English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/130920
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Title

Efficient Inter-Team Task Allocation in RoboCup Rescue

AuthorsPujol-Gonzalez, Marc; Cerquides, Jesús ; Meseguer, Pedro ; Rodríguez-Aguilar, Juan Antonio
KeywordsMulti agent systemS
RoboCup rescue
Task allocation
Max-Sum
Allocation problems
Inter-team coordinations
Issue Date2015
PublisherInternational Foundation for Autonomous Agents and Multiagent Systems
Citation14th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015; Istanbul Congress CenterIstanbul; Turkey; 4 May 2015 through 8 May 2015; Proceedings, vol.1, 2015, pp. 413-421
AbstractThe coordination of cooperative agents involved in rescue missions is an important open research problem. We consider the RoboCup Rescue Simulation (RCS) challenge, where teams of agents perform urban rescue operations. Previous approaches typically cast such problem as separate single-team allocation problems. However, different teams have complementary capabilities, and therefore some kind of inter-team coordination is desirable for high-quality solutions. Our contribution considers inter-team coordination using Max-Sum. We present a methodology that allows teams in RCS to efficiently assess joint allocations. Furthermore, we show how to reduce the algorithm's computational complexity from exponential to polynomial time by using Tractable High Order Potentials. To the best of our knowledge this is the first time where it has been shown that MS can be run in polynomial time in the RCS challenge without relaxing the problem. Experiments with fire brigades and police agents show that teams employing inter-team coordination are significantly more effective than uncoordinated teams. Moreover, the evaluation shows that our BMS and THOPs method achieves up to 2.5 times better results than other state-of-the-art methods. Copyright © 2015, International Foundation for Autonomous Agents and Multiagent Systems.
URIhttp://hdl.handle.net/10261/130920
ISBN978-145033769-4
ISSN15488403
Appears in Collections:(IIIA) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
AAMAS15_413-421.pdf600,47 kBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.