There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

We consider the problem of cooperation among a collection of vehicles performing a shared task using intervehicle communication to coordinate their actions. Tools from algebraic graph theory prove useful in modeling the communication network and relating its topology to formation stability. We prove a Nyquist criterion that uses the eigenvalues of the graph Laplacian matrix to determine the effect of the communication topology on formation stability. We also propose a method for decentralized information exchange between vehicles. This approach realizes a dynamical system that supplies each vehicle with a common reference to be used for cooperative motion. We prove a separation principle that decomposes formation stability into two components: Stability of this is achieved information flow for the given graph and stability of an individual vehicle for the given controller. The information flow can thus be rendered highly robust to changes in the graph, enabling tight formation control despite limitations in intervehicle communication capability.

/pdf/information-flow-and-cooperative-control-of-vehicle-4ws61wioze.pdf

Information flow and cooperative control of vehicle formations

In this note, we revisit the problem of scheduling stabilizing control tasks on embedded processors. We start from the paradigm that a real-time scheduler could be regarded as a feedback controller that decides which task is executed at any given instant. This controller has for objective guaranteeing that (control unrelated) software tasks meet their deadlines and that stabilizing control tasks asymptotically stabilize the plant. We investigate a simple event-triggered scheduler based on this feedback paradigm and show how it leads to guaranteed performance thus relaxing the more traditional periodic execution requirements.

/pdf/event-triggered-real-time-scheduling-of-stabilizing-control-t1gebqsndp.pdf

Event-Triggered Real-Time Scheduling of Stabilizing Control Tasks

This paper describes decentralized control laws for the coordination of multiple vehicles performing spatially distributed tasks. The control laws are based on a gradient descent scheme applied to a class of decentralized utility functions that encode optimal coverage and sensing policies. These utility functions are studied in geographical optimization problems and they arise naturally in vector quantization and in sensor allocation tasks. The approach exploits the computational geometry of spatial structures such as Voronoi diagrams.

/pdf/coverage-control-for-mobile-sensing-networks-3gs75qafnm.pdf

Coverage control for mobile sensing networks

This paper presents control and coordination algorithms for groups of vehicles. The focus is on autonomous vehicle networks performing distributed sensing tasks where each vehicle plays the role of a mobile tunable sensor. The paper proposes gradient descent algorithms for a class of utility functions which encode optimal coverage and sensing policies. The resulting closed-loop behavior is adaptive, distributed, asynchronous, and verifiably correct.

This paper presents an approach to the control of continuous systems through the use of symbolic models describing the system behavior only at a finite number of points in the state space. These symbolic models can be seen as abstract representations of the continuous dynamics enabling the use of algorithmic controller design methods. We identify a class of linear control systems for which the loss of information incurred by working with symbolic sub-systems can be compensated by feedback. We also show how to transform symbolic controllers designed for a symbolic sub-system into controllers for the original system. The resulting controllers combine symbolic controller dynamics with continuous feedback control laws and can thus be seen as hybrid systems. Furthermore, if the symbolic controller already accounts for software/hardware requirements, the hybrid controller is guaranteed to enforce the desired specifications by construction thereby reducing the need for formal verification.

/pdf/symbolic-sub-systems-and-symbolic-control-of-linear-systems-4hx6tu9c5l.pdf

Symbolic sub-systems and symbolic control of linear systems

Secure state-reconstruction is the problem of reconstructing the state of a linear time-invariant system from sensor measurements that have been corrupted by an adversary. Whereas most work focuses on attacks on sensors, we consider the more challenging case where attacks occur on sensors as well as on nodes and links of a network that transports sensor measurements to a receiver. In this letter we provide necessary and sufficient conditions for the secure state-reconstruction problem to be solvable in the presence of attacks on sensors and on the network.

Secure State-Reconstruction Over Networks Subject to Attacks

In this paper we propose an approach to control design of nonlinear time-delay systems, which is based on the construction of symbolic models, where each symbolic state and each symbolic label correspond to an aggregate of continuous states and to an aggregate of input signals in the original system. The use of symbolic models offers a systematic methodology for control design in which constraints coming from software and hardware, interacting with the physical world, can be integrated. The main contribution of this paper is in showing that incrementally input-to-state stable time-delay systems do admit symbolic models that are approximately bisimilar to the original system, with a precision that can be rendered as small as desired. An algorithm is also presented which computes the proposed symbolic models. When the state and input spaces of time-delay systems are bounded the proposed algorithm is shown to terminate in a finite number of steps.

A symbolic model approach to the digital control of nonlinear time-delay systems

The aim of this work is to address issues where formal specifications cannot be realized on a given dynamical system subjected to a changing environment. Such failures occur whenever the dynamics of the system restrict the robot in such a way that the environment may prevent the robot from progressing safely to its goals. We provide a framework that automatically synthesizes revisions to such specifications that restrict the assumed behaviors of the environment and the behaviors of the system. We provide a means for explaining such modifications to the user in a concise, easy-to-understand manner. Integral to the framework is a new algorithm for synthesizing controllers for reactive specifications that include a discrete representation of the robot's dynamics. The new approach is demonstrated with a complex task implemented using a unicycle model.

Dynamics-Based Reactive Synthesis and Automated Revisions for High-Level Robot Control

Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growing interest in the use of symbolic models as a tool for analysis and synthesis of complex systems. In fact, symbolic models enable the use of well known algorithms in the context of supervisory control and algorithmic game theory, for controller synthesis. Since the 1990s many researchers faced the problem of identifying classes of dynamical and control systems that admit symbolic models. In this paper we make further progress along this research line by focusing on control systems affected by disturbances. Our main contribution is to show that incrementally globally asymptotically stable nonlinear control systems with disturbances admit symbolic models. When specializing these results to linear systems, we show that these symbolic models can be easily constructed.

Paulo Tabuada

Papers

Symbolic sub-systems and symbolic control of linear systems

Secure State-Reconstruction Over Networks Subject to Attacks

A symbolic model approach to the digital control of nonlinear time-delay systems

Dynamics-Based Reactive Synthesis and Automated Revisions for High-Level Robot Control

Symbolic models for nonlinear control systems affected by disturbances