<?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=A_Motion_Planner_for_Nonholonomic_Robots</id>
	<title>A Motion Planner for Nonholonomic Robots - 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=A_Motion_Planner_for_Nonholonomic_Robots"/>
	<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=A_Motion_Planner_for_Nonholonomic_Robots&amp;action=history"/>
	<updated>2026-09-04T18:54:38Z</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=A_Motion_Planner_for_Nonholonomic_Robots&amp;diff=20050&amp;oldid=prev</id>
		<title>Murray: htdb2wiki: creating page for 1994p_ljtm94-tra.html</title>
		<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=A_Motion_Planner_for_Nonholonomic_Robots&amp;diff=20050&amp;oldid=prev"/>
		<updated>2016-05-15T06:20:41Z</updated>

		<summary type="html">&lt;p&gt;htdb2wiki: creating page for 1994p_ljtm94-tra.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 = J-P. Laumond, P. E. Jacobs, M. Taix and R. M. Murray&lt;br /&gt;
| title = A Motion Planner for Nonholonomic Robots&lt;br /&gt;
| source = &amp;lt;i&amp;gt;IEEE T. Robotics and Automation&amp;lt;/i&amp;gt;, 10: (5) 577-593&lt;br /&gt;
| year = 1994&lt;br /&gt;
| type = Downloading and printing FAQ&lt;br /&gt;
| funding = &lt;br /&gt;
| url = help.html&lt;br /&gt;
| abstract =  This paper considers the problem of motion planning for a car-like robot (i.e., a&lt;br /&gt;
mobile robot with a nonholonomic constraint whose turning radius is lower-bounded). We&lt;br /&gt;
present a fast and exact planner for our mobile robot model, based upon recursive&lt;br /&gt;
subdivision of a collision-free path generated by a lower-level geometric planner that&lt;br /&gt;
ignores the motion constraints. The resultant trajectory is optimized to give a path that&lt;br /&gt;
is of near-minimal length in its homotopy class. Our claims of high speed are supported by&lt;br /&gt;
experimental results for implementations that assume a robot moving amid polygonal&lt;br /&gt;
obstacles. The completeness and the complexity of the algorithm are proven using an&lt;br /&gt;
appropriate metric in the configuration space R2 x S1 of the robot. This metric is defined&lt;br /&gt;
by using the length of the shortest paths in the absence of obstacles as the distance&lt;br /&gt;
between two configurations. We prove that the new induced topology and the classical one&lt;br /&gt;
are the same. Although we concentration upon the car-like robot, the generalization of&lt;br /&gt;
these techniques leads to new theoretical issues involving sub-Riemannian geometry and to&lt;br /&gt;
practical results for nonholonomic motion planning. &lt;br /&gt;
| flags = &lt;br /&gt;
| tag = ljtm94-tra&lt;br /&gt;
| id = 1994p&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Murray</name></author>
	</entry>
</feed>