No self-introduction
Loading
Profile
Follow
codes (2)
C#And XNA a star algorithm
no vote
This program is completed by using C # with XNA, and its content is path planning for astar. Astar is the basic path planning algorithm, which can be used to solve the problem of how to walk to make the robot reach the set goal. Compared with the traditional Dijstra algorithm, the path planned by Dijstra will be the best, but it will consume more computational efficiency Although star is not necessarily the best path, it tends to be the best path, but the cost of computing efficiency is less.
victor425425 0 0
1
Dijkstra path planning algorithm
no vote
This is an algorithm related to path planning. It is also a basic algorithm in path planning. It can calculate the shortest path. However, as the depth of the map increases, this algorithm will consume more computer computing resources, because it will calculate every point of the map to produce the shortest path.
victor425425 0 0
1
No more~
Follows0
Fans0