2,367 research outputs found
Formal Controller Synthesis from Specifications Given by Discrete-Time Hybrid Automata
This paper deals with formal controller synthesis for discrete-time dynamical systems. For a specification under the form of a discrete-time hybrid automaton, we aim at synthesizing controllers such that the trajectories of the closed-loop system are also trajectories of the hybrid automaton. We first show that the existence of an alternating simulation relation from the specification to the open-loop system is a necessary and sufficient condition for the existence of such controllers. Then, we propose an approach based on the use of symbolic (i.e. finite-state) abstractions of both the system and the specification. Effective computations are discussed for systems that are monotone and for specifications given by piecewise affine hybrid automata. We extend our approach to handle specifications with additional safety or reachability requirements. Finally, we illustrate our approach with examples from autonomous vehicle control
From Small-Gain Theory to Compositional Construction of Barrier Certificates for Large-Scale Stochastic Systems
This paper is concerned with a compositional approach for the construction of
control barrier certificates for large-scale interconnected stochastic systems
while synthesizing hybrid controllers against high-level logic properties. Our
proposed methodology involves decomposition of interconnected systems into
smaller subsystems and leverages the notion of control sub-barrier certificates
of subsystems, enabling one to construct control barrier certificates of
interconnected systems by employing some -type small-gain conditions. The
main goal is to synthesize hybrid controllers enforcing complex logic
properties including the ones represented by the accepting language of
deterministic finite automata (DFA), while providing probabilistic guarantees
on the satisfaction of given specifications in bounded-time horizons. To do so,
we propose a systematic approach to first decompose high-level specifications
into simple reachability tasks by utilizing automata corresponding to the
complement of specifications. We then construct control sub-barrier
certificates and synthesize local controllers for those simpler tasks and
combine them to obtain a hybrid controller that ensures satisfaction of the
complex specification with some lower-bound on the probability of satisfaction.
To compute control sub-barrier certificates and corresponding local
controllers, we provide two systematic approaches based on sum-of-squares (SOS)
optimization program and counter-example guided inductive synthesis (CEGIS)
framework. We finally apply our proposed techniques to two physical case
studies
Synthesis of Switching Protocols from Temporal Logic Specifications
We propose formal means for synthesizing switching protocols that determine the sequence in which the modes of a switched system are activated to satisfy certain high-level specifications in linear temporal logic. The synthesized protocols are robust against exogenous disturbances on the continuous dynamics. Two types of finite transition systems, namely under- and over-approximations, that abstract the behavior of the underlying continuous dynamics are defined. In particular, we show that the discrete synthesis problem for an under-approximation can be formulated as a model checking problem, whereas that for an over-approximation can be transformed into a two-player game. Both of these formulations are amenable to efficient, off-the-shelf software tools. By construction, existence of a discrete switching strategy for the discrete synthesis problem guarantees the existence of a continuous switching protocol for the continuous synthesis problem, which can be implemented at the continuous level to ensure the correctness of the nonlinear switched system. Moreover, the proposed framework can be straightforwardly extended to accommodate specifications that require reacting to possibly adversarial external events. Finally, these results are illustrated using three examples from different application domains
Low-Complexity Quantized Switching Controllers using Approximate Bisimulation
In this paper, we consider the problem of synthesizing low-complexity
controllers for incrementally stable switched systems. For that purpose, we
establish a new approximation result for the computation of symbolic models
that are approximately bisimilar to a given switched system. The main advantage
over existing results is that it allows us to design naturally quantized
switching controllers for safety or reachability specifications; these can be
pre-computed offline and therefore the online execution time is reduced. Then,
we present a technique to reduce the memory needed to store the control law by
borrowing ideas from algebraic decision diagrams for compact function
representation and by exploiting the non-determinism of the synthesized
controllers. We show the merits of our approach by applying it to a simple
model of temperature regulation in a building
Lazy Abstraction-Based Controller Synthesis
We present lazy abstraction-based controller synthesis (ABCS) for
continuous-time nonlinear dynamical systems against reach-avoid and safety
specifications. State-of-the-art multi-layered ABCS pre-computes multiple
finite-state abstractions of varying granularity and applies reactive synthesis
to the coarsest abstraction whenever feasible, but adaptively considers finer
abstractions when necessary. Lazy ABCS improves this technique by constructing
abstractions on demand. Our insight is that the abstract transition relation
only needs to be locally computed for a small set of frontier states at the
precision currently required by the synthesis algorithm. We show that lazy ABCS
can significantly outperform previous multi-layered ABCS algorithms: on
standard benchmarks, lazy ABCS is more than 4 times faster
- …