Lazy Abstraction-Based Control for Reachability.
Lists
Only you see this
Abstract
We present lazy abstraction-based controller synthesis (ABCS) for continuous-time nonlinear dynamical systems against reach-avoid specifications. State-of-the-art multi-layered ABCS pre-computes multiple finite-state abstractions of different coarseness and applies reactive synthesis to the coarsest abstraction whenever feasible, but adaptively considers finer abstractions when necessary. Our new algorithm improves this technique by constructing abstractions lazily on demand. Our insight is that the abstract transition relation only needs to be locally computed for a small set of frontier states of the courseness currently required by the synthesis algorithm. We show that lazy ABCS can significantly outperform previous multi-layered ABCS algorithms: on a standard benchmark, lazy ABCS was more than 4 times faster.
BibTeX
@inproceedings{hsu2019lazy,
author = {Kyle Hsu and Rupak Majumdar and Kaushik Mallik and Anne-Kathrin Schmuck},
title = {{Lazy Abstraction-Based Control for Reachability.}},
booktitle = {ATVA},
year = {2019},
doi = {10.1007/978-3-030-31784-3\_2},
}Loading related content...