Advertisement

Task Allocation in the RoboCup Rescue Simulation Domain: A Short Note

  • Ranjit Nair
  • Takayuki Ito
  • Milind Tambe
  • Stacy Marsella
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2377)

Abstract

We consider the problem of disaster mitigation in the RoboCup Rescue Simulation Environment [3] to be a task allocation problem where the tasks arrive dynamically and can change in intensity. These tasks can be performed by ambulance teams, fire brigades and police forces with the help of an ambulance center, a fire station and a police office. However the agents don’t get automatically notified of the tasks as soon as they arrive and hence it is necessary for the agents to explore the simulated world to discover new tasks and to notify other agents of these.

Keywords

Police Force Task Allocation Combinatorial Auction Disaster Mitigation Communication Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. International Joint Conference on Artificial Intelligence 99(IJCAI-99), 1999.Google Scholar
  2. 2.
    Hunsberger, L., Grosz, B.: A Combinatorial Auction for Collaborative Planning. Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000), 2000.Google Scholar
  3. 3.
    Kitano, H. et al: RoboCup-Rescue: Search and Rescue for Large Scale Disasters as a Domain for Multi-Agent Research. Proceedings of IEEE Conference, SMC-99, October 1999.Google Scholar
  4. 4.
    Nair, R., Ito, T., Tambe, M., Marsella, S.: RoboCup-Rescue: A Proposal and Preliminary Experiences. Proceedings of RoboCup-Rescue Workshop, Fourth International Conference on Multi-Agent Systems(ICMAS-2000), July 2000.Google Scholar
  5. 5.
    Sandholm, T.: An Algorithm for Optimal Winner Determination in Combinatorial Auctions. International Joint Conference on Artificial Intelligence (IJCAI), 1999, pp. 542–547.Google Scholar
  6. 6.
    Sandholm, T., Suri, S.: Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations. National Conference on Artificial Intelligence (AAAI), 2000, pp. 90–97.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ranjit Nair
    • 1
  • Takayuki Ito
    • 2
  • Milind Tambe
    • 1
  • Stacy Marsella
    • 1
  1. 1.University of Southern California’s Information Sciences InstituteMarina del ReyUSA
  2. 2.Center for Knowledge ScienceJapan Advanced Institute of Science and Technology (JAIST)Japan

Personalised recommendations