An Approach To Manipulator Path Planning
- 1 October 1989
- journal article
- other
- Published by SAGE Publications in The International Journal of Robotics Research
- Vol. 8 (5) , 87-95
- https://doi.org/10.1177/027836498900800509
Abstract
A path planning technique for fixed-base robot manipulators consists of a Mapping Phase and a Path Planning Phase. The Mapping Phase employs a closed-form relationship to map from object space to C-Space for a manipulator with revolute joints. The Path Planning Phase consists of develop ing a potential field around each object in C-Space and using the resulting field to choose an appropriate path. To accom plish this, a trial path is chosen and then modified under the influence of the potential field. Considering the entire path greatly reduces the probability of becoming trapped in a local minimum, making the method effective for global planning.Keywords
This publication has 11 references indexed in Scilit:
- Real-Time Obstacle Avoidance for Manipulators and Mobile RobotsThe International Journal of Robotics Research, 1986
- Decision of robot movement by means of a potential fieldAdvanced Robotics, 1986
- Configuration Maps for Robot Path Planning in Two DimensionsJournal of Dynamic Systems, Measurement, and Control, 1985
- Impedance Control: An Approach to Manipulation: Part II—ImplementationJournal of Dynamic Systems, Measurement, and Control, 1985
- Impedance Control: An Approach to Manipulation: Part I—TheoryJournal of Dynamic Systems, Measurement, and Control, 1985
- Impedance Control: An Approach to Manipulation: Part III—ApplicationsJournal of Dynamic Systems, Measurement, and Control, 1985
- On the Piano Movers' Problem: III. Coordinating the Motion of Several Independent Bodies: The Special Case of Circular Bodies Moving Amidst Polygonal BarriersThe International Journal of Robotics Research, 1983
- Solving the find-path problem by good representation of free spaceIEEE Transactions on Systems, Man, and Cybernetics, 1983
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983
- An algorithm for planning collision-free paths among polyhedral obstaclesCommunications of the ACM, 1979