<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://murray.cds.caltech.edu/index.php?action=history&amp;feed=atom&amp;title=Dynamic_Consensus_for_Mobile_Networks</id>
	<title>Dynamic Consensus for Mobile Networks - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://murray.cds.caltech.edu/index.php?action=history&amp;feed=atom&amp;title=Dynamic_Consensus_for_Mobile_Networks"/>
	<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Dynamic_Consensus_for_Mobile_Networks&amp;action=history"/>
	<updated>2026-06-29T04:06:40Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.2</generator>
	<entry>
		<id>https://murray.cds.caltech.edu/index.php?title=Dynamic_Consensus_for_Mobile_Networks&amp;diff=19875&amp;oldid=prev</id>
		<title>Murray: htdb2wiki: creating page for 2005f_som05-ifac.html</title>
		<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Dynamic_Consensus_for_Mobile_Networks&amp;diff=19875&amp;oldid=prev"/>
		<updated>2016-05-15T06:17:58Z</updated>

		<summary type="html">&lt;p&gt;htdb2wiki: creating page for 2005f_som05-ifac.html&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{HTDB paper&lt;br /&gt;
| authors = Demetri P. Spanos, Reza Olfati-Saber, Richard M. Murray&lt;br /&gt;
| title = Dynamic Consensus for Mobile Networks&lt;br /&gt;
| source = 2005 IFAC World Congress&lt;br /&gt;
| year = 2005&lt;br /&gt;
| type = Conference Paper&lt;br /&gt;
| funding = AFOSR/info2&lt;br /&gt;
| url = http://www.cds.caltech.edu/~murray/preprints/som05-ifac.pdf&lt;br /&gt;
| abstract = &lt;br /&gt;
This work examines several dynamical aspects of average consensus&lt;br /&gt;
in mobile networks. The results herein allow consensus on general&lt;br /&gt;
time-varying signals, and allow tracking analysis using standard&lt;br /&gt;
frequency-domain techniques. Further, the frequency-domain&lt;br /&gt;
analysis naturally inspires a robust small-gain version of the&lt;br /&gt;
algorithm, which tolerates arbitrary non-uniform time delays.&lt;br /&gt;
Finally, we show how to exploit a dynamical conservation property&lt;br /&gt;
in order to ensure consensus tracking despite splitting and&lt;br /&gt;
merging of the underlying mobile network.&lt;br /&gt;
&lt;br /&gt;
| flags = &lt;br /&gt;
| tag = som05-ifac&lt;br /&gt;
| id = 2005f&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Murray</name></author>
	</entry>
</feed>