Abstract
At present, the problem of multi-agent pursuit-evasion game is usually studied in the two-dimensional plane, and the movement of the evader is not constrained. At the same time, one problem is that it is difficult for traditional methods to design control strategy without accurate model. Therefore, this paper proposes a multi-agent evasion algorithm based on deep Q-network when the motion of evader is constrained in three-dimensional space. The proposed algorithm is a decentralized algorithm, and the evader obtains the desired evasive strategy by exploring and learning the environment. In order to improve the learning efficiency, the agent strategy learning is divided into two stages according to the difficulty of the task, and the corresponding reward function is designed to guide the agent to explore the desired evasive strategy. The simulation results show that the effect of the evasive strategy obtained by the algorithm is stable, and the algorithm has generalization ability, and the evader can successfully evade after changing certain initial position conditions.
| Translated title of the contribution | Multi-Agent Evasion Algorithm Design Based on Deep Q-Network |
|---|---|
| Original language | Chinese (Traditional) |
| Pages (from-to) | 40-47 |
| Number of pages | 8 |
| Journal | Navigation, Positionng and Timing |
| Volume | 9 |
| Issue number | 6 |
| DOIs | |
| State | Published - Nov 2022 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'Multi-Agent Evasion Algorithm Design Based on Deep Q-Network'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver