Coordinated navigation of multi-robot systems with binary constraints

IEEE/RSJ 2010 International Conference on Intelligent Robots and Systems, IROS 2010 - Conference Proceedings

Volumn , Issue , 2010, Pages 3854-3859

  Brüggemann, Bernd ^a   Schulz, Dirk ^a  

^a FRAUNHOFER FKIE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY CONSTRAINTS; CONSTRAINT GRAPH; DISTANCE GRAPHS; GRAPH ALGORITHMS; GRAPH STRUCTURES; LARGE CLASS; LINE-OF-SIGHT; MULTI-ROBOT SYSTEMS; ROADMAP; STEINER TREES; TARGET CONFIGURATIONS;

INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; NAVIGATION; ROBOT LEARNING; TREES (MATHEMATICS);

INTELLIGENT ROBOTS;

EID: 78651507223     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IROS.2010.5652679     Document Type: Conference Paper

References (12)

1. C. Gröpl, S. Hougardy, T. Nierhoff, and H. J. Prömel. Lower bounds for approximation algorithms for the steiner tree problem. In Proceedings of 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG2001, Springer LNCS, pages 217-228. Springer Verlag, 2001.
2. Y. Guo and L. E. Parker. A distributed and optimal motion planning approach for multiple mobile robots. In Proceedings of IEEE International Conference on Robotics and Automation, pages 2612-2619, 2002.
3. F K. Hwang and D. S. Richards. Steiner tree problems. Networks, 22(l):55-89, 1992.
4. N. Kalra, D. Ferguson, and A. Stentz. Hoplites: A market-based framework for planned tight coordination in multirobot teams. In Proceedings of the IEEE International Conference on Robotics and Automation, 2005.
5. M. Lagoudakis, E. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, S. Koenig, C. Tovey, A. Meyerson, and S. Jain. Auction-based multirobot routing. In Robotics: Science and Systems, pages 343-350. Citeseer, 2005.
6. S. M. Lavalle and S. A. Hutchinson. Optimal motion planning for multiple robots having independent goals. IEEE Trans, on Robotics and Automation, 14:912-925, 1996.
7. K. Mehlhorn. A faster approximation algorithm for the steiner problem in graphs. Inf. Process. Lett., 27(3): 125-128, 1988.
8. A. R. Mosteo, L. Montano, and M. G. Lagoudakis. Multi-robot routing under limited communication range. In IEEE International Conference on Robotics and Automation (ICRA) 2008, 2008.
9. A. R. Mosteo, L. Montanoand, and M. G. Lagoudakis. Guaranteedperformance multi-robot routing under limited communication range. In Distributed Autonomous Robotic Systems 8, pages 491-502. Springer Berlin Heidelberg, 2009.
10. L. Parker. Distributed intelligence: Overview of the field and its application in multi-robot systems. Journal of Physical Agents, 2(1), 2008.
11. L. E. Parker and A. Howard. Experiments with a large heterogeneous mobile robot team: Exploration, mapping, deployment and detection. International Journal of Robotics Research, 25:431-447, 2006.
12. L. E. Parker, B. Kannan, F Tang, and M. Bailey. Tightly-coupled navigation assistance in heterogeneous multi-robot teams. In Proceedings of IEEE International Conference on Intelligent Robots and Systems (IROS), pages 1016-1022, 2004.