<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462011000200004</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Optimización de trayectorias para sistemas sujetos a restricciones no holónomas]]></article-title>
<article-title xml:lang="en"><![CDATA[Trajectory Optimization for Systems Under Nonholonomic Constraints]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Arechavaleta]]></surname>
<given-names><![CDATA[Gustavo]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Centro de Investigación y de Estudios Avanzados Robótica y Manufactura Avanzada Unidad Saltillo]]></institution>
<addr-line><![CDATA[ Coah.]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2011</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2011</year>
</pub-date>
<volume>14</volume>
<numero>4</numero>
<fpage>365</fpage>
<lpage>382</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462011000200004&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462011000200004&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462011000200004&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Presentamos una estrategia numérica para calcular trayectorias válidas para sistemas sin deriva con restricciones diferenciales no integrables que minimicen el consumo de energía expresado como la norma L2 del control. Utilizamos herramientas de la teoría del control óptimo y la programación no lineal para formular y resolver el problema de optimización. Primero analizamos las condiciones necesarias que debe satisfacer el control óptimo. Posteriormente convertimos el problema de dimensión infinita a un problema de optimización no lineal de dimensión finita. Esta formulación nos permite generar las trayectorias deseadas utilizando una estrategia simple y eficiente basada en la Programación Cuadrática Secuencial (PCS). Comparamos la estrategia propuesta con el algoritmo desarrollado por [Fernandes, et al., 1994], en términos de convergencia y tiempo de cálculo, utilizando varios modelos cinemáticos de robots móviles con ruedas y remolques y también un modelo dinámico de robot espacial.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[This paper presents a numerical strategy to compute feasible trajectories for driftless systems under nonintegrable differential constraints that minimize the norm of the control. We made use of optimal control tools and nonlinear programming to formulate and solve the optimization problem. First, we analyze the necessary conditions to be satisfied by the optimal control. Then, we transform the infinite-dimensional problem into a finite-dimensional nonlinear optimization problem. This formulation allows us to generate the desired trajectories by using a simple and efficient strategy based on the Sequential Quadratic Programming (SQP). We compare the proposed strategy with the algorithm developed by [Fernandes, et al., 1994], in terms of convergence and computational time, by using various kinematic models of mobile robots with wheels, chained systems and a dynamic model of space robot.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[sistemas no holónomos]]></kwd>
<kwd lng="es"><![CDATA[control óptimo]]></kwd>
<kwd lng="es"><![CDATA[optimización numérica]]></kwd>
<kwd lng="es"><![CDATA[robótica móvil]]></kwd>
<kwd lng="en"><![CDATA[Nonholonomic systems]]></kwd>
<kwd lng="en"><![CDATA[optimal control]]></kwd>
<kwd lng="en"><![CDATA[numerical optimization]]></kwd>
<kwd lng="en"><![CDATA[mobile robotics]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p> 	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="center"><font face="verdana" size="4"><b>Optimizaci&oacute;n de trayectorias para sistemas sujetos a restricciones no hol&oacute;nomas</b></font></p> 	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="center"><font face="verdana" size="3"><b>Trajectory Optimization for Systems Under Nonholonomic Constraints</b></font></p> 	    <p align="center"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="center"><font face="verdana" size="2"><b>Gustavo Arechavaleta</b></font></p> 	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2"><i>Rob&oacute;tica y Manufactura Avanzada, CINVESTAV &#150; Unidad Saltillo Carretera Saltillo&#150;Monterrey Km. 13.5, C.P. 25900, Ramos Arizpe, Coah. M&eacute;xico</i> <a href="mailto:garechav@cinvestav.edu.mx">garechav@cinvestav.edu.mx</a></font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2">Art&iacute;culo recibido en Enero 15, 2010    <br>     Aceptado en Junio 11, 2010</font></p> 	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p> 	    <p align="justify"><font face="verdana" size="2">Presentamos una estrategia num&eacute;rica para calcular trayectorias v&aacute;lidas para sistemas sin deriva con restricciones diferenciales no integrables que minimicen el consumo de energ&iacute;a expresado como la norma <i>L</i><sub>2</sub> del control. Utilizamos herramientas de la teor&iacute;a del control &oacute;ptimo y la programaci&oacute;n no lineal para formular y resolver el problema de optimizaci&oacute;n. Primero analizamos las condiciones necesarias que debe satisfacer el control &oacute;ptimo. Posteriormente convertimos el problema de dimensi&oacute;n infinita a un problema de optimizaci&oacute;n no lineal de dimensi&oacute;n finita. Esta formulaci&oacute;n nos permite generar las trayectorias deseadas utilizando una estrategia simple y eficiente basada en la Programaci&oacute;n Cuadr&aacute;tica Secuencial (PCS).</font></p> 	    <p align="justify"><font face="verdana" size="2">Comparamos la estrategia propuesta con el algoritmo desarrollado por &#91;Fernandes, et al., 1994&#93;, en t&eacute;rminos de convergencia y tiempo de c&aacute;lculo, utilizando varios modelos cinem&aacute;ticos de robots m&oacute;viles con ruedas y remolques y tambi&eacute;n un modelo din&aacute;mico de robot espacial.</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Palabras clave:</b> sistemas no hol&oacute;nomos, control &oacute;ptimo, optimizaci&oacute;n num&eacute;rica, rob&oacute;tica m&oacute;vil.</font></p> 	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p> 	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">This paper presents a numerical strategy to compute feasible trajectories for driftless systems under nonintegrable differential constraints that minimize the norm of the control. We made use of optimal control tools and nonlinear programming to formulate and solve the optimization problem. First, we analyze the necessary conditions to be satisfied by the optimal control. Then, we transform the infinite&#150;dimensional problem into a finite&#150;dimensional nonlinear optimization problem. This formulation allows us to generate the desired trajectories by using a simple and efficient strategy based on the Sequential Quadratic Programming (SQP).</font></p> 	    <p align="justify"><font face="verdana" size="2">We compare the proposed strategy with the algorithm developed by &#91;Fernandes, et al., 1994&#93;, in terms of convergence and computational time, by using various kinematic models of mobile robots with wheels, chained systems and a dynamic model of space robot.</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Nonholonomic systems, optimal control, numerical optimization, mobile robotics.</font></p> 	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v14n4/v14n4a4.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p> 	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Agradecimientos</b></font></p> 	    <p align="justify"><font face="verdana" size="2">Agradecemos el soporte financiero del CONACyT por medio del proyecto No. 84855 para desarrollar este trabajo.</font></p> 	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p> 	    <p align="justify"><font face="verdana" size="2"><b>Referencias</b></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>1. Arechavaleta, G., Laumond, J.P., Hicheur, H.</b> &amp; <b>Berthoz, A. (2008).</b> An Optimality Principle Governing Human Walking. <i>IEEE Transactions on Robotics,</i> 24(1), 5&#150;14.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052618&pid=S1405-5546201100020000400001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>2. Balkcom, D.J., Kavathekar, P.A.</b> &amp; <b>Mason, M.T. (2008).</b> The Minimum&#150;Time Trajectories for an Omni&#150;Directional Vehicle. In S. Akella, N.M. Amato, W.H. Huang &amp; B. Mishra (Eds.), <i>Algorithmic Foundation of Robotics VII</i> (343&#150;358). Berlin: Springer.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052620&pid=S1405-5546201100020000400002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>3. Balkcom, D.J.</b> &amp; <b>Mason, M.T. (2002).</b> Time Optimal Trajectories for Bounded Velocity Differential Drive Vehicles. <i>International Journal of Robotics Research,</i> 21(3), 199&#150;217.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052622&pid=S1405-5546201100020000400003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>4. Bhattacharya, S., Murrieta&#150;Cid, R.</b> &amp; <b>Hutchinson, S. (2007).</b> Optimal Paths for Landmark&#150;based Navigation by Differential Drive Vehicles with Field&#150;of&#150;View Constraints. <i>IEEE Transactions on Robotics,</i> 23(1), 47&#150;59.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052624&pid=S1405-5546201100020000400004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>5. Bellaiche, A.</b> &amp; <b>Risler, J. J. (1996).</b> <i>Sub&#150;Riemannian Geometry.</i> Basel; Boston: Birkh&auml;user.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052626&pid=S1405-5546201100020000400005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>6. Betts, J.T. (1998).</b> Survey of Numerical Methods for Trajectory Optimization. <i>Journal of Guidance, Control, and Dynamics,</i> 21(2), 193&#150;207.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052628&pid=S1405-5546201100020000400006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>7. Boissonnat, J.D., Cerezo A. &amp; Leblong, J. (1992). </b>Shortest paths of bounded curvature in the plane. <i>IEEE International Conference on Robotics and Automation,</i> Nice, France, 3, 2315&#150;2320.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052630&pid=S1405-5546201100020000400007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>8. Boissonnat, J.D., Cerezo, A.</b> &amp; <b>Leblong, J. (1994).</b> <i>A note on shortest paths in the plane subject to a constraint on the derivative of the curvature</i> (Rapport de recherche n 2160). Nice: Institut National De Recherche En Informatique Et Automatique.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052632&pid=S1405-5546201100020000400008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>9. Brockett, R.W. (1976).</b> Nonlinear Systems and Differential Geometry. <i>Proceedings of the IEEE,</i> 64(1), 61&#150;72.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052634&pid=S1405-5546201100020000400009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>10. Cesari, L. (1983).</b> <i>Optimization, theory and applications: Problems with ordinary differential equations.</i> New York: Springer&#150;Verlag.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052636&pid=S1405-5546201100020000400010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>11. Choset, H., Lynch, K.M., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L.E.</b> &amp; <b>Thrun, S. (2005).</b> <i>Principles of robot motion: Theory, algorithms and implementations.</i> Boston: MIT Press.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052638&pid=S1405-5546201100020000400011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>12. Divelbiss, A.W.</b> &amp; <b>Wen, J.T. (1997).</b> A path space approach to nonholonomic motion planning in the presence of obstacles. <i>IEEE Transactions on Robotics and Automation,</i> 13(3), 443&#150;451.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052640&pid=S1405-5546201100020000400012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>13. Dubins, L.E. (1957).</b> On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents. <i>American Journal of Mathematics,</i> 79(3), 497&#150;516.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052642&pid=S1405-5546201100020000400013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>14. Fernandes, C., Gurvits, L.</b> &amp; <b>Li Z. (1994).</b> Near&#150;optimal nonholonomic motion planning for a system of coupled rigid bodies. <i>IEEE Transactions on Automatic Control, </i>39(3), 450&#150;463.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052644&pid=S1405-5546201100020000400014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>15. Hayet, J.B., Esteves, C., Arechavaleta, G.</b> &amp; <b>Yoshida, E. (2009).</b> Motion Planning for a Vigilant Humanoid Robot. 9th <i>IEEE&#150;RAS International Conference on Humanoid Robots,</i> Paris, France, 196&#150;201.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052646&pid=S1405-5546201100020000400015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>16. Hayet, J.B., Esteves, C.</b> &amp; <b>Murrieta&#150;Cid, R. (2010).</b> A Motion Planner for Maintaining Landmark Visibility with a Differential Drive Robot. In G.S. Chirikjian, H. Choset, M. Morales &amp; T. Murphey (Eds.), <i>Algorithmic Foundation of Robotics VIII</i> (333&#150;347). Berlin: Springer.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052648&pid=S1405-5546201100020000400016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>17. Howard, T.</b> &amp; <b>Kelly, A. (2007).</b> Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots. <i>International Journal of Robotics Research,</i> 26(2), 141&#150;166.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052650&pid=S1405-5546201100020000400017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>18. Huifang, W., Yangzhou, C.</b> &amp; <b>Sou&egrave;res P. (2009).</b> A Geometric Algorithm to Compute Time&#150;Optimal Trajectories for a Bidirectional Steered Robot. <i>IEEE Transactions on Robotics,</i> 25(2), 399&#150;413.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052652&pid=S1405-5546201100020000400018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>19. Kostov, V.P.</b> &amp; <b>Degtiariova&#150;Kostova, E.V. (1995).</b> The planar motion with bounded derivative of the curvature and its suboptimal paths. <i>Acta Mathematica Universitatis Comeianae,</i> 64(2), 185&#150;226.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052654&pid=S1405-5546201100020000400019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>20. Lamiraux, F., Bonnafous, D.</b> &amp; <b>Lefebvre, O. (2004).</b> Reactive path deformation for nonholonomic mobile robots. <i>IEEE Transactions on Robotics,</i> 20(6), 967&#150;977.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052656&pid=S1405-5546201100020000400020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>21. Latombe J.C. (1991).</b> <i>Robot Motion Planning.</i> Boston: Kluwer Academic Publishers.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052658&pid=S1405-5546201100020000400021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>22. Laumond, J.P., Sekhavat, S.</b> &amp; <b>Lamiraux, F. (1998).</b> Guidelines in Nonholonomic Motion Planning for Mobile Robots. <i>Robot Motion Planning and Control. Lecture Notes in Control and Information Sciences, 229, 1&#150;53.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052660&pid=S1405-5546201100020000400022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></i></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>23. LaValle, S.M. (2006).</b> <i>Planning Algorithms,</i> Cambridge; New York: Cambridge University Press.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052662&pid=S1405-5546201100020000400023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>24. Li, Z.</b> &amp; <b>Canny, J. F. (1993).</b> <i>Nonholonomic Motion Planning.</i> Boston: Kluwer Academic.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052664&pid=S1405-5546201100020000400024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>25. Mombaur, K., Laumond, J.P.</b> &amp; <b>Yoshida, E. (2008).</b> An optimal control model unifying holonomic and nonholonomic walking. 8th <i>IEEE&#150;RAS International Conference on Humanoid Robots,</i> Daejeon, Korea (South), 646&#150;653.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052666&pid=S1405-5546201100020000400025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>26. Murray, R.M, Li, Z.</b> &amp; <b>Sastry S.S. (1994).</b> <i>A Mathematical Introduction to Robotic Manipulation.</i> Boca Raton: CRC Press.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052668&pid=S1405-5546201100020000400026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>27. Nocedal, J.</b> &amp; <b>Wright, S. J. (1999).</b> <i>Numerical Optimization.</i> New York: Springer.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052670&pid=S1405-5546201100020000400027&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>28. Ostrowski, J.P., Desai, J.P.</b> &amp; <b>Kumar, V. (2000).</b> Optimal Gait Selection for Nonholonomic Locomotion Systems. <i>International Journal of Robotics Research, </i>19(3), 225&#150;237.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052672&pid=S1405-5546201100020000400028&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>29. Pecsvaradi, T. (1972).</b> Optimal Horizontal Guidance Law for Aircraft in the Terminal Area. <i>IEEE Transactions on Automatic Control,</i> 17(6), 763&#150;772.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052674&pid=S1405-5546201100020000400029&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>30. Pontryagin, L.S., Boltyanskii, V.G., Gamkrelidze, R.V.</b> &amp; <b>Mishchenko E.F. (1964).</b> <i>The Mathematical Theory of Optimal Processes.</i> Oxford, New York: Pergamon Press.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052676&pid=S1405-5546201100020000400030&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>31. Reeds, J.A.</b> &amp; <b>Shepp, L.A. (1990).</b> Optimal paths for a car that goes both forward and backwards. <i>Pacific Journal of Mathematics,</i> 145(2), 367&#150;393.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052678&pid=S1405-5546201100020000400031&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>32. Salaris, P., Fontanelli, D., Pallottino, L.</b> &amp; <b>Bicchi, A. (2010).</b> Shortest Paths for a Robot With Nonholonomic and Field&#150;of&#150;View Constraints. <i>IEEE Transactions on Robotics</i>, 26(2), 269&#150;281.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052680&pid=S1405-5546201100020000400032&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>33. Sastry, S.S. &amp; Montgomery, R. (1992). </b>The structure of optimal controls for a steering problem. <i>IFAC Conference on Nonlinear Control Systems Design</i>. Bordeaux, France, 135&#150;140.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052682&pid=S1405-5546201100020000400033&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>34. Sontag, E.D. (1995)</b>. Control of Systems Without Drift via Generic Loops. <i>IEEE Transactions on Automatic Control</i>, 40(7), 1210&#150;1219.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052684&pid=S1405-5546201100020000400034&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>35. Sou&egrave;res, P. &amp; Laumond, J.P. (1996)</b>. Shortest path synthesis for a car&#150;like robot. <i>IEEE Transactions on Automatic Control</i>, 41(5), 672&#150;688.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052686&pid=S1405-5546201100020000400035&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2"><b>36. Sussmann, H.J. (1990)</b>. <i>Nonlinear Controllability and Optimal Control</i>, New York: M. Dekker.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052688&pid=S1405-5546201100020000400036&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p> 	    <!-- ref --><p align="justify"><font face="verdana" size="2"><b>37. Sussmann, H.J. &amp; Tang, W. (1991)</b>. <i>Shortest paths for Reeds&#150;Shepp car: a worked out example of the use of geometric techniques in nonlinear optimal control</i> (Report SYCON&#150;91&#150;10). New Brunswick Rutgers University.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2052690&pid=S1405-5546201100020000400037&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Arechavaleta]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Laumond]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Hicheur]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Berthoz]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An Optimality Principle Governing Human Walking]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics]]></source>
<year>2008</year>
<volume>24</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>5-14</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balkcom]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Kavathekar]]></surname>
<given-names><![CDATA[P.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mason]]></surname>
<given-names><![CDATA[M.T]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Minimum-Time Trajectories for an Omni-Directional Vehicle]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Akella]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Amato]]></surname>
<given-names><![CDATA[N.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Huang]]></surname>
<given-names><![CDATA[W.H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mishra]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithmic Foundation of Robotics VII]]></source>
<year>2008</year>
<page-range>343-358</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Balkcom]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Mason]]></surname>
<given-names><![CDATA[M.T]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Time Optimal Trajectories for Bounded Velocity Differential Drive Vehicles]]></article-title>
<source><![CDATA[International Journal of Robotics Research]]></source>
<year>2002</year>
<volume>21</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>199-217</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bhattacharya]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Murrieta-Cid]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Hutchinson]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal Paths for Landmark-based Navigation by Differential Drive Vehicles with Field-of-View Constraints]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics]]></source>
<year>2007</year>
<volume>23</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>47-59</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bellaiche]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Risler]]></surname>
<given-names><![CDATA[J. J]]></given-names>
</name>
</person-group>
<source><![CDATA[Sub-Riemannian Geometry]]></source>
<year>1996</year>
<publisher-loc><![CDATA[Basel^eBoston Boston]]></publisher-loc>
<publisher-name><![CDATA[Birkhäuser]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Betts]]></surname>
<given-names><![CDATA[J.T]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Survey of Numerical Methods for Trajectory Optimization]]></article-title>
<source><![CDATA[Journal of Guidance, Control, and Dynamics]]></source>
<year>1998</year>
<volume>21</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>193-207</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boissonnat]]></surname>
<given-names><![CDATA[J.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cerezo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Leblong]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Shortest paths of bounded curvature in the plane]]></article-title>
<source><![CDATA[IEEE International Conference on Robotics and Automation]]></source>
<year>1992</year>
<volume>3</volume>
<page-range>2315-2320</page-range><publisher-loc><![CDATA[Nice ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boissonnat]]></surname>
<given-names><![CDATA[J.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Cerezo]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Leblong]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<source><![CDATA[A note on shortest paths in the plane subject to a constraint on the derivative of the curvature]]></source>
<year>1994</year>
<publisher-loc><![CDATA[Nice ]]></publisher-loc>
<publisher-name><![CDATA[Institut National De Recherche En Informatique Et Automatique]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brockett]]></surname>
<given-names><![CDATA[R.W]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Nonlinear Systems and Differential Geometry]]></article-title>
<source><![CDATA[Proceedings of the IEEE]]></source>
<year>1976</year>
<volume>64</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>61-72</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cesari]]></surname>
<given-names><![CDATA[L]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimization, theory and applications: Problems with ordinary differential equations]]></source>
<year>1983</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Choset]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lynch]]></surname>
<given-names><![CDATA[K.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hutchinson]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Kantor]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Burgard]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Kavraki]]></surname>
<given-names><![CDATA[L.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Thrun]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<source><![CDATA[Principles of robot motion: Theory, algorithms and implementations]]></source>
<year>2005</year>
<publisher-loc><![CDATA[Boston ]]></publisher-loc>
<publisher-name><![CDATA[MIT Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Divelbiss]]></surname>
<given-names><![CDATA[A.W.]]></given-names>
</name>
<name>
<surname><![CDATA[Wen]]></surname>
<given-names><![CDATA[J.T]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A path space approach to nonholonomic motion planning in the presence of obstacles]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics and Automation]]></source>
<year>1997</year>
<volume>13</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>443-451</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dubins]]></surname>
<given-names><![CDATA[L.E]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[On curves of minimal length with a constraint on average curvature and with prescribed initial and terminal positions and tangents]]></article-title>
<source><![CDATA[American Journal of Mathematics]]></source>
<year>1957</year>
<volume>79</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>497-516</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fernandes]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gurvits]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Near-optimal nonholonomic motion planning for a system of coupled rigid bodies]]></article-title>
<source><![CDATA[IEEE Transactions on Automatic Control]]></source>
<year>1994</year>
<volume>39</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>450-463</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hayet]]></surname>
<given-names><![CDATA[J.B.]]></given-names>
</name>
<name>
<surname><![CDATA[Esteves]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Arechavaleta]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Yoshida]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Motion Planning for a Vigilant Humanoid Robot]]></article-title>
<source><![CDATA[]]></source>
<year>2009</year>
<conf-name><![CDATA[9 IEEE-RAS International Conference on Humanoid Robots]]></conf-name>
<conf-loc>Paris </conf-loc>
<page-range>196-201</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hayet]]></surname>
<given-names><![CDATA[J.B.]]></given-names>
</name>
<name>
<surname><![CDATA[Esteves]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Murrieta-Cid]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Motion Planner for Maintaining Landmark Visibility with a Differential Drive Robot]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Chirikjian]]></surname>
<given-names><![CDATA[G.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Choset]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Morales]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Murphey]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Algorithmic Foundation of Robotics VIII]]></source>
<year>2010</year>
<page-range>333-347</page-range><publisher-loc><![CDATA[Berlin ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Howard]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Kelly]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal Rough Terrain Trajectory Generation for Wheeled Mobile Robots]]></article-title>
<source><![CDATA[International Journal of Robotics Research]]></source>
<year>2007</year>
<volume>26</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>141-166</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Huifang]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
<name>
<surname><![CDATA[Yangzhou]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Souères]]></surname>
<given-names><![CDATA[P]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Geometric Algorithm to Compute Time-Optimal Trajectories for a Bidirectional Steered Robot]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics]]></source>
<year>2009</year>
<volume>25</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>399-413</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kostov]]></surname>
<given-names><![CDATA[V.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Degtiariova-Kostova]]></surname>
<given-names><![CDATA[E.V]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The planar motion with bounded derivative of the curvature and its suboptimal paths]]></article-title>
<source><![CDATA[Acta Mathematica Universitatis Comeianae]]></source>
<year>1995</year>
<volume>64</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>185-226</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lamiraux]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Bonnafous]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Lefebvre]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Reactive path deformation for nonholonomic mobile robots]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics]]></source>
<year>2004</year>
<volume>20</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>967-977</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Latombe]]></surname>
<given-names><![CDATA[J.C]]></given-names>
</name>
</person-group>
<source><![CDATA[Robot Motion Planning]]></source>
<year>1991</year>
<publisher-loc><![CDATA[Boston ]]></publisher-loc>
<publisher-name><![CDATA[Kluwer Academic Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laumond]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Sekhavat]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Lamiraux]]></surname>
<given-names><![CDATA[F]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Guidelines in Nonholonomic Motion Planning for Mobile Robots]]></article-title>
<source><![CDATA[Robot Motion Planning and Control. Lecture Notes in Control and Information Sciences]]></source>
<year>1998</year>
<volume>229</volume>
<page-range>1-53</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[LaValle]]></surname>
<given-names><![CDATA[S.M]]></given-names>
</name>
</person-group>
<source><![CDATA[Planning Algorithms]]></source>
<year>2006</year>
<publisher-loc><![CDATA[CambridgeNew York ]]></publisher-loc>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Canny]]></surname>
<given-names><![CDATA[J. F]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonholonomic Motion Planning]]></source>
<year>1993</year>
<publisher-loc><![CDATA[Boston ]]></publisher-loc>
<publisher-name><![CDATA[Kluwer Academic]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mombaur]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Laumond]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Yoshida]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An optimal control model unifying holonomic and nonholonomic walking]]></article-title>
<source><![CDATA[]]></source>
<year>2008</year>
<conf-name><![CDATA[8 IEEE-RAS International Conference on Humanoid Robots]]></conf-name>
<conf-loc>Daejeon </conf-loc>
<page-range>646-653</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[R.M]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Sastry]]></surname>
<given-names><![CDATA[S.S]]></given-names>
</name>
</person-group>
<source><![CDATA[A Mathematical Introduction to Robotic Manipulation]]></source>
<year>1994</year>
<publisher-loc><![CDATA[Boca Raton ]]></publisher-loc>
<publisher-name><![CDATA[CRC Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nocedal]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[S. J]]></given-names>
</name>
</person-group>
<source><![CDATA[Numerical Optimization]]></source>
<year>1999</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ostrowski]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Desai]]></surname>
<given-names><![CDATA[J.P.]]></given-names>
</name>
<name>
<surname><![CDATA[Kumar]]></surname>
<given-names><![CDATA[V]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal Gait Selection for Nonholonomic Locomotion Systems]]></article-title>
<source><![CDATA[International Journal of Robotics Research]]></source>
<year>2000</year>
<volume>19</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>225-237</page-range></nlm-citation>
</ref>
<ref id="B29">
<label>29</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pecsvaradi]]></surname>
<given-names><![CDATA[T]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal Horizontal Guidance Law for Aircraft in the Terminal Area]]></article-title>
<source><![CDATA[IEEE Transactions on Automatic Control]]></source>
<year>1972</year>
<volume>17</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>763-772</page-range></nlm-citation>
</ref>
<ref id="B30">
<label>30</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pontryagin]]></surname>
<given-names><![CDATA[L.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Boltyanskii]]></surname>
<given-names><![CDATA[V.G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gamkrelidze]]></surname>
<given-names><![CDATA[R.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Mishchenko]]></surname>
<given-names><![CDATA[E.F]]></given-names>
</name>
</person-group>
<source><![CDATA[The Mathematical Theory of Optimal Processes]]></source>
<year>1964</year>
<publisher-loc><![CDATA[Oxford^eNew York New York]]></publisher-loc>
<publisher-name><![CDATA[Pergamon Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B31">
<label>31</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reeds]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Shepp]]></surname>
<given-names><![CDATA[L.A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal paths for a car that goes both forward and backwards]]></article-title>
<source><![CDATA[Pacific Journal of Mathematics]]></source>
<year>1990</year>
<volume>145</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>367-393</page-range></nlm-citation>
</ref>
<ref id="B32">
<label>32</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Salaris]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Fontanelli]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Pallottino]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Bicchi]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Shortest Paths for a Robot With Nonholonomic and Field-of-View Constraints]]></article-title>
<source><![CDATA[IEEE Transactions on Robotics]]></source>
<year>2010</year>
<volume>26</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>269-281</page-range></nlm-citation>
</ref>
<ref id="B33">
<label>33</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sastry]]></surname>
<given-names><![CDATA[S.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Montgomery]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The structure of optimal controls for a steering problem]]></article-title>
<source><![CDATA[IFAC Conference on Nonlinear Control Systems Design]]></source>
<year>1992</year>
<page-range>135-140</page-range><publisher-loc><![CDATA[Bordeaux ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B34">
<label>34</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sontag]]></surname>
<given-names><![CDATA[E.D]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Control of Systems Without Drift via Generic Loops]]></article-title>
<source><![CDATA[IEEE Transactions on Automatic Control]]></source>
<year>1995</year>
<volume>40</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>1210-1219</page-range></nlm-citation>
</ref>
<ref id="B35">
<label>35</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Souères]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Laumond]]></surname>
<given-names><![CDATA[J.P]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Shortest path synthesis for a car-like robot]]></article-title>
<source><![CDATA[IEEE Transactions on Automatic Control]]></source>
<year>1996</year>
<volume>41</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>672-688</page-range></nlm-citation>
</ref>
<ref id="B36">
<label>36</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sussmann]]></surname>
<given-names><![CDATA[H.J]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonlinear Controllability and Optimal Control]]></source>
<year>1990</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[M. Dekker]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B37">
<label>37</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sussmann]]></surname>
<given-names><![CDATA[H.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Tang]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Shortest paths for Reeds-Shepp car: a worked out example of the use of geometric techniques in nonlinear optimal control]]></source>
<year>1991</year>
<publisher-name><![CDATA[New Brunswick Rutgers University]]></publisher-name>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
