J. Melvin, P. Keskinocak, S. Koenig, C. Tovey and B. Yuksel Ozkaya. Multi-Robot Routing with Rewards and Disjoint Time Windows. In Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), pages 2332-2337, 2007.

Abstract: Multiple robots are often faster and more fault-tolerant than single robots for applications such as planetary exploration and search and rescue. We study applications where robots move in two-dimensional terrain and have to visit targets of given priorities during given time windows that do not overlap. We analyze the complexity of these coordination tasks and, where possible, use techniques from operations research to develop coordination methods that are efficient and optimize the team performance. We then develop auction-based coordination methods that build on these results and show experimentally that they run in seconds and achieve good team performance for NP-hard coordination tasks.

Download the paper in pdf.

Many publishers do not want authors to make their papers available electronically after the papers have been published. Please use the electronic versions provided here only if hardcopies are not yet available. If you have comments on any of these papers, please send me an email! Also, please send me your papers if we have common interests.

This page was automatically created by a bibliography maintenance system that was developed as part of an undergraduate research project, advised by Sven Koenig.