Brief paper: Recursive state bounding by parallelotopes

Authors:
L. Chisci;A. Garulli;G. Zappa
Affiliations:
Dipartimento di Sistemi e Informatica, Universitá di Firenze, Via di S. Marta 3, 50139 Firenze, Italy;Dipartimento di Sistemi e Informatica, Universitá di Firenze, Via di S. Marta 3, 50139 Firenze, Italy;Dipartimento di Sistemi e Informatica, Universitá di Firenze, Via di S. Marta 3, 50139 Firenze, Italy
Venue:
Automatica (Journal of IFAC)
Year:
1996

Citing 5
Cited 8

Estimation of parameter bounds from bounded-error data: a survey

Mathematics and Computers in Simulation - Parameter identifications with error bound
A compact algorithm for the intersection and approximation of N-dimensional polytopes

Mathematics and Computers in Simulation - Parameter identifications with error bound
Fast and robust algorithm to compute exact polytope parameter bounds

Mathematics and Computers in Simulation - Parameter identifications with error bound
Predictive self-tuning control by parameter bounding and worst-case design

Automatica (Journal of IFAC) - Special section on fault detection, supervision and safety for technical processes
On the value of information in system identification-Bounded noise case

Automatica (Journal of IFAC)

Guaranteed Dynamic-System State Estimation by the Method of Bidirectional Dynamic Programming

Cybernetics and Systems Analysis
A Set Theoretic Approach to Dynamic Robot Localization and Mapping

Autonomous Robots
Brief paper: A set-membership state estimation algorithm based on DC programming

Automatica (Journal of IFAC)
Fast communication: Narrowband interference cancellation based on set-membership estimation in DCSK communication system

Signal Processing
Fault diagnosis and fault tolerant control using set-membership approaches: Application to real case studies

International Journal of Applied Mathematics and Computer Science
Energy-aware robust model predictive control based on noisy wireless sensors

Automatica (Journal of IFAC)
Brief Guaranteed state estimation by zonotopes

Automatica (Journal of IFAC)
Brief A set theoretic approach for time-to-contact estimation in dynamic vision

Automatica (Journal of IFAC)

Quantified Score

Hi-index	22.15

Visualization

Abstract

In this paper, the problem of recursively estimating the state uncertainty set of a discrete-time linear dynamical system is addressed. A novel approach based on minimum-volume bounding parallelotopes is introduced and an algorithm of polynomial complexity is derived. Simulation results and performance comparisons with ellipsoidal recursive state-bounding algorithms are also given.