基于关注网络的多智能体时空信息聚合寻径图。

IF 2.6 3区 综合性期刊 Q1 MULTIDISCIPLINARY SCIENCES
PLoS ONE Pub Date : 2025-06-16 eCollection Date: 2025-01-01 DOI:10.1371/journal.pone.0318981
Qingling Zhang, Peng Wang, Cui Ni, Xianchang Liu
{"title":"基于关注网络的多智能体时空信息聚合寻径图。","authors":"Qingling Zhang, Peng Wang, Cui Ni, Xianchang Liu","doi":"10.1371/journal.pone.0318981","DOIUrl":null,"url":null,"abstract":"<p><p>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 information fusion method is crucial for addressing these challenges. Information fusion expands the observation range of each agent, thereby enhancing the overall performance of the MAPF system. This paper explores a fusion approach in both temporal and spatial dimensions based on Graph Attention Networks (GAT). Since MAPF is a long-horizon, continuous task, leveraging historical observation dependencies is key for predicting future actions. Initially, historical observations are fused by incorporating a Gated Recurrent Unit (GRU) with a Convolutional Neural Network (CNN), extracting local observations to form an encoder. Next, GAT is used to enable inter-agent communication, utilizing the stability of the scaled dot-product aggregation to merge agents' information. Finally, the aggregated data is decoded into the agent's final action strategy, effectively solving the partial observability problem. Experimental results show that the proposed method improves accuracy and time efficiency by 24.5%, 47%, and 37.5%, 73% over GNN and GAT, respectively, under varying map sizes and agent densities. Notably, the performance enhancement is more pronounced in larger maps, highlighting the algorithm's scalability.</p>","PeriodicalId":20189,"journal":{"name":"PLoS ONE","volume":"20 6","pages":"e0318981"},"PeriodicalIF":2.6000,"publicationDate":"2025-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12169555/pdf/","citationCount":"0","resultStr":"{\"title\":\"Graph attention networks based multi-agent path finding via temporal-spatial information aggregation.\",\"authors\":\"Qingling Zhang, Peng Wang, Cui Ni, Xianchang Liu\",\"doi\":\"10.1371/journal.pone.0318981\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>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 information fusion method is crucial for addressing these challenges. Information fusion expands the observation range of each agent, thereby enhancing the overall performance of the MAPF system. This paper explores a fusion approach in both temporal and spatial dimensions based on Graph Attention Networks (GAT). Since MAPF is a long-horizon, continuous task, leveraging historical observation dependencies is key for predicting future actions. Initially, historical observations are fused by incorporating a Gated Recurrent Unit (GRU) with a Convolutional Neural Network (CNN), extracting local observations to form an encoder. Next, GAT is used to enable inter-agent communication, utilizing the stability of the scaled dot-product aggregation to merge agents' information. Finally, the aggregated data is decoded into the agent's final action strategy, effectively solving the partial observability problem. Experimental results show that the proposed method improves accuracy and time efficiency by 24.5%, 47%, and 37.5%, 73% over GNN and GAT, respectively, under varying map sizes and agent densities. Notably, the performance enhancement is more pronounced in larger maps, highlighting the algorithm's scalability.</p>\",\"PeriodicalId\":20189,\"journal\":{\"name\":\"PLoS ONE\",\"volume\":\"20 6\",\"pages\":\"e0318981\"},\"PeriodicalIF\":2.6000,\"publicationDate\":\"2025-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12169555/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"PLoS ONE\",\"FirstCategoryId\":\"103\",\"ListUrlMain\":\"https://doi.org/10.1371/journal.pone.0318981\",\"RegionNum\":3,\"RegionCategory\":\"综合性期刊\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2025/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q1\",\"JCRName\":\"MULTIDISCIPLINARY SCIENCES\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"PLoS ONE","FirstCategoryId":"103","ListUrlMain":"https://doi.org/10.1371/journal.pone.0318981","RegionNum":3,"RegionCategory":"综合性期刊","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/1 0:00:00","PubModel":"eCollection","JCR":"Q1","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

摘要

有效的多智能体寻径算法必须在遵守约束的前提下,高效地为多个智能体规划路径,保证从起点到目标的安全导航。然而,由于部分可观察性,智能体常常难以确定最佳策略。因此,开发一种健壮的信息融合方法对于应对这些挑战至关重要。信息融合扩大了各个agent的观察范围,从而提高了MAPF系统的整体性能。本文探讨了一种基于图注意力网络(GAT)的时间和空间融合方法。由于MAPF是一个长期的、连续的任务,利用历史观察依赖性是预测未来行动的关键。最初,通过将门控循环单元(GRU)与卷积神经网络(CNN)相结合,将历史观测数据融合,提取局部观测数据形成编码器。其次,使用GAT实现代理间通信,利用缩放点积聚合的稳定性来合并代理的信息。最后,将聚合的数据解码为智能体的最终动作策略,有效地解决了部分可观察性问题。实验结果表明,在不同的地图大小和agent密度下,该方法比GNN和GAT分别提高了24.5%、47%和37.5%、73%的准确率和时间效率。值得注意的是,在较大的映射中,性能增强更为明显,突出了算法的可伸缩性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

Graph attention networks based multi-agent path finding via temporal-spatial information aggregation.

Graph attention networks based multi-agent path finding via temporal-spatial information aggregation.

Graph attention networks based multi-agent path finding via temporal-spatial information aggregation.

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 information fusion method is crucial for addressing these challenges. Information fusion expands the observation range of each agent, thereby enhancing the overall performance of the MAPF system. This paper explores a fusion approach in both temporal and spatial dimensions based on Graph Attention Networks (GAT). Since MAPF is a long-horizon, continuous task, leveraging historical observation dependencies is key for predicting future actions. Initially, historical observations are fused by incorporating a Gated Recurrent Unit (GRU) with a Convolutional Neural Network (CNN), extracting local observations to form an encoder. Next, GAT is used to enable inter-agent communication, utilizing the stability of the scaled dot-product aggregation to merge agents' information. Finally, the aggregated data is decoded into the agent's final action strategy, effectively solving the partial observability problem. Experimental results show that the proposed method improves accuracy and time efficiency by 24.5%, 47%, and 37.5%, 73% over GNN and GAT, respectively, under varying map sizes and agent densities. Notably, the performance enhancement is more pronounced in larger maps, highlighting the algorithm's scalability.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
PLoS ONE
PLoS ONE 生物-生物学
CiteScore
6.20
自引率
5.40%
发文量
14242
审稿时长
3.7 months
期刊介绍: PLOS ONE is an international, peer-reviewed, open-access, online publication. PLOS ONE welcomes reports on primary research from any scientific discipline. It provides: * Open-access—freely accessible online, authors retain copyright * Fast publication times * Peer review by expert, practicing researchers * Post-publication tools to indicate quality and impact * Community-based dialogue on articles * Worldwide media coverage
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信