{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:21:51Z","timestamp":1740100911850,"version":"3.37.3"},"reference-count":25,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T00:00:00Z","timestamp":1658102400000},"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":[[2022,7,18]]},"DOI":"10.1109\/cec55065.2022.9870300","type":"proceedings-article","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T19:28:14Z","timestamp":1662492494000},"page":"1-8","source":"Crossref","is-referenced-by-count":3,"title":["Multi-Objective Roadmap Optimization for Multiagent Navigation"],"prefix":"10.1109","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2255-3277","authenticated-orcid":false,"given":"Sebastian","family":"Mai","sequence":"first","affiliation":[{"name":"Otto von Guericke University,Faculty of Computer Science,Magdeburg,Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4312-4364","authenticated-orcid":false,"given":"Maximilian","family":"Deubel","sequence":"additional","affiliation":[{"name":"Otto von Guericke University,Faculty of Computer Science,Magdeburg,Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9917-5227","authenticated-orcid":false,"given":"Sanaz","family":"Mostaghim","sequence":"additional","affiliation":[{"name":"Otto von Guericke University,Faculty of Computer Science,Magdeburg,Germany"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1017\/CBO9780511546877"},{"year":"2019","author":"li","journal-title":"Visual model-predictive localization for computationally efficient autonomous racing of a 72-gram drone","key":"ref11"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-030-60376-2_15"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1017\/S0373463318001005"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1109\/ICRA40945.2020.9196686"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/IROS51168.2021.9636683"},{"year":"2021","author":"ren","journal-title":"Subdirnensional Expansion for Multi-objective Multi-agent Path Finding","key":"ref16"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.3390\/s21237898"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1109\/LRA.2020.3010487"},{"key":"ref19","first-page":"97","article-title":"Meta-agent conflict-based search for optimal multi-agent path finding","author":"sharon","year":"0","journal-title":"Pro-ceedings of the 5th Annual Symposium on Combinatorial Search SoCS 2012"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1145\/1276958.1277190"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/4235.996017"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1109\/LRA.2019.2894217","article-title":"Persistent and Robust Execution of MAPF Schedules in Warehouses","volume":"4","author":"wolfgang","year":"2019","journal-title":"IEEE l of Robotics and Automation"},{"key":"ref5","first-page":"11","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"hagberg","year":"0","journal-title":"7th Python in Science Conference (SciPy 2008) (SciPy)"},{"year":"2004","author":"kammer","journal-title":"Connectivity in Graphs","key":"ref8"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TRO.2018.2853613"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1016\/j.robot.2005.09.002"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/IROS.2011.6048339"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1109\/ACCESS.2020.2990567"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/s43154-021-00043-8"},{"key":"ref22","first-page":"145","article-title":"An em-pirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives","author":"surynek","year":"0","journal-title":"Proceedings of the 9th Annual Symposium on Combinatorial Search SoCS 2016 2016-Janua(SoCS)"},{"key":"ref21","volume":"11866 lnai","author":"stern","year":"2019","journal-title":"Multi-agent path finding - an overview"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1109\/WCICA.2012.6359164"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1109\/CEC48606.2020.9185585"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1109\/4235.797969"}],"event":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2022,7,18]]},"location":"Padua, Italy","end":{"date-parts":[[2022,7,23]]}},"container-title":["2022 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9870216\/9870201\/09870300.pdf?arnumber=9870300","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T21:15:16Z","timestamp":1664226916000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9870300\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,18]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/cec55065.2022.9870300","relation":{},"subject":[],"published":{"date-parts":[[2022,7,18]]}}}