Home /Research /Shortest path synthesis for Dubins non-holonomic robot
OTHER

Shortest path synthesis for Dubins non-holonomic robot

Xuan-Nam Bui, J. D. Boissonnat, Philippe Souères, Jean‐Paul Laumond

Year
2002
Citations
156

Abstract

We calculate the partition of the configuration space R/sup 2//spl times/S/sup 1/ of a car-like robot, only moving forwards, with respect to the type of the length optimal paths. This kind of robot is subject to kinematic constraints on its path curvature and its orientation. Starting from the results on shortest paths, we give new optimality conditions on these paths, and compute the partition for any horizontal plane of the configuration space.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

KinematicsHolonomicRobotPartition (number theory)Shortest path problemPath (computing)MathematicsConfiguration spaceComputer scienceCombinatorics

Related papers

Browse all OTHER papers