Bounded-curvature shortest paths through a sequence of points using convex optimization

DOI10.1137/100816079MaRDI QIDQ2840989zbMATH OpenOpenAlexFDO

Authors Xavier Goaoc, Hyo-Sil Kim, Sylvain Lazard

Publication date 24 July 2013

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://hal.inria.fr/hal-00927100/file/viapoints_final.pdf

zbMATH Keywords

bounded curvatureconvex optimizationDubins pathpath planning

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Convex programming (90C25)

Recommendations

• Shortest paths of bounded curvature in the plane
• Curvature-Constrained Shortest Paths in a Convex Polygon
• An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
• scientific article; zbMATH DE number 1670669
• Approximation algorithms for curvature-constrained shortest paths

Cited in

(15)

• A geometric approach to shortest bounded curvature paths
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Shortest paths of bounded curvature in the plane
• The cost of bounded curvature
• Convex tours of bounded curvature
• On shortest Dubins path via a circular boundary
• Shortest Dubins paths through three points
• Markov-Dubins interpolating curves
• scientific article; zbMATH DE number 1670669 (Why is no real title available?)
• Discrete optimization methods to determine trajectories for Dubins' vehicles
• An efficient method to find a shortest path for a car-like robot
• Reachability by paths of bounded curvature in a convex polygon
• scientific article; zbMATH DE number 2015319 (Why is no real title available?)
• Classification of the Dubins set
• Shortest Paths in Graphs of Convex Sets

This page was built for publication: Bounded-curvature shortest paths through a sequence of points using convex optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840989)