{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:19Z","timestamp":1759638379153,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_50","type":"book-chapter","created":{"date-parts":[[2009,9,22]],"date-time":"2009-09-22T22:44:15Z","timestamp":1253659455000},"page":"496-511","source":"Crossref","is-referenced-by-count":9,"title":["Keeping Mobile Robot Swarms Connected"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"Cornejo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabian","family":"Kuhn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruy","family":"Ley-Wild","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nancy","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Johnson, D., Maltz, D.: Dynamic Source Routing in Ad Hoc Wireless Networks. Computer Communications Review - SIGCOMM (1996)","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Perkins, C., Royer, E.: Ad-hoc On-Demand Distance Vector Routing. In: Workshop on Mobile Computing Systems and Applications (1999)","DOI":"10.1109\/MCSA.1999.749281"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Malpani, N., Welch, J., Vaidya, N.: Leader Election Algorithms for Mobile Ad-hoc Networks. In: DIAL-M: Workshop in Discrete Algorithms and Methods for Mobile Computing and Communications (2000)","DOI":"10.1145\/345848.345871"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Walter, J., Welch, J., Vaidya, N.: A Mutual Exclusion Algorithm for Ad Hoc Mobile Networks. Wireless Networks (2001)","DOI":"10.1023\/A:1012363200403"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Regmi, A., Sandoval, R., Byrne, R., Tanner, H., Abdallah, C.: Experimental Implementation of Flocking Algorithms in Wheeled Mobile Robots. In: Proceedings of the American Control Conference 2005, pp. 4917\u20134922 (2005)","DOI":"10.1109\/ACC.2005.1470774"},{"key":"50_CR6","unstructured":"Hayes, A., Dormiani-Tabatabaei, P.: Self-organized flocking with agent failure: Off-line optimization and demonstration with real robots. In: ICRA (2002)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Fierro, R., Das, A.: A modular architecture for formation control. Robot Motion and Control (2002)","DOI":"10.1109\/ROMOCO.2002.1177121"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Carpin, S., Parker, L.E.: Cooperative Leader Following in a Distributed Multi-Robot System. In: ICRA (2002)","DOI":"10.1109\/ROBOT.2002.1013687"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Zavlanos, M.M., Pappas, G.J.: Controlling Connectivity of Dynamic Graphs. In: CDC-ECC, pp. 6388\u20136393 (2005)","DOI":"10.1109\/CDC.2005.1583186"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Savla, K., Notarstefano, G., Bullo, F.: Maintaining limited-range connectivity among second-order agents. SIAM Journal on Control and Optimization (2007)","DOI":"10.1109\/ACC.2006.1656533"},{"issue":"5","key":"50_CR11","first-page":"818","volume":"15","author":"H. Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobilerobots with limited visibility. ICRA\u00a015(5), 818\u2013828 (1999)","journal-title":"ICRA"},{"issue":"1-3","key":"50_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P. Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci.\u00a0337(1-3), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"50_CR13","unstructured":"Ganguli, A., Cort\u00e9s, J., Bullo, F.: Multirobot rendezvous with visibility sensors in nonconvex environments. CoRR abs\/cs\/0611022 (2006)"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Using eventually consistent compasses to gather oblivious mobile robots with limited visibility. In: SSS, pp. 484\u2013500 (2006)","DOI":"10.1007\/978-3-540-49823-0_34"},{"key":"50_CR15","doi-asserted-by":"crossref","unstructured":"Lee, G., Chong, N.Y., Defago, X.: Robust Self-Deployment for a Swarm of Autonomous Mobile Robots with Limited Visibility Range. In: Robot and Human interactive Communication (2007)","DOI":"10.1109\/ROMAN.2007.4415216"},{"key":"50_CR16","first-page":"113","volume":"13","author":"A.H. Maja","year":"2001","unstructured":"Maja, A.H., Howard, A., Matari, M.J., Sukhatme, G.S.: An Incremental Self-Deployment Algorithm for Mobile Sensor Networks. Autonomous Robots, Special Issue on Intelligent Embedded Systems\u00a013, 113\u2013126 (2001)","journal-title":"Autonomous Robots, Special Issue on Intelligent Embedded Systems"},{"key":"50_CR17","doi-asserted-by":"crossref","unstructured":"Cornejo, A., Lynch, N.: Connectivity Service for Mobile Ad-Hoc Networks. In: Spatial Computing Workshop (2008)","DOI":"10.1109\/SASOW.2008.62"},{"issue":"3","key":"50_CR18","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"K. Gabriel","year":"1969","unstructured":"Gabriel, K., Sokal, R.: A new statistical approach to geographic variation analysis. Systematic Zoology\u00a018(3), 259\u2013278 (1969)","journal-title":"Systematic Zoology"},{"issue":"4","key":"50_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G.T. Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition\u00a012(4), 261\u2013268 (1980)","journal-title":"Pattern Recognition"},{"key":"50_CR20","first-page":"1702","volume":"3","author":"N. Li","year":"2003","unstructured":"Li, N., Hou, J.C., Sha, L.: Design and analysis of an MST-based topology control algorithm. INFOCOM\u00a03, 1702\u20131712 (2003)","journal-title":"INFOCOM"},{"key":"50_CR21","unstructured":"Cornejo, A., Kuhn, F., Lynch, N., Ley-Wild, R.: Keeping mobile robot swarms connected. MIT-CSAIL-TR-2009-027 (2009), http:\/\/hdl.handle.net\/1721.1\/45568"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T15:44:19Z","timestamp":1558539859000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}