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/33188

Title: Addressing robustness in time-critical, distributed, task allocation algorithms
Authors: Whitbrook, Amanda
Meng, Qinggang
Chung, Paul Wai Hing
Keywords: Heuristic algorithms
Multi-agent systems
Distributed task allocation
Auction-based scheduling
Robust optimization
Issue Date: 2018
Publisher: Springer © The Author(s)
Citation: WHITBROOK, A., MENG, Q. and CHUNG, P.W.H., 2018. Addressing robustness in time-critical, distributed, task allocation algorithms. Applied Intelligence, 49 (1), pp.1–15.
Abstract: The aim of this work is to produce and test a robustness module (ROB-M) that can be generally applied to distributed, multi-agent task allocation algorithms, as robust versions of these are scarce and not well-documented in the literature. ROB-M is developed using the Performance Impact (PI) algorithm, as this has previously shown good results in deterministic trials. Different candidate versions of the module are thus bolted on to the PI algorithm and tested using two different task allocation problems under simulated uncertain conditions, and results are compared with baseline PI. It is shown that the baseline does not handle uncertainty well; the task-allocation success rate tends to decrease linearly as degree of uncertainty increases. However, when PI is run with one of the candidate robustness modules, the failure rate becomes very low for both problems, even under high simulated uncertainty, and so its architecture is adopted for ROB-M and also applied to MIT’s baseline Consensus Based Bundle Algorithm (CBBA) to demonstrate its flexibility. Strong evidence is provided to show that ROB-M can work effectively with CBBA to improve performance under simulated uncertain conditions, as long as the deterministic versions of the problems can be solved with baseline CBBA. Furthermore, the use of ROB-M does not appear to increase mean task completion time in either algorithm, and only 100 Monte Carlo samples are required compared to 10,000 in MIT’s robust version of the CBBA algorithm. PI with ROB-M is also tested directly against MIT’s robust algorithm and demonstrates clear superiority in terms of mean numbers of solved tasks.
Description: This is an Open Access Article. It is published by Springer under the Creative Commons Attribution 4.0 International License (CC BY). Full details of this licence are available at: http://creativecommons.org/licenses/by/4.0/
Sponsor: This work was supported by EPSRC (grant number EP/J011525/1) with BAE Systems as the leading industrial partner.
Version: Published
DOI: 10.1007/s10489-018-1169-3
URI: https://dspace.lboro.ac.uk/2134/33188
Publisher Link: https://doi.org/10.1007/s10489-018-1169-3
ISSN: 0924-669X
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
Whitbrook_et_al-2018-Applied_Intelligence.pdfPublished version1.86 MBAdobe PDFView/Open

 

SFX Query

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