arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.12178cs.MAmath.COmath.OC
收藏

分层循环追逐:包含拉普拉斯谱的代数曲线

Hierarchical Cyclic Pursuit: Algebraic Curves Containing the Laplacian Spectra

Sergei E. Parsegov, Pavel Yu. Chebotarev, Pavel S. Shcherbakov, Federico M. Ibáñez

AI总结:

本文将经典循环追逐拓扑推广为分层有向环结构,通过推导拉普拉斯矩阵特征多项式并分析其根所在代数曲线的闭式方程,结合频域判据分析变规模多智能体网络的一致性可行性。

摘要:

本文研究具有规则有向环结构网络中的多智能体通信问题。这类网络可视为经典循环追逐拓扑的分层扩展。我们证明相应拉普拉斯矩阵的谱可以在复平面上精确定位。进一步,我们推导出此类矩阵特征多项式的一般形式,分析其根所属的代数曲线,并提出一种获得这些曲线闭式方程的方法。结合高阶SISO线性智能体的频域一致性判据,这些曲线使人们能够分析智能体数量变化的网络中一致性的可行性。

英文摘要:

The paper addresses the problem of multi-agent communication in networks with regular directed ring structure. These can be viewed as hierarchical extensions of the classical cyclic pursuit topology. We show that the spectra of the corresponding Laplacian matrices allow exact localization on the complex plane. Furthermore, we derive a general form of the characteristic polynomial of such matrices, analyze the algebraic curves its roots belong to, and propose a way to obtain their closed-form equations. In combination with frequency domain consensus criteria for high-order SISO linear agents, these curves enable one to analyze the feasibility of consensus in networks with varying number of agents.

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

↑