Identifiability Of Links And Nodes In Multi-Agent Systems Under The Agreement Protocol

2013 AMERICAN CONTROL CONFERENCE (ACC)(2013)

引用 2|浏览61
暂无评分
摘要
In this paper, the question of identifying various links and nodes in the network based on the observed agent dynamics is addressed. The focus is on a multi-agent network that evolves under the linear agreement protocol. The results help determine if various components of the network are distinguishable from each other, based on the choice of initial conditions and the observed output responses. Identifiability of links and nodes are studied separately, and in each case, the role of symmetries in the network information flow graph are analyzed. Examples are provided to elucidate the results.
更多
查看译文
关键词
symmetric matrices,protocols,multiagent systems,multi agent systems,graph theory,vectors,vehicle dynamics,robots
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要