Point-to-point and multi-goal path planning for industrial robots

Journal of Robotic Systems

Volumn 18, Issue 8, 2001, Pages 445-461

  Wurll, Christian ^a,b   Henrich, Dominik ^a  

^a AMATEC Robotics GmbH   (Germany)

^b Rheinland Pfälzische Technische Universität Kaiserslautern Landau   (Germany)

Author keywords

Bidirectional search; Discretization; Distributed and parallel processing; Graph search; Industrial robots; On line algorithms; Path planning; Search algorithms

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; DEGREES OF FREEDOM (MECHANICS); MOTION PLANNING; OPTIMIZATION;

MULTIPLE GOAL PATH PLANNING; OPTIMAL DISCRETIZATION METHOD;

INDUSTRIAL ROBOTS;

EID: 0035424321     PISSN: 07412223     EISSN: None     Source Type: Journal    
DOI: 10.1002/rob.1036     Document Type: Article

References (30)

1. Automatic offline programming and motion planning for industrial robots
2. Gross motion planning-A survey
3. A formal basis for the heuristic determination of minimum cost paths
4. Motion planning for manipulators with many degrees of freedom-The BB-method
5. A dynamic graph search algorithm for motion planning
6. Completeness vs. efficiency in real applications of motion planning
7. Integration eines parallelen Bewegungsplaners in ROBCAD
8. On-line path planning with optimal C-space discretization
9. Path planning for industrial robot arms-A parallel randomized approach
10. 6 DOF path planning in dynamic environments-A parallel on-line approach
11. Fast distance computation for on-line collision detection with multi-arm robots
12. Kollisionserkennung durch parallele Abstandsberechnung
13. Segment-based distance computation for an on-line path planner
14. Ein Workstation-Cluster für paralleles Rechnen in Robotik-Anwendungen
15. H-PBS: A hash-based scalable technique for parallel bidirectional search
16. Multi-directional search with goal switching for robot path planning
17. Multi-goal path planning for industrial robots
18. A note on two problems in connexion with graphs
19. On the symmetric travelling salesman problem: Solution of a 120-city problem
20. Optimization of a 532-city symmetric traveling salesman problem by branch and cut
21. Solution of large-scale symmetric traveling salesman problems
22. On the solution of traveling salesman problems
23. Industrial applications of the AMROSE motion planner
24. On-line path planning by heuristic hierarchical search
25. Robot motion planning by a hierarchical search on a modified discretized configuration space