Abstract
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.
| Original language | English |
|---|---|
| Article number | 605 |
| Journal | Cluster Computing |
| Volume | 29 |
| Issue number | 10 |
| DOIs | |
| State | Published - Aug 2026 |
Keywords
- Asynchronous communication
- Localized auction
- Pursuit-evasion game
- Satellites
- Task allocation
Fingerprint
Dive into the research topics of 'A distributed dynamic task allocation for satellite orbital pursuit-evasion game via local asynchronous communication'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver