文章基本信息

标题：Graph-Theoretic Optimization for Edge Consensus
本地全文：下载
作者：Mathias Hudoba de Badyn ; Dillon R. Foight ; Daniel Calderone 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2021
卷号：54
期号：9
页码：533-538
DOI：10.1016/j.ifacol.2021.06.113
语种：English
出版社：Elsevier
摘要：AbstractWe consider network structures that optimize the H2-norm of weighted, time scaled consensus networks, under a minimal representation of such consensus networks described by the edge Laplacian. We show that a greedy algorithm can be used to find the minimum-H2norm spanning tree, as well as how to choose edges to optimize the H2norm when edges are added back to a spanning tree. In the case of edge consensus with a measurement model considering all edges in the graph, we show that adding edges between slow nodes in the graph provides the smallest increase in the H2norm.
关键词：KeywordsMulti-agent systemsconsensusdistributed controlH2control