Close category search window
 

How hard is it to control 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)
Egerstedt, M. ; Georgia Inst. of Technol., Atlanta, GA, USA ; Blondel, V.D.

We show that the problem of deciding if there exists a control that drives a switched control system between two given states is undecidable. We furthermore investigate what happens if we search for a control that achieves this in a given number of steps, or with a given number of switches. These problems are shown to be respectively NP-complete and NP-hard. The results follow as a consequence of recent complexity results on matrix mortality.

Published in:
American Control Conference, 2002. Proceedings of the 2002  (Volume:3 )

Date of Conference: 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.