… In particular, in this work the parametric uncertainty is bounded by a zonotope. Fault detection
is then based on checking, at every sampling time, the non existence of a parameter value …

… Problem 1.8 Describe zonotopes, which are Minkowski sums of k non-parallel edges,
hence parallelograms are zonotopes for k = 2. Can you always partition the zonotope into …

… For numerous random matrix ensembles, the expected number of k-dimensional faces of
the random n-dimensional zonotope AHN obeys the formula Efk(AHN)/fk(HN) = 1 − PN−n,N−k, …

… The set representations that are currently supported are intervals, zonotopes, zonotope
bundles, polynomial zonotopes, and polytopes. CORA also realizes the conversion between the …

… We prove that this locus is a convex polytope, the projection of a zonotope in R 4+ 1. We
derive complexity bounds and algorithms for the construction of these" centroid polytopes”. …

… To move the zonotope from event to event, we connect points on the two zonotope
boundaries with the same parameterization, with a line segment. This is called sweeping the …

… Instead of using the traditional point-based methods, zonotope technique is adopted in this
paper due to its high accuracy, good compactness of the representation, and low complexity […

… space of the zonotope Z(V) in the class of zonotopes is stably equivalent to the realization
space of the oriented matroid My. From a realization of Z(V) as a zonotope the configuration V …

… One is an over-approximation based approach, such as Zonotope and Abstract domain, …
The approximation methods normally apply a geometric object such as Zonotope to …

… zonotopes, a subclass of polytopes amenable to reachable set computation [24]. A zonotope
… We represent Ji with one zonotope per time interval, which is returned by Ji : NT → P(R2 ×K)…