TY - JOUR
T1 - Constrained Consensus in State-Dependent Directed Multiagent Networks
AU - Shang, Yilun
PY - 2022/11/1
Y1 - 2022/11/1
N2 - In this paper, constrained consensus of a group of continuous-time dynamical agents over state-dependent networks is investigated. The communication network, modulated by an asymmetric distance between agents, accommodates general directed information flows. Each agent proposes a comfortable range in a distributed manner, where they are inclined to agree on the final equilibrium state. Based on Lyapunov stability theory and robustness analysis, different conditions have been obtained to guarantee convergence within the common comfortable range when the network connectivity is fixed and time-varying. No global information is required in the proposed nonlinear control protocols. Furthermore, an opinion dynamics model has been introduced incorporating both social observer effect and bounded confidence phenomenon in the same state-dependent framework. Relaxed consensus conditions have been derived under certain symmetric assumptions. Finally, numerical examples have been presented to verify the effectiveness of the theoretical results.
AB - In this paper, constrained consensus of a group of continuous-time dynamical agents over state-dependent networks is investigated. The communication network, modulated by an asymmetric distance between agents, accommodates general directed information flows. Each agent proposes a comfortable range in a distributed manner, where they are inclined to agree on the final equilibrium state. Based on Lyapunov stability theory and robustness analysis, different conditions have been obtained to guarantee convergence within the common comfortable range when the network connectivity is fixed and time-varying. No global information is required in the proposed nonlinear control protocols. Furthermore, an opinion dynamics model has been introduced incorporating both social observer effect and bounded confidence phenomenon in the same state-dependent framework. Relaxed consensus conditions have been derived under certain symmetric assumptions. Finally, numerical examples have been presented to verify the effectiveness of the theoretical results.
KW - Communication networks
KW - Consensus
KW - Gravity
KW - Network topology
KW - Robustness
KW - Switches
KW - Task analysis
KW - Topology
KW - asymmetric distance
KW - constraint
KW - directed network
KW - state-dependent communication
UR - http://www.scopus.com/inward/record.url?scp=85137584866&partnerID=8YFLogxK
U2 - 10.1109/tnse.2022.3201187
DO - 10.1109/tnse.2022.3201187
M3 - Article
VL - 9
SP - 4416
EP - 4425
JO - IEEE Transactions on Network Science and Engineering
JF - IEEE Transactions on Network Science and Engineering
SN - 2327-4697
IS - 6
ER -