Abstract
In this paper we introduce a new class of geometric robot motion planning problems that we call incremental problems. We also introduce the concept of incremental algorithms to solve this class of problems. As an example, we describe an incremental critical curve based exact cell decomposition algorithm for a line segment robot moving freely amidst polygonal obstacles. In the example, after computing an initial representation of the robot's free space, the algorithm maintains the representation as obstacles are moved between planning problems. The cost to maintain the representation is expected to be small relative to the cost of its initial construction.
| Original language | English (US) |
|---|---|
| Pages | 39-44 |
| Number of pages | 6 |
| State | Published - Jan 1 1995 |
| Event | Proceedings of the 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 3 (of 3) - Pittsburgh, PA, USA Duration: Aug 5 1995 → Aug 9 1995 |
Other
| Other | Proceedings of the 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 3 (of 3) |
|---|---|
| City | Pittsburgh, PA, USA |
| Period | 8/5/95 → 8/9/95 |
ASJC Scopus subject areas
- Control and Systems Engineering
- Software
- Computer Vision and Pattern Recognition
- Computer Science Applications
Fingerprint Dive into the research topics of 'Toward an exact incremental geometric robot motion planner'. Together they form a unique fingerprint.
Cite this
Barbehenn, M., & Hutchinson, S. (1995). Toward an exact incremental geometric robot motion planner. 39-44. Paper presented at Proceedings of the 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Part 3 (of 3), Pittsburgh, PA, USA, .