… We represent sets using constrained zonotopes, zonotopes, and intervals, because they
enable efficient Minkowski sum computation (a key part of reachability analysis) [30] and …

… the dynamic operations of the cyber-physical networked microgrid system, Zonotope
method is adopted in this work. Mathematically, Zonotope is a type of polytope [10], which is a …

… graphic zonotopes of … zonotopes of K n . In Section 3.2, we show that the hyperplane
separation bound is at most a constant when applied to our linear description of graphic zonotopes (…

… , and Ziegler), and on our study of the so-called symmetric cubillages of cyclic zonotopes. …
recall basic facts on cubillages of cyclic zonotopes used in the paper. For details, see [3]. A …

We consider the problem of minimizing a function that attains its minimum over a greedy
polytope at one of its vertices. This problem class contains many computationally intractable …

… Zonoids are defined as limits of zonotopes in the Hausdorff metric, where zonotopes are
Minkowski sum of line segments. Indeed, any origin-symmetric convex body in R 2 is a zonoid. …

… The sets are represented through generalized star sets or zonotopes which we define below…
the time spent per zonotope or we can try to reduce the number of zonotopes which have to …

… the containment of an improper M-Zonotope (red) in a proper M-Zonotope (green), by …
3b we show how the proper M-Zonotope can be decomposed into their Box and Zonotope …

… Because of simplicity and efficient computations, the proposed algorithms are based on
zonotopes for set representation and computation, while for process representation the …

… We call it a zonotope if it is a Minkowski sum of finite number of segments. In other words,
P = S 1 + S 2 + … + S w , where w is an integer and S i are segments in E n . Zonotopes are a …