arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.02465math.OC
收藏

局部高阶共识破坏大规模网络稳定

Localized high-order consensus destabilizes large-scale networks

Emma Tegling, Bassam Bamieh, Henrik Sandberg

摘要:

我们研究了网络中的分布式共识问题,其中本地代理具有高阶($n\ge 3$)积分动态,并且所有反馈都是本地化的,每个代理都有一个有界的邻居。我们证明,没有共识算法的基础上,相邻代理的状态之间的相对差异,然后可以实现任何规模的网络中的共识。也就是说,虽然给定的算法可以允许一个小网络收敛到共识,但如果代理被添加到网络中,使其增长超过某个有限的大小,则相同的算法将导致不稳定。这适用于代数连通性的网络图类,即最小的非零拉普拉斯特征值,在网络大小上向零减小。例如,这适用于所有的可平面图。我们的证明,这依赖于Routh-Hurwitz标准的复值多项式,适用于有向图与正常的图拉普拉斯算子。我们调查类图出现这个问题,并讨论领导者-追随者的共识,不稳定性将出现在任何增长,无向网络,只要反馈是本地化的。

英文摘要:

We study the problem of distributed consensus in networks where the local agents have high-order ($n\ge 3$) integrator dynamics, and where all feedback is localized in that each agent has a bounded number of neighbors. We prove that no consensus algorithm based on relative differences between states of neighboring agents can then achieve consensus in networks of any size. That is, while a given algorithm may allow a small network to converge to consensus, the same algorithm will lead to instability if agents are added to the network so that it grows beyond a certain finite size. This holds in classes of network graphs whose algebraic connectivity, that is, the smallest non-zero Laplacian eigenvalue, is decreasing towards zero in network size. This applies, for example, to all planar graphs. Our proof, which relies on Routh-Hurwitz criteria for complex-valued polynomials, holds true for directed graphs with normal graph Laplacians. We survey classes of graphs where this issue arises, and also discuss leader-follower consensus, where instability will arise in any growing, undirected network as long as the feedback is localized.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑