This self-contained introduction to the distributed control of robotic networks offers a
distinctive blend of computer science and control theory. The book presents a broad set of …

A new decentralized approach for solving the economic dispatch problem is presented in
this paper. The proposed approach consists of either two or three stages. In the first stage, a …

This letter addresses the problem of designing the transition probabilities of a finite Markov
chain (the policy) in order to minimize the expected cost for reaching a destination node from …

Consensus algorithms have been studied in the field of distributed computing for decades.
Recently consensus algorithms have attracted renewed attention because they can be …

This work introduces a new family of link-based dissimilarity measures between nodes of a
weighted directed graph. This measure, called the randomized shortest-path (RSP) …

In this article, we propose two distributed control protocols for discrete-time multiagent
systems, which solve the dynamic consensus problem on the max value. In this problem …

We consider the problem of combining belief functions in a situation where pieces of
evidence are held by agents at the node of a communication network, and each agent can …

The Fiedler vector of a graph is the eigenvector corresponding to the smallest non-trivial
eigenvalue of the graph's Laplacian matrix. The entries of the Fiedler vector are known to …

In-depth understanding of the spectral properties of grounded Laplacian matrices is critical
for the analysis of convergence speeds of dynamical processes over complex networks …

In several multi agent control problems, the convergence properties and speed of the system
depend on the algebraic connectivity of the graph. We discuss a particular event-triggered …