invariantSet
Purpose
Computation of invariant sets for PWA systems
Syntax
S = system.invariantSet()
S = system.invariantSet('X', X, 'U', U)
Description
For an autonomous PWA system
this function
computes the set of states for which recursive satisfaction of
state constraints can be shown.
The set is computed by running the set recursion

initialized by
and terminating once
. If
is not provided,
is assumed.
For a PWA system
, which is subject to
polyhedral state constraints
and input constraints
this function calculates the maximal
control-invariant set

Note that this function requires that state constraints
defined in system.x.min and system.x.max (see
"help SystemSignal").
Input Arguments
X |
Polyhedron defining state constraints (optional)
Class: polyhedron
|
U |
Polyhedron defining input constraints (optional)
Class: polyhedron
|
maxIterations |
Maximal number of iterations (optional)
Class: double
|
Output Arguments
S |
Invariant set
Class: Polyhedron
|
◀ |
initialize |
|
reachableset |
▶ |
© 2003-2013 Michal Kvasnica: STU Bratislava, michal.kvasnica@stuba.sk