Papers › Set operations and order reductions for constrained zonotopes
Set operations and order reductions for constrained zonotopes
Vignesh Raghuraman, Justin P. Koeln
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
This paper presents methods for using zonotopes and constrained zonotopes to improve the practicality of a wide variety of set-based operations commonly used in control theory. The proposed methods extend the use of constrained zonotopes to represent sets resulting from operations including halfspace intersections, convex hulls, robust positively invariant sets, and Pontryagin differences. Order reduction techniques are also presented that provide lower-complexity inner-approximations of zonotopes and constrained zonotopes. Numerical examples are used to demonstrate the efficacy and computational advantages of using zonotope-based set representations for dynamic system analysis and control.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections