Recursive state bounding by parallelotopes

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 performa...

Full description

Saved in:
Bibliographic Details
Published in:Automatica (Oxford) 1996-07, Vol.32 (7), p.1049-1055
Main Authors: Chisci, L., Garulli, A., Zappa, G.
Format: Article
Language:English
Subjects:
Applied sciences
Computer science
control theory
systems
Control theory. Systems
Exact sciences and technology
Modelling and identification
recursive estimation
set-membership estimation
state bounding
State estimation
unknown but bounded estimation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0005-1098
1873-2836
DOI:10.1016/0005-1098(96)00048-9