A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
An Effective Algorithm of Shortest Path Planning in a Static Environment
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 adoi:10.1007/0-387-34403-9_35 dblp:conf/prolamat/SunLL06 fatcat:l3y2d4lfizc57km3aixdddaoqu