Implementation of Polyhedral Operations in CORA 2024

Tool presentation: Polyhedra are a common set representation with widespread appli- cations in many areas of research, including convex geometry, reachability analysis, and invariant set computation. Their popularity stems from a tight relation to linear program- ming. Apart from some basic set operations with analytic formulae, the implementation of many polyhedral set operations in tools is not well documented. For this reason, we describe the evaluation of common set operations on polyhedra, including their runtime complexity, and provide an overview of their implementation as a dedicated class in the MATLAB tool Continuous Reachability Analyzer (CORA) for set-based computing. In particular, we highlight the handling of unbounded and degenerate sets. Finally, we com- pare our implementation to the popular multi-parametric toolbox.

Authors

Publication Details

Journal
EPiC series in computing
Published
2024-10-10
DOI
https://doi.org/10.29007/wb9s
Primary Topic
Formal Methods in Verification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Implementation of Polyhedral Operations in CORA 2024

Matthias Althoff, Adrian Kulmburg, Mark Wetzlinger, Viktor Kotsev
EPiC series in computing
Formal Methods in Verification
article

Implementation of Polyhedral Operations in CORA 2024

Matthias Althoff, Adrian Kulmburg, Mark Wetzlinger, Viktor Kotsev
article en

Abstract

Tool presentation: Polyhedra are a common set representation with widespread appli- cations in many areas of research, including convex geometry, reachability analysis, and invariant set computation. Their popularity stems from a tight relation to linear program- ming. Apart from some basic set operations with analytic formulae, the implementation of many polyhedral set operations in tools is not well documented. For this reason, we describe the evaluation of common set operations on polyhedra, including their runtime complexity, and provide an overview of their implementation as a dedicated class in the MATLAB tool Continuous Reachability Analyzer (CORA) for set-based computing. In particular, we highlight the handling of unbounded and degenerate sets. Finally, we com- pare our implementation to the popular multi-parametric toolbox.

EPiC series in computingVol. 103
Partnerships for the goals
Openalex Percentile: Top 79%
Formal Methods in Verification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Implementation of Polyhedral Operations in CORA 2024 — Matthias Althoff, Adrian Kulmburg, et al. · EPiC series in computing (2024) | TGRS Research Map | TGRS