Abstract
This paper presents a new randomized roadmap method for motion planning for many dof robots that can be used to obtain high quality roadmaps even when C-space is crowded. The main novelty in our approach is that roadmap candidate points are chosen on C-obstacle surfaces. As a consequence, the roadmap is likely to contain difficult paths, such as those traversing long, narrow passages in C-space. The approach can be used for both collision-free path planning and for manipulation planning of contact tasks. Experimental results with a planar articulated 6 dof robot show that, after preprocessing, difficult path planning operations can often be carried out in less than a second.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 113-120 |
| Number of pages | 8 |
| Journal | Proceedings - IEEE International Conference on Robotics and Automation |
| Volume | 1 |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 13th IEEE International Conference on Robotics and Automation. Part 1 (of 4) - Minneapolis, MN, USA Duration: Apr 22 1996 → Apr 28 1996 |
ASJC Scopus subject areas
- Software
- Control and Systems Engineering
- Artificial Intelligence
- Electrical and Electronic Engineering