Local planning using switching time optimization

Elliot R. Johnson, Todd David Murphey

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

Switching-time optimization has applications in local motion planning using the geometry of the nonlinear vector fields that govern the control system. In this paper, we present an algorithm for computing the second derivative of a switching-time cost function that enables second-order numerical optimization techniques that often converge quickly compared to first-order only algorithms. The resulting algorithms (for both first and second derivatives) each require only a single integration along the time horizon, yielding excellent computational performance. We present an example that uses this method to do local motion planning for a parallel parking maneuver for a kinematic car using the infinitesimal Lie bracket expansion that is used to demonstrate controllability. This same expansion allows one to construct a sequence of motions and approximate switching times that can then be used in the switching time optimization for a finite (non-infinitesimal) motion.

Original languageEnglish (US)
Title of host publication2010 IEEE International Conference on Automation Science and Engineering, CASE 2010
Pages828-834
Number of pages7
DOIs
StatePublished - Nov 17 2010
Event2010 IEEE International Conference on Automation Science and Engineering, CASE 2010 - Toronto, ON, Canada
Duration: Aug 21 2010Aug 24 2010

Publication series

Name2010 IEEE International Conference on Automation Science and Engineering, CASE 2010

Other

Other2010 IEEE International Conference on Automation Science and Engineering, CASE 2010
CountryCanada
CityToronto, ON
Period8/21/108/24/10

ASJC Scopus subject areas

  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Local planning using switching time optimization'. Together they form a unique fingerprint.

Cite this