Solvability of Approximate Reach-Avoid Games
Systems and Control
2025-02-10 v1 Logic in Computer Science
Systems and Control
Abstract
Objective: In a companion paper, we propose a parametric hybrid automaton model and an algorithm for the online synthesis of robustly correct and near-optimal controllers for cyber-physical system with reach-avoid guarantees. A key part of this synthesis problem is based on a weighted discretised game and solved via scope-adaptive discrete dynamic programming. Approach: This work examines proofs of key properties of the discussed algorithm. Evaluation: The main proof is by induction over the stages of a discrete Hamilton-Jacobi-Bellman system of equations. Contribution: The results include a game solvability theorem and identify necessary and sufficient conditions for its applicability.
Cite
@article{arxiv.2502.04544,
title = {Solvability of Approximate Reach-Avoid Games},
author = {Mario Gleirscher},
journal= {arXiv preprint arXiv:2502.04544},
year = {2025}
}
Comments
15 pages