摘要
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.
原文 | ???core.languages.en_GB??? |
---|---|
頁(從 - 到) | 1010-1021 |
頁數 | 12 |
期刊 | Proceedings of SPIE - The International Society for Optical Engineering |
卷 | 1468 |
發行號 | pt 2 |
出版狀態 | 已出版 - 1991 |
事件 | Applications of Artificial Intelligence IX - Orlando, FL, USA 持續時間: 2 4月 1991 → 4 4月 1991 |