Mobile robot path planning based on hierarchical hexagonal decomposition and artificial potential fields
- 1 January 1994
- journal article
- research article
- Published by Wiley in Journal of Robotic Systems
- Vol. 11 (7) , 605-614
- https://doi.org/10.1002/rob.4620110704
Abstract
In this article, a new 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 complete map of the workspace including obstacle locations is assumed to be known a priori. 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. © 1994 John Wiley & Sons, Inc.Keywords
This publication has 9 references indexed in Scilit:
- Global path planning using artificial potential fieldsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Using moments to plan paths for the Oxford AGVPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New heuristic algorithms for efficient hierarchical path planningIEEE Transactions on Robotics and Automation, 1991
- Algorithmic motion planning in roboticsComputer, 1989
- A search algorithm for motion planning with six degrees of freedomArtificial Intelligence, 1987
- Multiresolution path planning for mobile robotsIEEE Journal on Robotics and Automation, 1986
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- Impedance Control: An Approach to Manipulation: Part I—TheoryJournal of Dynamic Systems, Measurement, and Control, 1985
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983