Location of Repository

Task Allocation in the RoboCup Rescue

By Ranjit Nair, Takayuki Ito, Milind Tambe and Stacy Marsella

Abstract

this paper we focus on the problem of task allocation. We have developed two approaches, a centralized combinatorial auction mechanism demonstrated at Agents-2001 and a distributed method which helped our agents finish third in RoboCup-Rescue 2001. With regard to task discovery, we use a greedy search method to explore the world- agents count the number of times they have visited each node, and attempt to visit nodes that have been visited the least number of time

Topics: itotaj aist. ac. jp
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.19.9981
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.isi.edu/teamcore/Re... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.