{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:56:56Z","timestamp":1770541016936,"version":"3.49.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2120219"],"award-info":[{"award-number":["2120219"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2120529"],"award-info":[{"award-number":["2120529"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tase.2024.3466183","type":"journal-article","created":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T17:33:40Z","timestamp":1727804020000},"page":"7590-7605","source":"Crossref","is-referenced-by-count":4,"title":["A Bounded Sub-Optimal Approach for Multi-Agent Combinatorial Path Finding"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2880-8653","authenticated-orcid":false,"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[{"name":"UM-SJTU Joint Institute, Shanghai Jiao Tong University, Shanghai, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9223-7456","authenticated-orcid":false,"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[{"name":"Mechanical Engineering Department, Texas A&M University, College Station, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5434-7945","authenticated-orcid":false,"given":"Howie","family":"Choset","sequence":"additional","affiliation":[{"name":"Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, USA"}]}],"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":"AI Mag."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2623642"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.6028\/NIST.IR.8022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197527"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29350-4_56"},{"key":"ref6","volume-title":"The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)","author":"Applegate","year":"2007"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2023.3266993"},{"key":"ref9","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"Stern","year":"2019","journal-title":"arXiv:1906.08291"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2010.938844"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00070-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022039"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103574"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21162"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s43069-021-00101-z"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(91)90016-I"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2011.5991534"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.11.010"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90138-Y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TRA.2002.805653"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2004.1310000"},{"key":"ref28","volume-title":"Combinatorial optimization: Exact and approximate algorithms","author":"Trevisan","year":"2011"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/321958.321975"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.02.001"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.12.014"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2371918"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v6i1.18343"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18501"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636683"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3183183"},{"key":"ref39","first-page":"1","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proc. Int. Joint Conf. Auto. Agents Multiagent Syst.","author":"H\u00f6nig"},{"key":"ref40","first-page":"1144","article-title":"Optimal target assignment and path finding for teams of agents","volume-title":"Proc. Int. Conf. Auto. Agents Multiagent Syst.","author":"Ma"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/169"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v12i1.18582"},{"key":"ref43","first-page":"1464","article-title":"Multi-agent path finding for precedence-constrained goal sequences","volume-title":"Proc. 21st Int. Conf. Auto. Agents Multiagent Syst.","author":"Zhang"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812020"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref46","first-page":"1","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","volume-title":"Proc. Conf. Auto. Agents Multiagent Syst.","author":"Ma"},{"key":"ref47","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","volume-title":"Proc. Int. Joint Conf. Auton. Agents Multiagent Syst. (AAMAS)","author":"Liu"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968096"},{"issue":"9","key":"ref50","doi-asserted-by":"crossref","first-page":"7987","DOI":"10.1109\/LRA.2024.3436333","article-title":"DMS\u2217: Towards minimizing makespan for multi-agent combinatorial path finding","volume":"9","author":"Ren","year":"2024","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v17i1.31591"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2531648"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.01.032"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1002\/net.21541"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v26i1.13796"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8856\/10839176\/10702350-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8856\/10839176\/10702350.pdf?arnumber=10702350","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T19:12:12Z","timestamp":1742843532000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10702350\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tase.2024.3466183","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}