An Effective Algorithm of Shortest Path Planning in a Static Environment [chapter]

Lingyu Sun, Xuemei Liu, Ming Leng
IFIP International Federation for Information Processing  
Path Planning is generating a collision-free path in an environment with obstacles and optimizing it with respect to some criterion. Because of its importance in robotics, the problem has attracted a considerable amount of research interest. In this paper, we present an effective algorithm of shortest path planning for planar mobile robot whose time complexity is 0(4 x n),;? is the geometric complexity of the static planar environment. The success of our algorithm relies on exploiting both a
more » ... u restriction and the greedy strategy of the Dijkstra algorithm. Our experimental evaluations on four different test cases show that our algorithm produces the shortest path very quickly.
doi:10.1007/0-387-34403-9_35 dblp:conf/prolamat/SunLL06 fatcat:l3y2d4lfizc57km3aixdddaoqu