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

  • Scott J
  • Raimondo D
  • Marseglia G
 et al. 
  • 23


    Mendeley users who have this article in their library.
  • 8


    Citations of this article.


This article introduces a new class of sets, called constrained zonotopes, that can be used to enclose sets of interest for estimation and control. The numerical representation of these sets is sufficient to describe arbitrary convex polytopes when the complexity of the representation is not limited. At the same time, this representation permits the computation of exact projections, intersections, and Minkowski sums using very simple identities. Efficient and accurate methods for computing an enclosure of one constrained zonotope by another of lower complexity are provided. The advantages and disadvantages of these sets are discussed in comparison to ellipsoids, parallelotopes, zonotopes, and convex polytopes in halfspace and vertex representations. Moreover, extensive numerical comparisons demonstrate significant advantages over other classes of sets in the context of set-based state estimation and fault detection.

Author-supplied keywords

  • Fault detection
  • Reachability analysis
  • Set-based computing
  • State estimation
  • Zonotopes

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Joseph K. Scott

  • Davide M. Raimondo

  • Giuseppe Roberto Marseglia

  • Richard D. Braatz

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free