arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.13628eess.SYcs.SY
收藏

开放多智能体系统中的拓扑估计

Topology Estimation for Open Multi-Agent Systems

KTH Royal Institute of Technology(皇家理工学院)

Nana Wang, Pelin Sekercioglu, Dimos V. Dimarogonas

AI总结:

针对动态节点集和快速切换交互的开放多智能体系统,提出基于投影的不相似性度量方法,通过局部最小二乘算子的一致性性质实现鲁棒模式聚类,从而准确估计拓扑结构。

摘要:

我们解决了开放多智能体系统(OMAS)中交互拓扑识别的问题,其中动态节点集和快速切换交互导致短驻留时间区间,使得传统分段估计和聚类方法不可靠。为此,我们提出了一种基于投影的不相似性度量,源自局部最小二乘算子的一致性性质,实现鲁棒模式聚类。在每个聚类中聚合区间可获得准确的拓扑估计。所提框架为快速切换环境下OMAS交互拓扑重建提供系统性解决方案。最后,我们通过数值模拟验证了理论结果。

英文摘要:

We address the problem of interaction topology identification in open multi-agent systems (OMAS) with dynamic node sets and fast switching interactions. In such systems, new agents join and interactions change rapidly, resulting in intervals with short dwell time and rendering conventional segment-wise estimation and clustering methods unreliable. To overcome this, we propose a projection-based dissimilarity measure derived from a consistency property of local least-squares operators, enabling robust mode clustering. Aggregating intervals within each cluster yields accurate topology estimates. The proposed framework offers a systematic solution for reconstructing the interaction topology of OMAS subject to fast switching. Finally, we illustrate our theoretical results via numerical simulations.

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

↑