Limits on the Network Sensitivity Function for Multi-Agent Systems on a Graph

Tonetti, Stefania and Murray, Richard M. (2009) Limits on the Network Sensitivity Function for Multi-Agent Systems on a Graph. Technical Report. California Institute of Technology, Pasadena, CA. [CaltechCDSTR:2009.001]

Full text available as:

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

Abstract

This report explores the tradeoffs and limits of performance in feedback control of interconnected multi-agent systems, focused on the network sensitivity functions. We consider the interaction topology described by a directed graph and we prove that the sensitivity transfer functions between every pair of agents, arbitrarily connected, can be derived using a version of the Mason's Direct Rule. Explicit forms for special types of graphs are presented. An analysis of the role of cycles points out that these structures influence and limit considerably the performance of the system. The more the cycles are equally distributed among the formation, the better performance the system can achieve, but they are always worse than the single agent case. We also prove the networked version of Bode's integral formula, showing that it still holds for multi-agent systems.

EPrint Type:	Monograph (Technical Report)
Additional Information:	The authors would like to thank Håkan Terelius and Anna Maria Cherubini for their feedback on the material in this paper.
Subjects:	All Records
ID Code:	169
Deposited By:	Richard M. Murray
Deposited On:	03 November 2009
Unique Identifier:	CaltechCDSTR:2009.001
Official Persistent URL:	http://resolver.caltech.edu/CaltechCDSTR:2009.001
Usage Policy:	You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.

Archive Staff Only: edit this record