Tree-Structured Polyhedral Invariant Set Calculations

• This letter provides a description of how hierarchical dependencies between inequalities can be exploited in order to efficiently calculate polyhedral approximations of maximal robust positive invariant sets using geometrically motivated methods. Due to the hierarchical dependencies, the calculations of preimage sets and minimal representations can be alleviated. It is also shown that as a byproduct from the calculations of minimal representations, a stopping criterion is obtained, which means that the commonly used subset test is superfluous.

Subject headings

NATURVETENSKAP  -- Kemi -- Teoretisk kemi (hsv//swe)

NATURAL SCIENCES  -- Chemical Sciences -- Theoretical Chemistry (hsv//eng)

NATURVETENSKAP  -- Matematik -- Sannolikhetsteori och statistik (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Probability Theory and Statistics (hsv//eng)

NATURVETENSKAP  -- Matematik -- Matematisk analys (hsv//swe)

NATURAL SCIENCES  -- Mathematics -- Mathematical Analysis (hsv//eng)

Keyword

Monitoring

Uncertainty

Computational methods

Robust control

Economic indicators

Linear parameter-varying systems.

Computational efficiency

Redundancy

Iterative algorithms

Linear systems

Publication and Content Type

art (subject category)

ref (subject category)