Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1010-1021 |
| Number of pages | 12 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 1468 |
| Issue number | pt 2 |
| State | Published - 1991 |
| Event | Applications of Artificial Intelligence IX - Orlando, FL, USA Duration: 2 Apr 1991 → 4 Apr 1991 |