Hierarchical path planning with hexagonal decomposition

Abstract

An algorithm based on an artificial potential field and hierarchical cell decomposition technique is developed to solve the find-path problem for a mobile robot. The basic cell structure used for decomposition is a hexagon. The artificial potential field is based on an attractive force from the goal position and repelling forces from the obstacles. Computer simulations of the algorithm for various obstacle scenarios are also presented.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>