Tree-Structured Polyhedral Invariant Set Calculations

Journal article, 2020

© 2017 IEEE. 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.