{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T14:13:43Z","timestamp":1784211223871,"version":"3.55.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T00:00:00Z","timestamp":1759276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1109\/lra.2025.3597871","type":"journal-article","created":{"date-parts":[[2025,8,11]],"date-time":"2025-08-11T17:44:53Z","timestamp":1754934293000},"page":"9742-9749","source":"Crossref","is-referenced-by-count":6,"title":["Congestion Mitigation Path Planning for Large-Scale Multi-Agent Navigation in Dense Environments"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3663-8375","authenticated-orcid":false,"given":"Takuro","family":"Kato","sequence":"first","affiliation":[{"name":"TICO-AIST Cooperative Research Laboratory for Advanced Logistics, National Institute of Advanced Industrial Science and Technology (AIST), Ibaraki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9491-7367","authenticated-orcid":false,"given":"Keisuke","family":"Okumura","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Center, National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1220-6124","authenticated-orcid":false,"given":"Yoko","family":"Sasaki","sequence":"additional","affiliation":[{"name":"Artificial Intelligence Research Center, National Institute of Advanced Industrial Science and Technology (AIST), Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Naoya","family":"Yokomachi","sequence":"additional","affiliation":[{"name":"TICO-AIST Cooperative Research Laboratory for Advanced Logistics, National Institute of Advanced Industrial Science and Technology (AIST), Ibaraki, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.07.009"},{"key":"ref2","first-page":"608","article-title":"Planning, scheduling and monitoring for airport surface operations","volume-title":"Proc. AAAI Workshop","author":"Morris","year":"2016"},{"key":"ref3","article-title":"Scalable rail planning and replanning with soft deadlines","author":"Chen","year":"2023"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2502"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2004.842408"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9800-z"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v38i18.30054"},{"issue":"1","key":"ref9","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"Wurman","year":"2008","journal-title":"AI Mag."},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19457-3_1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103752"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17344"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v34i1.31522"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2017.2656241"},{"key":"ref15","first-page":"563","article-title":"Conflict-based search","volume-title":"Proc. AAAI Conf. Artif. Intell.","author":"Sharon","year":"2012"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26377"},{"key":"ref18","first-page":"3067","article-title":"Improved solvers for bounded-suboptimal multi-agent path finding","volume-title":"Proc. Int. Joint Conf. Artif. Intell","author":"Cohen","year":"2016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2024\/35"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812357"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48891.2023.10161554"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref24","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref25","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","volume-title":"Proc. Int. Joint Conf. Auton. Agents Multiagent Syst","author":"Ma","year":"2017"},{"key":"ref26","first-page":"1","article-title":"The league of robot runners competition: Goals, designs, and implementation","volume-title":"Proc. ICAPS 2024 Syst. Demonstration Track","author":"Chan","year":"2024"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2024.3455787"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7083369\/11125679\/11122641.pdf?arnumber=11122641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T01:03:57Z","timestamp":1755911037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11122641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10]]},"references-count":27,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/lra.2025.3597871","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10]]}}}