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

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 if the system is observable in a probabilistic sense or the system is not observable in a deterministic sense. 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.