{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T01:02:00Z","timestamp":1783126920292,"version":"3.54.6"},"reference-count":45,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2120219"],"award-info":[{"award-number":["2120219"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2120529"],"award-info":[{"award-number":["2120529"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Robot."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tro.2023.3266993","type":"journal-article","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T18:28:35Z","timestamp":1682620115000},"page":"2669-2683","source":"Crossref","is-referenced-by-count":39,"title":["CBSS: A New Approach for Multiagent Combinatorial Path Finding"],"prefix":"10.1109","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2880-8653","authenticated-orcid":false,"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9223-7456","authenticated-orcid":false,"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5434-7945","authenticated-orcid":false,"given":"Howie","family":"Choset","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/IROS47612.2022.9981785"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2022.XVIII.058"},{"key":"ref34","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","author":"liu","year":"0","journal-title":"Proc Int Joint Conf Auton Agents Multiagent Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v6i1.18343"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968096"},{"key":"ref31","first-page":"1464","article-title":"Multi-agent path finding for precedence-constrained goal sequences","author":"zhang","year":"0","journal-title":"Proc 21st Int Conf Auton Agents Multiagent Syst"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/9781119606475"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(98)00070-7"},{"key":"ref33","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"ma","year":"0","journal-title":"Proc Int Joint Conf Auton Agents Multiagent Syst"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA46639.2022.9812020"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.2623642"},{"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":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636683"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9560985"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18501"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197527"},{"key":"ref19","article-title":"The traveling salesman problem","author":"applegate","year":"2011","journal-title":"The Traveling Salesman Problem"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3183183"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.02.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.04.047"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/684"},{"key":"ref26","first-page":"1144","article-title":"Optimal target assignment and path finding for teams of agents","author":"ma","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref25","first-page":"757","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"0","journal-title":"Proc 1st Int Conf Autonomous Agents Multiagent Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-009-0004-6"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2011.5980306"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/BF02022039"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00407-013-0127-z"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2019.2949973"},{"key":"ref21","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"christofides","year":"1976"},{"key":"ref43","article-title":"Multi-objective conflict-based search using safe-interval path planning","author":"ren","year":"2021"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/169"},{"key":"ref27","article-title":"Overview: Generalizations of multi-agent path finding to real-world scenarios","author":"ma","year":"2017"},{"key":"ref29","first-page":"197","article-title":"Multi-goal multi-agent path finding via decoupled and integrated goal vertex ordering","author":"surynek","year":"0","journal-title":"Proc Int Symp Combinatorial Search"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2004.10.004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.12.014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2010.938844"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2009.5160666"}],"container-title":["IEEE Transactions on Robotics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8860\/10214173\/10109784-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8860\/10214173\/10109784.pdf?arnumber=10109784","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T18:17:17Z","timestamp":1693246637000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10109784\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":45,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tro.2023.3266993","relation":{},"ISSN":["1552-3098","1941-0468"],"issn-type":[{"value":"1552-3098","type":"print"},{"value":"1941-0468","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}