Polynomial-time probabilistic observability analysis of sampled-data piecewise affine systems

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.

DOI: 10.1016/j.sysconle.2007.06.005

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@article{Azuma2007PolynomialtimePO, title={Polynomial-time probabilistic observability analysis of sampled-data piecewise affine systems}, author={Shun-ichi Azuma and Jun-ichi Imura}, journal={Systems & Control Letters}, year={2007}, volume={56}, pages={685-694} }