Reach set computation and control synthesis for discrete-time dynamical systems with disturbances

DOI10.1016/j.automatica.2011.02.009zbMath1220.93020MaRDI QIDQ2276115

Pravin P. Varaiya, Alex A. Kurzhanskiy

Publication date: 1 August 2011

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2011.02.009

zbMATH Keywords

dynamic programming; discrete-time linear systems; ellipsoidal methods; backward reachability; closed-loop reach set; maxmin/minmax reachability

Mathematics Subject Classification ID

90C47: Minimax problems in mathematical programming

49L20: Dynamic programming in optimal control and differential games

93C55: Discrete-time control/observation systems

93C05: Linear systems in control theory

90C39: Dynamic programming

93B50: Synthesis problems

93B03: Attainable sets, reachability

Related Items

On infinite horizon switched LQR problems with state and control constraints, Control and estimation in linear time-varying systems based on ellipsoidal reachability sets, A convex optimization approach to dynamic programming in continuous state and action spaces, Ellipsoidal reachable sets of linear time-varying continuous and discrete systems in control and estimation problems, Control design with guaranteed transient performance: an approach with polyhedral target tubes, Ellipsoidal reachability sets of linear time-varying systems in estimation and control problems

Uses Software

• Matlab
• Ellipsoidal Toolbox

Cites Work

• Unnamed Item
• Properties of the optimal ellipsoids approximating the reachable sets of uncertain systems
• Optimal control for nonlinear processes
• Controllers for reachability specifications for hybrid systems
• Ellipsoidal calculus for estimation and control
• Linear Matrix Inequalities in System and Control Theory
• Variational Analysis
• Ellipsoidal Techniques for Reachability Analysis of Discrete-Time Linear Systems
• Minimax Theorems
• Dynamic optimization for reachability problems.