TABLE OF CONTENTS Sepanta Sekhavat, LAAS/CNRS, Toulouse, France,
Petr vestka, Department of Computer Science, Utrecht University, the Netherlands,
Jean-Paul Laumond, LAAS/CNRS, Toulouse, France,
Mark Overmars, Department of Computer Science, Utrecht University, the Netherlands
We present a new and complete multi-level approach for solving path planning problems for nonholonomic robots. At the first level a path is found that disrespects (some of) the nonholonomic constraints. At each next level a new path is generated, by transformation of the path generated at the previous level. The transformation is such that more nonholonomic constraints are respected than at the previous level. At the final level all nonholonomic constraints are respected. We present two techniques for these transformations.
In the intermediate levels we plan paths for what we refer to as semi-holonomic subsystems. Such a system is obtained by taking the real (physical) system, and removing some of its nonholonomic constraints.
In this paper, we apply the scheme to car-like robots pulling trailers, that is, tractor-trailer robots. In this case, the real system is the tractor-trailer robot, and the ignored constraints in the semi-holonomic subsystems are the kinematic ones on the trailers. These are the constraints of rolling without slipping, on the trailers wheels. Experimental results are given that illustrate the time-efficiency of the resulting planner. In particular, we show that using the...
