Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
5-2024
Abstract
Pursuit-evasion games (PEGs) model interactions between a team of pursuers and an evader in graph-based environments such as urban street networks. Recent advancements have demonstrated the effectiveness of the pre-training and fine-tuning paradigm in Policy-Space Response Oracles (PSRO) to improve scalability in solving large-scale PEGs. However, these methods primarily focus on specific PEGs with fixed initial conditions that may vary substantially in real-world scenarios, which significantly hinders the applicability of the traditional methods. To address this issue, we introduce Grasper, a GeneRAlist purSuer for Pursuit-Evasion pRoblems, capable of efficiently generating pursuer policies tailored to specific PEGs. Our contributions are threefold: First, we present a novel architecture that offers high-quality solutions for diverse PEGs, comprising critical components such as (i) a graph neural network (GNN) to encode PEGs into hidden vectors, and (ii) a hypernetwork to generate pursuer policies based on these hidden vectors. As a second contribution, we develop an efficient three-stage training method involving (i) a pre-pretraining stage for learning robust PEG representations through self-supervised graph learning techniques like graph masked auto-encoder (Graph-MAE), (ii) a pre-training stage utilizing heuristic-guided multi-task pre-training (HMP) where heuristic-derived reference policies (e.g., through Dijkstra’s algorithm) regularize pursuer policies, and (iii) a fine-tuning stage that employs PSRO to generate pursuer policies on designated PEGs. Finally, we perform extensive experiments on synthetic and real-world maps, showcasing Grasper’s significant superiority over baselines in terms of solution quality and generalizability. We demonstrate that Grasper provides a versatile approach for solving pursuit-evasion problems across a broad range of scenarios, enabling practical deployment in real-world situations.
Keywords
Generalizability, Hypernetwork, Multi-Agent Learning, Pre-training and Fine-tuning, Pursuit-Evasion Problems
Discipline
Artificial Intelligence and Robotics | Numerical Analysis and Scientific Computing
Research Areas
Intelligent Systems and Optimization
Areas of Excellence
Digital transformation
Publication
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024: Auckland, May 6-10
First Page
1147
Last Page
1155
Publisher
IFAAMAS
City or Country
San Diego
Citation
LI, Pengdeng; LI, Shuxin; WANG, Xinrun; CERNY, Jakub; ZHANG, Youzhi; McAleer, Stephen; CHAN, Hau; and AN, Bo.
Grasper: A generalist pursuer for pursuit-evasion problems. (2024). Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2024: Auckland, May 6-10. 1147-1155.
Available at: https://ink.library.smu.edu.sg/sis_research/9130
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Included in
Artificial Intelligence and Robotics Commons, Numerical Analysis and Scientific Computing Commons