{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:08:23Z","timestamp":1761718103194},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Intel Serv Robotics"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1007\/s11370-009-0051-x","type":"journal-article","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T09:53:43Z","timestamp":1251712423000},"page":"265-273","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic network formation through coverage and freeze-tag"],"prefix":"10.1007","volume":"2","author":[{"given":"Eric","family":"Meisner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volkan","family":"Isler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,9,1]]},"reference":[{"key":"51_CR1","volume-title":"The theory of search games and rendezvous","author":"S Alpern","year":"2002","unstructured":"Alpern S, Gal S (2002) The theory of search games and rendezvous. Springer, Berlin"},{"issue":"3","key":"51_CR2","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S Alpern","year":"1995","unstructured":"Alpern S (1995) The rendezvous search problem. SIAM J Control Optim 33(3): 673\u2013683","journal-title":"SIAM J Control Optim"},{"key":"51_CR3","doi-asserted-by":"crossref","unstructured":"Anderson EJ, Fekete SP (1998) Asymmetric rendezvous on the plane. In: SCG \u201998: Proceedings of the fourteenth annual symposium on Computational geometry. ACM Press, New York, pp 365\u2013373","DOI":"10.1145\/276884.276925"},{"issue":"2","key":"51_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00453-006-1206-1","volume":"46","author":"EM Arkin","year":"2006","unstructured":"Arkin EM, Bender MA, Fekete SP, Mitchell JSB, Skutella M (2006) The freeze-tag problem: how to wake up a swarm of robots. Algorithmica 46(2): 193\u2013221. doi: 10.1007\/s00453-006-1206-1","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"51_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/S0925-7721(00)00015-8","volume":"17","author":"EM Arkin","year":"2000","unstructured":"Arkin EM, Fekete SP, Mitchell JSB (2000) Approximation algorithms for lawn mowing and milling. Comput Geom 17(1\u20132): 25\u201350","journal-title":"Comput Geom"},{"issue":"3","key":"51_CR6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1023\/A:1008958800904","volume":"9","author":"H Choset","year":"2000","unstructured":"Choset H (2000) Coverage of known spaces: the boustrophedon cellular decomposition. Auton Robots 9(3): 247\u2013253","journal-title":"Auton Robots"},{"issue":"SI","key":"51_CR7","first-page":"2486","volume":"14","author":"S Deb","year":"2006","unstructured":"Deb S, M\u00e9dard M, Choute C (2006) Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE\/ACM Trans Netw 14(SI): 2486\u20132507","journal-title":"IEEE\/ACM Trans Netw"},{"key":"51_CR8","unstructured":"Ganguli A, Cortes J, Bullo F (2006) Multirobot rendezvous with visibility sensors in nonconvex environments. IEEE Trans Robot (2006, to appear)"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Martinez S, Bullo F, Cortes J, Frazzoli E (2007) On synchronous robotic networks. Part II. Time complexity of rendezvous and deployment algorithms. IEEE Trans Autom Control (to appear)","DOI":"10.1109\/TAC.2007.908304"},{"key":"51_CR10","volume-title":"Randomized algorithms","author":"R Motwani","year":"2000","unstructured":"Motwani R, Raghavan P (2000) Randomized algorithms. Cambridge Press, Cambridge"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Poduri S, Sukhatme GS (2007) Achieving connectivity through coalescence in mobile robot networks. In: International conference on robot communication and coordination, October 2007","DOI":"10.4108\/ICST.ROBOCOMM2007.2272"},{"key":"51_CR12","doi-asserted-by":"crossref","unstructured":"Poduri S, Sukhatme GS (2007) Latency analysis of coalescence in robot groups. In: IEEE international conference on robotics and automation","DOI":"10.1109\/ROBOT.2007.363981"},{"issue":"2","key":"51_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1023\/A:1011219024159","volume":"11","author":"N Roy","year":"2001","unstructured":"Roy N, Dudek G (2001) Collaborative robot exploration and rendezvous: algorithms, performance bounds and observations. Auton Robots 11(2): 117\u2013136","journal-title":"Auton Robots"},{"key":"51_CR14","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1002\/nav.1043","volume":"48","author":"LC Thomas","year":"2001","unstructured":"Thomas LC, Pikounis M (2001) Many-player rendevous search: stick together or split and meet. Naval Res Logist 48: 710\u2013721","journal-title":"Naval Res Logist"}],"container-title":["Intelligent Service Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-009-0051-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11370-009-0051-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11370-009-0051-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T14:23:36Z","timestamp":1559571816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11370-009-0051-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9,1]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["51"],"URL":"https:\/\/doi.org\/10.1007\/s11370-009-0051-x","relation":{},"ISSN":["1861-2776","1861-2784"],"issn-type":[{"value":"1861-2776","type":"print"},{"value":"1861-2784","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,9,1]]}}}