Path planning algorithm for a mobile robot

Kuo Chin Fan, Po Chang Lui

研究成果: 雜誌貢獻會議論文同行評審


The task of path planning in mapped environments is well-known in robotics. Given an object and a set of obstacles located in space, the problem is to find a shortest path for the object from the initial position to the goal position which avoids collisions with obstacles along the way. In this paper, we will present a path planning algorithm to solve the find-path problem. The advantages of this algorithm are that it is quite fast and it finds the shortest path which avoids obstacles generously rather than avoiding them barely.

頁(從 - 到)1010-1021
期刊Proceedings of SPIE - The International Society for Optical Engineering
發行號pt 2
出版狀態已出版 - 1991
事件Applications of Artificial Intelligence IX - Orlando, FL, USA
持續時間: 2 4月 19914 4月 1991


深入研究「Path planning algorithm for a mobile robot」主題。共同形成了獨特的指紋。