{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T03:16:45Z","timestamp":1779333405932,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2021M702030"],"award-info":[{"award-number":["2021M702030"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-025-07377-6","type":"journal-article","created":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T14:44:50Z","timestamp":1748097890000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["CoMP-LG: coordinate-aware multi-agent pathfinding via learnable communication graphs"],"prefix":"10.1007","volume":"81","author":[{"given":"Qingling","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cui","family":"Ni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen","family":"Rong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chongguang","family":"Ren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianchang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoyuan","family":"Shan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,24]]},"reference":[{"key":"7377_CR1","doi-asserted-by":"crossref","unstructured":"Cho S H, Shin W J, Ahn J et al (2024) Dynamic crane scheduling with reinforcement learning for a steel coil warehouse. In: 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE. pp 16545\u201316552","DOI":"10.1109\/ICRA57147.2024.10610858"},{"key":"7377_CR2","doi-asserted-by":"publisher","first-page":"16314","DOI":"10.1109\/JIOT.2024.3352658","volume":"11","author":"Z Zhao","year":"2024","unstructured":"Zhao Z, Cheng J, Liang J et al (2024) Order picking optimization in smart warehouses with human-robot collaboration. IEEE Internet Things J 11:16314","journal-title":"IEEE Internet Things J"},{"key":"7377_CR3","doi-asserted-by":"publisher","first-page":"107087","DOI":"10.1016\/j.ocecoaman.2024.107087","volume":"251","author":"X Chen","year":"2024","unstructured":"Chen X, Liu S, Zhao J et al (2024) Autonomous port management based AGV path planning and optimization via an ensemble reinforcement learning framework. Ocean Coast Manag 251:107087","journal-title":"Ocean Coast Manag"},{"key":"7377_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2023.104480","volume":"167","author":"ST Chen","year":"2023","unstructured":"Chen ST, Ermi\u015f G, Sharpanskykh A (2023) Multi-agent planning and coordination for automated aircraft ground handling. Robot Auton Syst 167:104480","journal-title":"Robot Auton Syst"},{"key":"7377_CR5","doi-asserted-by":"crossref","unstructured":"Stern R, Sturtevant N, Felner A et al (2019) Multi-agent pathfinding: definitions, variants, and benchmarks. In: Proceedings of the International Symposium on Combinatorial Search. 10(1): 151\u2013158","DOI":"10.1609\/socs.v10i1.18510"},{"key":"7377_CR6","doi-asserted-by":"crossref","unstructured":"Ferner C, Wagner G, Choset H (2013) ODrM* optimal multirobot path planning in low dimensional search spaces. In: 2013 IEEE International Conference on Robotics and Automation. IEEE. pp 3854\u20133859","DOI":"10.1109\/ICRA.2013.6631119"},{"key":"7377_CR7","doi-asserted-by":"publisher","first-page":"104570","DOI":"10.1016\/j.robot.2023.104570","volume":"171","author":"H Tu","year":"2024","unstructured":"Tu H, Deng Y, Li Q et al (2024) Improved RRT global path planning algorithm based on bridge test. Robot Auton Syst 171:104570","journal-title":"Robot Auton Syst"},{"key":"7377_CR8","doi-asserted-by":"publisher","first-page":"113039","DOI":"10.1016\/j.nucengdes.2024.113039","volume":"420","author":"ME Miyombo","year":"2024","unstructured":"Miyombo ME, Liu Y, Mulenga CM et al (2024) Optimal path planning in a real-world radioactive environment: a comparative study of A-star and Dijkstra algorithms. Nucl Eng Des 420:113039","journal-title":"Nucl Eng Des"},{"key":"7377_CR9","doi-asserted-by":"crossref","unstructured":"Tajbakhsh A, Biegler LT, Johnson AM (2024) Conflict-based model predictive control for scalable multi-robot motion planning. In: 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE. pp 14562\u201314568","DOI":"10.1109\/ICRA57147.2024.10611078"},{"key":"7377_CR10","doi-asserted-by":"crossref","unstructured":"Fu S, Huang H, Wang S (2024) Research on robot path planning technology by integrating particle swarm optimization algorithm and DWA algorithm. In: 2024 10th International Conference on Control, Automation and Robotics (ICCAR). IEEE. pp 147\u2013152","DOI":"10.1109\/ICCAR61844.2024.10569525"},{"key":"7377_CR11","doi-asserted-by":"crossref","unstructured":"Li Q, Gama F, Ribeiro A et al (2020) Graph neural networks for decentralized multi-robot path planning. In: 2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE. pp 11785\u201311792","DOI":"10.1109\/IROS45743.2020.9341668"},{"key":"7377_CR12","doi-asserted-by":"crossref","unstructured":"Ma J, Lian D (2022) Attention-cooperated reinforcement learning for multi-agent path planning. In: International Conference on Database Systems for Advanced Applications. Cham: Springer International Publishing. pp 272\u2013290","DOI":"10.1007\/978-3-031-11217-1_20"},{"key":"7377_CR13","doi-asserted-by":"publisher","first-page":"107631","DOI":"10.1016\/j.engappai.2023.107631","volume":"129","author":"L Zhang","year":"2024","unstructured":"Zhang L, Cai Z, Yan Y et al (2024) Multi-agent policy learning-based path planning for autonomous mobile robots. Eng Appl Artif Intell 129:107631","journal-title":"Eng Appl Artif Intell"},{"key":"7377_CR14","unstructured":"Nayak S, Choi K, Ding W et al (2023) Scalable multi-agent reinforcement learning through intelligent information aggregation. In: International Conference on Machine Learning. PMLR. pp 25817\u201325833"},{"key":"7377_CR15","unstructured":"Gilmer J, Schoenholz SS, Riley PF et al (2017) Neural message passing for quantum chemistry. In: International Conference on Machine Learning. PMLR. pp 1263\u20131272."},{"key":"7377_CR16","doi-asserted-by":"crossref","unstructured":"Park H, Neville J (2019) Exploiting interaction links for node classification with deep graph neural networks. In: IJCAI. 2019. pp 3223\u20133230","DOI":"10.24963\/ijcai.2019\/447"},{"key":"7377_CR17","unstructured":"Jiang J, Lu Z (2018) Learning attentional communication for multi-agent cooperation. Advances in neural information processing systems. Vol. 31"},{"key":"7377_CR18","unstructured":"Wang Y, Zhong F, Xu J et al (2021) Tom2c: target-oriented multi-agent communication and cooperation with theory of mind. arXiv preprint arXiv:2111.09189"},{"issue":"2","key":"7377_CR19","doi-asserted-by":"publisher","first-page":"455","DOI":"10.3390\/electronics13020455","volume":"13","author":"T Liao","year":"2024","unstructured":"Liao T, Chen F, Wu Y et al (2024) Research on path planning with the integration of adaptive a-star algorithm and improved dynamic window approach. Electronics 13(2):455","journal-title":"Electronics"},{"issue":"3","key":"7377_CR20","doi-asserted-by":"publisher","first-page":"035212","DOI":"10.1088\/2631-8695\/ad61bd","volume":"6","author":"W Ayalew","year":"2024","unstructured":"Ayalew W, Menebo M, Merga C et al (2024) Optimal path planning using bidirectional rapidly-exploring random tree star-dynamic window approach (BRRT*-DWA) with adaptive Monte Carlo localization (AMCL) for mobile robot. Eng Res Express 6(3):035212","journal-title":"Eng Res Express"},{"key":"7377_CR21","doi-asserted-by":"publisher","first-page":"115203","DOI":"10.1016\/j.oceaneng.2023.115203","volume":"284","author":"F Zhang","year":"2023","unstructured":"Zhang F, Liu Y, Du L et al (2023) A rule-based maritime traffic situation complex network approach for enhancing situation awareness of vessel traffic service operators. Ocean Eng 284:115203","journal-title":"Ocean Eng"},{"key":"7377_CR22","doi-asserted-by":"publisher","first-page":"7661","DOI":"10.1109\/ACCESS.2023.3349093","volume":"12","author":"C Lauretti","year":"2024","unstructured":"Lauretti C, Tamantini C, Zollo L (2024) A new dmp scaling method for robot learning by demonstration and application to the agricultural domain. IEEE Access 12:7661\u20137673","journal-title":"IEEE Access"},{"key":"7377_CR23","doi-asserted-by":"publisher","first-page":"103848","DOI":"10.1016\/j.apor.2023.103848","volume":"142","author":"A Martorell-Torres","year":"2024","unstructured":"Martorell-Torres A, Guerrero-Sastre J, Oliver-Codina G (2024) Coordination of marine multi robot systems with communication constraints. Appl Ocean Res 142:103848","journal-title":"Appl Ocean Res"},{"key":"7377_CR24","doi-asserted-by":"publisher","first-page":"7182","DOI":"10.1109\/LRA.2024.3412589","volume":"9","author":"X Luo","year":"2024","unstructured":"Luo X, Xu S, Liu R et al (2024) Decomposition-based hierarchical task allocation and planning for multi-robots under hierarchical temporal logic specifications. IEEE Robot Autom Lett 9:7182","journal-title":"IEEE Robot Autom Lett"},{"issue":"3","key":"7377_CR25","doi-asserted-by":"publisher","first-page":"2378","DOI":"10.1109\/LRA.2019.2903261","volume":"4","author":"G Sartoretti","year":"2019","unstructured":"Sartoretti G, Kerr J, Shi Y et al (2019) Primal: pathfinding via reinforcement and imitation multi-agent learning. IEEE Robot Autom Lett 4(3):2378\u20132385","journal-title":"IEEE Robot Autom Lett"},{"issue":"2","key":"7377_CR26","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1109\/LRA.2021.3062803","volume":"6","author":"M Damani","year":"2021","unstructured":"Damani M, Luo Z, Wenzel E et al (2021) PRIMAL $ _2 $: Pathfinding via reinforcement and imitation multi-agent learning-lifelong. IEEE Robot Autom Lett 6(2):2666\u20132673","journal-title":"IEEE Robot Autom Lett"},{"key":"7377_CR27","doi-asserted-by":"crossref","unstructured":"Liu Z, Chen B, Zhou H et al (2020) Mapper: multi-agent path planning with evolutionary reinforcement learning in mixed dynamic environments. In: 2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE. pp 11748\u201311754","DOI":"10.1109\/IROS45743.2020.9340876"},{"issue":"4","key":"7377_CR28","doi-asserted-by":"publisher","first-page":"6932","DOI":"10.1109\/LRA.2020.3026638","volume":"5","author":"B Wang","year":"2020","unstructured":"Wang B, Liu Z, Li Q et al (2020) Mobile robot path planning in dynamic environments through globally guided reinforcement learning. IEEE Robot Autom Lett 5(4):6932\u20136939","journal-title":"IEEE Robot Autom Lett"},{"key":"7377_CR29","doi-asserted-by":"crossref","unstructured":"He C, Yang T, Duhan T et al (2024) Alpha: attention-based long-horizon pathfinding in highly-structured areas. In: 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE. pp 14576\u201314582","DOI":"10.1109\/ICRA57147.2024.10611301"},{"key":"7377_CR30","doi-asserted-by":"crossref","unstructured":"Li W, Chen H, Jin B et al (2022) Multi-agent path finding with prioritized communication learning. In: 2022 International Conference on Robotics and Automation (ICRA). IEEE. pp 10695\u201310701","DOI":"10.1109\/ICRA46639.2022.9811643"},{"issue":"4","key":"7377_CR31","doi-asserted-by":"publisher","first-page":"0404-1","DOI":"10.52396\/JUSTC-2022-0048","volume":"53","author":"J Ma","year":"2023","unstructured":"Ma J, Lian D (2023) Learning attention-based strategies to cooperate for multi-agent path finding. JUSTC 53(4):0404-1\u20130404-13","journal-title":"JUSTC"},{"key":"7377_CR32","doi-asserted-by":"crossref","unstructured":"Wang Y, Xiang B, Huang S et al (2023) Scrimp: scalable communication for reinforcement-and imitation-learning-based multi-agent pathfinding. In: 2023 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS). IEEE. pp 9301\u20139308","DOI":"10.1109\/IROS55552.2023.10342305"},{"key":"7377_CR33","doi-asserted-by":"crossref","unstructured":"Ma Z, Luo Y, Ma H (2021) Distributed heuristic multi-agent path finding with communication. In: 2021 IEEE International Conference on Robotics and Automation (ICRA). IEEE. pp 8699\u20138705","DOI":"10.1109\/ICRA48506.2021.9560748"},{"issue":"16","key":"7377_CR34","first-page":"17346","volume":"38","author":"S Ding","year":"2024","unstructured":"Ding S, Du W, Ding L et al (2024) Learning efficient and robust multi-agent communication via graph information bottleneck. Proc AAAI Conf Artif Intell 38(16):17346\u201317353","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"05","key":"7377_CR35","first-page":"7236","volume":"34","author":"H Ryu","year":"2020","unstructured":"Ryu H, Shin H, Park J (2020) Multi-agent actor-critic with hierarchical graph attention network. Proc AAAI Conf Artif Intell 34(05):7236\u20137243","journal-title":"Proc AAAI Conf Artif Intell"},{"issue":"2","key":"7377_CR36","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s10458-022-09580-8","volume":"36","author":"J Sheng","year":"2022","unstructured":"Sheng J, Wang X, Jin B et al (2022) Learning structured communication for multi-agent reinforcement learning. Auton Agent Multi-Agent Syst 36(2):50","journal-title":"Auton Agent Multi-Agent Syst"},{"issue":"3","key":"7377_CR37","doi-asserted-by":"publisher","first-page":"5533","DOI":"10.1109\/LRA.2021.3077863","volume":"6","author":"Q Li","year":"2021","unstructured":"Li Q, Lin W, Liu Z et al (2021) Message-aware graph attention networks for large-scale multi-robot path planning. IEEE Robot Autom Lett 6(3):5533\u20135540","journal-title":"IEEE Robot Autom Lett"},{"issue":"05","key":"7377_CR38","first-page":"7211","volume":"34","author":"Y Liu","year":"2020","unstructured":"Liu Y, Wang W, Hu Y et al (2020) Multi-agent game abstraction via graph attention neural network. Proc AAAI Conf Artif Intell 34(05):7211\u20137218","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"7377_CR39","unstructured":"Das A, Gervet T, Romoff J et al (2019) Tarmac: targeted multi-agent communication. In: International Conference on Machine Learning. PMLR. pp 1538\u20131546"},{"key":"7377_CR40","doi-asserted-by":"crossref","unstructured":"Xiong Y, Li Z, Chen Y et al (2024) Efficient deformable convnets: rethinking dynamic and sparse operator for vision applications. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. pp 5652\u20135661","DOI":"10.1109\/CVPR52733.2024.00540"},{"key":"7377_CR41","doi-asserted-by":"crossref","unstructured":"Hou Q, Zhou D, Feng J (2021) Coordinate attention for efficient mobile network design. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. pp 13713\u201313722.","DOI":"10.1109\/CVPR46437.2021.01350"},{"key":"7377_CR42","doi-asserted-by":"crossref","unstructured":"Ouyang D, He S, Zhang G et al (2023) Efficient multi-scale attention module with cross-spatial learning. In: ICASSP 2023\u20132023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE. pp 1\u20135","DOI":"10.1109\/ICASSP49357.2023.10096516"},{"key":"7377_CR43","doi-asserted-by":"crossref","unstructured":"Hou Z, Yu B, Tao D (2022) Batchformer: learning to explore sample relationships for robust representation learning. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition. pp 7256\u20137266","DOI":"10.1109\/CVPR52688.2022.00711"},{"key":"7377_CR44","unstructured":"Hu S, Shen L, Zhang Y et al (2024) Learning multi-agent communication from graph modeling perspective. arXiv preprint arXiv:2405.08550"},{"issue":"10","key":"7377_CR45","doi-asserted-by":"publisher","first-page":"2219","DOI":"10.1142\/S0218127497001618","volume":"7","author":"LO Chua","year":"1997","unstructured":"Chua LO (1997) CNN: a vision of complexity. Int J Bifurc Chaos 7(10):2219\u20132425","journal-title":"Int J Bifurc Chaos"},{"key":"7377_CR46","unstructured":"Veli\u010dkovi\u0107 P, Cucurull G, Casanova A et al (2017) Graph attention networks. arXiv preprint arXiv:1710.10903"},{"key":"7377_CR47","first-page":"24261","volume":"34","author":"IO Tolstikhin","year":"2021","unstructured":"Tolstikhin IO, Houlsby N, Kolesnikov A et al (2021) Mlp-mixer: an all-mlp architecture for vision. Adv Neural Inf Process Syst 34:24261\u201324272","journal-title":"Adv Neural Inf Process Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07377-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-025-07377-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-025-07377-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T14:45:01Z","timestamp":1748097901000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-025-07377-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,24]]},"references-count":47,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2025,6]]}},"alternative-id":["7377"],"URL":"https:\/\/doi.org\/10.1007\/s11227-025-07377-6","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,24]]},"assertion":[{"value":"1 May 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"The work described has not been published before, and its publication has been approved by the responsible authorities at the institution where the work is carried out.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The codes used during the current study are available from the corresponding author on reasonable request.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}],"article-number":"881"}}