Very fast motion planning for dexterous robots

Authors:
D. Challou;C. Olson
Affiliations:
-;-
Venue:
ISATP '95 Proceedings of the 1995 IEEE International Symposium on Assembly and Task Planning
Year:
1995

Citing 8
Cited 0

Sensor fusion in certainty grids for mobile robots

AI Magazine
A Randomized Parallel Backtracking Algorithm

IEEE Transactions on Computers
Gross motion planning—a survey

ACM Computing Surveys (CSUR)
Robot motion planning: a distributed representation approach

International Journal of Robotics Research
Systematic and nonsystematic search strategies

Proceedings of the first international conference on Artificial intelligence planning systems
Parallel search algorithms for robot motion planning

Parallel search algorithms for robot motion planning
Robot Motion Planning

Robot Motion Planning
OR-Parallel Theorem Proving with Random Competition

LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: The authors show that paths for dexterous robots can be generated in a few seconds or less using parallel informed randomized search on multicomputers. The experimental results the authors present have been obtained for a simulated 7-jointed arm operating in realistic 3D workspaces. The authors also present a new method for predicting the solution times that their parallel formulation can deliver on increasing numbers of processors.