The Ariadne's Clew Algorithm

Abstract : We present a new approach to path planning, called the Ariadne's clew algorithm. It is designed to find paths in high-dimensional continuous spaces and applies to robots with many degrees of freedom in static, as well as dynamic environments --- ones where obstacles may move. The Ariadne's clew algorithm comprises two sub-algorithms, called SEARCH and EXPLORE, applied in an interleaved manner. EXPLORE builds a representation of the accessible space while SEARCH looks for the target. Both are posed as optimization problems. We describe a real implementation of the algorithm to plan paths for a six degrees of freedom arm in a dynamic environment where another six degrees of freedom arm is used as a moving obstacle. Experimental results show that a path is found in about one second without any pre-processing.
Type de document :
Article dans une revue
Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 1998, 9, pp.295-316
Liste complète des métadonnées

https://hal.inria.fr/inria-00356708
Contributeur : Christian Laugier <>
Soumis le : mercredi 28 janvier 2009 - 11:59:11
Dernière modification le : mercredi 11 avril 2018 - 01:59:29

Identifiants

  • HAL Id : inria-00356708, version 1

Collections

IMAG | INRIA | UGA

Citation

Emmanuel Mazer, Juan-Manuel Ahuactzin, Pierre Bessiere. The Ariadne's Clew Algorithm. Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 1998, 9, pp.295-316. 〈inria-00356708〉

Partager

Métriques

Consultations de la notice

242