Location:
Search - A*算法
Search list
Description: 通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系-through the preparation of the maze procedure to skillfully master A * algorithm. * A full understanding of algorithms and heuristic function of
Platform: |
Size: 3405 |
Author: 陶钊 |
Hits:
Description: 程序目的：
通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系。-procedures Objective : Maze procedure to prepare skilled master A * algorithm. * A full understanding of algorithms and heuristic function relationship.
Platform: |
Size: 5757 |
Author: hehe |
Hits:
Description: A*算法是，最经典的寻路算法，广泛用于游戏人工智能领域。-A * algorithm is the most classic Routing algorithm, widely used in the field of artificial intelligence game.
Platform: |
Size: 31628 |
Author: 沈铭硕 |
Hits:
Description: A*算法是，最经典的寻路算法，广泛用于游戏人工智能领域。-A* algorithm is the most classic Routing algorithm, widely used in the field of artificial intelligence game.
Platform: |
Size: 1781760 |
Author: 沈铭硕 |
Hits:
Description: 这里有人工智能的A*算法看能不能帮到你。。我是在里面得到了不少的经验的-here is the AI A* algorithm can do to help you. . I was there to be a lot of experience
Platform: |
Size: 10240 |
Author: 林小雨 |
Hits:
Description: A*算法属于一种启发式搜索。它扩展结点的次序类似于广度优先搜索，但不同的是每生成一个子结点需要计算估价函数F，以估算起始结点到该结点的代价及它到达目标结点的代价的和；每当扩展结点时，总是在所有待扩展结点中选择具有最小F值的结点作为扩展对象，以便使搜索尽量沿最有希望的方向进行。 -A* algorithm is a heuristic search. It extended node in the order of priority similar to the breadth of search, but in every generation is a sub-node calculated valuation function F, to estimate initial node to the node, the price and it arrived at the target node, and the price; Whenever expansion node, the question has always extended to all nodes with the smallest choosing F value of the node as expansion targets, in order to search as far as possible along the most promising direction.
Platform: |
Size: 2048 |
Author: |
Hits:
Description: 这个程序是从广度优先搜索，深度优先搜索，A算法以及A*算法等多方面算法来解决八数码问题-this procedure is breadth- first search, depth-first search, A and A* algorithm algorithm various algorithms to solve the problem eight digital
Platform: |
Size: 75776 |
Author: 藤力 |
Hits:
Description: 通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系-through the preparation of the maze procedure to skillfully master A* algorithm.* A full understanding of algorithms and heuristic function of
Platform: |
Size: 3072 |
Author: 陶钊 |
Hits:
Description: 人工智能的经典八皇后问题,这个算法是a*算法.利用这个算法可以解决八数码,八皇后问题等
-artificial intelligence Queen's classic 8, the algorithm is a* algorithm. Use of this algorithm can solve eight digital, 8 Queen's problems
Platform: |
Size: 39936 |
Author: 春风秋雨 |
Hits:
Description: 八数码问题的A*算法.本实验的A*算法的h(n)=p(n),p(n)定义为每个将牌与其目标位置之间的距离(不考虑夹在其间的将牌)的总和,显然有p(n)=<h*(n),g(n)仍就为节点深度.-the A* algorithm. The experiment of the A* algorithm h (n) = p (n), p (n) is defined for each license its goal the distance between the location (not consider caught in the crossfire of the license) and the aggregate obviously p (n) =
Platform: |
Size: 2048 |
Author: 杨秀云霁 |
Hits:
Description: 程序目的：
通过编制迷宫程序来熟练掌握A*算法。充分理解A*算法和启发函数的关系。-procedures Objective : Maze procedure to prepare skilled master A* algorithm.* A full understanding of algorithms and heuristic function relationship.
Platform: |
Size: 5120 |
Author: hehe |
Hits:
Description: 用A*算法求解八数码问题。A*算法又叫做最佳图搜索算法，是满足启发函数不大于实际耗散值的A算法，可以用理论证明如果最佳解图存在的话，一定可以用A*算法找出来。-with A* algorithm eight digital problem. A* algorithm also called the plan the best search algorithm, it is instructive function to meet not more than the actual value of the A dissipation algorithm, Theory can be used to prove that if SCR plans exist, will be able to use A* algorithm to find out.
Platform: |
Size: 91136 |
Author: 罗鹏魁 |
Hits:
Description: 设计说明：1。数据结构和表示：程序用1、2、3、4分别表示将右、上、左、下的数字块移动到空格之中。采用典型的树+链表结构，每种局面产生一个BoardState类。出于避免走法顺序列表被过多复制的考虑，在树结构中保存局面的继承关系。每种新的局面产生后，引用估值函数产生f的值，再根据大小将其插入链表之中，以便实现“优先展开f值小的节点”。Solve()函数在成功解决问题之后保存一个走法序列供输出并返回零，而失败则返回失败处的节点层数。(具体的判断方法见后文)-Design Notes : 1. Data structure and said : 1,2,3,4 procedures used were said to the right, and left, The figure moved to the block among the blanks. A typical tree Chain structure, each have a situation BoardState category. For France order to avoid excessive copying the list was, in consideration of the tree structure to preserve the situation in relation to the succession. Each of the new situation after the election, have cited valuation function f value, in accordance with the size of its insertion Chain, in order to achieve the "priority start small f value of the node." Solve () function in the successful solution of the problem after a law to preserve sequence for output and return to zero. and failure to return to the failed node floors. (Specific judgment method, see be
Platform: |
Size: 256000 |
Author: 陈士骞 |
Hits:
Description: 在VC6.0下通过测试的A*算法源码，很珍贵的资料哦！-In VC6.0 that pass the tests under the A* algorithm source code, it is valuable information Oh!
Platform: |
Size: 208896 |
Author: zhou |
Hits:
Description: 初学A*算法的很好源码，基于最短路径规则-Novice A* algorithm is a good source, based on the shortest path rules
Platform: |
Size: 5120 |
Author: 杨羽 |
Hits:
Description: java语言编写，有完善的操作界面，A*算法求八数码问题的最优解。
Platform: |
Size: 26183 |
Author: abefyz@163.com |
Hits:
Description: 启发式搜索的定义、估价函数和算法过程，并利用A*算法求解N数码难题，理解求解流程和搜索顺序(The definition, evaluation function and algorithm process of heuristic search, and A* algorithm is used to solve the N digital puzzle, and the solution flow and search order are understood)
Platform: |
Size: 214016 |
Author: anbao
|
Hits:
Description: A算法实现路径规划，数字地图用矩阵建立的(A* algorithm, A* algorithm to achieve path planning, digital map with matrix establishment)
Platform: |
Size: 112640 |
Author: 理行者 |
Hits:
Description: 基于A算法的航路规划 可以运行的程序 C++程序(Route planning based on algorithm a)
Platform: |
Size: 59392 |
Author: 陌离殇 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»