{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,7]],"date-time":"2026-11-07T19:08:31Z","timestamp":1794078511741,"version":"4.8.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000},"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,8,17]]},"DOI":"10.1109\/case58245.2025.11163822","type":"proceedings-article","created":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T17:24:07Z","timestamp":1758648247000},"page":"16-23","source":"Crossref","is-referenced-by-count":1,"title":["Interaction-Minimizing Roadmap Optimization for High-Density Multi-Agent Path Finding"],"prefix":"10.1109","author":[{"given":"S\u00f6ren","family":"Weindel","sequence":"first","affiliation":[{"name":"Institute of Automation and Information Systems, Technical University of Munich,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan","family":"Wilch","sequence":"additional","affiliation":[{"name":"Institute of Automation and Information Systems, Technical University of Munich,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"K\u00f6gel","sequence":"additional","affiliation":[{"name":"Research and Development, SOMIC Ver-Packungsmaschinen,Amerang,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Xiao","sequence":"additional","affiliation":[{"name":"Research and Development, Planar Motor Incorporated,Richmond,Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Birgit","family":"Vogel-Heuser","sequence":"additional","affiliation":[{"name":"Institute of Automation and Information Systems, Technical University of Munich,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-56345-9"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2022.01.361"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/s0217595924400153"},{"key":"ref4","first-page":"837","article-title":"Lifelong Multi-Agent Path Finding for Online Pickup and Delivery Tasks","volume-title":"AAMAS 2017","author":"Ma"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.32604\/cmes.2022.019770"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8140"},{"key":"ref10","first-page":"740","article-title":"ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding","volume-title":"IJCAI 2015","author":"Boyarski"},{"key":"ref11","article-title":"Conflict-Based Search with Optimal Task Assignment","volume-title":"AAMAS 2018","author":"H\u00f6nig"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103662"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2012.11.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911406761"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942789"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICARA55094.2022.9738574"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2023.3323099"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-51532-8_30"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-44051-0_47"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICCDA.2010.5541300"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22216-0_62"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3341105.3373916"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1115\/1.4048817"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-13.1.743"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380211102"}],"event":{"name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2025,8,17]]},"end":{"date-parts":[[2025,8,21]]}},"container-title":["2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11163731\/11163732\/11163822.pdf?arnumber=11163822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T14:52:22Z","timestamp":1759243942000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11163822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,17]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/case58245.2025.11163822","relation":{},"subject":[],"published":{"date-parts":[[2025,8,17]]}}}