Solving findpath by combination of goal-directed and randomized search
- 4 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1718-1723 vol.3
- https://doi.org/10.1109/robot.1990.126257
Abstract
An application of the findpath problem is briefly introduced, and method solving findpath by a combination of goal-directed straight-and-slide search and randomized generation of subgoals is outlined. The major parts and details of the implemented plane-findpath algorithm are discussed, and experimental results are given. The future extensions of the algorithm to a three-dimensional environment and a six-degree-of-freedom manipulator are considered.Keywords
This publication has 10 references indexed in Scilit:
- A feasible motion-planning algorithm for a mobile robot based on a quadtree representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Hierarchical object models for efficient anti-collision algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Task-level planning of pick-and-place robot motionsComputer, 1989
- Algorithmic motion planning in roboticsComputer, 1989
- Real-Time Pathfinding in Multirobot Systems Including Obstacle AvoidanceThe International Journal of Robotics Research, 1988
- A simple motion-planning algorithm for general robot manipulatorsIEEE Journal on Robotics and Automation, 1987
- A search algorithm for motion planning with six degrees of freedomArtificial Intelligence, 1987
- Computational Geometry and Motion PlanningPublished by Elsevier ,1985
- Planning Collision- Free Motions for Pick-and-Place OperationsThe International Journal of Robotics Research, 1983
- Spatial Planning: A Configuration Space ApproachIEEE Transactions on Computers, 1983