Hostname: page-component-77c78cf97d-tlp4c Total loading time: 0 Render date: 2026-05-04T03:12:06.029Z Has data issue: false hasContentIssue false

Path planning for simple wheeled robots: sub-Riemannian and elastic curves on SE(2)

Published online by Cambridge University Press:  07 June 2013

Craig Maclean*
Affiliation:
Advanced Space Concepts Laboratory, Department of Mechanical & Aerospace Engineering, University of Strathclyde, Glasgow G4 0LT, UK
James D. Biggs
Affiliation:
Advanced Space Concepts Laboratory, Department of Mechanical & Aerospace Engineering, University of Strathclyde, Glasgow G4 0LT, UK
*
*Corresponding author. E-mail: craig.maclean@strath.ac.uk

Summary

This paper presents a motion planning method for a simple wheeled robot in two cases: (i) where translational and rotational speeds are arbitrary, and (ii) where the robot is constrained to move forwards at unit speed. The motions are generated by formulating a constrained optimal control problem on the Special Euclidean group SE(2). An application of Pontryagin's maximum principle for arbitrary speeds yields an optimal Hamiltonian which is completely integrable in terms of Jacobi elliptic functions. In the unit speed case, the rotational velocity is described in terms of elliptic integrals, and the expression for the position is reduced to quadratures. Reachable sets are defined in the arbitrary speed case, and a numerical plot of the time-limited reachable sets is presented for the unit speed case. The resulting analytical functions for the position and orientation of the robot can be parametrically optimised to match prescribed target states within the reachable sets. The method is shown to be easily adapted to obstacle avoidance for static obstacles in a known environment.

Information

Type
Articles
Copyright
Copyright © Cambridge University Press 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable