A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
DOI10.1007/s10898-022-01261-wzbMath1526.93006arXiv1902.05239OpenAlexW4310612508MaRDI QIDQ6104921
Janosch Rieger, Andreas T. Ernst, Lars Grüne
Publication date: 28 June 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.05239
polytopesdiscrete-time linear systemsnumerical approximationlinear optimizationreachable setdisjunctive program
Linear programming (90C05) Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05) Asymptotic stability in control theory (93D20) Attainable sets, reachability (93B03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral and algebraic methods in computational geometry
- Theory and computation of disturbance invariant sets for discrete-time linear systems
- Bounds for error in the solution set of a perturbed linear program
- \((A,B)\)-invariant polyhedral sets of linear discrete-time systems
- A Galerkin approach to optimization in the space of convex and compact subsets of \(\mathbb{R}^d\)
- Hyperplane method for reachable state estimation for linear time- invariant systems
- Feedback and invariance under uncertainty via set-iterates
- Linear Programming Approach to Deterministic Infinite Horizon Optimal Control Problems with Discounting
- Lectures on Polytopes
- Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations
- Disjunctive Programming
- Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems
- Invariant approximations of the minimal robust positively Invariant set
- Convex Bodies The Brunn-MinkowskiTheory
- Approximation of reachable sets by direct solution methods for optimal control problems
- Approximation of convex bodies by multiple objective optimization and an application in reachable sets
- Hybrid Systems: Computation and Control
This page was built for publication: A linear programming approach to approximating the infinite time reachable set of strictly stable linear control systems
