Online Adaptive Dynamic Programming-Based Solution of Networked Multiple-Pursuer and Single-Evader Game

• Published in: Electronics (Basel) 2022-11, Vol.11 (21), p.3583
• Main Authors: Gong, Zifeng, He, Bing, Hu, Chen, Zhang, Xiaobo, Kang, Weijie
• Format: Article
• Language: English
• Subjects: Algorithms; Approximation; Communication; Communications networks; Computer & video games; Decision making; Distance learning; Dynamic programming; Equilibrium; Game theory; Games; Internet of Things; Liapunov functions; Multi-agent systems; Multiagent systems; Navigation systems; Neural networks; Performance indices; Pursuit-evasion games; Teaching methods
• ISSN: 2079-9292; 2079-9292
• DOI: 10.3390/electronics11213583

This paper presents a new scheme for the online solution of a networked multi-agent pursuit–evasion game based on an online adaptive dynamic programming method. As a multi-agent in the game can form an Internet of Things (IoT) system, by incorporating the relative distance and the control energy as the performance index, the expression of the policies when the agents reach the Nash equilibrium is obtained and proved by the minmax principle. By constructing a Lyapunov function, the capture conditions of the game are obtained and discussed. In order to enable each agent to obtain the policy for reaching the Nash equilibrium in real time, the online adaptive dynamic programming method is used to solve the game problem. Furthermore, the parameters of the neural network are fitted by value function approximation, which avoids the difficulties of solving the Hamilton-Jacobi–Isaacs equation, and the numerical solution of the Nash equilibrium is obtained. Simulation results depict the feasibility of the proposed method for use on multi-agent pursuit–evasion games.