The Ariadne's clew algorithm

  • Authors:
  • Emmanuel Mazer;Juan Manuel Ahuactzin;Pierre Bessiére

  • Affiliations:
  • Laboratoire GRAVIR, Montbonnot, France;Depto. de Ing. en Sistemas Computationales, Universidad de las Americas,;Laboratoire LEIBNIZ, Grenoble, France

  • Venue:
  • Journal of Artificial Intelligence Research
  • Year:
  • 1998

Quantified Score

Hi-index 0.00

Visualization

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.