A Survey of Mobile Robots Path Planning Using Geometric Methods
Huajun Liu · Journal of Engineering Graphics · 2008
In recent forty years,a lot of path planning algorithms for mobile robot have been proposed.Majority of them translates environment geometric information into graph and then solve the problems using graph theory.They are classified into three categories: geometry construction methods in 2D and 3D configuration space with good completeness,randomized planning methods,and graph search algorithms.This survey tries to summarize these planning algorithms and point out the advantages and disadvantages of them.Finally,the future of mobile robot path planning is discussed.