An experimental study of distributed robot coordination

Robotics and Autonomous Systems

Volumn 57, Issue 2, 2009, Pages 129-133

  Carpin, Stefano ^a   Pagello, Enrico ^b  

^a Merced   (United States)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

Intelligent mobility; Motion planning; Multi robot systems; Randomized algorithms

Indexed keywords

ALGORITHMS; INDUSTRIAL ROBOTS; MOTION PLANNING; MULTIPURPOSE ROBOTS; NAVIGATION; ROBOT LEARNING; ROBOTS;

INTELLIGENT MOBILITY; MULTI-ROBOT SYSTEMS; MULTIPLE ROBOTS; RANDOMIZED ALGORITHMS; ROBOT COORDINATION;

ROBOTICS;

EID: 58549110622     PISSN: 09218890     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.robot.2008.07.001     Document Type: Article

References (18)

1. G. Sánchez, J. Latombe, Using a prm planner to compare centralized and decoupled planning for multi-robot systems, in: Proceedings of the IEEE International Conference on Robotics and Automation, 2002
2. Carpin S., and Pillonetto G. Motion planning using adaptive random walks. IEEE Transactions on Robotics 21 1 (2005) 129-136
3. Kavraki L., Švestka P., Latombe J., and Overmars M. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12 4 (1996) 566-580
4. LaValle S., and Kufner J. Randomized kinodynamic planning. International Journal of Robotics Research 20 5 (2001) 378-400
5. Choset H., Lynch K., Hutchinson S., Kantor G., Burgard W., Kavraki L., and Thrun S. Principles of Robot Motion (2005), MIT Press
6. LaValle S. Planning Algorithms (2006), Cambridge Academic Press
7. Erdman M., and Lozano-Pérez T. On multiple moving objects. Algorithmica 2 1 (1987) 477-521
8. Bennewitz M., Burgard W., and Thrun S. Finding and optimizing solvable priority schemes for decoupled path planning techniques for teams of mobile robots. Robotics and Autonomous Systems 41 2-3 (2002) 89-99
9. LaValle S. Robot motion planning: A game-theoretic approach. Algorithmica 26 3-4 (2000) 430-465
10. LaValle S., and Hutchinson S. Optimal motion planning for multiple robots having independent goals. IEEE Transactions on Robotics and Automation 14 6 (1998) 912-925
11. Siméon T., Leroy S., and Laumond J. Path coordination for multiple mobile robots: A resolution-complete algorithm. IEEE Transactions on Robotics and Automation 18 1 (2002) 42-49
12. S. Akella, S. Hutchinson, Coordinating the motions of multiple robots with specified trajectories, in: Proceedings of the IEEE International Conference on Robotics and Automation, 2002, pp. 624-632
13. Peng J., and Akella S. Coordinating multple robots with kinodynamic constraints along specified paths. International journal of robotics research 24 4 (2005) 295-310
14. Garey M., and Johnson D. Computers and Intractability. A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company
15. S. Carpin, E. Pagello, A distributed algorithm for multi-robot motion planning, in: Proceedings of the fourth Eurpoean Conference on Advanced Mobile Robots, Lund (Sweden), 2001, pp. 207-214
16. Y. Guo, L. Parker, A distributed and optimal motion planning approach for multiple mobile robots, in: Proceedings of the IEEE Conference on Robotics and Automation, 2002, pp. 2612-2619
17. G. project, The gnu linear programming toolkit.www.gnu.org/software/glpk/glpk.html, 2005
18. Shmoys D., Stein C., and Wein J. Improved approximation algorithns for shop scheduling problems. SIAM Journal of Computing 23 3 (1994) 617-632