Research of Robot Motion Planning
Zhengda Meng · Control Engineering of China · 2004
Path planning and collision examining are the focuses of researches, and many algorithms have been put forward, such as C-space method, potential field method and genetic method etc. The problem of sequence planning can be translated into Traveling Salesman Problem (TSP). On the basis of researches of the past, it puts forward two robot motion planning algorithms: robot motion planning algorithm based on arbitrary paths and robot motion planning algorithm based on straight line paths. Both of the algorithms are simple and can be used for all kinds of robot complicated tasks.