Projection-based optimal mode scheduling

T. M. Caldwell, T. D. Murphey

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

11 Scopus citations


This paper develops an iterative optimization technique that can be applied to mode scheduling. The algorithm provides both a mode schedule and timing of that mode schedule with convergence guarantees. Moreover, the algorithm takes advantage of a line search, and the number of iterations in the line search is bounded. There are two key ingredients in the algorithm. First, a projection operation is used that takes arbitrary curves and maps them to feasible switching controls. Second, a descent direction that incorporates the projection is calculated using the mode insertion gradient. Similar to derivative-based finite dimensional optimization, the convergence guarantees and sufficient decrease criteria follow from a local approximation of the cost in the direction of the search direction, but this local approximation is not the standard quadratic approximation. An example demonstrates the steps to implement the optimization algorithm and illustrates convergence.

Original languageEnglish (US)
Title of host publication2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages8
ISBN (Print)9781467357173
StatePublished - 2013
Event52nd IEEE Conference on Decision and Control, CDC 2013 - Florence, Italy
Duration: Dec 10 2013Dec 13 2013

Publication series

NameProceedings of the IEEE Conference on Decision and Control
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370


Other52nd IEEE Conference on Decision and Control, CDC 2013

ASJC Scopus subject areas

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


Dive into the research topics of 'Projection-based optimal mode scheduling'. Together they form a unique fingerprint.

Cite this