Curvature-Constrained Shortest Paths in a Convex Polygon - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles SIAM Journal on Computing Year : 2002

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.
Fichier principal
Vignette du fichier
paper.pdf (569.82 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00100887 , version 1 (15-12-2009)

Identifiers

Cite

Pankaj K. Agarwal, Thérèse Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, et al.. Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM Journal on Computing, 2002, 31 (6), pp.1814-1851. ⟨10.1137/S0097539700374550⟩. ⟨inria-00100887⟩
91 View
162 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More