Abstract
This paper presents an algorithm for finding collision free trajectories in a three dimensional environment. Given the starting and destination points, the algorithm constructs a trajectory from the segments of the medial axis of the free space. The moving object is represented by its minimum enclosing sphere. The medial axis is obtained by shrinking the voxel representation, and the trajectory is derived by treating the medial axis as a graph and conducting a heuristic search; both phases are implemented in an inefficient manner in the current algorithm. Improvements in these and other parts are outlined and currently under way.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings - International Conference on Pattern Recognition |
| Publisher | IEEE |
| Pages | 188-191 |
| Number of pages | 4 |
| ISBN (Print) | 0818605456 |
| State | Published - Dec 1 1984 |
Publication series
| Name | Proceedings - International Conference on Pattern Recognition |
|---|
ASJC Scopus subject areas
- Computer Vision and Pattern Recognition
Fingerprint Dive into the research topics of 'PATH PLANNING IN A THREE DIMENSIONAL ENVIRONMENT.'. Together they form a unique fingerprint.
Cite this
Ruff, R., & Ahuja, N. (1984). PATH PLANNING IN A THREE DIMENSIONAL ENVIRONMENT. In Proceedings - International Conference on Pattern Recognition (pp. 188-191). (Proceedings - International Conference on Pattern Recognition). IEEE.