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

DOI10.1137/100816079zbMath1271.68234OpenAlexW1963641530MaRDI QIDQ2840989

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

convex optimizationpath planningbounded curvatureDubins path

Mathematics Subject Classification ID

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

Related Items (4)

Markov-Dubins interpolating curves ⋮ The cost of bounded curvature ⋮ On shortest Dubins path via a circular boundary ⋮ Shortest Dubins paths through three points

This page was built for publication: Bounded-Curvature Shortest Paths through a Sequence of Points Using Convex Optimization