Tree-Structured Polyhedral Invariant Set Calculations
Journal article, 2020
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.
Monitoring
Uncertainty
Computational methods
Robust control
Economic indicators
Linear parameter-varying systems.
Computational efficiency
Redundancy
Iterative algorithms
Linear systems
Author
Emil Klintberg
Volvo Group
Magnus Nilsson
Qamcom Research & Technology
Ankit Gupta
Chalmers, Electrical Engineering, Systems and control
Lars Johannesson Mårdh
Zenuity AB
Paolo Falcone
Chalmers, Electrical Engineering, Systems and control
IEEE Control Systems Letters
24751456 (eISSN)
Vol. 4 2 426-431Driving Forces
Sustainable development
Areas of Advance
Transport
Subject Categories
Theoretical Chemistry
Probability Theory and Statistics
Mathematical Analysis
DOI
10.1109/LCSYS.2019.2945721