We have been first interested in car like systems. For this
type of systems we provided the first complete algorithm that
consists in transforming any collision-free path into a
sequence of admissible collision-free ones. This result is
mainly based on the knowledge of the shortest paths (the
so-called Reeds and Shepp curves). The combinatorial
analysis of the path complexity is related to the study of
the underlying nonholonomic metrics. We proved that the
number of maneuvers to park a car varies as the inverse of
the square of the size of the free space. Such a proof has
been made possible via a complete synthesis of the Reeds and
Shepp curves. The picture on the right below shows the domains of
the configuration space (x,y,theta) reachable by shortest
paths of a given length.
Selected Publications:
"A motion planner for nonholonomic mobile robots"
J.P.LAUMOND , P.JACOBS , M.TAIX , R.MURRAY
IEEE Transactions on Robotics and Automation, 10(5), pp.577-593, October 1994
"Shortest path synthesis for a car-like robot"
P. SOUČRES and J.-P. LAUMOND,
IEEE Transaction on Automatic Control, 41 (5), May 1996
"Obstacle distance for car-like robots"
M.VENDITTELLI , J.P.LAUMOND and C.NISSOUX
IEEE Transactions on Robotics and Automation, 15(4), pp.678-691, August 1999