Description: Use Dijkstra algorithm to find the shortest path network diagram to find the starting point P1 to the end of Pn from the shortest path algorithm is used as the midpoint of the condition of cable, not the entire optimal path planning of space, and then use genetic algorithm to find shortest path of each path points Pi (i = 1,2, ... n) adjusted to the path of obstacles in the corresponding endpoint connection point slide
To Search:
File list (Check if you may need any files):
5\基于遗传算法的机器人路径规划MATLAB源码.doc
5
Download