.png){kind=icon}
Return
Potential game for dynamic task allocation in multi-agent system
.png){kind=icon}
PRE
AI
DOI：10.1016/j.isatra.2020.03.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a novel distributed multi-agent dynamic task allocation method based on the potential game. Consider that the workload of each task may vary in a dynamic environment, and the communication range of each agent constrains the selectable action set. Each agent makes the decision independently based on the local information. Firstly, a potential game-theoretic framework is designed. Any Nash equilibrium is guaranteed at least 50% of suboptimality, and the best Nash equilibrium is the optimal solution. Furthermore, a time variant constrained binary log-linear learning algorithm is provided and the global convergence is proved under certain conditions. Finally, numerical results show that the proposed algorithm performs well in terms of global searching ability, and verify the effectiveness of the distributed dynamic task allocation approach. (C) 2020 ISA. Published by Elsevier Ltd. All rights reserved.
Keywords:
Dynamic task allocation
Multi-agent system
Game theory
Log-linear learning
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
6.1K
Citations:
2.0W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveTask allocation for maximizing reliability of distributed systems: A simulated annealing approach
PREAI
ShareSave
View more