{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T11:10:41Z","timestamp":1766056241610,"version":"3.48.0"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T00:00:00Z","timestamp":1760832000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100008047","name":"Carnegie Mellon University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008047","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,10,19]]},"DOI":"10.1109\/iros60139.2025.11246148","type":"proceedings-article","created":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T18:54:45Z","timestamp":1764269685000},"page":"14111-14117","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating Focal Search in Multi-Agent Path Finding with Tighter Lower Bounds"],"prefix":"10.1109","author":[{"given":"Yimin","family":"Tang","sequence":"first","affiliation":[{"name":"University of Southern California,Thomas Lord Department of Computer Science"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenghong","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Wisconsin–Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaoyang","family":"Li","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Koenig","sequence":"additional","affiliation":[{"name":"University of California,Irvine"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","first-page":"9","article-title":"Coordinating hundreds of cooperative, autonomous vehicles in warehouses","volume":"29","author":"Wurman","year":"2008","journal-title":"Artificial Intelligence"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6095022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v6i1.18343"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/63"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840371"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017643"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v16i1.27278"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21266"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i10.26377"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i14.17466"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/199"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v17i1.31551"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MRS60187.2023.10416794"},{"key":"ref20","first-page":"294","article-title":"Push and swap: Fast cooperative path-finding with completeness guarantees","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)","author":"Luna"},{"key":"ref21","first-page":"380","article-title":"Fast and memory-efficient multiagent pathfinding","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS)","author":"Wang"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"ref23","first-page":"668","article-title":"Complete algorithms for cooperative pathfinding problems","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI)","author":"Standley"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v25i1.13725"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103574"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"}],"event":{"name":"2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2025,10,19]]},"location":"Hangzhou, China","end":{"date-parts":[[2025,10,25]]}},"container-title":["2025 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11245651\/11245652\/11246148.pdf?arnumber=11246148","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T11:06:10Z","timestamp":1766055970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11246148\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,19]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iros60139.2025.11246148","relation":{},"subject":[],"published":{"date-parts":[[2025,10,19]]}}}