Characterization of backward reachable set and positive invariant set in polytopes

Authors:
Min Wu;Gangfeng Yan;Zhiyun Lin;Meiqin Liu
Affiliations:
Asus Intelligent Systems Lab, Department of Systems Science and Engineering, Zhejiang University, Hangzhou, P. R. China;Asus Intelligent Systems Lab, Department of Systems Science and Engineering, Zhejiang University, Hangzhou, P. R. China;Asus Intelligent Systems Lab, Department of Systems Science and Engineering, Zhejiang University, Hangzhou, P. R. China;Asus Intelligent Systems Lab, Department of Systems Science and Engineering, Zhejiang University, Hangzhou, P. R. China
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 4
Cited 0

Interconnected automata and linear systems: a theoretical framework in discrete-time

Proceedings of the DIMACS/SYCON workshop on Hybrid systems III : verification and control: verification and control
Search for Steady States of Piecewise-Linear Differential Equation Models of Genetic Regulatory Networks

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Survey paper: Set invariance in control

Automatica (Journal of IFAC)
Control of systems integrating logic, dynamics, and constraints

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper studies reachability problems of autonomous affine systems in polytopes. Our goal is to find in a given polytope both the largest positive invariant set and backward reachable sets (or attraction domains) of facets. Special attention is paid to the stable invariant affine subspace. After presenting several useful properties of these sets, a partition procedure is given so that the polytope is divided into a positive invariant set and several backward reachable sets.