Skip to Main Content
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.
American Control Conference, 2002. Proceedings of the 2002 (Volume:3 )
Date of Conference: 2002