{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T22:20:49Z","timestamp":1769725249522,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,11,8]],"date-time":"2024-11-08T00:00:00Z","timestamp":1731024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,11,8]]},"DOI":"10.1145\/3716895.3716937","type":"proceedings-article","created":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T12:08:41Z","timestamp":1742558921000},"page":"230-234","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Search multi-unmanned ship path planning algorithm"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4316-4391","authenticated-orcid":false,"given":"Longxiang","family":"Wang","sequence":"first","affiliation":[{"name":"Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3733-1203","authenticated-orcid":false,"given":"Kai","family":"Sun","sequence":"additional","affiliation":[{"name":"Chongqing University, Chongqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2507-3576","authenticated-orcid":false,"given":"Fan","family":"Tang","sequence":"additional","affiliation":[{"name":"Wuhan University of Science and Technology, Wuhan, Hubei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-0967-1716","authenticated-orcid":false,"given":"Yuanpeng","family":"Song","sequence":"additional","affiliation":[{"name":"China University of Petroleum (Beijing), Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1981-5552","authenticated-orcid":false,"given":"Chuyu","family":"Wang","sequence":"additional","affiliation":[{"name":"Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-9840-6672","authenticated-orcid":false,"given":"Xu","family":"Feng","sequence":"additional","affiliation":[{"name":"Xinjiang Agricultural University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6369-5659","authenticated-orcid":false,"given":"Fengbo","family":"Zhou","sequence":"additional","affiliation":[{"name":"Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7586-702X","authenticated-orcid":false,"given":"Ziteng","family":"Guo","sequence":"additional","affiliation":[{"name":"Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4540-4121","authenticated-orcid":false,"given":"Zeyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Xinjiang University, Urumqi, Xinjiang, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,3,21]]},"reference":[{"key":"e_1_3_3_1_1_2","volume-title":"AAAI Conference on Artificial Intelligence and Inter active Digital Entertainment.","author":"SILVER D.","year":"2005","unstructured":"SILVER D. Cooperative pathfinding[ C]\/\/Proceedings ofthe AAAI Conference on Artificial Intelligence and Inter active Digital Entertainment. 2005, 1(1) : 117 - 122."},{"key":"e_1_3_3_1_2_2","first-page":"406","volume-title":"IEEE","author":"YI Z","year":"2019","unstructured":"YI Z, YANAN Z, XIANGDE L. Path planning of multiple industrial mobile robots based on ant colony algorithm[C]\/\/2019 16th International Computer Conference onWavelet Active Media Technology and Information Pro-cessing. IEEE, 2019, 406 - 409."},{"key":"e_1_3_3_1_3_2","first-page":"354","volume-title":"IEEE","author":"XIA C","year":"2018","unstructured":"XIA C, YUDI A. Multi\u2014UAV path planning based onimproved neural network[C]\/\/2018 Chinese Control AndDecision Conference (CCDC) . IEEE, 2018, 354 - 359."},{"key":"e_1_3_3_1_4_2","volume-title":"The in-creasing cost tree search for optimal multi-agent pathfinding[J]. Artificial intelligence","author":"SHARON G","year":"2013","unstructured":"SHARON G, STERN R, GOLDENBERG M, et al. The in-creasing cost tree search for optimal multi-agent pathfinding[J]. Artificial intelligence, 2013, 195, 470 - 495."},{"key":"e_1_3_3_1_5_2","volume-title":"Efficient traj ectory planning for multiple non holonomic mobile robots via prioritized trajectory optimization[C]\/\/IEEE Robotics and Automation Letters","author":"LI J","year":"2021","unstructured":"LI J, RAN M, XIE L. Efficient traj ectory planning for multiple non holonomic mobile robots via prioritized trajectory optimization[C]\/\/IEEE Robotics and Automation Letters, 2021, 6 ( 2 ), 405 - 412."},{"key":"e_1_3_3_1_6_2","first-page":"40","article-title":"Conflict basedsearch for optimal multiagent pathfinding[J]","volume":"219","author":"SHARON G","year":"2015","unstructured":"SHARON G, STERN R, FELNER A, et al. Conflict basedsearch for optimal multiagent pathfinding[J]. ArtificialIntelligence, 2015, 219, 40 - 66.","journal-title":"ArtificialIntelligence"},{"key":"e_1_3_3_1_7_2","volume-title":"Suboptimal va-riants of the conflict based search algorithm for the multi agent pathfinding problem[C]\/\/Proceedings of the Inter-national Symposium on Combinatorial Search","author":"BARER M","year":"2014","unstructured":"BARER M, SHARON G, STERN R, et al. Suboptimal va-riants of the conflict based search algorithm for the multi agent pathfinding problem[C]\/\/Proceedings of the Inter-national Symposium on Combinatorial Search. 2014, 5(1), 19 - 27."},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103662"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"crossref","unstructured":"LI J RUML W KOENIG S. Eecbs:a bounded-suboptimalsearch for multi-agent path finding[ C]\/\/Proceedings ofthe AAAI Conference on Artificial Intelligence. 2021 35(14) 12353 - 12362.","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"e_1_3_3_1_10_2","volume-title":"Nested ECBS forbounded-suboptimal multi-agent path finding[C]\/\/In IJCAI 20 Workshop on Multi-Agent Path Finding","author":"CHAN S H","year":"2020","unstructured":"CHAN S H, LI J, HARABOR D, et al. Nested ECBS forbounded-suboptimal multi-agent path finding[C]\/\/In IJCAI 20 Workshop on Multi-Agent Path Finding, 2020."}],"event":{"name":"ICAICE 2024: The 5th International Conference on Artificial Intelligence and Computer Engineering","location":"Wuhu Shandong China","acronym":"ICAICE 2024"},"container-title":["Proceedings of the 5th International Conference on Artificial Intelligence and Computer Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716895.3716937","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3716895.3716937","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:19:16Z","timestamp":1750295956000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3716895.3716937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,8]]},"references-count":10,"alternative-id":["10.1145\/3716895.3716937","10.1145\/3716895"],"URL":"https:\/\/doi.org\/10.1145\/3716895.3716937","relation":{},"subject":[],"published":{"date-parts":[[2024,11,8]]},"assertion":[{"value":"2025-03-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}