Flexible computational pipelines for robust abstraction based control synthesis

Abstract

Successfully synthesizing controllers for complex dynamical systems and specifications often requires leveraging domain knowledge as well as making difficult computational or mathematical tradeoffs. This paper presents a flexible and extensible framework for constructing robust control synthesis algorithms and applies this to the traditional abstraction-based control synthesis pipeline. It is grounded in the theory of relational interfaces and provides a principled methodology to seamlessly combine different techniques (such as dynamic precision grids, refining abstractions while synthesizing, or decomposed control predecessors) or create custom procedures to exploit an application's intrinsic structural properties. A Dubins vehicle is used as a motivating example to showcase memory and runtime improvements.

Document type: Part of book or chapter of book

Full document

Original document

The different versions of the original document can be found in:

• http://arxiv.org/abs/1905.09503

• http://dx.doi.org/10.1007/978-3-030-25540-4_34

• https://link.springer.com/content/pdf/10.1007%2F978-3-030-25540-4_34.pdf under the license cc-by