title: Consensus of Multiagent Systems With Distance-Dependent Communication Networks.
abstract: In this paper, we study the consensus problem of discrete-time and continuous-time multiagent systems with distance-dependent communication networks, respectively. The communication weight between any two agents is assumed to be a nonincreasing function of their distance. First, we consider the networks with fixed connectivity. In this case, the interaction between adjacent agents always exists but the influence could possibly become negligible if the distance is long enough. We show that consensus can be reached under arbitrary initial states if the decay rate of the communication weight is less than a given bound. Second, we study the networks with distance-dependent connectivity. It is assumed that any two agents interact with each other if and only if their distance does not exceed a fixed range. With the validity of some conditions related to the property of the initial communication graph, we prove that consensus can be achieved asymptotically. Third, we present some applications of the main results to opinion consensus problems and formation control problems. Finally, several simulation examples are presented to illustrate the effectiveness of the theoretical findings.In this paper, we study the consensus problem of discrete-time and continuous-time multiagent systems with distance-dependent communication networks, respectively. The communication weight between any two agents is assumed to be a nonincreasing function of their distance. First, we consider the networks with fixed connectivity. In this case, the interaction between adjacent agents always exists but the influence could possibly become negligible if the distance is long enough. We show that consensus can be reached under arbitrary initial states if the decay rate of the communication weight is less than a given bound. Second, we study the networks with distance-dependent connectivity. It is assumed that any two agents interact with each other if and only if their distance does not exceed a fixed range. With the validity of some conditions related to the property of the initial communication graph, we prove that consensus can be achieved asymptotically. Third, we present some applications of the main results to opinion consensus problems and formation control problems. Finally, several simulation examples are presented to illustrate the effectiveness of the theoretical findings.
authors.affiliation: Center for Complex Systems, School of Mechano-Electronic Engineering, Xidian University, Xi'an, China.
authors.forename: Gangshan
authors.initials: G
authors.lastname: Jing
authors.affiliation: Center for Complex Systems, School of Mechano-Electronic Engineering, Xidian University, Xi'an, China.
authors.forename: Yuanshi
authors.initials: Y
authors.lastname: Zheng
authors.affiliation: Center for Systems and Control, College of Engineering, Peking University, Beijing, China.
authors.forename: Long
authors.initials: L
authors.lastname: Wang
keywords: Communication networks; Laplace equations; Multi-agent systems; Robot sensing systems; Switches; Symmetric matrices