LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

On-the-Fly Symbolic Synthesis With Memory Reduction Guarantees

Photo by kellysikkema from unsplash

We present novel on-the-fly abstraction-based controller synthesis algorithms for two fundamental specifications—invariance and optimal reachability. In contrast to existing methods, the algorithms we propose do not require precomputation or storage… Click to show full abstract

We present novel on-the-fly abstraction-based controller synthesis algorithms for two fundamental specifications—invariance and optimal reachability. In contrast to existing methods, the algorithms we propose do not require precomputation or storage of any large abstraction parts. This translates to orders of magnitude of reduction in memory consumption compared to standard methods. Moreover, our algorithms fully apply to general nonlinear systems and provide controllers that do not posses any additional conservatism. We demonstrate the successful synthesis of controllers for a problem that was previously unsolvable due to excessive memory and time consumption.

Keywords: synthesis; synthesis memory; memory; reduction; fly symbolic; symbolic synthesis

Journal Title: IEEE Transactions on Automatic Control
Year Published: 2023

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.