{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T15:57:46Z","timestamp":1779897466066,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642293528","type":"print"},{"value":"9783642293535","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29353-5_4","type":"book-chapter","created":{"date-parts":[[2012,4,14]],"date-time":"2012-04-14T12:14:18Z","timestamp":1334405658000},"page":"30-38","source":"Crossref","is-referenced-by-count":21,"title":["Gathering of Fat Robots with Limited Visibility and without Global Navigation"],"prefix":"10.1007","author":[{"given":"K\u00e1lm\u00e1n","family":"Bolla","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tam\u00e1s","family":"Kovacs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G\u00e1bor","family":"Fazekas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","volume":"384","author":"G. Prencipe","year":"2007","unstructured":"Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science\u00a0384, 222\u2013231 (2007)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-27796-5_8","volume-title":"Structural Information and Communication Complexity","author":"R. Cohen","year":"2004","unstructured":"Cohen, R., Peleg, D.: Robot Convergence via Center-of-Gravity Algorithms. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 79\u201388. Springer, Heidelberg (2004)"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Automata, Languages and Programming","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"key":"4_CR4","first-page":"453","volume-title":"1995 IEEE International Symposium on Intelligent Control","author":"H. Ando","year":"1995","unstructured":"Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: 1995 IEEE International Symposium on Intelligent Control, pp. 453\u2013460. IEEE Press, New York (1995)"},{"key":"4_CR5","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. Theoretical Computer Science\u00a0337, 147\u2013168 (2005)","journal-title":"Theoretical Computer Science"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-540-49823-0_34","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S. Souissi","year":"2006","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Using Eventually Consistent Compasses to Gather Oblivious Mobile Robots with Limited Visibility. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 484\u2013500. Springer, Heidelberg (2006)"},{"key":"4_CR7","first-page":"224","volume-title":"SPAA 2010: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures","author":"B. Degener","year":"2010","unstructured":"Degener, B., Kempkes, B., auf der Heide, F.M.: A local O(n\n                  2) gathering algorithm. In: SPAA 2010: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 224\u2013232. ACM, New York (2010)"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"G.J. Czyzowicz","year":"2009","unstructured":"Czyzowicz, G.J., Gasieniec, L., Pelc, A.: I Gathering few fat mobile robots in the plane. Theoretical Computer Science\u00a0410, 481\u2013499 (2009)","journal-title":"Theoretical Computer Science"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-18381-2_15","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"A. Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., Degener, B., Fischer, M., H\u00fcllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., M\u00e4rtens, M., auf der Heide, F.M., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: Collisionless Gathering of Robots with an Extent. In: \u010cern\u00e1, I., Gyim\u00f3thy, T., Hromkovi\u010d, J., Jefferey, K., Kr\u00e1lovi\u0107, R., Vukoli\u0107, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol.\u00a06543, pp. 178\u2013189. Springer, Heidelberg (2011)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-642-11659-9_17","volume-title":"Distributed Computing and Internet Technology","author":"S. Gan Chaudhuri","year":"2010","unstructured":"Gan Chaudhuri, S., Mukhopadhyaya, K.: Gathering Asynchronous Transparent Fat Robots. In: Janowski, T., Mohanty, H. (eds.) ICDCIT 2010. LNCS, vol.\u00a05966, pp. 170\u2013175. Springer, Heidelberg (2010)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2008.02.007","volume":"399","author":"R. Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Local Spread Algorithms for Autonomous Robot Systems. Theoretical Computer Science\u00a0399, 71\u201382 (2008)","journal-title":"Theoretical Computer Science"},{"key":"4_CR12","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1016\/j.robot.2006.05.001","volume":"54","author":"P. Valdastri","year":"2006","unstructured":"Valdastri, P., Corradi, P., Menciassi, A., Schmickl, T., Crailsheim, K., Seyfried, J., Dario, P.: Micromanipulation, Communication and Swarm Intelligence Issues in a Swarm Microrobotic Platform. Robotics and Autonomous Systems\u00a054, 789\u2013804 (2006)","journal-title":"Robotics and Autonomous Systems"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11721-007-0009-6","volume":"2","author":"S. Nouyan","year":"2008","unstructured":"Nouyan, S., Alexandre Campo, A., Dorigo, M.: Gathering Path formation in a robot swarm Self-organized strategies to find your way home. Swarm Intelligence\u00a02(1), 1\u201323 (2008)","journal-title":"Swarm Intelligence"}],"container-title":["Lecture Notes in Computer Science","Swarm and Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29353-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:37:02Z","timestamp":1620128222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29353-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642293528","9783642293535"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29353-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}