{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:52:19Z","timestamp":1729637539353,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/acc.2012.6315292","type":"proceedings-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T21:55:22Z","timestamp":1405547722000},"page":"3167-3172","source":"Crossref","is-referenced-by-count":7,"title":["Decentralized topology control for robotic networks with limited field of view sensors"],"prefix":"10.1109","author":[{"given":"D.","family":"Di Paola","sequence":"first","affiliation":[]},{"given":"R.","family":"De Asmundis","sequence":"additional","affiliation":[]},{"given":"A.","family":"Gasparri","sequence":"additional","affiliation":[]},{"given":"A.","family":"Rizzo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"17","first-page":"417","article-title":"Approximating the minimum strongly connected subgraph via a matching lower bound","author":"vetta","year":"2001","journal-title":"Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms Ser SODA '01"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095883"},{"key":"16","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831470","author":"bullo","year":"2009","journal-title":"Distributed Control of Robotic Networks"},{"key":"13","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/TWC.2005.846971","article-title":"Design and analysis of an mst-based topology control algorithm","volume":"4","author":"hou","year":"2005","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0020-0190(02)00476-3","article-title":"A linear time 5\/3-approximation for the minimum strongly-connected spanning subgraph problem","volume":"86","author":"zhao","year":"2003","journal-title":"Inf Process Lett"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30301-5_41"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377041"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2007.900638"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400723"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2072570"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2008.2006233"},{"key":"7","article-title":"A distributed minimum restrictive connectivity maintenance algorithm","author":"wagenpfeil","year":"2009","journal-title":"The 9th International IFAC Symposium on Robot Control (SYROCO2009)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2010.5717290"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2011.6094818"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1137\/060674971"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2007.4434530"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.11.012"}],"event":{"name":"2012 American Control Conference - ACC 2012","start":{"date-parts":[[2012,6,27]]},"location":"Montreal, QC","end":{"date-parts":[[2012,6,29]]}},"container-title":["2012 American Control Conference (ACC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6297579\/6314593\/06315292.pdf?arnumber=6315292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T22:20:30Z","timestamp":1565648430000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6315292\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/acc.2012.6315292","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}