The multi-agent pursuit-evasion (PE) games are solved in this brief to find the best possible strategic options for every participant. In these games, numerous pursuers aim to catch numerous evaders which are trying to escape arrest. In order to determine distributed control rules for each agent, a graph-theoretic technique is used to examine how the agents with restricted sensing capabilities interact with one another. Further, the online and real-time solution of Hamilton-Jacobi-Bellman (HJB) equations is necessary to achieve the optimal actions. By introducing the $Q$ -learning technique’s policy iteration, we are able to solve this issue. Once capture, the game is over. The simulation results are shown to demonstrate the viability of the suggested techniques.
Paper
Full text
Adaptive Optimal Control via Q-Learning for Multi-Agent Pursuit-Evasion Games
Semantic Scholar · Computer Science · 2024
Abstract
The multi-agent pursuit-evasion (PE) games are solved in this brief to find the best possible strategic options for every participant. In these games, numerous pursuers aim to catch numerous evaders which are trying to escape arrest. In order to determine distributed control rules for each agent, a graph-theoretic technique is used to examine how the agents with restricted sensing capabilities interact with one another. Further, the online and real-time solution of Hamilton-Jacobi-Bellman (HJB) equations is necessary to achieve the optimal actions. By introducing the $Q$ -learning technique’s policy iteration, we are able to solve this issue. Once capture, the game is over. The simulation results are shown to demonstrate the viability of the suggested techniques.