{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T14:58:41Z","timestamp":1781621921266,"version":"3.54.5"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"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":[[2021,5,30]]},"DOI":"10.1109\/icra48506.2021.9561779","type":"proceedings-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:28:35Z","timestamp":1634689715000},"page":"11560-11565","source":"Crossref","is-referenced-by-count":25,"title":["MS*: A New Exact Algorithm for Multi-agent Simultaneous Multi-goal Sequencing and Path Finding"],"prefix":"10.1109","author":[{"given":"Zhongqiang","family":"Ren","sequence":"first","affiliation":[{"name":"Carnegie Mellon University,Robotics Institute and the Department of Mechanical Engineering,Pittsburgh,PA,USA,15213"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sivakumar","family":"Rathinam","sequence":"additional","affiliation":[{"name":"Texas A&M University,Department of Mechanical Engineering,College Station,TX,77843-3123"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Howie","family":"Choset","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University,Robotics Institute and the Department of Mechanical Engineering,Pittsburgh,PA,USA,15213"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","first-page":"1144","article-title":"Optimal target assignment and path finding for teams of agents","author":"ma","year":"2016","journal-title":"Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2007.02.001"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2010.938844"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2009.5160665"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1982.4767270"},{"key":"ref15","first-page":"33:1","article-title":"Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem","author":"rathinam","year":"2020","journal-title":"17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020) volume 162 of Leibniz International Proceedings in Informatics (LIPIcs)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2006.872110"},{"key":"ref17","article-title":"Ms*: A new exact algorithm for multi-agent simultaneous multi-goal sequencing and path finding","author":"ren","year":"2021","journal-title":"arXiv preprint arXiv 2103 05767"},{"key":"ref18","article-title":"Subdimensional expansion for multi-objective multi-agent path finding","author":"ren","year":"2021","journal-title":"arXiv preprint arXiv 2102 05988"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.006"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.1701"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v31i1.15950","article-title":"S?: A heuristic information-based approximation framework for multi-goal path finding","author":"chour","year":"2021","journal-title":"International Conference on Automated Planning and Scheduling"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref8","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"2018","journal-title":"Proc Int Joint Conf Autonomous Agents and Multiagent Systems"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968096"},{"key":"ref2","first-page":"1","article-title":"A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem","author":"bae","year":"2015","journal-title":"Optimization Letters"},{"key":"ref9","first-page":"1152","article-title":"Task and path planning for multi-agent pickup and delivery","author":"liu","year":"2019","journal-title":"AAMAS"},{"key":"ref1","author":"applegate","year":"2007","journal-title":"The Traveling Salesman Problem A Computational Study (Princeton Series in Applied Mathematics)"},{"key":"ref20","article-title":"Multi-agent pathfinding: Definitions, variants, and benchmarks","author":"stern","year":"2019","journal-title":"arXiv preprint arXiv 1906 03008"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.12.014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICUAS.2015.7152311"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99253-2_8"},{"key":"ref23","article-title":"Multi-goal multi-agent path finding via decoupled and integrated goal vertex ordering","author":"surynek","year":"2020","journal-title":"arXiv preprint arXiv 2009 02026"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v27i1.8541","article-title":"Structure and intractability of optimal multi-robot path planning on graphs","author":"yu","year":"2013","journal-title":"Twenty-Seventh AAAI Conference on Artificial Intelligence"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"}],"event":{"name":"2021 IEEE International Conference on Robotics and Automation (ICRA)","location":"Xi'an, China","start":{"date-parts":[[2021,5,30]]},"end":{"date-parts":[[2021,6,5]]}},"container-title":["2021 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9560720\/9560666\/09561779.pdf?arnumber=9561779","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T19:08:59Z","timestamp":1674241739000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9561779\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9561779","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}