https://murray.cds.caltech.edu/index.php?action=history&feed=atom&title=Consensus_Protocols_for_Networks_of_Dynamic_Agents 2026-07-03T05:44:43Z Revision history for this page on the wiki MediaWiki 1.44.2 https://murray.cds.caltech.edu/index.php?title=Consensus_Protocols_for_Networks_of_Dynamic_Agents&diff=19938&oldid=prev 2016-05-15T06:18:54Z

<p>htdb2wiki: creating page for 2002o_om03-acc.html</p> <p><b>New page</b></p><div>{{HTDB paper<br /> | authors = Reza Olfati-Saber and Richard M. Murray<br /> | title = Consensus Protocols for Networks of Dynamic Agents<br /> | source = 2003 American Control Conference<br /> | year = 2002<br /> | type = Conference <br /> Paper<br /> | funding = AFOSR/MURI<br /> | url = http://www.cds.caltech.edu/~murray/preprints/om03-acc.pdf<br /> | abstract = <br /> In this paper, we introduce a consensus protocol for a network of dynamic <br /> agents that allows the agents to reach <br /> a decision in a distributed and cooperative <br /> fashion. We consider both linear and nonlinear protocols as well as <br /> the characteristic function of the communication links in the network. <br /> This includes links with delay and (possible) distortion/filtering effects. <br /> It turns out that for a number of protocols, the convergence properties <br /> and the decision-value obtained via this protocol is strongly related <br /> to connectivity and algebraic graph theoretic properties of the information <br /> flow in the network of decision-making agents. Standard <br /> tools from multivariable control and linear control theory such as Nyquist <br /> plots appear naturally for convergence analysis of the obtained linear <br /> protocols. For the analysis of the nonlinear protocols, certain <br /> disagreement costs are constructed that are minimized by the consensus <br /> protocols in a distributed way. Simulation results are provided for attitude <br /> alignment of a group of 20 dynamic agents. <br /> <br /> | flags = <br /> | tag = om03-acc<br /> | id = 2002o<br /> }}</div>

Murray