Exploiting constraints during prioritized path planning for teams of mobile robots

IEEE International Conference on Intelligent Robots and Systems

Volumn 1, Issue , 2001, Pages 393-398

  Bennewitz, Maren ^a   Burgard, Wolfram ^a   Thrun, Sebastian ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTER SIMULATION; CONSTRAINT THEORY; MOTION PLANNING; ROBOTICS;

MULTIPLE MOBILE ROBOTS; ROBOT SIMULATION;

MOBILE ROBOTS;

EID: 0035558925     PISSN: None     EISSN: None     Source Type: Journal    
DOI: 10.1109/IROS.2001.973389     Document Type: Article

References (19)

1. A decentralized approach for the conflict-free motion of multiple mobile robots
2. Numerical potential field techniques for robot path planning
3. A monte-carlo algorithm for path planning with many degrees of freedom
4. A minimum-time trajectory planning method for two robots
5. Fast motion planning for multiple moving robots
6. On multiple moving objects
7. Multirobot motion coordination in space and time
8. An extension of the plan-merging paradigm for multi-robot coordination
9. Probabilistic road maps for path planning in high-dimensional configuration spaces
10. Optimal motion planning for multiple robots having independent goals
11. Multiple path coordination for mobile robots: A geometric algorithm
12. High resolution maps from wide angle sonar
13. Deadlock-free and collision-free coordination of two robot manipulators
14. A new method for solving hard instances of satisfiability
15. Coordinated motion planning for multiple carlike robots using probabilistic roadmaps
16. A strategy for obstacle avoidence and its application to multi-robot systems
17. Multiple robot path coordination using artificial potential fields