Dimos V. Dimarogonas

Event-based broadcasting for multi-agent average consensus

A novel control strategy for multi-agent coordination with event-based broadcasting is presented. In particular, each agent decides itself when to transmit its current state to its neighbors and the local control laws are based on these sampled state measurements. Three scenarios are analyzed: Networks of single-integrator agents with and without communication delays, and networks of double-integrator agents. The novel event-based scheduling strategy bounds each agents measurement error by a time-dependent threshold. For each scenario it is shown that the proposed control strategy guarantees either asymptotic convergence to average consensus or convergence to a ball centered at the average consensus. Moreover, it is shown that the inter-event intervals are lower-bounded by a positive constant. Numerical simulations show the effectiveness of the novel event-based control strategy and how it compares to time-scheduled control.

On the Rendezvous Problem for Multiple Nonholonomic Agents

In this note, a decentralized feedback control strategy that drives a system of multiple nonholonomic unicycles to a rendezvous point in terms of both position and orientation is introduced. The proposed nonholonomic control law is discontinuous and time-invariant and using tools from nonsmooth Lyapunov theory and graph theory the stability of the overall system is examined. Similarly to the linear case, the convergence of the multi-agent system relies on the connectivity of the communication graph that represents the inter-agent communication topology. The control law is first defined in order to guarantee connectivity maintenance for an initially connected communication graph. Moreover, the cases of static and dynamic communication topologies are treated as corollaries of the proposed framework

Leader–follower cooperative attitude control of multiple rigid bodies

In this paper we extend our previous results on coordinated control of rotating rigid bodies to the case of teams with heterogenous agents. We assume that only a certain subgroup of the agents (the leaders) are vested with the main control objective, that is, maintain constant relative orientation amongst themselves. The rest of the team must meet relaxed control specifications, namely maintain their respective orientations within certain limits dictated by the orientation of the leaders. The proposed control laws respect the limited information each rigid body has with respect to the rest of its peers (leaders or followers) as well as with the rest of the team. Each rigid body is equipped with a control law that utilizes the Laplacian matrix of the associated communication graph, which encodes the communication links between the team members. Similarly to the linear case, the convergence of the multi-agent system relies on the connectivity of the communication graph.

Event-triggered control for multi-agent systems

Event-driven strategies for multi-agent systems are motivated by the future use of embedded microprocessors with limited resources that will gather information and actuate the individual agent controller updates. The control actuation updates considered in this paper are event-driven, depending on the ratio of a certain measurement error with respect to the norm of a function of the state, and are applied to a first order agreement problem. A centralized formulation of the problem is considered first and then the results are extended to the decentralized counterpart, in which agents require knowledge only of the states of their neighbors for the controller implementation.

Short survey: Dual arm manipulation-A survey

Recent advances in both anthropomorphic robots and bimanual industrial manipulators had led to an increased interest in the specific problems pertaining to dual arm manipulation. For the future, we foresee robots performing human-like tasks in both domestic and industrial settings. It is therefore natural to study specifics of dual arm manipulation in humans and methods for using the resulting knowledge in robot control. The related scientific problems range from low-level control to high level task planning and execution. This review aims to summarize the current state of the art from the heterogenous range of fields that study the different aspects of these problems specifically in dual arm manipulation.

Brief paper: Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.

Connectedness Preserving Distributed Swarm Aggregation for Multiple Kinematic Robots

A distributed swarm aggregation algorithm is developed for a team of multiple kinematic agents. Specifically, each agent is assigned a control law, which is the sum of two elements: a repulsive potential field, which is responsible for the collision avoidance objective, and an attractive potential field, which forces the agents to converge to a configuration where they are close to each other. Furthermore, the attractive potential field forces the agents that are initially located within the sensing radius of an agent to remain within this area for all time. In this way, the connectivity properties of the initially formed communication graph are rendered invariant for the trajectories of the closed-loop system. It is shown that under the proposed control law, agents converge to a configuration where each agent is located at a bounded distance from each of its neighbors. The results are also extended to the case of nonholonomic kinematic unicycle-type agents and to the case of dynamic edge addition. In the latter case, we derive a smaller bound in the swarm size than in the static case.

Event-triggered control for discrete-time systems

In this paper, event-triggered strategies for control of discrete-time systems are proposed and analyzed. Similarly to the continuous-time case, the plant is assumed input-to-state stable with respect to measurement errors and the control law is updated once a triggering condition involving the norm of a measurement error is violated. The results are also extended to a self-triggered formulation, where the next control updates are decided at the previous ones, thus relaxing the need for continuous monitoring of the measurement error. The overall framework is then used in a novel Model Predictive Control approach. The results are illustrated through simulated examples.

Global consensus for discrete-time multi-agent systems with input saturation constraints

In this paper, we consider the global consensus problem for discrete-time multi-agent systems with input saturation constraints under fixed undirected topologies. We first give necessary conditions for achieving global consensus via a distributed protocol based on relative state measurements of the agent itself and its neighboring agents. We then focus on two special cases, where the agent model is either neutrally stable or a double integrator. For the neutrally stable case, any linear protocol of a particular form, which solves the consensus problem for the case without input saturation constraints, also solves the global consensus problem for the case with input saturation constraints. For the double integrator case, we show that a subset of linear protocols, which solve the consensus problem for the case without saturation constraints, also solve the global consensus problem for the case with input saturation constraints. The results are illustrated by numerical simulations.

Distributed Control of Networked Dynamical Systems: Static Feedback, Integral Action and Consensus

This paper analyzes distributed control protocols for first- and second-order networked dynamical systems. We propose a class of nonlinear consensus controllers where the input of each agent can be written as a product of a nonlinear gain, and a sum of nonlinear interaction functions. By using integral Lyapunov functions, we prove the stability of the proposed control protocols, and explicitly characterize the equilibrium set. We also propose a distributed proportional-integral (PI) controller for networked dynamical systems. The PI controllers successfully attenuate constant disturbances in the network. We prove that agents with single-integrator dynamics are stable for any integral gain, and give an explicit tight upper bound on the integral gain for when the system is stable for agents with double-integrator dynamics. Throughout the paper we highlight some possible applications of the proposed controllers by realistic simulations of autonomous satellites, power systems and building temperature control.