<?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=Motion_Planning_with_Wireless_Network_Constraints</id>
	<title>Motion Planning with Wireless Network Constraints - 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=Motion_Planning_with_Wireless_Network_Constraints"/>
	<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Motion_Planning_with_Wireless_Network_Constraints&amp;action=history"/>
	<updated>2026-07-04T09:11:02Z</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=Motion_Planning_with_Wireless_Network_Constraints&amp;diff=19876&amp;oldid=prev</id>
		<title>Murray: htdb2wiki: creating page for 2005e_sm05-acc.html</title>
		<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Motion_Planning_with_Wireless_Network_Constraints&amp;diff=19876&amp;oldid=prev"/>
		<updated>2016-05-15T06:17:59Z</updated>

		<summary type="html">&lt;p&gt;htdb2wiki: creating page for 2005e_sm05-acc.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 = Motion Planning with Wireless Network Constraints&lt;br /&gt;
| source = 2005 American Control Conference&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/sm05-acc.pdf&lt;br /&gt;
| abstract = &lt;br /&gt;
This work discusses feasibility aspects of motion planning for&lt;br /&gt;
groups of agents connected by a range-constrained wireless&lt;br /&gt;
network. Specifically, we address the difficulties encountered&lt;br /&gt;
when trajectories are required to preserve the connectedness of&lt;br /&gt;
the network. The analysis utilizes a quantity called the&lt;br /&gt;
connectivity robustness of the network, which can be&lt;br /&gt;
calculated in a distributed fashion, and thus is applicable to&lt;br /&gt;
distributed motion planning problems arising in control of vehicle&lt;br /&gt;
networks. Further, these results show that network constraints&lt;br /&gt;
posed as connectivity robustness constraints have minimal impact&lt;br /&gt;
on reachability, provided that an appropriate topology control&lt;br /&gt;
algorithm is implemented. This contrasts with more naive&lt;br /&gt;
approaches to connectivity maintenance, which can significantly&lt;br /&gt;
reduce the reachable set.&lt;br /&gt;
&lt;br /&gt;
| flags = &lt;br /&gt;
| tag = sm05-acc&lt;br /&gt;
| id = 2005e&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Murray</name></author>
	</entry>
</feed>