Reachability analysis of discrete-time systems with disturbances
Rakovic S. V. and Kerrigan E. C. and Mayne D. Q. and Lygeros J.
IEEE Transactions on Automatic Control, April 2006 In press
Abstract
This paper presents new results that allow one to compute the set
of states that can be robustly steered in a finite number of
steps, via state feedback control, to a given target set. The
assumptions that are made in this paper are that the system is
discrete-time, nonlinear and time-invariant and subject to mixed
constraints on the state and input. A persistent disturbance,
dependent on the current state and input, acts on the system.
Existing results are not able to address state- and
input-dependent disturbances and the results in this paper are
therefore a generalization of previously-published results. One of
the key aims of this paper is to present results such that one can
perform the relevant set computations using polyhedral algebra and
computational geometry software, provided the system is piecewise
affine and the constraints are polygonal. Existing methods are
only applicable to piecewise affine systems that either have no
control inputs or no disturbances, whereas the results in this
paper remove this limitation. Some simple examples are also given
that show that, even if all the relevant sets are convex and the
system is linear, convexity of the set of controllable states
cannot be guaranteed.
Pre-Prints
[PDF]
BibTex Entry
- @Article{rakovic:kerrigan:mayne:lygeros:2006,
- author = {Rakovic S. V. and Kerrigan E. C. and Mayne D. Q. and Lygeros J.},
- journal = {IEEE Transactions on Automatic Control},
- title = {Reachability analysis of discrete-time systems with disturbances},
- year = {2006},
- bibkey = {rakovic:kerrigan:mayne:lygeros:2006},
- month = {April},
- note = {In press}
- }
|