{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T14:48:33Z","timestamp":1777128513125,"version":"3.51.4"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T00:00:00Z","timestamp":1747612800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,5,19]]},"DOI":"10.1109\/icra55743.2025.11127663","type":"proceedings-article","created":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T17:28:56Z","timestamp":1756834136000},"page":"6609-6615","source":"Crossref","is-referenced-by-count":1,"title":["ICBSS: An Improved Algorithm for Multi-Agent Combinatorial Path Finding"],"prefix":"10.1109","author":[{"given":"Zheng","family":"Chen","sequence":"first","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University,Hangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changlin","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,Key Laboratory of Precision and Intelligent Chemistry,Department of Precision Machinery and Precision Instrumentation,Hefei,Anhui,China,230026"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiran","family":"Ni","sequence":"additional","affiliation":[{"name":"College of Computer Science and Technology, Zhejiang University,Hangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3266993"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICAR58858.2023.10406648"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MITS.2021.3100062"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989376"},{"key":"ref5","article-title":"Reciprocal collision avoidance and multi-agent navigation for video games","volume-title":"Multiagent Pathfinding","volume":"WS-12-10","author":"Snape","year":"2012"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32695-0_50"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-014-9259-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8592"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref16","first-page":"757","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS. International Foundation for Autonomous Agents and Multiagent Systems","author":"H\u00f6nig","year":"2018"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/MRS60187.2023.10416794"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v17i1.31551"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17472"},{"key":"ref20","first-page":"1464","article-title":"Multiagent path finding for precedence-constrained goal sequences","volume-title":"21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)","author":"Zhang","year":"2022"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812020"},{"key":"ref22","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"Applegate","year":"2007"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-021-00101-z"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-16711-0_7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3390\/a14010021"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/net.21830"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref29","volume-title":"Exact and anytime heuristic search for the time dependent traveling salesman problem with time windows. (recherche heuristique exacte et anytime pour r\u00e9soudre le time dependent traveling salesman problem with time windows)","author":"Fontaine","year":"2024"}],"event":{"name":"2025 IEEE International Conference on Robotics and Automation (ICRA)","location":"Atlanta, GA, USA","start":{"date-parts":[[2025,5,19]]},"end":{"date-parts":[[2025,5,23]]}},"container-title":["2025 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11127273\/11127223\/11127663.pdf?arnumber=11127663","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T06:48:55Z","timestamp":1756882135000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11127663\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,19]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icra55743.2025.11127663","relation":{},"subject":[],"published":{"date-parts":[[2025,5,19]]}}}