Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. For technical support, please contact us at We apologize for any inconvenience.
By Topic

Algorithm for optimal mode scheduling in switched systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

This paper considers the problem of computing the schedule of modes in an autonomous switched dynamical system, that minimizes a cost functional defined on the trajectory of the system's continuous state variable. It proposes an algorithm that modifies a finite but unbounded number of modes at each iteration, whose computational workload at the various iterations appears to be independent on the number of modes being changed. The algorithm is based on descent directions defined by Gaâteaux differentials of the performance function with respect to variations in mode-sequences , and its convergence to (local) minima is established in the framework of optimality functions and minimizing sequences, devised by Polak for infinite-dimensional optimization problems.

Published in:

American Control Conference (ACC), 2012

Date of Conference:

27-29 June 2012