{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T19:21:24Z","timestamp":1792869684322,"version":"4.5.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T00:00:00Z","timestamp":1588291200000},"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":[[2020,5]]},"DOI":"10.1109\/icra40945.2020.9197527","type":"proceedings-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T17:25:46Z","timestamp":1600190746000},"page":"441-447","source":"Crossref","is-referenced-by-count":38,"title":["Optimal Sequential Task Assignment and Path Finding for Multi-Agent Robotic Assembly Planning"],"prefix":"10.1109","author":[{"given":"Kyle","family":"Brown","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Oriana","family":"Peltzer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin A.","family":"Sehr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mac","family":"Schwager","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mykel J.","family":"Kochenderfer","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2007.07.033"},{"key":"ref11","article-title":"Conflict-based search for optimal multi-agent path finding","author":"sharon","year":"2012","journal-title":"AAAI Conference on Artificial Intelligence (AAAI)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref13","first-page":"117","article-title":"Cooperative pathnding.pdf","author":"silver","year":"2005","journal-title":"Proc AAAI Conf Artif Intell Interactive Digit Entertain"},{"key":"ref14","first-page":"837","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","volume":"2","author":"ma","year":"2017","journal-title":"AAMAS '03 Proc Intl Conf on Autonomous Agents and Multiagent Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593448"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.772530"},{"key":"ref17","article-title":"Gurobi Optimization","year":"2019","journal-title":"Gurobi Optimizer Reference Manual"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/87.911382"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2894217"},{"key":"ref4","first-page":"177","article-title":"Subdimensional expansion and optimal task reassignment","author":"wagner","year":"2012","journal-title":"Symposium on Combinatorial Search"},{"key":"ref3","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"2018","journal-title":"International Conference on Autonomous Agents and Multiagent Systems (AAMAS)"},{"key":"ref6","article-title":"Optimal multi-robot path planning on graphs: structure and computational complexity","author":"yu","year":"2015","journal-title":"ArXiv"},{"key":"ref5","article-title":"Optimal target assignment and path finding for teams of agents","author":"ma","year":"2016","journal-title":"International Conference on Autonomous Agents and Multiagent Systems (AAMAS)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.20472"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/58"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913496484"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36279-8_10"},{"key":"ref9","first-page":"1","article-title":"A branch and price algorithm for the combined vehicle routing and scheduling problem with synchronization constraints","author":"bredstrom","year":"2011","journal-title":"SSRN Electronic Journal"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2017.4531217"}],"event":{"name":"2020 IEEE International Conference on Robotics and Automation (ICRA)","location":"Paris, France","start":{"date-parts":[[2020,5,31]]},"end":{"date-parts":[[2020,8,31]]}},"container-title":["2020 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9187508\/9196508\/09197527.pdf?arnumber=9197527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T20:21:31Z","timestamp":1656361291000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9197527\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,5]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icra40945.2020.9197527","relation":{},"subject":[],"published":{"date-parts":[[2020,5]]}}}