Loading…
A novel distributed scheduling algorithm for time-critical multi-agent systems
This paper describes enhancements made to the distributed performance impact (PI) algorithm and presents the results of trials that show how the work advances the stateof- the-art in single-task, single-robot, time-extended, multiagent task assignment for time-critical missions. The improvement boos...
Saved in:
Main Authors: | , , |
---|---|
Format: | Default Conference proceeding |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/2134/18840 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
_version_ | 1818172661426028544 |
---|---|
author | Amanda Whitbrook Qinggang Meng Paul Chung |
author_facet | Amanda Whitbrook Qinggang Meng Paul Chung |
author_sort | Amanda Whitbrook (1249524) |
collection | Figshare |
description | This paper describes enhancements made to the distributed performance impact (PI) algorithm and presents the results of trials that show how the work advances the stateof- the-art in single-task, single-robot, time-extended, multiagent 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 ε-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 consensusbased 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. |
format | Default Conference proceeding |
id | rr-article-9405209 |
institution | Loughborough University |
publishDate | 2015 |
record_format | Figshare |
spelling | rr-article-94052092015-01-01T00:00:00Z A novel distributed scheduling algorithm for time-critical multi-agent systems Amanda Whitbrook (1249524) Qinggang Meng (1257072) Paul Chung (1250973) Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified This paper describes enhancements made to the distributed performance impact (PI) algorithm and presents the results of trials that show how the work advances the stateof- the-art in single-task, single-robot, time-extended, multiagent 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 ε-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 consensusbased 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. 2015-01-01T00:00:00Z Text Conference contribution 2134/18840 https://figshare.com/articles/conference_contribution/A_novel_distributed_scheduling_algorithm_for_time-critical_multi-agent_systems/9405209 CC BY-NC-ND 4.0 |
spellingShingle | Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified Amanda Whitbrook Qinggang Meng Paul Chung A novel distributed scheduling algorithm for time-critical multi-agent systems |
title | A novel distributed scheduling algorithm for time-critical multi-agent systems |
title_full | A novel distributed scheduling algorithm for time-critical multi-agent systems |
title_fullStr | A novel distributed scheduling algorithm for time-critical multi-agent systems |
title_full_unstemmed | A novel distributed scheduling algorithm for time-critical multi-agent systems |
title_short | A novel distributed scheduling algorithm for time-critical multi-agent systems |
title_sort | novel distributed scheduling algorithm for time-critical multi-agent systems |
topic | Other information and computing sciences not elsewhere classified untagged Information and Computing Sciences not elsewhere classified |
url | https://hdl.handle.net/2134/18840 |