Author:
Li Yi,Liu Mingxin,Luan Peiyu,Zhou Junchi
Abstract
Abstract
In this article, two environment modeling methods and two methods are used to solve the pursuit-evasion game problem. It separately introduces several methods based on graph and geometry – all with the same goal of reducing the time for the pursuers to capture all the evaders. Corresponding experiment data and results are also listed. Furthermore, two methods, the differential game theory-based method and decentralization will also be introduced to solve the pursuit-evasion games. These two methods will be discussed under the condition of multiple pursuers and evaders. The number of pursuers is equal to the number of evaders. The experiment results, as well as the difference between the two methods, will be shown specifically in the following chapters.
Subject
General Physics and Astronomy
Reference26 articles.
1. A game of cops and robbers played on products of graphs;Neufeld;Discrete Mathematics,1998
2. On the numerical solution of a free end-time homicidal chauffeur game;Campana;ESAIM: Proceedings and Surveys,2021
3. On the complexity of searching for an evader with a faster pursuer;Shkurti,2013
4. An evasion game on a graph;Haslegrave;Discrete Mathematics,2014
5. Leader-following cluster consensus as a graphical differential game with a Nash equilibrium solution;Naleini;IEEE Control Systems Letters,2022
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献