An Efficient Algorithm for Grid-Based Robotic Path Planning Based on Priority Sorting of Direction Vectors
This paper presents an efficient grid-based robotic path planning algorithm. This method is motivated by the engineering requirement in practical embedded systems where the hardware resource is always limited. The main target of this algorithm is to reduce the searching time and to achieve the minimum number of movements. In order to assess the performance, the classical A* algorithm is also developed as a reference point to verify the effectiveness and determine the performance of the proposed algorithm. The comparison results confirm that the proposed approach considerably shortens the searching time by nearly half and produces smoother paths with less jagged segments than A* algorithm.
path planning grid-based map priority sorting time-efficient algorithm
Aolei Yang Qun Niu Wanqing Zhao Kang Li George W.Irwin
Intelligent Systems and Control Group School of Electronics, Electrical Engineering and Computer Science Queens University of Belfast, Belfast, BT9 5AH, UK
国际会议
无锡
英文
456-466
2010-09-17(万方平台首次上网日期,不代表论文的发表时间)