Coordinating the motions of multiple robots with specified trajectories

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 1, Issue , 2002, Pages 624-631

  Akella, Srinivas ^a   Hutchinson, Seth ^b  

^a Rensselaer Polytechnic Institute   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; DEGREES OF FREEDOM (MECHANICS); INTEGER PROGRAMMING; MANIPULATORS; MOTION PLANNING; OPTIMIZATION;

AUTOMATED GUIDED VEHICLES; MULTIPLE ROBOTS;

MOBILE ROBOTS;

EID: 0036055650     PISSN: 10504729     EISSN: None     Source Type: Journal    
DOI: 10.1109/ROBOT.2002.1013428     Document Type: Article

References (19)

1. A minimum time trajectory planning method for two robots
2. Collision avoidance of two robot manipulators by minimum delay time
3. On multiple moving objects
4. The complexity of flowshop and jobshop scheduling
5. No-wait shop scheduling: Computational complexity and approximate algorithms
6. On the complexity of motion planning for multiple independent objects: PSPACE-hardness of the "warehouseman's problem"
7. Toward efficient trajectory planning: The path-velocity decomposition
8. Fast distance queries using rectangular swept sphere volumes
9. Optimal motion planning for multiple robots having independent goals
10. Sequencing and scheduling: Algorithms and complexity
11. Multiple path coordination for mobile robots: A geometric algorithm
12. Deadlock-free and collision-free coordination of two robot manipulators
13. Motion planning in the presence of moving obstacles
14. Complexity of scheduling shops with no wait in process
15. Minimum-time collision-free trajectory planning for dual robot systems