Guaranteed approximations of arbitrarily quantified reachability problems
Systems and Control
2023-09-22 v1 Logic in Computer Science
Systems and Control
Abstract
We propose an approach to compute inner and outer-approximations of the sets of values satisfying constraints expressed as arbitrarily quantified formulas. Such formulas arise for instance when specifying important problems in control such as robustness, motion planning or controllers comparison. We propose an interval-based method which allows for tractable but tight approximations. We demonstrate its applicability through a series of examples and benchmarks using a prototype implementation.
Cite
@article{arxiv.2309.07662,
title = {Guaranteed approximations of arbitrarily quantified reachability problems},
author = {Eric Goubault and Sylvie Putot},
journal= {arXiv preprint arXiv:2309.07662},
year = {2023}
}