搜索资源列表
A
- 实现A*算法地图寻优路径问题,游戏地图采用网格地图。-Achieve A* algorithm maps the path optimization problem, the game map using a grid map.
A--matlab
- A*算法,很重要的一种算法!欢迎下载学习!-A* algorithm, an algorithm is very important! Welcome to download learning! Thank you! ! ! ! ! ! Thank you! ! ! ! ! ! Thank you! ! ! ! ! ! Thank you! ! ! ! !
A-star-search-for--eight-digit
- A*算法实现八数码问题。源码和可执行文件。 vs2012实现通过-A* algorithm eight digital problem. Source code and executable files. vs2012 achieved by
A
- 人工智能中,用A*算法解决八数码难题,代码附在报告后面,为C语言编写。-AI A* algorithm for 8 numbers problem
TSP-A
- 用A*算法解决旅行商难题,用C语言实现,含程序。-A* algorithm for TSP problem
A-Star
- A*算法,既是八向寻路算法,不是最优的,但和很快捷。 flash演示代码。-A* algorithm, both eight-routing algorithm is not optimal, but and very fast. flash demo code.
A--algorithm-eight-digital-problem
- 这是一个领用人工智能中的A*算法求解八数码问题的完整实现,包含多种启发函数。-This is A recipients A* algorithm in artificial intelligence eight digital problem complete implementation, contain A variety of enlightening function.
A
- A*算法的实现与演示,使用C++编写。课程设计时可以用到-A* algorithm implementation and demonstration, using C++ to write. Curriculum design can be used
A
- 在C++下进行地图的最短路径搜索的A*算法这个算法被广泛应用在即时游戏的路径寻找过程上。-In the C++ under the map of the A* shortest path search algorithm for this algorithm is widely used in real-time search process on the path of the game.
A
- A*(A-Star)算法是一种静态路网中求解最短路最有效的方法,估价值与实际值越接近,估价函数取得就越好。该上传的内容是一个A*算法的模拟实现。-A* (A-Star) algorithm is the most effective way to short-circuit a static road network to solve the valuation closer to the actual value, the valuation function is achieved, the
A
- Javascr ipt实现A*算法查找最短路径-use A* to find path
a
- A*算法求解八数码问题,命令行输入格式: 程序名 输入文件名 输出文件名-A* algorithm eight digital issues, the command line input format: program name Enter the file name of the output file name
a-STAR
- 使用a*算法解决机器人自动寻路的问题(适合初学者理解和学习经典的a*算法)-Use a* pathfinding algorithm to solve the problem of automatic robot (a* algorithm suitable for beginners to understand and learn classical)
A-star
- 按照A*算法的步骤来实现。Matlab code-According to the steps of the A* algorithm to achieve
A-algorithm
- A*算法的实例。通过迷宫路径的搜索展示A*算法广度优先搜索的过程-Examples of A* algorithm. By searching the maze path display A* algorithm breadth-first search process
An-Improved-A--Star-Algorithm
- (被EI收录,不错的文章)传统A*算法在栅格地图上进行路径规划时,求解得到的路径长度不是最短并且转折点较多。针对这些不足,提出了一种改进A*算法,将传统A*算法的可搜索邻域个数从离散的8个拓展为无限个,可以沿任意方向进行搜索。这样不仅求解出来的路径长度更短,并且大大降低了其转折点的个数。该算法被应用于自主研发的“智能先锋”号系列无人驾驶车辆上,实车试验以及它们在“中国智能车未来挑战赛”中的优异表现证明该方法能够在栅格地图中求解出一条更优的可行驶路径,可以显著提升无人驾驶车辆行驶的效率和平稳性。-
A-star-algorithm-without-grid-limit
- 本算法支持任意角度的路径搜索,支持任意网格大小的路障设置,采用A* 算法,实现复杂地图下的路径搜索。 -The algorithm supports any angle route search, support of any grid size barricades set up using A* algorithm, route maps under complex searches.
A-star-pathfinding-master
- A*算法JAVA实现,it is helpful to understand the A* algorithm-A* algorithm JAVA implementation, it is helpful to understand the A* algorithm
八数码A星算法加扩展节点分析
- 基于matlab八数码的A*算法实现,有图形界面化,对用户友好。(Based on MATLAB eight digital A* algorithm, graphical interface, user-friendly.)
银行家算法
- 银行家算法是由Dijkstra设计的最具有代表性的避免死锁的算法。本实验要求用高级语言编写一个银行家的模拟算法。通过本实验可以对预防死锁和银行家算法有更深刻的认识。(Banker's algorithm is the most typical deadlock avoidance algorithm designed by Dijkstra. This experiment requires the use of high-level language to write a banker's s