Reliable, distributed scheduling and rescheduling for time-critical, multiagent systems

5.00
Hdl Handle:
http://hdl.handle.net/10545/621610
Title:
Reliable, distributed scheduling and rescheduling for time-critical, multiagent systems
Authors:
Whitbrook, Amanda ( 0000-0001-8199-0402 ) ; Meng, Qinggang; Chung, Paul W. H.
Abstract:
This paper addresses two main problems with many heuristic task allocation approaches – solution trapping in local minima and static structure. The existing distributed task allocation algorithm known as PI (Performance Impact) is used as the vehicle for developing solutions to these problems as it has been shown to out-perform the state-of-the-art Consensus Based Bundle Algorithm (CBBA) for time-critical problems with tight deadlines, but is both static and sub-optimal with a tendency towards trapping in local minima. The paper describes two additional modules that are easily integrated with PI. The first extends the algorithm to permit dynamic online rescheduling in real time, and the second boosts performance by introducing an additional soft max action selection procedure that increases the algorithm’s exploratory properties. The paper demonstrates the effectiveness of the dynamic rescheduling module and shows that the average time taken to perform tasks can be reduced by up to 9% when the soft max module is used. In addition, the solution of some problems that baseline PI cannot handle is enabled by the second module. These developments represent a significant advance in the state-of-the-art for multi-agent, time-critical task assignment.
Affiliation:
University of Derby; Loughborough University
Citation:
Whitbrook, A. et al (2017) 'Reliable, Distributed Scheduling and Rescheduling for Time-Critical, Multiagent Systems' , IEEE Transactions on Automation Science and Engineering, DOI: 10.1109/TASE.2017.2679278
Publisher:
IEEE
Journal:
IEEE Transactions on Automation Science and Engineering
Issue Date:
26-Apr-2017
URI:
http://hdl.handle.net/10545/621610
DOI:
10.1109/TASE.2017.2679278
Additional Links:
http://ieeexplore.ieee.org/document/7907248/
Type:
Article
Language:
en
ISSN:
1545-5955
EISSN:
15583783
Sponsors:
EPSRC
Appears in Collections:
Department of Electronics, Computing & Maths

Full metadata record

DC FieldValue Language
dc.contributor.authorWhitbrook, Amandaen
dc.contributor.authorMeng, Qinggangen
dc.contributor.authorChung, Paul W. H.en
dc.date.accessioned2017-05-10T18:17:02Z-
dc.date.available2017-05-10T18:17:02Z-
dc.date.issued2017-04-26-
dc.identifier.citationWhitbrook, A. et al (2017) 'Reliable, Distributed Scheduling and Rescheduling for Time-Critical, Multiagent Systems' , IEEE Transactions on Automation Science and Engineering, DOI: 10.1109/TASE.2017.2679278en
dc.identifier.issn1545-5955-
dc.identifier.doi10.1109/TASE.2017.2679278-
dc.identifier.urihttp://hdl.handle.net/10545/621610-
dc.description.abstractThis paper addresses two main problems with many heuristic task allocation approaches – solution trapping in local minima and static structure. The existing distributed task allocation algorithm known as PI (Performance Impact) is used as the vehicle for developing solutions to these problems as it has been shown to out-perform the state-of-the-art Consensus Based Bundle Algorithm (CBBA) for time-critical problems with tight deadlines, but is both static and sub-optimal with a tendency towards trapping in local minima. The paper describes two additional modules that are easily integrated with PI. The first extends the algorithm to permit dynamic online rescheduling in real time, and the second boosts performance by introducing an additional soft max action selection procedure that increases the algorithm’s exploratory properties. The paper demonstrates the effectiveness of the dynamic rescheduling module and shows that the average time taken to perform tasks can be reduced by up to 9% when the soft max module is used. In addition, the solution of some problems that baseline PI cannot handle is enabled by the second module. These developments represent a significant advance in the state-of-the-art for multi-agent, time-critical task assignment.en
dc.description.sponsorshipEPSRCen
dc.language.isoenen
dc.publisherIEEEen
dc.relation.urlhttp://ieeexplore.ieee.org/document/7907248/en
dc.rightsArchived with thanks to IEEE Transactions on Automation Science and Engineeringen
dc.subjectAdaptive systemsen
dc.subjectAuction-based schedulingen
dc.subjectDistributed task allocationen
dc.subjectMulti-agent systemsen
dc.titleReliable, distributed scheduling and rescheduling for time-critical, multiagent systemsen
dc.typeArticleen
dc.identifier.eissn15583783-
dc.contributor.departmentUniversity of Derbyen
dc.contributor.departmentLoughborough Universityen
dc.identifier.journalIEEE Transactions on Automation Science and Engineeringen
All Items in UDORA are protected by copyright, with all rights reserved, unless otherwise indicated.