Please use this identifier to cite or link to this item:
|Title:||A new perspective on criteria and algorithms for reachability of discrete-time switched linear systems|
|Source:||Ji, Z., Lin, H., Lee, T.H. (2009-06). A new perspective on criteria and algorithms for reachability of discrete-time switched linear systems. Automatica 45 (6) : 1584-1587. ScholarBank@NUS Repository. https://doi.org/10.1016/j.automatica.2009.02.024|
|Abstract:||The paper presents a unified perspective on geometric and algebraic criteria for reachability and controllability of controlled switched linear discrete-time systems. Direct connections between geometric and algebraic criteria are established as well as that between the subspace based controllability/reachability algorithm and Kalman-type algebraic rank criteria. Also the existing geometric criteria is simplified and new algebraic conditions on controllability and reachability are given. © 2009 Elsevier Ltd. All rights reserved.|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
WEB OF SCIENCETM
checked on Nov 16, 2017
checked on Dec 10, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.