Sliced Configuration Spaces for Curved Planar Bodies
Elisha Sacks, Chandrajit Bajaj
- Year
- 1998
- Citations
- 37
Abstract
We present the first practical, implemented configuration-space computation algorithm for a curved, planar object translating and rotating amidst stationary obstacles. The bodies are rigid, compact, regular, and bounded by a finite number of rational parametric curve segments. The algorithm represents the three-dimensional configu ration space as two-dimensional slices in which the moving object has a fixed orientation. It discretizes the configuration space into in tervals of equivalent slices separated by critical slices. The output is topologically correct and accurate to within a specified toler ance. We have implemented the algorithm for objects bounded by line segments and circular arcs, which is an important class for applications. The program is simple, fast, and robust. The slice representation is a natural and efficient abstract data type for geo metric computations in robotics and engineering.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Fractional Differential Equations
Igor Podlubný
2025
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991