Shortest 3-dimensional paths with a prescribed curvature bound

Hector J. Sussmann

Research output: Contribution to journalConference articlepeer-review

78 Scopus citations

Abstract

We present the solution of the three-dimensional case of a problem studied by A.A. Markov, L. Dubins, and J. Reeds and L. Shepp, regarding the structure of minimum-length paths with a prescribed curvature bound and prescribed initial and terminal positions and directions. In particular, we disprove a conjecture made by other authors, according to which every minimizer is a concatenation of circles and straight lines. We show that there are many minimizers - the 'helicoidal arcs' - that are not of this form. These arcs are smooth and are characterized by the fact that their torsion satisfies a second-order ordinary differential equation. The solution is obtained by applying Optimal Control Theory. An essential feature of the problem is that it requires the use of Optimal Control on manifolds. The natural state space of the problem is the product of three-dimensional Euclidean space and a two-dimensional sphere. Although the problem is obviously embeddable in 6-dimensional Euclidean space, the Maximum Principle for the embedded problem yields no information, whereas a careful application of the Maximum Principle on manifolds yields a very strong result, namely, that every minimizer is either a helicoidal arc or of the form C, S, CS, SC, CSC, CCC, where C, S stand for 'circle' and 'segment,' respectively.

Original languageAmerican English
Pages (from-to)3306-3312
Number of pages7
JournalProceedings of the IEEE Conference on Decision and Control
Volume4
StatePublished - 1995
EventProceedings of the 1995 34th IEEE Conference on Decision and Control. Part 1 (of 4) - New Orleans, LA, USA
Duration: Dec 13 1995Dec 15 1995

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this