ε-feasible approximation of the state reachable set for discrete-time systems
Authors:
- 21 June 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (01912216) , 5520-5525
Abstract
This paper considers an approximation problem of the state reachable set for linear discrete-time systems with unknown but bounded exogenous inputs. A simple recursive procedure provides a sequence of enlarging convex polyhedral sets which successively approximates the state reachable set. The main contribution of this paper is to clarify a stopping criterion for the recursive procedure. The notion of positive invariance is utilized to derive the stopping criterion. The procedure makes it possible, as it is contrast to those of other existing methods, to estimate the state reachable set within a required accuracy.Keywords
This publication has 9 references indexed in Scilit:
- Behavioral inclusion2003
- A survey of techniques for approximating reachable and controllable sets2002
- Analysis of conditions for non-violation of constraints on linear discrete-time systems with exogenous inputs2002
- Analysis of State Reachable Sets for Quadratic SystemsTransactions of the Society of Instrument and Control Engineers, 1998
- Theory and computation of disturbance invariant sets for discrete‐time linear systemsMathematical Problems in Engineering, 1998
- Optimization of the l/sup ∞/-induced norm under full state feedbackIEEE Transactions on Automatic Control, 1996
- Linear systems with state and control constraints: the theory and application of maximal output admissible setsIEEE Transactions on Automatic Control, 1991
- Computation of minimum-time feedback control laws for discrete-time systems with state-control constraintsIEEE Transactions on Automatic Control, 1987
- Estimating Reachable SetsJournal of Dynamic Systems, Measurement, and Control, 1981