Manipulator path planning by decomposition: Algorithm and analysis

IEEE Transactions on Robotics and Automation

Volumn 17, Issue 6, 2001, Pages 842-856

  Hourtash, Arjang ^b   Tarokh, Mahmoud ^a,c  

^a IEEE   (United States)

^b Simplify Robotics Inc   (United States)

^c San Diego State University   (United States)

Author keywords

Manipulator decomposition; Path planning

Indexed keywords

CELL DECOMPOSITION METHOD; MANIPULATOR DECOMPOSITION; MANIPULATOR PATH PLANNING; OFF-LINE PREPROCESSING STAGE; POTENTIAL FIELD METHOD; ROAD MAP METHOD; THREE-DIMENSIONAL WORK SPACE; THREE-PHASE ON-LINE PATH PLANNING SCHEME;

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL METHODS; CONTROL SYSTEM SYNTHESIS; DEGREES OF FREEDOM (MECHANICS); GRAPH THEORY; MANIPULATORS; THREE DIMENSIONAL;

MOTION PLANNING;

EID: 0035708338     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.976006     Document Type: Article

References (32)

1. Robot motion planning: A distributed representation approach
2. A random sampling scheme for path planning
3. A subdivision algorithm in configuration space for findpath with rotation
4. SANDROS: A dynamic graph search algorithm for motion planning
5. A kinematic notation for lower-pair mechanisms based on matrices
6. A fast procedure for computing the distance between complex objects in three-dimensional space
7. Fast collision avoidance for manipulator arms: A sequential search strategy
8. Motion planning for many degrees of freedom: Sequential search with backtracking
9. Practical global motion planning for many degrees of freedom-A novel approach with sequential search framework
10. Optimal robot decomposition for fast path planning
11. Efficient path planning by optimal configuration generation using evolutionary programming
12. Computation time analysis of path planning by decomposition
13. Robot path planning by decomposition
14. A heuristic and complete planner for the classical mover's problem
15. Computation of configuration-space obstacles using the fast Fourier transform
16. Probabilistic roadmaps for path planning in high-dimensional configuration spaces
17. Analysis of probabilistic roadmaps for path planning
18. Real-time obstacle avoidance for manipulators and mobile robots
19. Exact robot navigation by means of potential functions: Some topological considerations
20. A fast algorithm for incremental distance calculation
21. Spatial planning: A configuration space approach
22. A simple motion-planning algorithm for general robot manipulators
23. Path planning and the topology of configuration space
24. Efficient distance computation between nonconvex objects
25. Exact robot navigation using artificial potential functions
26. Fast path planning for robot manipulators
27. Fast path planning for robot manipulators by formation-posture decomposition
28. Implementation of a fast path planner on an industrial manipulator
29. Path planning by robot decomposition and parallel search
30. New heuristic algorithms for efficient hierarchical path planning