Computing good holonomic collision-free paths to steer nonholonomic mobile robots - LAAS - Laboratoire d'Analyse et d'Architecture des Systèmes Accéder directement au contenu
Communication Dans Un Congrès Année : 1997

Computing good holonomic collision-free paths to steer nonholonomic mobile robots

Résumé

Several schemes have been proposed in the path planning-literature to plan collision-free and feasible trajectories for non-holonomic mobile robots. A classical scheme is the two-step approach proposed in [4, 8, 5] which consists in first computing a collision-free holonomic path, and then in transforming this path by a sequence of feasible ones. The quality of the solution and the computational cost of the second step depend on the shape of the holonomic path. In this paper, we introduce a nonholonomic cost of the geometric path to be approximated and we propose a configuration-space structuring that allows us to compute an holonomic path minimizing at best the nonholonomic cost. The algorithms have been implemented and we present simulation results which illustrate the efficacy of the planner to produce good solutions with respect to the nonholonomic constraints of a mobile robot.
Fichier principal
Vignette du fichier
97iros Leroy.pdf (194.83 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04295571 , version 1 (20-11-2023)

Identifiants

  • HAL Id : hal-04295571 , version 1

Citer

Thierry Simeon, Stéphane Leroy, Jean-Paul Laumond. Computing good holonomic collision-free paths to steer nonholonomic mobile robots. IEEE/FSR International Conference on Intelligent Robots and Systems (IROS), Sep 1997, Grenoble, France. ⟨hal-04295571⟩
15 Consultations
4 Téléchargements

Partager

Gmail Facebook X LinkedIn More