ISSN:
1573-2878
Keywords:
Linear systems
;
linear programming
;
convexity
;
polyhedra
;
invariance
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract The problem of confining the trajectory of a linear discrete-time system in a given polyhedral domain is addressed through the concept of (A, B)-invariance. First, an explicit characterization of (A, B)-invariance of convex polyhedra is proposed. Such characterization amounts to necessary and sufficient conditions in the form of linear matrix relations and presents two major advantages compared to the ones found in the literature: it applies to any convex polyhedron and does not require the computation of vertices. Such advantages are felt particularly in the computation of the supremal (A, B)-invariant set included in a given polyhedron, for which a numerical method is proposed. The problem of computing a control law which forces the system trajectories to evolve inside an (A, B)-invariant polyhedron is treated as well. Finally, the (A, B)-invariance relations are generalized to persistently disturbed systems.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1021727806358
Permalink
