Repository navigation
JuliaReach Days 1
Institute of Science and Technology, Austria. The time zone is GMT+2.
- zonotopes
- polyhedral approximations
- compositional methods for reachability computations and beyond
- Aadesh Deshmukh (Indian Institute of Information and Technology Trichy) (remote).
- Marcelo Forets (Universidad de la República, Uruguay).
- Christian Schilling (IST Austria).
Reviewed and merged a series of internal improvements in LazySets: revision and cleanup of the concrete polyhedra test suite (LazySets#1518).
Continue with PR reviews in LazySets: more efficient support vector of VPolytope (LazySets#1530).
We released LazySets v1.15.0.
DISCUSSION:
- decomposition of mRPI: https://nbviewer.jupyter.org/github/mforets/escritoire/blob/master/reachability/mRPI_Decomposed.ipynb
REVIEWED AND MERGED:
REVIEWED AND MERGED:
- Optional global tolerance setting: https://github.com/JuliaReach/LazySets.jl/pull/1510
- Documentation improvements: https://github.com/JuliaReach/LazySets.jl/pull/1534, https://github.com/JuliaReach/LazySets.jl/pull/1541
- Missing absorbing elements for some map types: https://github.com/JuliaReach/LazySets.jl/pull/1519
DISCUSSION:
- (mforets)
update and upload notebook with decomposed mRPI - Hausdorff distance and iterative refinement in high dimensions: https://github.com/JuliaReach/LazySets.jl/issues/1536, https://github.com/JuliaReach/LazySets.jl/issues/1537 https://github.com/JuliaReach/LazySets.jl/issues/969
- mRPI
- mRPI Decomposed (for an approach that uses Cartesian decomposition) showcase different ways to compute the minimal robust positively invariant set of an affine discrete dynamical system were updated and uploaded, using LazySets or a combination of LazySets and Polyhedra. A prototype implementation and theoretical errors bounds are included too.
We discussed about adding a function to compute the Hausdorff distance (see https://github.com/JuliaReach/LazySets.jl/issues/1536) and we saw that in inclusion checks, the right-hand side cannot be an arbitrary lazy set and should be generalized (see https://github.com/JuliaReach/LazySets.jl/issues/1537). Related to this topic we discussed about iterative refinement in arbitrary dimensions from Kamenev, Lotov, et al work. The asphercity plays the role of tightening the Hausdorff distance bound obtained by evaluating support functions; a strategy to compute has not been implemented yet (https://github.com/JuliaReach/LazySets.jl/issues/1540). However, it is not crucial to compute it to obtain an upper bound on the Hausdorff distance using support functions, since it is never greater than 1.
PRs / REVIEWING:
- Working with the tests for
AffineMap(https://github.com/JuliaReach/LazySets.jl/pull/1360) we hit what seems to be a bug in Julia, returningunreachable reached. A minimal failing example is https://github.com/JuliaReach/LazySets.jl/issues/1544. - worked on fix repeated-constraint removal in HPolyhedron (#1549)
- custom template directions: https://github.com/JuliaReach/LazySets.jl/pull/1293
- faster vertices list implementation: https://github.com/JuliaReach/LazySets.jl/pull/1467
REVIEWED AND MERGED:
- faster support vector/function for BallInf: https://github.com/JuliaReach/LazySets.jl/pull/1466
- lazy affine map: https://github.com/JuliaReach/LazySets.jl/pull/1360
- concrete minkowski sum: https://github.com/JuliaReach/LazySets.jl/pull/1508/
- check for intersection of CartesianProductArray and high-dimensional Cartesian set: https://github.com/JuliaReach/LazySets.jl/pull/1458
DISCUSSION:
- NNets verification using LazySets: https://github.com/mforets/escritoire/blob/master/reachability/Lazy_NNets.ipynb
REVIEWED AND MERGED:
- fixed repeated-constraint removal in HPolyhedron (#1549).
- use _rtol in Approximations module (#1554)
- small documentation fixes: https://github.com/JuliaReach/LazySets.jl/pull/1560
DISCUSSION:
- flowpipe confidence sets
- refactoring of
Reachability: outsourcereachof "CPost" operators to new packageSetBasedRecurrences - high-level discussion about the vision and mission of the JuliaReach org
REVIEWED AND MERGED:
- add features for lazy M-sums and set inclusion:
- constraints list of polyhedral lazy Minkowski sum: https://github.com/JuliaReach/LazySets.jl/pull/1569
- constraints list of M-sum of hyperrectangular set: https://github.com/JuliaReach/LazySets.jl/pull/1568
- inclusion check of a general lazy set into a polyhedral set https://github.com/JuliaReach/LazySets.jl/pull/1566
- decided to expose the
Approximationsmodule whenusing LazySetshttps://github.com/JuliaReach/LazySets.jl/pull/1567 - We reached 3000 commits in LazySets 🎉
DISCUSSION:
- set-based computation for a switched control system
- new algorithm for zonotope convex hull: https://github.com/JuliaReach/LazySets.jl/pull/1397
- add lazy Minkowski difference type: https://github.com/JuliaReach/LazySets.jl/issues/1509
- add Parallelotope type: https://github.com/JuliaReach/LazySets.jl/issues/1014
- disambiguation of intersection: https://github.com/JuliaReach/LazySets.jl/pull/1354
- Overapproximation of zonotope with polyhedron in constraint representation: https://github.com/JuliaReach/LazySets.jl/issues/1328
- update and improve with examples Reachability docs (!!!) https://juliareach.github.io/Reachability.jl/latest/
- (discussion) Boundedness check for polyhedra using Stiemke's Theorem of alternatives https://github.com/JuliaReach/LazySets.jl/issues/1136