Task Allocation in the RoboCup Rescue Simulation Domain: A Short Note
We consider the problem of disaster mitigation in the RoboCup Rescue Simulation Environment  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.
KeywordsPolice Force Task Allocation Combinatorial Auction Disaster Mitigation Communication Constraint
Unable to display preview. Download preview PDF.
- 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.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.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.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.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.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