.png){kind=icon}
.png){kind=icon}
Return
Consensus-Based Distributed Connectivity Control in Multi-Agent Systems
.png){kind=icon}
OA
AI
DOI：10.1109/TNSE.2021.3139045.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses a distributed connectivity control problem in networked multi-agent systems. The system communication topology is controlled through the algebraic connectivity measure, the second smallest eigenvalue of the communication graph Laplacian. The algebraic connectivity is estimated locally in a decentralized manner through a trust-based consensus algorithm, in which the agents communicate the perceived quality of the communication links in the system with their set of neighbors. In the presented approach, link qualities represent the weights of the communication graph from which the adjacency matrix is estimated. The Laplacian matrix and its eigenvalues, including the algebraic connectivity, are then calculated from this local estimate of the global adjacency matrix. A method for network topology control is proposed, which creates and deletes communication links based on the Albert-Barabasi probabilistic model, depending on the estimated and referenced connectivity level. The proposed algebraic connectivity estimation and connectivity maintenance strategy have been validated both in simulation and on a physical robot swarm, demonstrating the method performance under varying initial topology of the communication graph, different multi-agent system sizes, in various deployment scenarios, and in the case of agent failure.
Keywords:
Network topology
Multi-agent systems
Costs
Resilience
Topology
Eigenvalues and eigenfunctions
Consensus algorithm
Coordination
distributed control
multi-agent systems
trust-based consensus
Journal
I
IF:
7.9
Papers:
2.5K
Citations:
10.0K