2018
DOI: 10.1007/s10489-018-1169-3
|View full text |Cite
|
Sign up to set email alerts
|

Addressing robustness in time-critical, distributed, task allocation algorithms

Abstract: The aim of this work is to produce and test a robustness module (ROB-M) that can be generally applied to distributed, multi-agent task allocation algorithms, as robust versions of these are scarce and not well-documented in the literature. ROB-M is developed using the Performance Impact (PI) algorithm, as this has previously shown good results in deterministic trials. Different candidate versions of the module are thus bolted on to the PI algorithm and tested using two different task allocation problems under … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(9 citation statements)
references
References 34 publications
0
9
0
Order By: Relevance
“…The PI-MaxAssignment was proposed in [38] to maximize task allocations by shifting the assignments to create feasible slots for unassigned tasks. To improve the robustness of PI algorithm, Whitbrook et al [39] proposed three variants and validated the significant performance of them compared with a robust version of CBBA.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The PI-MaxAssignment was proposed in [38] to maximize task allocations by shifting the assignments to create feasible slots for unassigned tasks. To improve the robustness of PI algorithm, Whitbrook et al [39] proposed three variants and validated the significant performance of them compared with a robust version of CBBA.…”
Section: Related Workmentioning
confidence: 99%
“…In addition, the auction-based algorithms [44,45,46] are another kind of distributed method that has been applied to solve ST-SR-TA problems and have been shown to be able to efficiently produce suboptimal solutions, as they employ greedy-based strategies in their task inclusion phase. This reason also applies to the CBBA [25] since a market-based decision strategy is utilized as the mechanism for the decentralized [36], and its modifications can only provide suboptimal solutions [9,39,38,37].…”
Section: Computational Complexity and Optimalitymentioning
confidence: 99%
“…Therefore, multi-UAV multi-target assignment is critical to air warfare. The objective assignment belongs to NP-hard combinatorial optimization problem [5]. The idea of solving it is to construct an assignment model and then calculate the model.…”
Section: Introductionmentioning
confidence: 99%
“…Multi UAV task allocation belongs to NP-hard combinatorial optimization problem [4]. This problem is mainly considered from the construction of problem model and the solution of model [5].…”
Section: Introductionmentioning
confidence: 99%