{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T19:12:29Z","timestamp":1775934749664,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-18-1-2830"],"award-info":[{"award-number":["N00014-18-1-2830"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007161","name":"Boston University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007161","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,23]]},"DOI":"10.1109\/icra46639.2022.9812306","type":"proceedings-article","created":{"date-parts":[[2022,7,12]],"date-time":"2022-07-12T19:36:40Z","timestamp":1657654600000},"page":"6860-6866","source":"Crossref","is-referenced-by-count":6,"title":["Free-Space Ellipsoid Graphs for Multi-Agent Target Monitoring"],"prefix":"10.1109","author":[{"given":"Aaron","family":"Ray","sequence":"first","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, Mas-sachusetts Institute of Technology,Cambridge,MA,USA,02139"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alyssa","family":"Pierson","sequence":"additional","affiliation":[{"name":"Boston University,Department of Mechanical Engineering,Boston,MA,USA,02215"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniela","family":"Rus","sequence":"additional","affiliation":[{"name":"Computer Science and Artificial Intelligence Laboratory, Mas-sachusetts Institute of Technology,Cambridge,MA,USA,02139"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-018-0139-4"},{"key":"ref30","first-page":"180","volume":"10","author":"hochbaum","year":"1985","journal-title":"A Best Possible Heuristic for the K-Center Problem"},{"key":"ref10","article-title":"Computing large convex regions of obstacle-free space through semidefinite programming","volume":"107","author":"deits","year":"2014","journal-title":"Workshop on the Algorithmic Fundamentals of Robotics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570649"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2409903"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2017.03.005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MRS.2017.8250935"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561550"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2881296"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-019-09840-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2019.8914330"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2016.7759297"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487282"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(91)90012-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7138978"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636719"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1109\/SFCS.1988.21976","article-title":"Covering polygons is hard","author":"culberson","year":"1988","journal-title":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science"},{"key":"ref29","author":"tedrake","year":"0","journal-title":"Underactuated Robotics Algorithms for Walking Running Swimming Flying and Manipulation (Course Notes for MIT 6 832)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00977785"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702405139"},{"key":"ref7","article-title":"Covering polygons is even harder","author":"abrahamsen","year":"2021","journal-title":"2021 Symposium on the Foundations of Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-014-0090-1"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1109\/T-C.1975.224276","article-title":"decomposition of polygons into simpler components: feature generation for syntactic pattern recognition","volume":"c 24","author":"feng","year":"1975","journal-title":"IEEE Transactions on Computers"},{"key":"ref1","first-page":"497","article-title":"Non-linear mpc for longitudinal and lateral control of vehicle's platoon with insert and exit manoeuvres","author":"graffione","year":"2020","journal-title":"International Conference on Informatics in Control Automation and Robotics"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460701"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2016.2593450"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913504011"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2016.7487151"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1177\/0278364919882082"},{"key":"ref26","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SDF.2014.6954724"}],"event":{"name":"2022 IEEE International Conference on Robotics and Automation (ICRA)","location":"Philadelphia, PA, USA","start":{"date-parts":[[2022,5,23]]},"end":{"date-parts":[[2022,5,27]]}},"container-title":["2022 International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9811522\/9811357\/09812306.pdf?arnumber=9812306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T23:08:23Z","timestamp":1667516903000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9812306\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icra46639.2022.9812306","relation":{},"subject":[],"published":{"date-parts":[[2022,5,23]]}}}