Description: For the maze of such a unique environment model, a Cartesian coordinate system based on a new path planning algorithm. The algorithm by identifying the location of robot moving direction and changes in the relationship quickly and easily realize the path memory, and upon arrival at the finishing point to the path through a simple optimization algorithm calculates the shortest path, and ultimately to realize the shortest path to return. The feasibility of this algorithm has passed wheeled robot instance to be confirmed.
To Search:
- [improvedalgorithmforthemaze.Rar] - maze procedures learning algorithms, dat
- [EX_Draw2_0101] - This is a graphics application programmi
- [DStar_5.26] - AI's A-star algorithm for robot path pla
- [antCpp1] - This is on the right ants swarm algorith
- [AdvancedGraphic] - map coordinates pool, C source code, inc
- [Path4J_0.01.tar] - In 2007 a variety of the latest path pla
- [2] - Rat Maze robot machine is one of the gam
- [Dijkstra] - Based on VC++ Path planning, the main di
- [segspecs] - Found in the open-source Web site on inf
- [zuiyou] - This procedure is based on the priority
File list (Check if you may need any files):
Download