Back to Search
Start Over
Reaching a Polygon with Directional Uncertainty.
- Source :
- International Journal of Computational Geometry & Applications; Apr2001, Vol. 11 Issue 2, p197, 18p
- Publication Year :
- 2001
-
Abstract
- Assume a robot that, when directed to move in a particular direction, is guaranteed to move inside a cone of angle α centered at the specified direction. The robot has to reach a convex polygonal goal G, while avoiding polygonal obstacles of complexity n. We show that the complexity of the safe region, from where the robot can reach the goal with a single motion with uncertainty α, is O(m + n), and can be computed in time O((m + n) log(m + n)), if α is assumed constant. [ABSTRACT FROM AUTHOR]
- Subjects :
- COMPUTATIONAL geometry
POLYGONS
ROBOTIC path planning
Subjects
Details
- Language :
- English
- ISSN :
- 02181959
- Volume :
- 11
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- International Journal of Computational Geometry & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 7084256
- Full Text :
- https://doi.org/10.1142/S0218195901000456