Computations of probabilistic output admissible set for uncertain constrained systems

DOI10.1016/j.automatica.2007.03.031zbMath1283.93048OpenAlexW2016660844MaRDI QIDQ2440622

Takeshi Hatanaka, Kiyotsugu Takaba

Publication date: 19 March 2014

Published in: Automatica (Search for Journal in Brave)

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

zbMATH Keywords

uncertaintyrandomized algorithmconstrained systemmaximal output admissible set

Mathematics Subject Classification ID

Related Items (2)

Probabilistic output admissible set for systems with time-varying uncertainties ⋮ Constraint-admissible sets for systems with soft constraints and their application in model predictive control

Cites Work

• Unnamed Item
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
• Fulfilling hard constraints in uncertain linear systems by reference managing
• Robust performance with fixed and worst-case signals for uncertain time-varying systems
• Set invariance in control
• Robust command governors for constrained linear systems
• Randomized algorithms for probabilistic robustness with real and complex structured uncertainty
• Nonlinear control of constrained linear systems via predictive reference management
• Linear systems with state and control constraints: the theory and application of maximal output admissible sets
• Ultimate boundedness control for uncertain discrete-time systems via set-induced Lyapunov functions
• Discrete‐time reference governors and the nonlinear control of systems with state and control constraints
• Optimization of the l/sup ∞/-induced norm under full state feedback
• The Scenario Approach to Robust Control Design

This page was built for publication: Computations of probabilistic output admissible set for uncertain constrained systems