Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems
arXiv:1908.09950 · doi:10.1016/j.automatica.2019.108614
Abstract
This paper presents new methods for set-valued state estimation of nonlinear discrete-time systems with unknown-but-bounded uncertainties. A single time step involves propagating an enclosure of the system states through the nonlinear dynamics (prediction), and then enclosing the intersection of this set with a bounded-error measurement (update). When these enclosures are represented by simple sets such as intervals, ellipsoids, parallelotopes, and zonotopes, certain set operations can be very conservative. Yet, using general convex polytopes is much more computationally demanding. To address this, this paper presents two new methods, a mean value extension and a first-order Taylor extension, for efficiently propagating constrained zonotopes through nonlinear mappings. These extend existing methods for zonotopes in a consistent way. Examples show that these extensions yield tighter prediction enclosures than zonotopic estimation methods, while largely retaining the computational benefits of zonotopes. Moreover, they enable tighter update enclosures because constrained zonotopes can represent intersections much more accurately than zonotopes.
This includes the supplement "Supplementary material for: Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems"
References in corpus (1)
Cited by in corpus (6)
- Guaranteed methods based on constrained zonotopes for set-valued state estimation of nonlinear discrete-time systems
- Joint state and parameter estimation based on constrained zonotopes
- Safety Verification of Neural Feedback Systems Based on Constrained Zonotopes
- Robust output feedback model predictive control using online estimation bounds
- Simultaneous State and Unknown Input Set-Valued Observers for Some Classes of Nonlinear Dynamical Systems
- Rethinking the Mathematical Framework and Optimality of Set-Membership Filtering