-
When given a query point `q` and zonotope `z=zonotope(x,G)`, `zonotope_distance_point(z,x)` may return something larger than `distance(x,q)`. Example code:
```
import numpy as np
from pypolycontain…
-
Add a function `is_intersection_empty(S1, S2; witness=false)` that returns `true` if the sets `S1` and `S2` do not intersect.
If the flag `witness` is set, also produce a witness, i.e., a point (vect…
-
# Summary
When I transition from dual monitors to a single monitor, stumpwm crashes.
I believe this is the result of the new randr commits in stumpwm (@ralt), as it started when I updated stumpwm …
-
Similar to #586 the Pontryagin (or Minkwoski) Difference of two `HPolytopes` from Theorem 2.2 in [Book on RPI sets](https://www.hindawi.com/journals/mpe/1998/934097/abs/).
![image](https://user-…
-
In https://github.com/JuliaReach/Reachability.jl/pull/528 we added the option `set_operations` with default value `"lazy"`. If `set_operations` is `"zonotope"`, it uses concrete operations between zon…
-
For the zonotopes set representation, Minkowski sum and linear map can be computed efficiently. The proposal is to offer a way to compute
```julia
Ω0 = ConvexHull(X0, ϕ*X0 ⊕ δ*U ⊕ □α)
```
in dis…
-
See:
- https://juliareach.github.io/LazySets.jl/latest/man/reach_zonotopes.html#Introduction-1
- [Reachability of uncertain linear systems using zonotopes](http://www-ljk.imag.fr/membres/Antoine.G…
-
Hi Gagandeep!
We are experiencing strange issues with Octagons when performing a series of affine transformations. At a high level, we first convert the octagon to linear constraints and then print…
-
```julia
function bouncing_ball()
automaton = LightAutomaton(1)
A = [0.0 1.0; 0.0 0.0]
B = reshape([0.0, -1.0], (2, 1))
U = Singleton([1.0])
inv = HalfSpace([-1.0, 0.0], 0.0)…
-
```julia
julia> Z = Zonotope([10.1, -0.05], sparse([1, 2, 1], [1, 3, 4], [0.1, 0.1, 0.1], 2, 4))
Zonotope{Float64}([10.1, -0.05],
[1, 1] = 0.1
[2, 3] = 0.1
[1, 4] = 0.1)
julia> co…