DocumentCode :
3125471
Title :
Polynomial-Time Probabilistic Observability Analysis of Sampled-Data Piecewise Affine Systems
Author :
Azuma, Shun-ichi ; Imura, Jun-ichi
Author_Institution :
Graduate School of Informatics, Kyoto University, Uji, Kyoto 611-0011, Japan sazuma@i.kyoto-u.ac.jp
fYear :
2005
fDate :
12-15 Dec. 2005
Firstpage :
6644
Lastpage :
6649
Abstract :
This paper proposes a polynomial-time probabilistic approach to solve the observability problem of sampled-data piecewise affine systems. First, an algebraic characterization for the system to be observable is derived. Next, based on the characterization, we propose a randomized algorithm that can determine with a probabilistic accuracy if the system is observable or not. Finally, it is shown with some examples, for which it is hopeless to check the observability in a deterministic way, that the proposed algorithm is very useful.
Keywords :
Computational complexity; Control system analysis; Control system synthesis; Controllability; Informatics; Information science; NP-hard problem; Observability; Polynomials; Sampling methods;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC '05. 44th IEEE Conference on
Print_ISBN :
0-7803-9567-0
Type :
conf
DOI :
10.1109/CDC.2005.1583229
Filename :
1583229
Link To Document :
بازگشت