当前位置: X-MOL 学术Automatica › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Bipartite consensus for a network of wave PDEs over a signed directed graph
Automatica ( IF 4.8 ) Pub Date : 2021-04-17 , DOI: 10.1016/j.automatica.2021.109640
Yining Chen , Zhiqiang Zuo , Yijing Wang

This paper studies the bipartite consensus problem for a network of wave PDEs. The interactions among participating individuals may be antagonistic characterized by a signed digraph. Two distributed algorithms consisting of boundary sensing of the agents’ states are proposed for the disturbance-free and disturbed cases, respectively. Then Lyapunov function is constructed to assure bipartite consensus of the agents. Moreover, the relationship between control gain and communication topology is also explicitly revealed. Using the tool from semigroup theory, the property of well-posedness of the underlying systems is guaranteed. Finally, numerical examples are given to support the proposed setup.



中文翻译:

在有向有向图上的波动PDE网络的两方共识

本文研究了波动PDE网络的两方共识问题。参与的个体之间的相互作用可以是对抗性的,其特征在于签名的有向图。针对无扰动情况和受扰动情况,分别提出了两种由代理状态边界检测组成的分布式算法。然后构造Lyapunov函数以确保代理的两方共识。此外,还明确揭示了控制增益与通信拓扑之间的关系。使用半群理论的工具,可以保证底层系统的适定性。最后,给出了数值示例来支持所提出的设置。

更新日期:2021-04-18
down
wechat
bug