The Ariadne's Clew Algorithm

by   J. M. Ahuactzin, et al.

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.



page 1

page 2

page 3

page 4


Cleverarm: A Novel Exoskeleton For Rehabilitation Of Upper Limb Impairments

CLEVERarm (Compact, Low-weight, Ergonomic, Virtual and Augmented Reality...

Search Spaces for Neural Model Training

While larger neural models are pushing the boundaries of what deep learn...

Condensation Jacobian with Adaptivity

We present a new approach that allows large time steps in dynamic simula...

Dynamic Optimization Fabrics for Motion Generation

Optimization fabrics represent a geometric approach to real-time motion ...

Proximodistal Exploration in Motor Learning as an Emergent Property of Optimization

To harness the complexity of their high-dimensional bodies during sensor...

Recognition of 26 Degrees of Freedom of Hands Using Model-based approach and Depth-Color Images

In this study, we present an model-based approach to recognize full 26 d...

Dynamically Efficient Kinematics for Hyper-Redundant Manipulators

A hyper-redundant robotic arm is a manipulator with many degrees of free...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.