Reachability by paths of bounded curvature in convex polygons

Hee kap Ahn*, Otfried Cheong, Jiri Matousek, Antoine Vigneron

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

A point robot in the plane whose turning radius is constrained to be at least 1 and that is not allowed to make reversals is analyzed. Result is a characterization of the region of points reachable by paths under curvature constraints from a given starting configuration inside a convex polygon. It is shown that all points reachable from the starting configuration is also reachable by paths of a fairly special form. Reachable region is also shown to have complexity linear in the complexity of the polygon. The characterization is constructive and could be used to compute the reachability region.

Original languageEnglish (US)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherACM
Pages251-259
Number of pages9
StatePublished - 2000
Externally publishedYes
Event16th Annual Symposium on Computational Geometry - Hong Kong, Hong Kong
Duration: Jun 12 2000Jun 14 2000

Other

Other16th Annual Symposium on Computational Geometry
CityHong Kong, Hong Kong
Period06/12/0006/14/00

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics

Fingerprint Dive into the research topics of 'Reachability by paths of bounded curvature in convex polygons'. Together they form a unique fingerprint.

Cite this