Optimized State Space Grids for Abstractions
Alexander Weber, Matthias Rungger, Gunther Reissig

TL;DR
This paper introduces a method to optimize the aspect ratio of hyper-intervals in state space grids to minimize computational effort in abstraction-based controller synthesis, making the process more efficient.
Contribution
It proposes a predictive functional for computational effort and a convex optimization approach to select hyper-interval aspect ratios for more efficient abstractions.
Findings
The proposed method reduces the number of transitions in abstractions.
The optimization problem is convex and globally solvable.
Demonstrated effectiveness on a practical example.
Abstract
The practical impact of abstraction-based controller synthesis methods is currently limited by the immense computational effort for obtaining abstractions. In this note we focus on a recently proposed method to compute abstractions whose state space is a cover of the state space of the plant by congruent hyper-intervals. The problem of how to choose the size of the hyper-intervals so as to obtain computable and useful abstractions is unsolved. This note provides a twofold contribution towards a solution. Firstly, we present a functional to predict the computational effort for the abstraction to be computed. Secondly, we propose a method for choosing the aspect ratio of the hyper-intervals when their volume is fixed. More precisely, we propose to choose the aspect ratio so as to minimize a predicted number of transitions of the abstraction to be computed, in order to reduce the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
