{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T13:49:58Z","timestamp":1784296198743,"version":"3.55.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"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":[[2023,4]]},"DOI":"10.1109\/tase.2022.3183183","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T20:32:57Z","timestamp":1655757177000},"page":"1262-1274","source":"Crossref","is-referenced-by-count":52,"title":["A Conflict-Based Search Framework for Multiobjective Multiagent Path Finding"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2880-8653","authenticated-orcid":false,"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[{"name":"Robotics Institute and Mechanical Engineering Department, 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":"Department of Mechnical Engineering, 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":"Robotics Institute and Mechanical Engineering Department, Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2022.103662"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18501"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-27659-9"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-018-9685-y"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/s0927-0507(06)14009-8"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4171"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v31i1.15957"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MRS50823.2021.9620590"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48782-8_9"},{"key":"ref10","first-page":"1","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proc. Int. Joint Conf. Auton. Agents Multiagent Syst.","author":"H\u00f6nig"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/179"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58475-7_43"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017651"},{"key":"ref14","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":"ref15","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":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60376-2_15"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1754399.1754400"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-003-0368-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2013.2283256"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.05.007"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636683"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561779"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9560985"},{"key":"ref24","article-title":"Multi-objective conflict-based search using safe-interval path planning","author":"Ren","year":"2021","journal-title":"arXiv:2108.00745"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3096744"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.15607\/rss.2022.xviii.058"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3146918"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3390\/electronics10101193"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05816-6_3"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.autcon.2004.04.012"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7564"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v10i1.18510"},{"issue":"4","key":"ref34","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1145\/115234.115368","article-title":"Multiobjective A*","volume":"38","author":"Stewart","year":"1991","journal-title":"J. ACM"},{"key":"ref35","first-page":"810","article-title":"Efficient sat approach to multi-agent path finding under the sum of costs objective","volume-title":"Proc. 22nd Eur. Conf. Artif. Intell.","author":"Surynek"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v30i1.6655"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CEC48606.2020.9185585"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3089050"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561818"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v27i1.8541"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-16595-0_42"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8856\/10094220\/9801082-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/10094220\/09801082.pdf?arnumber=9801082","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T05:11:59Z","timestamp":1706764319000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9801082\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":42,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tase.2022.3183183","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}