Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/28490

Title: Fast consensus for fully distributed multi-agent task allocation
Authors: Turner, Joanna
Meng, Qinggang
Schaefer, Gerald
Soltoggio, Andrea
Keywords: Distributed task allocation
Auction-based scheduling
Multi-agent systems
Heuristic algorithms
Issue Date: 2018
Publisher: © ACM
Citation: TURNER, J. ... et al, 2018. Fast consensus for fully distributed multi-agent task allocation. IN: Proceedings of SAC 2018: Symposium on Applied Computing, Pau, France, 9-13 April 2018, pp.832-839.
Abstract: In distributed multi-agent task allocation problems, the time to find a solution and a guarantee of reaching a solution, i.e. an execution plan, is critical to ensure a fast response. The problem is made more difficult by time constraints on tasks and on agents, which may prevent some tasks from being executed. This paper proposes a new distributed consensus-based task allocation algorithm that reduces convergence time with respect to previous methods, i.e. the time required for the network of agents to agree on a task allocation, while maximising the number of allocated tasks. The novel idea is to reduce the time to reach consensus among agents by using a hierarchy or rank-based conflict resolution among agents. Unlike other existing algorithms, this method enables different agents to construct their task schedules using any insertion heuristic, and still guarantee convergence. Simulation results demonstrate that the proposed approach can allocate a greater number of tasks in a shorter time than an established baseline method. Additionally, the analysis delineates dependencies between optimal insertion strategies and number of tasks per agent, providing insights for further optimisation strategies.
Description: © ACM 2018. This is the author's version of the work. It is posted here for your personal use. Not for redistribution. The definitive Version of Record was published in Proceedings of SAC 2018: Symposium on Applied Computing, http://dx.doi.org/10.1145/3167132.3167224.
Version: Accepted for publication
DOI: 10.1145/3167132.3167224
URI: https://dspace.lboro.ac.uk/2134/28490
Publisher Link: https://doi.org/10.1145/3167132.3167224
ISBN: 9781450351911
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
fast-consensus-fully (2).pdfAccepted version874.94 kBAdobe PDFView/Open

 

SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.