A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles International Journal of Computational Geometry and Applications Year : 2003

A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles

Abstract

In this paper, we consider the problem of computing shortest paths of bounded curvature amidst obstacles in the plane. More precisely, given two prescribed initial and final configurations (specifying the location and the direction of travel) and a set of obstacles in the plane, we want to compute a shortest $C^1$ path joining those two configurations, avoiding the obstacles, and with the further constraint that, on each $C^2$ piece, the radius of curvature is at least 1. In this paper, we consider the case of moderate obstacles (as introduced by Agarwal et al.) and present a polynomial-time exact algorithm to solve this problem.
Fichier principal
Vignette du fichier
REVISED_version.pdf (582.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

Jean-Daniel Boissonnat, Sylvain Lazard. A polynomial-time algorithm for computing shortest paths of bounded curvature amidst moderate obstacles. International Journal of Computational Geometry and Applications, 2003, 13 (3), pp.189-229. ⟨10.1142/S0218195903001128⟩. ⟨inria-00099509⟩
64 View
153 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More