Graph attention networks based multi-agent path finding via temporal-spatial information aggregation.
An effective Multi-Agent Path Finding (MAPF) algorithm must efficiently plan paths for multiple agents while adhering to constraints, ensuring safe navigation from start to goal. However, due to partial observability, agents often struggle to determine optimal strategies. Thus, developing a robust i...
Saved in:
| Main Authors: | Qingling Zhang, Peng Wang, Cui Ni, Xianchang Liu |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2025-01-01
|
| Series: | PLoS ONE |
| Online Access: | https://doi.org/10.1371/journal.pone.0318981 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Graph attention networks based multi-agent path finding via temporal-spatial information aggregation
by: Qingling Zhang, et al.
Published: (2025-01-01) -
STGAT: Spatial–Temporal Graph Attention Neural Network for Stock Prediction
by: Ruizhe Feng, et al.
Published: (2025-04-01) -
Colored Multi-Agent Path Finding: Solving Approaches
by: Roman Barták, et al.
Published: (2021-04-01) -
Anomaly Detection Over Multi-Relational Graphs Using Graph Structure Learning and Multi-Scale Meta-Path Graph Aggregation
by: Chi Zhang, et al.
Published: (2025-01-01) -
TSMGA: Temporal-Spatial Multiscale Graph Attention Network for Remote Sensing Change Detection
by: Xiaoyang Zhang, et al.
Published: (2025-01-01)