DocumentCode
3290998
Title
Overapproximating the reachable sets of LTI systems through a similarity transformation
Author
Kaynama, S. ; Oishi, M.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of British Columbia, Vancouver, BC, Canada
fYear
2010
fDate
June 30 2010-July 2 2010
Firstpage
1874
Lastpage
1879
Abstract
We present a decomposition method for complexity reduction in reachability analysis and controller synthesis based on a series of transformations. The decomposition is guaranteed to yield weakly-coupled (lower dimensional) subsystems with disjoint control input across them. Reachable sets, computed independently for each subsystem, are back-projected and intersected to yield an overapproximation of the actual reachable set. Using an example we show that significant reduction in the computational costs can be achieved. This technique has considerable potential utility for use in conjunction with computationally intensive reachability tools.
Keywords
approximation theory; computational complexity; control system synthesis; linear systems; reachability analysis; set theory; time-varying systems; LTI system; complexity reduction; controller synthesis; decomposition method; disjoint control input; intensive reachability tools; reachability analysis; significant reduction; similarity transformation; weakly coupled lower dimensional subsystem; Computational complexity; Computational efficiency; Control system synthesis; Ellipsoids; Formal verification; Reachability analysis; Reduced order systems; Safety; Shape control; State-space methods; LTI systems; decomposition; dimension reduction; projection; reachability analysis; transformation;
fLanguage
English
Publisher
ieee
Conference_Titel
American Control Conference (ACC), 2010
Conference_Location
Baltimore, MD
ISSN
0743-1619
Print_ISBN
978-1-4244-7426-4
Type
conf
DOI
10.1109/ACC.2010.5531392
Filename
5531392
Link To Document