By Topic

Synthesis of switching rules for switched linear systems through randomized algorithms

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

3 Author(s)
Ishii, H. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Basar, T. ; Tempo, R.

In this paper, the design of a stabilizing switching rule for a switched linear system is considered. We first propose a probabilistic algorithm for a known nonconvex condition that employs a multiple Lyapunov function. We prove a probability-one convergence of the algorithm under a new notion of convergence. Then, to reduce its complexity, a modified version of the algorithm is developed. The results are illustrated using two-and three-dimensional systems with multiple switch states.

Published in:

Decision and Control, 2003. Proceedings. 42nd IEEE Conference on  (Volume:5 )

Date of Conference:

9-12 Dec. 2003