In this paper, we discuss consensus problems for networks of dynamic agents with fixed and switching topologies. We analyze three cases: 1) directed networks with fixed topology; 2) directed networks with switching topology; and 3) undirected networks with communication time-delays and fixed topology. We introduce two consensus protocols for networks with and without time-delays and provide a convergence analysis in all three cases. We establish a direct connection between the algebraic connectivity (or Fiedler eigenvalue) of the network and the performance (or negotiation speed) of a linear consensus protocol. This required the generalization of the notion of algebraic connectivity of undirected graphs to digraphs. It turns out that balanced digraphs play a key role in addressing average-consensus problems. We introduce disagreement functions for convergence analysis of consensus protocols. A disagreement function is a Lyapunov function for the disagreement network dynamics. We proposed a simple disagreement function that is a common Lyapunov function for the disagreement dynamics of a directed network with switching topology. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.

/pdf/consensus-problems-in-networks-of-agents-with-switching-25c3hqvtd8.pdf

Consensus problems in networks of agents with switching topology and time-delays

This paper provides a theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees. An overview of basic concepts of information consensus in networks and methods of convergence and performance analysis for the algorithms are provided. Our analysis framework is based on tools from matrix theory, algebraic graph theory, and control theory. We discuss the connections between consensus problems in networked dynamic systems and diverse applications including synchronization of coupled oscillators, flocking, formation control, fast consensus in small-world networks, Markov processes and gossip-based algorithms, load balancing in networks, rendezvous in space, distributed sensor fusion in sensor networks, and belief propagation. We establish direct connections between spectral and structural properties of complex networks and the speed of information diffusion of consensus algorithms. A brief introduction is provided on networked systems with nonlocal information flow that are considerably faster than distributed systems with lattice-type nearest neighbor interactions. Simulation results are presented that demonstrate the role of small-world effects on the speed of consensus algorithms and cooperative control of multivehicle formations

/pdf/consensus-and-cooperation-in-networked-multi-agent-systems-5ame7z72ny.pdf

Consensus and Cooperation in Networked Multi-Agent Systems

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.

Coverage control for mobile sensing networks

http://www.eecs.northwestern.edu/~peters/references/LocalizationTechniquesMaoAustralia.pdf

Wireless sensor network localization techniques

A survey of multi-agent formation control

In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly

/pdf/a-theory-of-network-localization-1igue19rct.pdf

A Theory of Network Localization

We provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.

/pdf/rigidity-computation-and-randomization-in-network-1q9ik92020.pdf

Rigidity, computation, and randomization in network localization

https://www.eng.yale.edu/controls/2002/rigidity.ifac.pdf

A framework for maintaining formations based on rigidity

Distance measurements are not the only geometric quantities that can be used for multi-agent formation shape control. Bearing measurements can be used in conjunction with distances. This article employs bearing rigidity for mobile formations, which was developed for robot and sensor network localisation, so that bearings can be used for shape control in mobile formations. The first part of this article examines graph theoretical models for formation network analysis and control law design that are needed to maintain the shape of a formation in two-dimensional space, while the formation moves as a cohesive whole. Bearing-based shape control for a formation of mobile agents involves the design of distributed control laws that ensure the formation moves, so that bearing constraints maintain some desired values. The second part of this article focuses on the design of a distributed control scheme for nonholonomic agents to solve the bearing-based formation shape control problem. In particular, a control law u...

Formation shape control based on bearing rigidity

Sensor and network topologies of formations of autonomous agents are considered. The aim of the paper is to suggest an approach for such topologies for formations with direction, bearing and angle information between agents in the plane and in 3-space. A number of results are translated from prior work in this field and in the study of constraints in CAD programming, in rigidity theory, in structural engineering and in discrete mathematics. Some new results are presented both for the plane and for 3-space. A number of unsolved problems are also mentioned.

/pdf/sensor-and-network-topologies-of-formations-with-direction-3pm4xhur6s.pdf

Tolga Eren

Papers

A Theory of Network Localization

Rigidity, computation, and randomization in network localization

A framework for maintaining formations based on rigidity

Formation shape control based on bearing rigidity

Sensor and network topologies of formations with direction, bearing, and angle information between agents