摘要
Task allocation is a critical determinant of mission success in satellite Orbital Pursuit-Evasion Games (OPEG). However, strict orbital constraints and communication latencies pose significant challenges to real-time decision-making. Existing methods often lack robustness or suffer from slow convergence. To address these issues, a Distributed Dynamic Task Allocation Algorithm (DDTAA) is proposed. First, a comprehensive game-theoretic optimization model is constructed to capture tactical advantages and long-term sustainability. Subsequently, a novel asynchronous communication architecture utilizing a local serial auction mechanism is developed. This approach enables satellites to reorganize tasks via localized information exchange, significantly reducing communication overhead. Simulations demonstrate that DDTAA reduces task reassignment cost by approximately 8.0% and achieves faster convergence in communication-constrained environments, offering a scalable solution for on-orbit autonomous coordination.
| 源语言 | 英语 |
|---|---|
| 期刊论文编号 | 605 |
| 期刊 | Cluster Computing |
| 卷 | 29 |
| 期 | 10 |
| DOI | |
| 出版状态 | 已出版 - 8月 2026 |
学术指纹
探究 'A distributed dynamic task allocation for satellite orbital pursuit-evasion game via local asynchronous communication' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver