4.5 Article

H az control of networked multi-agent systems

期刊

JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
卷 22, 期 1, 页码 35-48

出版社

SPRINGER HEIDELBERG
DOI: 10.1007/s11424-009-9145-y

关键词

Coordination control; graph theory; H-infinity control; linear matrix inequality (LMI); pinning control

资金

  1. Natural Science Foundation of China [10832006, 60674093]

向作者/读者索取更多资源

This paper concerns the disturbance rejection problem arising in the coordination control of a group of autonomous agents subject to external disturbances. The agent network is said to possess a desired level of disturbance rejection, if the H (az) norm of its transfer function matrix from the disturbance to the controlled output is satisfactorily small. Undirected graph is used to represent the information flow topology among agents. It is shown that the disturbance rejection problem of an agent network can be solved by analyzing the H (az) control problem of a set of independent systems whose dimensions are equal to that of a single node. An interesting result is that the disturbance rejection ability of the whole agent network coupled via feedback of merely relative measurements between agents will never be better than that of an isolated agent. To improve this, local feedback injections are applied to a small fraction of the agents in the network. Some criteria for possible performance improvement are derived in terms of linear matrix inequalities. Finally, extensions to the case when communication time delays exist are also discussed.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据