Computing Abstractions of Nonlinear Systems
From MaRDI portal
Publication:5347889
Abstract: Sufficiently accurate finite state models, also called symbolic models or discrete abstractions, allow one to apply fully automated methods, originally developed for purely discrete systems, to formally reason about continuous and hybrid systems, and to design finite state controllers that provably enforce predefined specifications. We present a novel algorithm to compute such finite state models for nonlinear discrete-time and sampled systems which depends on quantizing the state space using polyhedral cells, embedding these cells into suitable supersets whose attainable sets are convex, and over-approximating attainable sets by intersections of supporting half-spaces. We prove a novel recursive description of these half-spaces and propose an iterative procedure to compute them efficiently. We also provide new sufficient conditions for the convexity of attainable sets which imply the existence of the aforementioned embeddings of quantizer cells. Our method yields highly accurate abstractions and applies to nonlinear systems under mild assumptions, which reduce to sufficient smoothness in the case of sampled systems. Its practicability in the design of discrete controllers for nonlinear continuous plants under state and control constraints is demonstrated by an example.
Cited in
(21)- Abstraction-based control synthesis using partial information
- Convexity of the images of small balls through nonconvex multifunctions
- Automated generation of dynamics-based runtime certificates for high-level control
- Towards scalable synthesis of stochastic control systems
- Formal controller synthesis from specifications given by discrete-time hybrid automata
- Safety synthesis for incrementally stable switched systems using discretization-free multi-resolution abstractions
- Modelling and supervisory control of hybrid dynamical systems via fuzzy \(l\)-complete approximation approach
- Optimization-based subdivision algorithm for reachable sets
- Refinements of behavioural abstractions for the supervisory control of hybrid systems
- Asynchronous \(l\)-complete approximations
- On distributed symbolic control of interconnected systems under persistency specifications
- Construction of discontinuous piecewise quadratic value functions in a target control problem
- Algorithms for exact and approximate linear abstractions of polynomial continuous systems
- Finite abstractions with robustness margins for temporal logic-based control synthesis
- Decentralized abstractions for multi-agent systems under coupled constraints
- Finite horizon discrete models for multi-agent control systems with coupled dynamics
- Automatic abstraction of non-linear systems using change of bases transformations
- Finite abstraction of mixed monotone systems with discrete and continuous inputs
- ABS: A formally correct software tool for space-efficient symbolic synthesis
- Abstractions of varying decentralization degree for reachability of coupled multiagent systems
- Discrete-State Abstractions of Nonlinear Systems Using Multi-resolution Quantizer
This page was built for publication: Computing Abstractions of Nonlinear Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347889)
