Brief paper: Computations of probabilistic output admissible set for uncertain constrained systems

Authors:
Takeshi Hatanaka;Kiyotsugu Takaba
Affiliations:
Department of Mechanical and Control Engineering, Tokyo Institute of Technology, O-okayama Meguro-ku, Tokyo 152-8550, Japan;Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto city, Kyoto 606-8501, Japan
Venue:
Automatica (Journal of IFAC)
Year:
2008

Citing 4
Cited 0

Robust performance with fixed and worst-case signals for uncertain time-varying systems

Automatica (Journal of IFAC)
Fulfilling hard constraints in uncertain linear systems by reference managing

Automatica (Journal of IFAC)
Brief paper: Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities

Automatica (Journal of IFAC)
Survey paper: Set invariance in control

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.14

Visualization

Abstract

This paper considers uncertain constrained systems, and develops two algorithms for computing a probabilistic output admissible (POA) set which is a set of initial states probabilistically assured to satisfy the constraint. The first algorithm is inspired by an existing randomized sequential technique. The second algorithm alleviates the computational effort based on heuristics. The present algorithms terminate in a finite number of iterations and provide a POA set. Additionally, we can obtain information on the size of the resulting set a posteriori. A numerical simulation demonstrates the applicability of the POA set to a control system design scheme.