2016
DOI: 10.1016/j.automatica.2016.02.036
|View full text |Cite
|
Sign up to set email alerts
|

Constrained zonotopes: A new tool for set-based estimation and fault detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
206
0
3

Year Published

2016
2016
2024
2024

Publication Types

Select...
6
1
1

Relationship

1
7

Authors

Journals

citations
Cited by 238 publications
(209 citation statements)
references
References 29 publications
0
206
0
3
Order By: Relevance
“…Though convex polytopes are closed for the operations of linear mapping and Minkowski sum, the complexity of both operations is exponential via H-rep in the worst case scenario [28]. By contrast, as shown in Tab.…”
Section: Set Operation Npmentioning
confidence: 99%
“…Though convex polytopes are closed for the operations of linear mapping and Minkowski sum, the complexity of both operations is exponential via H-rep in the worst case scenario [28]. By contrast, as shown in Tab.…”
Section: Set Operation Npmentioning
confidence: 99%
“…However, the Minkowski sum and linear image (see Section 3) are outer-approximated. In the article [25], constrained zonotopes are introduced to overcome many of the limitations of zonotopes. These sets are closed under intersection, Minkowski sum, and linear image, and are capable of describing arbitrary convex polytopes if the complexity of the set description is not limited.…”
Section: Introductionmentioning
confidence: 99%
“…These sets are closed under intersection, Minkowski sum, and linear image, and are capable of describing arbitrary convex polytopes if the complexity of the set description is not limited. Efficient algorithms for linear set-valued state estimation and also FDI using constrained zonotopes are described in [25,8].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…One alternative is to use the concept of zonotopes, described in [22] and further developed in [23], [24] and [25]. However, it is normally the case that each proposal represents a compromise between the computational complexity of the unions and intersections.…”
Section: Introductionmentioning
confidence: 99%