Location:
Search - astardemo
Search list
Description: A星算法实现～
人工智能中如何寻早最短路径，在游戏中有重要应用-A Star ~ artificial intelligence algorithm how to find the shortest path early in the game there are important applications
Platform: |
Size: 22528 |
Author: huhailong |
Hits:
Description: AStar简单例子，不包括f计算，用于游戏中的移动-AStar simple example, does not include f calculated for the mobile game
Platform: |
Size: 16384 |
Author: dhjdhja |
Hits:
Description: 用A*算法进行路径规划的演示程序，基于MFC开发-With the A* path planning algorithm demo program, developed based on MFC
Platform: |
Size: 256000 |
Author: ylp |
Hits:
Description: 人工智能A星算法网络小游戏地图寻径问题代码-A network of artificial intelligence algorithms Star game code map routing problem
Platform: |
Size: 557056 |
Author: caoshilian |
Hits:
Description: 通过A*算法解决两点之间最优路径的问题，并进行了可视化设计-for the problem of the best route between two locations, a algorithm is proposed and Visualization is designed
Platform: |
Size: 7168 |
Author: chenghaoyu |
Hits:
Description: 在matlab软件中，用A星算法进行栅格法路径规划，且路径不固定-In matlab software, using the grid method A star path planning algorithm, and the path is not fixed
Platform: |
Size: 4096 |
Author: ls |
Hits:
Description: Bob L. Sturm关于A star 算法的一则matlab程序，很有学习价值。源程序实现寻找最短路径的基本功能。如需商业使用，请尊重版权。-Bob L. Sturm on an A star algorithm matlab program, worth learning. Looking for the basic functions of the source code to achieve the shortest path. For commercial use, please respect the copyright.
Platform: |
Size: 6144 |
Author: zilin liu |
Hits:
Description: 基于优化的A星算法的最优路径最短路径规划问题(A star algorithm and path planning)
Platform: |
Size: 5120 |
Author: 无花~果
|
Hits:
Description: A*搜寻算法俗称A星算法。A*算法是比较流行的启发式搜索算法之一，被广泛应用于路径优化领域[。它的独特之处是检查最短路径中每个可能的节点时引入了全局信息，对当前节点距终点的距离做出估计，并作为评价该节点处于最短路线上的可能性的量度。(A * search algorithm commonly known as A Star algorithm. A * algorithm is one of the more popular heuristic search algorithms and is widely used in the field of path optimization. It is unique in that it examines every possible node in the shortest path by introducing global information, estimating the distance from the end of the current node, and serving as a measure of the likelihood of the node being on the shortest path.)
Platform: |
Size: 5120 |
Author: diuman |
Hits: