Path planning for manipulator robots in cluttered environments

Authors:
Samir Lahouar;Said Zeghloul;Lotfi Romdhane
Affiliations:
Laboratoire de Mécanique des Solides, UMR, CNRS, Chasseneuil Cedex, France;Laboratoire de Mécanique des Solides, UMR, CNRS, Chasseneuil Cedex, France;Laboratoire de Génie Mécanique, Ecole Nationale d'Ingénieurs, Monastir, Tunisia
Venue:
ACMOS'05 Proceedings of the 7th WSEAS international conference on Automatic control, modeling and simulation
Year:
2005

Citing 6
Cited 0

The complexity of robot motion planning

The complexity of robot motion planning
Real-time robot motion planning using rasterizing computer graphics hardware

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
An algorithm for planning collision-free paths among polyhedral obstacles

Communications of the ACM
SMAR: A Robot Modeling and Simulation System

Robotica
Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)

Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics)
The Ariadne's clew algorithm

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a new path planning method for a robot manipulator in a cluttered static environment, based on lazy grid sampling. Grid cells are built while searching for the path to the goal configuration. The proposed planner acts in two modes. A depth mode while the robot is far from obstacles makes it evolve toward its goal. Then a width search mode becomes active when the robot gets close to an obstacle, and it ensures the shortest path to go around an obstacle. This method reduces the gap between pre-computed grid methods and lazy grid methods. No heuristic function is needed to guide the search process. An example dealing with a robot in a cluttered environment is presented to show the efficiency of the method.