… In Section IV, the expression of residual zonotopes and their bounding zonotopes are
derived. The FDI algorithm is proposed in Section V. In Section VI, a collection of FDI conditions …

… use to zonotopes to … zonotope inclusion operator which is required to present the proposed
bounded operator. It is used to find an unique zonotope that includes the family of zonotopes …

… We introduce our implementation based on zonotopes and … , the number of generators for
zonotopes or directions for support … We begin with our approach based on zonotopes [4], [11]. …

… using the notion of “zonotope”. Zonotopes are a data structure which is very useful for
representing and manipulating efficiently convex polytopes. Zonotopes allow to compute easily …

… to Zlink to obtain the zonotope in Cartesian space … zonotope is a zonotope and a matrix of
symmetric intervals multiplied by a zonotope can be overapproximated with another zonotope …

… zonotope, all of its kdimensional faces are centrally symmetric, for 1 ≤ k ≤ d. For example,
the zonotopes in R2 are … We shall say that a polytope P ⊆ R3 is a two-flat zonotope if P is the …

… Moreover, complexity reduction is not well addressed for the zonotope-based reachability
analysis. In this paper, a zonotope-based reachability analysis is utilized for the analog …

… Let (2) A ̄ = [ A c T ] and define the zonotope Z ̄ as follows: (3) Z ̄ = { z ̄ ∈ ℜ m + 1 | z ̄
… z ̄ k + 1 , the nearest point of b ̄ k to the zonotope Z ̄ . Then b ̄ k + 1 is obtained as the …

… The behavior of the zonotope could be appreciated in Fig.7. At the beginning the region defined
by the zonotope grows until the reliable … In those moments the zonotope size is reduced. …

… sum can be called zonotope. Combining 2< j< k edges, 3-models of j-cubes can be built,
as parts of a k-cube. The suitable combinations of these zonotope models can result in 3-…