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

Title: A heuristic distributed task allocation method for multi-vehicle multi-task problems and its application to search and rescue scenario
Authors: Zhao, Wanqing
Meng, Qinggang
Chung, Paul Wai Hing
Issue Date: 2016
Publisher: IEEE
Citation: ZHAO, W., MENG, Q. and CHUNG, P.W.H., 2016. A heuristic distributed task allocation method for multi-vehicle multi-task problems and its application to search and rescue scenario. IEEE Transactions on Cybernetics, 46(4), pp.902-915.
Abstract: Using distributed task allocation methods for cooperating multivehicle systems is becoming increasingly attractive. However, most effort is placed on various specific experimental work and little has been done to systematically analyze the problem of interest and the existing methods. In this paper, a general scenario description and a system configuration are first presented according to search and rescue scenario. The objective of the problem is then analyzed together with its mathematical formulation extracted from the scenario. Considering the requirement of distributed computing, this paper then proposes a novel heuristic distributed task allocation method for multivehicle multitask assignment problems. The proposed method is simple and effective. It directly aims at optimizing the mathematical objective defined for the problem. A new concept of significance is defined for every task and is measured by the contribution to the local cost generated by a vehicle, which underlies the key idea of the algorithm. The whole algorithm iterates between a task inclusion phase, and a consensus and task removal phase, running concurrently on all the vehicles where local communication exists between them. The former phase is used to include tasks into a vehicle’s task list for optimizing the overall objective, while the latter is to reach consensus on the significance value of tasks for each vehicle and to remove the tasks that have been assigned to other vehicles. Numerical simulations demonstrate that the proposed method is able to provide a conflict-free solution and can achieve outstanding performance in comparison with the consensus-based bundle algorithm.
Description: This work is licensed under a Creative Commons Attribution 3.0 License. For more information, see http://creativecommons.org/licenses/by/3.0/
Sponsor: This work was supported by the U.K. Engineering and Physical Sciences Research Council Autonomous and Intelligent Systems Programme [grant number EP/J011525/1] with BAE Systems as the leading industrial partner.
Version: Published
DOI: 10.1109/TCYB.2015.2418052
URI: https://dspace.lboro.ac.uk/2134/17343
Publisher Link: http://dx.doi.org/10.1109/TCYB.2015.2418052
ISSN: 2168-2267
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
Chung_07084641.pdfPublished version1.74 MBAdobe PDFView/Open


SFX Query

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