Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization

Abstract : We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of $n$ points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are distance at least four apart, this question reduces to a family of convex optimization problems over polyhedra in $\mathbb{R}^n$.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [20 references]  Display  Hide  Download


https://hal.inria.fr/hal-00927100
Contributor : Sylvain Lazard <>
Submitted on : Friday, January 10, 2014 - 7:06:40 PM
Last modification on : Thursday, February 7, 2019 - 5:53:34 PM

Files

viapoints_final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Xavier Goaoc, Hyo-Sil Kim, Sylvain Lazard. Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2013, 42 (2), pp.662-684. ⟨10.1137/100816079⟩. ⟨hal-00927100⟩

Share

Metrics

Record views

317

Files downloads

475