Premium
Distributed control over structured and packet‐dropping networks
Author(s) -
Jiang Shengxiang,
Voulgaris Petros G.,
Neogi Natasha
Publication year - 2007
Publication title -
international journal of robust and nonlinear control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.361
H-Index - 106
eISSN - 1099-1239
pISSN - 1049-8923
DOI - 10.1002/rnc.1284
Subject(s) - performance metric , computer science , network packet , network topology , metric (unit) , stability (learning theory) , regular polygon , transmission (telecommunications) , control (management) , square (algebra) , controller (irrigation) , distributed computing , scheme (mathematics) , topology (electrical circuits) , control theory (sociology) , mathematical optimization , computer network , mathematics , engineering , telecommunications , agronomy , operations management , mathematical analysis , geometry , management , combinatorics , machine learning , artificial intelligence , economics , biology
In this paper we consider distributed control of n dynamic agents to optimize an overall system performance metric. Due to limited communication resources, there exist structured interconnections among the agents and the interest is placed on synthesizing a suitably distributed control law to provide a given performance level. Based on a Youla–Kucera (Y–K) parameterization approach, the problem of designing a distributed controller to deliver given performance levels for different network topologies is shown to be convex in the Y–K parameter Q . Furthermore, if in addition to structured interconnections, packet drops exist in information transmission among the agents, we provide convex conditions to guarantee mean square (MS) stability and to optimize ℋ 2 system performance. The proposed method is also extended to deal with systems of triangular structure. Copyright © 2007 John Wiley & Sons, Ltd.