Convergence of type-symmetric and cut-balanced consensus seeking systems
We consider continuous-time consensus seeking systems whose time-dependent
interactions are cut-balanced, in the following sense: if a group of agents influences the …
interactions are cut-balanced, in the following sense: if a group of agents influences the …
Performance evaluation of the consensus-based distributed subgradient method under random communication topologies
We investigate collaborative optimization of an objective function expressed as a sum of
local convex functions, when the agents make decisions in a distributed manner using local …
local convex functions, when the agents make decisions in a distributed manner using local …
Influence of the number of topologically interacting neighbors on swarm dynamics
Recent empirical and theoretical works on collective behaviors based on a topological
interaction are beginning to offer some explanations as for the physical reasons behind the …
interaction are beginning to offer some explanations as for the physical reasons behind the …
Stochastic consensus over noisy networks with Markovian and arbitrary switches
This paper considers stochastic consensus problems over lossy wireless networks. We first
propose a measurement model with a random link gain, additive noise, and Markovian lossy …
propose a measurement model with a random link gain, additive noise, and Markovian lossy …
Distributed parameter estimation over unreliable networks with Markovian switching topologies
Due to the existence of various uncertainties, the design of distributed estimation algorithms
with robustness and high accuracy is an urgent demand for sensor network applications …
with robustness and high accuracy is an urgent demand for sensor network applications …
Convergence results for the linear consensus problem under Markovian random graphs
This paper discusses the linear asymptotic consensus problem for a network of dynamic
agents whose communication network is modeled by a randomly switching graph. The …
agents whose communication network is modeled by a randomly switching graph. The …
Stochastic approximation for consensus: a new approach via ergodic backward products
This paper considers both synchronous and asynchronous consensus algorithms with noisy
measurements. For stochastic approximation based consensus algorithms, the existing …
measurements. For stochastic approximation based consensus algorithms, the existing …
Consensus reaching in swarms ruled by a hybrid metric-topological distance
Recent empirical observations of three-dimensional bird flocks and human crowds have
challenged the long-prevailing assumption that a metric interaction distance rules swarming …
challenged the long-prevailing assumption that a metric interaction distance rules swarming …
Scaled consensus of multi-agent systems with switching topologies and communication noises
This paper concerns with the mean square scaled consensus for multi-agent systems (MAS)
with Markovian switching topologies and communication noises. A time-homogeneous …
with Markovian switching topologies and communication noises. A time-homogeneous …
On the strengths of connectivity and robustness in general random intersection graphs
Random intersection graphs have received much attention for nearly two decades, and
currently have a wide range of applications ranging from key predistribution in wireless …
currently have a wide range of applications ranging from key predistribution in wireless …