DocumentCode
701898
Title
On the computation of viable polytopes for linear systems
Author
Gao, Yan ; Lygeros, John
Author_Institution
School of Management, University of Shanghai for Science and Technology, Shanghai 200093, China
fYear
2003
fDate
1-4 Sept. 2003
Firstpage
570
Lastpage
575
Abstract
We develop a procedure for computing viable (also known as controlled invariant) polytopes of a given subset of the state space under linear dynamics. The advantage of the proposed algorithm is that at every step it maintains a polytope that is itself viable. Therefore, even if the algorithm is stopped before termination it will still return a viable polytope, that can be subsequently used for controller design.
Keywords
Algorithm design and analysis; Approximation algorithms; Heuristic algorithms; Kernel; Linear programming; Linear systems; Optimization; Linear system; invariance; optimization; polytope;
fLanguage
English
Publisher
ieee
Conference_Titel
European Control Conference (ECC), 2003
Conference_Location
Cambridge, UK
Print_ISBN
978-3-9524173-7-9
Type
conf
Filename
7085016
Link To Document