<?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=Robust_Connectivity_of_Networked_Vehicles</id>
	<title>Robust Connectivity of Networked Vehicles - 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=Robust_Connectivity_of_Networked_Vehicles"/>
	<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Robust_Connectivity_of_Networked_Vehicles&amp;action=history"/>
	<updated>2026-05-25T01:27:33Z</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=Robust_Connectivity_of_Networked_Vehicles&amp;diff=19901&amp;oldid=prev</id>
		<title>Murray: htdb2wiki: creating page for 2004i_sm04-cdc.html</title>
		<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Robust_Connectivity_of_Networked_Vehicles&amp;diff=19901&amp;oldid=prev"/>
		<updated>2016-05-15T06:18:21Z</updated>

		<summary type="html">&lt;p&gt;htdb2wiki: creating page for 2004i_sm04-cdc.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 and Richard M. Murray&lt;br /&gt;
| title = Robust Connectivity of Networked Vehicles&lt;br /&gt;
| source = Submitted, 2004 Conference on Decision and Control (CDC)&lt;br /&gt;
| year = 2004&lt;br /&gt;
| type = Conference Paper&lt;br /&gt;
| funding = NSF/EPNES&lt;br /&gt;
| url = http://www.cds.caltech.edu/~murray/preprints/sm04-cdc.pdf&lt;br /&gt;
| abstract = &lt;br /&gt;
We present a simple geometric analysis of wireless&lt;br /&gt;
connectivity in vehicle networks. We introduce a localized&lt;br /&gt;
notion of connectedness, and construct a function that measures&lt;br /&gt;
the robustness of this local connectedness to variations&lt;br /&gt;
in position. Under a mild feasibility hypothesis, this function&lt;br /&gt;
provides a sufficient condition for global connectedness of&lt;br /&gt;
the network. Further, it is distributed, in the sense that&lt;br /&gt;
both the function and its gradients can be calculated using&lt;br /&gt;
only neighbor-to-neighbor communications. It can thus form&lt;br /&gt;
the basis for distributed motion-control algorithms which&lt;br /&gt;
respect connectivity constraints. We conclude with two simple&lt;br /&gt;
examples of target applications.&lt;br /&gt;
| flags = &lt;br /&gt;
| tag = sm04-cdc&lt;br /&gt;
| id = 2004i&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Murray</name></author>
	</entry>
</feed>