Browse wiki

From MurrayWiki
Jump to: navigation, search
Limits on the Network Sensitivity Function for Multi-Agent Systems on a Graph
Abstract This report explores the tradeoffs and lim …
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.
at it still holds for multi-agent systems.  +
Authors Stefania Tonetti, Richard M Murray  +
ID 2009r  +
Source CDS Technical Report 2009.001  +
Tag tm09-cds  +
Title Limits on the Network Sensitivity Function for Multi-Agent Systems on a Graph +
Type Technical Report  +
Categories Papers
Modification date
This property is a special property in this wiki.
15 May 2016 06:16:26  +
URL
This property is a special property in this wiki.
http://resolver.caltech.edu/CaltechCDSTR:2009.001  +
hide properties that link here 
Limits on the Network Sensitivity Function for Multi-Agent Systems on a Graph + Title
 

 

Enter the name of the page to start browsing from.