icrafinal.pdf (838 kB)
Increasing allocated tasks with a time minimization algorithm for a search and rescue scenario
conference contribution
posted on 2015-09-24, 09:15 authored by Joanna Turner, Qinggang MengQinggang Meng, Gerald SchaeferGerald SchaeferRescue missions require both speed to meet strict time constraints and maximum use of resources. This study presents a Task Swap Allocation (TSA) algorithm that increases vehicle allocation with respect to the state-of-the-art consensus-based bundle algorithm and one of its extensions, while meeting time constraints. The novel idea is to enable an online reconfiguration of task allocation among distributed and networked vehicles. The proposed strategy reallocates tasks among vehicles to create feasible spaces for unallocated tasks, thereby optimizing the total number of allocated tasks. The algorithm is shown to be efficient with respect to previous methods because changes are made to a task list only once a suitable space in a schedule has been identified. Furthermore, the proposed TSA can be employed as an extension for other distributed task allocation algorithms with similar constraints to improve performance by escaping local optima and by reacting to dynamic environments.
Funding
This work was supported by EPSRC (grant number EP/J011525/1) with BAE Systems as the leading industrial partner.
History
School
- Science
Department
- Computer Science
Published in
IEEE Int. on Robotics and Automation (ICRA)Citation
TURNER, J., MENG, Q. and SCHAEFER, G., 2015. Increasing allocated tasks with a time minimization algorithm for a search and rescue scenario. IN: Proceedings of the 2015 IEEE International Conference on Robotics and Automation (ICRA), Seattle, USA, May 26-30, 2015, pp. 3401-3407.Publisher
© IEEEVersion
- AM (Accepted Manuscript)
Publication date
2015Notes
© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other worksPublisher version
Language
- en