{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T21:56:19Z","timestamp":1769723779608,"version":"3.49.0"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,5,30]],"date-time":"2021-05-30T00:00:00Z","timestamp":1622332800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"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.9561041","type":"proceedings-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T20:28:35Z","timestamp":1634675315000},"page":"8955-8961","source":"Crossref","is-referenced-by-count":12,"title":["Communication-Aware Multi-robot Coordination with Submodular Maximization"],"prefix":"10.1109","author":[{"given":"Guangyao","family":"Shi","sequence":"first","affiliation":[]},{"given":"Ishat E","family":"Rabban","sequence":"additional","affiliation":[]},{"given":"Lifeng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Pratap","family":"Tokekar","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32","article-title":"Gurobi optimizer reference manual","author":"gurobi optimization","year":"2020"},{"key":"ref31","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543392"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.11.020"},{"key":"ref11","article-title":"Resilient coverage: Exploring the local-to-global trade-off","author":"ramachandran","year":"2019","journal-title":"arXiv preprint arXiv 1910 12731"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1108\/00242530810865501"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2019.2920749"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197243"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942986"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593630"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2020.XVI.095"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1127777.1127782"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2740625"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206450"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.63"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989038"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2301816"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917709507"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-319-16595-0_7","article-title":"Computing large convex regions of obstacle-free space through semidefinite programming","author":"deits","year":"2015","journal-title":"Algorithmic Foundations of Robotics XI"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9783-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1989734.1989736"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-018-9778-6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2881296"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029792"},{"key":"ref20","article-title":"The impact of information in greedy submodular maximization","author":"grimsman","year":"2018","journal-title":"IEEE Transactions on Control of Network Systems"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434530"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913499085"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.900638"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2011.2157884"},{"key":"ref26","article-title":"Maximizing covered area in the euclidean plane with connectivity constraint","author":"huang","year":"2019","journal-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques"},{"key":"ref25","article-title":"Learning with submodular functions: A convex optimization perspective","author":"bach","year":"2011","journal-title":"arXiv preprint arX-iv 1111 6453"}],"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\/09561041.pdf?arnumber=9561041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:47:10Z","timestamp":1652183230000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9561041\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,30]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/icra48506.2021.9561041","relation":{},"subject":[],"published":{"date-parts":[[2021,5,30]]}}}