-
```julia
using Test, InteractiveUtils
Z = rand(Zonotope, num_generators=40, dim=4);
order(Z)
@inferred reduce_order(Z, 5)
return type Zonotope{Float64,Array{Float64,1},SparseMatrixCSC{Float64…
-
some comments that we could consider later:
- the new overapproximate function has some overlap with [this function](https://github.com/JuliaReach/LazySets.jl/blob/master/src/LazyOperations/Interse…
-
The current implementation is
```julia
function forward_layer(solver::Ai2, L::Layer{Id}, input)
return affine_map(L, input)
end
```
but what I understand is correct would be
```julia
forw…
-
Purpose: generalize https://github.com/JuliaReach/LazySets.jl/pull/2199#issuecomment-650632317.
-
In [1] a method is proposed to convert (exactly) an arbitrary polytope to the intersection of zonotopes.
It would be interesting to add this method. One application is to make a convenient overappr…
-
See [this paper](http://www.i6.in.tum.de/Main/Publications/Althoff2009b.pdf) for an alternative algorithm to reduce the order of a zonotope, including heuristics.
-
See https://tel.archives-ouvertes.fr/tel-00422569v2
-
-
Let `F = (p(x₀, t), I)` be an n-dimensional TM flowpipe, `x₀ ∈ X₀`, `t ∈ [0, δ]`. Two ideas are outlined in [1] (we may split these into smaller issues):
- using a conservative linearization of the…
-
hey, I'm new to Julia, but I'm trying to add a constraint to cartesian product and it's not very easy.
What I was trying to do is to express this:
A zonotope Z \subset R^2, (z_1, z_2) \in BZ = …