Title: On the computation of viable polytopes for linear systems
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 a...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.Read More
Publication Year: 2003
Publication Date: 2003-09-01
Language: en
Type: article
Indexed In: ['crossref']
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot