{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:11:39Z","timestamp":1761487899537},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1109\/acc.2007.4282420","type":"proceedings-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T12:01:54Z","timestamp":1186574514000},"page":"1155-1160","source":"Crossref","is-referenced-by-count":24,"title":["Target assignment for robotic networks: Asymptotic performance under limited communication"],"prefix":"10.1109","author":[{"given":"Stephen L.","family":"Smith","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Bullo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/0212009"},{"journal-title":"Worst-case analysis of a new heuristic for the traveling salesman problem","year":"1976","author":"christofides","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"journal-title":"Parallel and Distributed Computation Numerical Methods","year":"1997","author":"bertsekas","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80062-6"},{"key":"ref6","article-title":"Distributed task assignment for mobile agents","author":"moore","year":"2006","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref5","first-page":"13","article-title":"Distributed algorithms for dynamic reassignment","author":"casta\u00f1\u00f3n","year":"2003","journal-title":"IEEE Conf on Decision and Control"},{"key":"ref8","article-title":"On synchronous robotic networks – Part I: Models, tasks and complexity notions. & Part II: Time complexity of rendezvous and deployment algorithms","author":"mart\u00ednez","year":"2005","journal-title":"IEEE Transactions on Automatic Control"},{"key":"ref7","first-page":"297","article-title":"Time complexity of sensor-based vehicle routing","author":"sharma","year":"2005","journal-title":"Robotics Science and Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref1","article-title":"Combinatorial Optimization: Theory and Algorithms","author":"korte","year":"2005","journal-title":"No 21 in Algorithmics and Combinatorics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2007.4282420"}],"event":{"name":"2007 American Control Conference","start":{"date-parts":[[2007,7,9]]},"location":"New York, NY, USA","end":{"date-parts":[[2007,7,13]]}},"container-title":["2007 American Control Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4282134\/4282135\/04282420.pdf?arnumber=4282420","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,15]],"date-time":"2017-03-15T16:29:00Z","timestamp":1489595340000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4282420\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/acc.2007.4282420","relation":{},"ISSN":["0743-1619"],"issn-type":[{"type":"print","value":"0743-1619"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}