Recursive state bounding by parallelotopes

被引：173

作者：

Chisci, L

Garulli, A

Zappa, G

机构：

[1] Dipto. di Sistemi e Informatica, Universitá di Firenze, 50139 Firenze

来源：

AUTOMATICA | 1996年 / 32卷 / 07期

关键词：

state estimation; unknown but bounded estimation; set-membership estimation; recursive estimation; state bounding;

D O I：

10.1016/0005-1098(96)00048-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. Copyright (C) 1996 Elsevier Science Ltd.

引用

页码：1049 / 1055

页数：7

共 16 条

[1] RECURSIVE STATE ESTIMATION FOR A SET-MEMBERSHIP DESCRIPTION OF UNCERTAINTY [J].