File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

VigneronAntoine

Vigneron, Antoine
Geometric Algorithms Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Reachability by paths of bounded curvature in convex polygons

Author(s)
Ahn, Hee-KapCheong, OtfriedMatousek, JiriVigneron, Antoine
Issued Date
2000-06-12
URI
https://scholarworks.unist.ac.kr/handle/201301/34500
Fulltext
http://dl.acm.org/citation.cfm?id=336211&CFID=639749174&CFTOKEN=76434841
Citation
16th Annual Symposium on Computational Geometry, pp.251 - 259
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.
Publisher
16th Annual Symposium on Computational Geometry

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.