搜索资源列表
AStar
- A星算法的经典模型,实现了寻找最短路径,并且用按钮实现了这些使用的方法-A classic model of satellite algorithm to realize the search for the shortest path, and used the button the methods used to achieve these
Astar
- 人工智能的a星搜索算法 根据评价函数找到最优路线-A star search
Astar
- 通过A星算法寻找最优路径到达目标,可自由设置障碍,能运行成功-optimal path planning
AStar
- 实现的人工智能寻路算法 希望对大家有所帮助-AI pathfinding algorithm implementation we want to help
astar
- A*算法详解,含例子,包括VC++和Basic两个版本-A* find path
AStar
- A星算法实现最短路径的选择,使用方便,功能完善,是学习人工智能作业中必须完成的一步。-Choose the shortest path by the method of AStar
Astar
- Astar算法 Astar算法 Astar算法-Astar
Astar
- A*寻路算法的相关源代码,收录了两种A*算法的实现-A* pathfinding algorithm related to the source code, contains two kinds of A* Algorithm
AStar
- VS2008开发环境 A*算法的一个简单小例子,主要体现A*寻路的方法,适合A*算法的初学者学习-VS2008 development environment, a simple A* algorithm is a small example, the main embodiment of the method of A* pathfinding for beginners A* algorithm
AStar
- A*算法实现了的寻路算法,此代码采用了STL的泛型程序设计,效率非常高!值得你的下载。-A* algorithm has to search for paths algorithm
AStar
- A*算法,在VS2005上实现,带界面和动画的-A* algorithm with windows
Astar
- 利用Visual Studio 6.0实现了迷宫的A星算法路径搜索-implement A* algorithm in maze route plan using Visual Studio 6.0
Astar(V5-14)
- A*算法(DTM格式数据) GIS环境下用到的最短路径算法模块,支持带权图和二值图,改进过,收敛速度不错 (实验室做的算法,请勿用于商业用途)-A* algorithm (DTM format data) GIS environment, shortest path algorithm used in modules to support a weighted graph and a binary image, improving over, a good convergence rat
AStar
- 这个一种A*算法的设计在J2ME上实现的-The design of a kind of A* algorithm implemented on the J2ME
Java.Game.Programming.AStar.algorithm.code
- Java游戏编程AStar算法源代码Java Game Programming AStar algorithm source code -Java Game Programming AStar algorithm source code
AStar
- A星算法实现八数码问题,找出从某一初态变换到终态的路径。-A Star Algorithm 8 digital issues, identify the initial state of transformation from one path to the final state.
Astar
- 人工智能系统中的A*寻径算法,以寻找最佳路径。-Artificial intelligence system A* routing algorithm to find the best path.
AStar
- 用于避障的A星算法,适用于机器人的轨迹规划-A star for Obstacle Avoidance Algorithm for Robot Path Planning
AStar
- A*(A-Star)算法是一种静态路网中求解最短路最有效的方法。公式表示为: f(n)=g(n)+h(n),其中f(n) 是从初始点经由节点n到目标点的估价函数,g(n) 是在状态空间中从初始节点到n节点的实际代价,h(n)是从n到目标节点最佳路径的估计代价。 -A* (A-Star) is a static network algorithm for solving the shortest most effective way. Formula is expressed as: f (n)
AStar
- 图像处理算法,AStar算法,用于路径规划寻找最优路径。-Image processing algorithms, AStar algorithm for path planning to find the optimal path.