A novel distributed scheduling algorithm for maximizing total task allocations of multi-UAV systems.
Saved in:
| Title: | A novel distributed scheduling algorithm for maximizing total task allocations of multi-UAV systems. |
|---|---|
| Authors: | Yan, Shaokun1,2 (AUTHOR) yanshaokun@foxmail.com, Xia, Yuanqing1,3 (AUTHOR) xia_yuanqing@bit.edu.cn, Zhai, Dihua1 (AUTHOR) zhaidih@bit.edu.cn |
| Source: | Journal of Supercomputing. Jul2025, Vol. 81 Issue 10, p1-31. 31p. |
| Subjects: | Constraint algorithms, Distributed algorithms, Computational complexity, Algorithms, Mathematics |
| Abstract: | This paper addresses the task allocation problem by maximizing the number of successfully allocated tasks through two decentralized algorithms: a novel performance impact algorithm with new scoring (PINS) and a local exchange performance impact algorithm (LEPI). PINS employs a scoring strategy that expands task inclusion capability in the task inclusion phase while ensuring tasks, once assigned, remain allocated. LEPI extends PINS by incorporating task reassignment to optimize allocations further. Evaluated in a deadline-limited and fuel-constrained simulated rescue scenario, both algorithms outperform existing methods and provably converge to conflict-free assignments within a finite number of iterations. Extensive simulations illustrate LEPI's superiority, improving the number of allocated tasks by up to 3.82% over the benchmarks; however, LEPI's substantially higher computational complexity limits its large-scale applicability. Conversely, PINS achieves up to 2.32% performance gains with computational complexity comparable to the Performance Impact (PI) algorithm. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Supercomputing is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | This paper addresses the task allocation problem by maximizing the number of successfully allocated tasks through two decentralized algorithms: a novel performance impact algorithm with new scoring (PINS) and a local exchange performance impact algorithm (LEPI). PINS employs a scoring strategy that expands task inclusion capability in the task inclusion phase while ensuring tasks, once assigned, remain allocated. LEPI extends PINS by incorporating task reassignment to optimize allocations further. Evaluated in a deadline-limited and fuel-constrained simulated rescue scenario, both algorithms outperform existing methods and provably converge to conflict-free assignments within a finite number of iterations. Extensive simulations illustrate LEPI's superiority, improving the number of allocated tasks by up to 3.82% over the benchmarks; however, LEPI's substantially higher computational complexity limits its large-scale applicability. Conversely, PINS achieves up to 2.32% performance gains with computational complexity comparable to the Performance Impact (PI) algorithm. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09208542 |
| DOI: | 10.1007/s11227-025-07598-9 |
