Convex Tours of Bounded Curvature

Abstract : We consider the motion planning problem for a point constrained to move along a smooth closed convex path of bounded curvature. The workspace of the moving point is bounded by a convex polygon with $m$ vertices, containing an obstacle in a form of a simple polygon with $n$ vertices. We present an $O(m+n)$ time algorithm finding the path, going around the obstacle, whose curvature is the smallest possible.
Type de document :
Rapport
[Research Report] RR-2375, INRIA. 1994
Liste complète des métadonnées

https://hal.inria.fr/inria-00074301
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 15:00:52
Dernière modification le : samedi 27 janvier 2018 - 01:30:56
Document(s) archivé(s) le : mardi 12 avril 2011 - 16:27:11

Fichiers

Identifiants

  • HAL Id : inria-00074301, version 1

Collections

Citation

Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jean-Marc Robert, Mariette Yvinec. Convex Tours of Bounded Curvature. [Research Report] RR-2375, INRIA. 1994. 〈inria-00074301〉

Partager

Métriques

Consultations de la notice

367

Téléchargements de fichiers

107