https://murray.cds.caltech.edu/index.php?title=Limits_on_the_Network_Sensitivity_Function_for_Multi-Agent_Systems_on_a_Graph&feed=atom&action=historyLimits on the Network Sensitivity Function for Multi-Agent Systems on a Graph - Revision history2021-06-24T14:42:40ZRevision history for this page on the wikiMediaWiki 1.35.2https://murray.cds.caltech.edu/index.php?title=Limits_on_the_Network_Sensitivity_Function_for_Multi-Agent_Systems_on_a_Graph&diff=19780&oldid=prevMurray: htdb2wiki: creating page for 2009r_tm09-cds.html2016-05-15T06:16:26Z<p>htdb2wiki: creating page for 2009r_tm09-cds.html</p>
<p><b>New page</b></p><div>{{HTDB paper<br />
| authors = Stefania Tonetti, Richard M Murray<br />
| title = Limits on the Network Sensitivity Function for Multi-Agent Systems on a Graph<br />
| source = CDS Technical Report 2009.001<br />
| year = 2009<br />
| type = Technical Report<br />
| funding = <br />
| url = http://resolver.caltech.edu/CaltechCDSTR:2009.001<br />
| 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.<br />
| flags = <br />
| tag = tm09-cds<br />
| id = 2009r<br />
}}</div>Murray