Multi-agent systems have numerous civilian, homeland security, and military applications;
however, for all these applications, communication bandwidth, sensing range, power …

Laplacian matrices play an important role in linear-consensus algorithms. This paper studies
optimal linear-consensus algorithms for multivehicle systems with single-integrator …

We consider the Hegselmann-Krause model for opinion dynamics and study the evolution of
the system under various settings. We first analyze the termination time of the synchronous …

This paper studies the leader-following finite-time consensus problem for the second-order
multi-agent networks with fixed and switched topologies. Based on the graph theory, matrix …

In this chapter we present a popular class of distributed algorithms, known as linear
consensus algorithms, which have the ability to compute the global average of local …

In this paper, we propose a decentralized and self-organizing solution framework aimed at
addressing economic dispatch (ED) analysis in a distributed scenario. In particular we will …

We study the convergence speed of distributed iterative algorithms for the consensus and
averaging problems, with emphasis on the latter. We first consider the case of a fixed …

In this paper, we consider the optimal topology for leader‐following consensus problem of
continuous‐time and discrete‐time multi‐agent systems based on linear quadratic regulator …

We describe a protocol for the average consensus problem on any fixed undirected graph
whose convergence time scales linearly in the total number nodes $ n $. The protocol is …

In this paper, we consider the problem of finding a linear iteration scheme that yields
distributed average consensus in a finite number of steps D. By modeling interactions …