Multi-robot routing with linear decreasing rewards over time

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2009, Pages 958-963

  Ekici, Ali ^a   Keskinocak, Pinar ^a   Koenig, Sven ^b  

^a Georgia Institute of Technology   (United States)

^b University of Southern California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DELIVERY OF GOODS; MIXED-INTEGER PROGRAMS; MULTIROBOTS; NP-HARD; TRAVEL COSTS;

COMPUTATIONAL COMPLEXITY; CONTRACTS; INDUSTRIAL ROBOTS; MULTIPURPOSE ROBOTS; ROBOTICS; SALES;

INTEGER PROGRAMMING;

EID: 70350367539     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2009.5152803     Document Type: Conference Paper

References (16)

1. A. Archer, A. Levin and D. Williamson, "Faster Approximation Algorithms for the Minimum Latency Problem", in Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 88-96, 2003.
2. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan and M. Sudan, "The Minimum Latency Problem", in Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 163-171, 1994.
3. A. Blum, S. Chawla, D. Karger, T. Lane, A. Meyerson and M. Minkoff, "Approximation Algorithms for Orienteering and Discounted-Reward TSP", SIAM Journal on Computing, vol.37, no.2, pp. 653-670, 2007.
4. K. Chaudhuri, B. Godfrey, S. Rao and K. Talwar, "Paths, Trees, and Minimum Latency Tours", in Proceedins of the Symposium on Foundations of Computer Science (FOCS), pp. 36-45, 2003.
5. E. Erkut and J. Zhang, "The Maximum Collection Problem with Time Dependent Rewards", Naval Research Logistics, vol.43, pp. 749-763, 1996.
6. M. Fischetti, G. Laporte and S. Martello, "The Delivery Man Problem and Cumulative Matroids", Operations Research, vol.41, no.6, pp. 1055-1064, 1993.
7. M. Garey and D. Johnson, "Computers and Intractability: A Guide to the Theory of NP-Completeness", 1979, Freeman and Company, New York.
8. B. Gerkey and M. Mataric, "Sold!: Auction Methods for Multi-Robot Coordination", IEEE Transactions on Robotics and Automation, vol.18, no.5, pp. 758-768, 2002.
9. M. Goemans and J. Kleinberg, "An Improved Approximation Ratio for the Minimum Latency Problem", Mathematical Programming, vol.82, pp. 114-124, 1998.
10. S. Koenig, C. Tovey, M. Lagoudakis, V. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, A. Meyerson and S. Jain, "The Power of Sequential Single-Item Auctions for Agent Coordination", in Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 1625-1629, 2006.
11. M. Lagoudakis, V. Markakis, D. Kempe, P. Keskinocak, A. Kleywegt, S. Koenig, C. Tovey, A. Meyerson and S. Jain, "Auction-Based Multi-Robot Routing", in Proceedings of the International Conference on Robotics: Science and Systems (RoSS), pp. 343-350, 2005.
12. J. Melvin, P. Keskinocak, S. Koenig, C. Tovey and B. Ozkaya, "Multi-Robot Routing with Rewards and Disjoint Time Windows", in Proceedings of the IEEE International Conference on Intelligent Robots and Systems (IROS), pp. 2332-2337, 2007.
13. S. Sahni and T. Gonzales, "P-complete Problems and Approximate Solutions", in Proceedings of the Annual Symposium on Switching and Automata Theory, pp. 28-32, 1974.
14. S. Sariel, T. Balch and J. Stack, "Empirical Evaluation of Auction-Based Coordination of AUVs in a Realistic Simulated Mine Countermeasure Task", in Proceedings of the International Symposium on Distributed Autonomous Robotic Systems (DARS), pp. 197-206, 2006.
15. B. Wu, "Polynomial Time Algorithms for some Minimum Latency Problems", Information Processing Letters, vol.75, pp. 225-229, 2000.
16. R. Zlot, A. Stentz, M. Dias and S. Thayer, "Multi-Robot Exploration Controlled by a Market Economy", in Proceedings of the International Conference on Robotics and Automation (ICRA), pp. 3016-3023, 2002.