Curvature-Constrained Shortest Paths in a Convex Polygon

Abstract : Let B be a point robot moving in the plane, whose path is constrained to have curvature at most 1, and let P be a convex polygon with n vertices. We study the collision-free, optimal path-planning problem for B moving between two configurations inside P (a configuration specifies both a location and a direction of travel). We present an O(n2 log n) time algorithm for determining whether a collision-free path exists for B between two given configurations. If such a path exists, the algorithm returns a shortest one. We provide a detailed classification of curvature-constrained shortest paths inside a convex polygon and prove several properties of them, which are interesting in their own right. Some of the properties are quite general and shed some light on curvature-constrained shortest paths amid obstacles.
Document type :
Conference papers
Complete list of metadatas

Cited literature [28 references]  Display  Hide  Download

https://hal.inria.fr/hal-00827890
Contributor : Sylvain Lazard <>
Submitted on : Wednesday, May 29, 2013 - 7:20:58 PM
Last modification on : Thursday, February 7, 2019 - 2:21:44 PM
Long-term archiving on : Tuesday, September 3, 2013 - 10:06:23 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pankaj K. Agarwal, Thérèse Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, et al.. Curvature-Constrained Shortest Paths in a Convex Polygon. Symposium on Computational Geometry - SCG 1998, Jun 1998, Mineapolis, United States. pp.392-401, ⟨10.1145/276884.276928⟩. ⟨hal-00827890⟩

Share

Metrics

Record views

518

Files downloads

387