A Spatiotemporal Graph Reasoning Approach for Pursuit-Evasion Game With Communication Limits

Unmanned aerial vehicle (UAV) swarms performing encirclement tasks require reliable communications to coordinate strategies to capture the fleeter target. However, dense urban buildings can obstruct signals, causing communication disruptions, observation fluctuations, and decreased strategy efficiency. To address this problem, we propose the Relational Graph Attention Twin Delayed DDPG (RGATD3) approach. In particular, we adopt a spatiotemporal graph to represent complex state information, and a graph prediction network to anticipate missing communication data, effectively stabilizing observation fluctuations. In order to improve decision-making in complex environments, a relational graph learning mechanism is introduced, where Graph Attention Networks (GATs) extract agent features based on specific relational types, and a multi-head self-attention mechanism aggregates these features. Combined with localized detection, this approach enhances decision-making from complex observation. Additionally, well-tailored reward functions further encourage agents to restore communication and cooperation. The results indicate that RGATD3 outperforms existing state-of-the-art methods, increasing encirclement success and reducing capture time under fluctuating communication conditions.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2025-09-03
DOI
https://doi.org/10.1109/tvt.2025.3605736
Citations
4
Primary Topic
Guidance and Control Systems
Type
article
Field-Weighted Citation Impact
19.97
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Spatiotemporal Graph Reasoning Approach for Pursuit-Evasion Game With Communication Limits

Wenbo Du, Xin Zhang, Yumeng Li, Zhengzhi Yang et al.
4 citations
IEEE Transactions on Vehicular Technology
Guidance and Control Systems
19.97
article

A Spatiotemporal Graph Reasoning Approach for Pursuit-Evasion Game With Communication Limits

Wenbo Du, Xin Zhang, Yumeng Li, Zhengzhi Yang, Jingjing Wang
article en
4 citations

Abstract

Unmanned aerial vehicle (UAV) swarms performing encirclement tasks require reliable communications to coordinate strategies to capture the fleeter target. However, dense urban buildings can obstruct signals, causing communication disruptions, observation fluctuations, and decreased strategy efficiency. To address this problem, we propose the Relational Graph Attention Twin Delayed DDPG (RGATD3) approach. In particular, we adopt a spatiotemporal graph to represent complex state information, and a graph prediction network to anticipate missing communication data, effectively stabilizing observation fluctuations. In order to improve decision-making in complex environments, a relational graph learning mechanism is introduced, where Graph Attention Networks (GATs) extract agent features based on specific relational types, and a multi-head self-attention mechanism aggregates these features. Combined with localized detection, this approach enhances decision-making from complex observation. Additionally, well-tailored reward functions further encourage agents to restore communication and cooperation. The results indicate that RGATD3 outperforms existing state-of-the-art methods, increasing encirclement success and reducing capture time under fluctuating communication conditions.

IEEE Transactions on Vehicular TechnologyVol. 75(2)
Hong Kong University of Science and Technology (HK), Beihang University (CN)
Openalex Percentile: Top 1%
Guidance and Control Systems
19.97
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.