Show simple item record

dc.contributor.authorWhitbrook, Amanda
dc.contributor.authorMeng, Qinggang
dc.contributor.authorChung, Paul W. H.
dc.date.accessioned2018-03-19T16:26:29Z
dc.date.available2018-03-19T16:26:29Z
dc.date.issued2015-12-17
dc.identifier.citationAmanda Whitbrook, Qinggang Meng, Paul W. H. Chung, 2015. “A Novel Distributed Task Allocation Algorithm for Urban Search and Rescue”. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2015), Hamburg, Germany, pp. 6451-6488en
dc.identifier.isbn9781479999941
dc.identifier.doi10.1109/IROS.2015.7354299
dc.identifier.urihttp://hdl.handle.net/10545/622387
dc.description.abstractThis paper describes enhancements made to the distributed performance impact (PI) algorithm and presents the results of trials that show how the work advances the state-of-the-art in single-task, single-robot, time-extended, multi-agent task assignment for time-critical missions. The improvement boosts performance by integrating the architecture with additional action selection methods that increase the exploratory properties of the algorithm (either soft max or e-greedy task selection). It is demonstrated empirically that the average time taken to perform rescue tasks can reduce by up to 8% and solution of some problems that baseline PI cannot handle is enabled. Comparison with the consensus-based bundle algorithm (CBBA) also shows that both the baseline PI algorithm and the enhanced versions are superior. All test problems center around a team of heterogeneous, autonomous vehicles conducting rescue missions in a 3-dimensional environment, where a number of different tasks must be carried out in order to rescue a known number of victims that is always more than the number of available vehicles.
dc.description.sponsorshipEPSRCen
dc.language.isoenen
dc.publisherIEEEen
dc.relation.urlhttp://ieeexplore.ieee.org/document/7354299/en
dc.subjectTask allocation algorithmsen
dc.subjectDistributed task allocationen
dc.subjectMulti-agent schedulingen
dc.subjectHeuristic algorithmsen
dc.subjectTime critical schedulingen
dc.titleA novel distributed scheduling algorithm for time-critical multi-agent systems.en
dc.typeMeetings and Proceedingsen
dc.contributor.departmentLoughborough Universityen
dc.identifier.journalProceedings of the International Conference on Intelligent Robots and Systems (IROS)en
html.description.abstractThis paper describes enhancements made to the distributed performance impact (PI) algorithm and presents the results of trials that show how the work advances the state-of-the-art in single-task, single-robot, time-extended, multi-agent task assignment for time-critical missions. The improvement boosts performance by integrating the architecture with additional action selection methods that increase the exploratory properties of the algorithm (either soft max or e-greedy task selection). It is demonstrated empirically that the average time taken to perform rescue tasks can reduce by up to 8% and solution of some problems that baseline PI cannot handle is enabled. Comparison with the consensus-based bundle algorithm (CBBA) also shows that both the baseline PI algorithm and the enhanced versions are superior. All test problems center around a team of heterogeneous, autonomous vehicles conducting rescue missions in a 3-dimensional environment, where a number of different tasks must be carried out in order to rescue a known number of victims that is always more than the number of available vehicles.


This item appears in the following Collection(s)

Show simple item record