Search

Many safety-critical systems, such as autonomous vehicles and service robots, must achieve high-level task specifications with performance guarantees. Much recent progress toward this goal has been made through an automatic controller synthesis from temporal logic specifications. Existing approaches, however, have been limited to relatively short and simple specifications. Furthermore, existing methods either consider some prior discretization of the state space, deal only with a convex fragment of temporal logic, or are not provably complete. We propose a scalable, provably complete algorithm that synthesizes continuous trajectories to satisfy nonconvex temporal logic over reals (RTL) specifications. We separate discrete task planning and continuous motion planning on-the-fly and harness highly efficient Boolean satisfiability and linear programming solvers to find dynamically feasible trajectories that satisfy nonconvex RTL specifications for high-dimensional systems. The proposed design algorithms are proven sound and complete, and simulation results demonstrate our approach's scalability. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of synchronizing a group of identical linear time-invariant agents that exchange information through a communication network. The agents may only broadcast information at discrete-time instants and the decision to execute a broadcast is based on an event-triggered communication protocol. We prove that with the proposed control architecture the state of each agent converges to and remains in a neighborhood of a desired reference signal and the closed-loop system does not exhibit Zeno solutions. A self-triggered implementation of the proposed event-triggered communication protocol is also derived. [ABSTRACT FROM AUTHOR]

The technical note presents the design of a reference governor that manages directly the state and input references for constrained output regulation problems. In particular, for the class of so-called weakly input redundant linear systems, the proposed method leads to a taxonomy in terms of non-intrusive and intrusive reference governors, on the basis of the effect of reference manipulation on the tracking error. Non-intrusive references constitute a degree of freedom that one can freely select to meet constraint requirements; intrusive references are also assignable during transient, but shall be forced to vanish in steady state in order to achieve exact regulation. A simulation study illustrates the features of the proposed approach in support of the theoretical findings. [ABSTRACT FROM AUTHOR]

In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interior, the proposed algorithm iteratively constructs the bisimulation quotient for the region bounded by any larger sublevel set. We show how this bisimulation quotient can be used for synthesis of switching laws and verification with respect to specifications given as syntactically co-safe Linear Temporal Logic formulae over the observed polytopic subsets. [ABSTRACT FROM AUTHOR]