{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T04:15:39Z","timestamp":1743221739562,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308499"},{"type":"electronic","value":"9783642308505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30850-5_2","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T01:44:33Z","timestamp":1338169473000},"page":"9-17","source":"Crossref","is-referenced-by-count":1,"title":["Continuous Local Strategies for Robotic Formation Problems"],"prefix":"10.1007","author":[{"given":"Barbara","family":"Kempkes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-13284-1_14","volume-title":"Structural Information and Communication Complexity","author":"B. Degener","year":"2010","unstructured":"Degener, B., Kempkes, B., Kling, P., Meyer auf der Heide, F.: A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 168\u2013182. Springer, Heidelberg (2010)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Dynia, M., Kutylowski, J., Lorek, P., Meyer auf der Heide, F.: Maintaining Communication Between an Explorer and a Base Station. In: IFIP 19th World Computer Congress, TC10: 1st IFIP International Conference on Biologically Inspired Computing (BICC 2006), pp. 137\u2013146 (2006)","DOI":"10.1007\/978-0-387-34733-2_14"},{"issue":"36","key":"2_CR3","doi-asserted-by":"publisher","first-page":"3391","DOI":"10.1016\/j.tcs.2008.04.010","volume":"410","author":"J. Kutylowski","year":"2009","unstructured":"Kutylowski, J., Meyer auf der Heide, F.: Optimal strategies for maintaining a chain of relays between an explorer and a base camp. Theoretical Computer Science\u00a0410(36), 3391\u20133405 (2009)","journal-title":"Theoretical Computer Science"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1145\/1248377.1248420","volume-title":"SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures","author":"M. Dynia","year":"2007","unstructured":"Dynia, M., Kutylowski, J., Meyer auf der Heide, F., Schrieb, J.: Local Strategies for Maintaining a Chain of Relay Stations between an Explorer and a Base Station. In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 260\u2013269. ACM Press, New York (2007)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Kling, P., Meyer auf der Heide, F.: Convergence of Local Communication Chain Strategies via Linear Transformations. In: SPAA 2011: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, pp.159\u2013166 (2011)","DOI":"10.1145\/1989493.1989517"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: Proceedings of the 2002 Workshop on Principles of Mobile Computing, POMC 2002, pp. 97\u2013104 (2002)","DOI":"10.1145\/584490.584509"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-24838-5_12","volume-title":"Experimental and Efficient Algorithms","author":"I. Chatzigiannakis","year":"2004","unstructured":"Chatzigiannakis, I., Markou, M., Nikoletseas, S.E.: Distributed Circle Formation for Anonymous Oblivious Robots. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 159\u2013174. Springer, Heidelberg (2004)"},{"key":"2_CR8","unstructured":"Meyer auf der Heide, F., Schneider, B.: Local Strategies for connecting stations by small robotic networks. In: IFIP 20th World Computer Congress, TC10: 2nd IFIP International Conference on Biologically Inspired Computing (BICC 2008), pp. 95\u2013104 (2008)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local O(n^2) gathering algorithm. In: SPAA 2010: Proceedings of the 22nd ACM Symposium on Parallelism in Algorithms and Architectures, pp. 217\u2013223 (2010)","DOI":"10.1145\/1810479.1810523"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Ando, H., Suzuki, Y., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: Proceedings of the 1995 IEEE International Symposium on Intelligent Control, ISIC 1995, pp. 453\u2013460 (August 1995)","DOI":"10.21236\/ADA296911"},{"issue":"1-3","key":"2_CR11","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(1-3), 147\u2013168 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"2_CR12","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H. Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation\u00a015(5), 818\u2013828 (1999)","journal-title":"IEEE Transactions on Robotics and Automation"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-22212-2_12","volume-title":"Structural Information and Communication Complexity","author":"B. Katreniak","year":"2011","unstructured":"Katreniak, B.: Convergence with Limited Visibility by Asynchronous Mobile Robots. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 125\u2013137. Springer, Heidelberg (2011)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-540-28646-2_13","volume-title":"Ant Colony Optimization and Swarm Intelligence","author":"N. Gordon","year":"2004","unstructured":"Gordon, N., Wagner, I.A., Bruckstein, A.M.: Gathering Multiple Robotic A(ge)nts with Limited Sensing Capabilities. In: Dorigo, M., Birattari, M., Blum, C., Gambardella, L.M., Mondada, F., St\u00fctzle, T. (eds.) ANTS 2004. LNCS, vol.\u00a03172, pp. 142\u2013153. Springer, Heidelberg (2004)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Desai, J.P., Ostrowski, J.P., Kumar, V.: Controlling Formations of Multiple Mobile Robots. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA 1998), vol.\u00a04, pp. 2864\u20132869 (1998)","DOI":"10.1109\/ROBOT.1998.680621"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S0263574708004438","volume":"27","author":"F. Fahimi","year":"2009","unstructured":"Fahimi, F., Nataraj, C., Ashrafiuon, H.: Real-time obstacle avoidance for multiple mobile robots. Robotica\u00a027(2), 189\u2013198 (2009)","journal-title":"Robotica"},{"issue":"6-7","key":"2_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"J. Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theoretical Computer Science\u00a0410(6-7), 481\u2013499 (2009)","journal-title":"Theoretical Computer Science"},{"key":"2_CR18","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., Meyer auf der Heide, F., 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":"2_CR19","doi-asserted-by":"crossref","unstructured":"Oasa, Y., Suzuki, I., Yamashita, M.: A robust distributed convergence algorithm for autonomous mobile robots. In: IEEE International Conference on Systems, Man, and Cybernetics (SMC 1997), vol.\u00a01, pp. 287\u2013292 (1997)","DOI":"10.1109\/ICSMC.1997.625764"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/978-3-642-22012-8_52","volume-title":"Automata, Languages and Programming","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., Meyer auf der Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 650\u2013661. Springer, Heidelberg (2011)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-22212-2_13","volume-title":"Structural Information and Communication Complexity","author":"P. Brandes","year":"2011","unstructured":"Brandes, P., Degener, B., Kempkes, B., Meyer auf der Heide, F.: Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 138\u2013149. Springer, Heidelberg (2011)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Kempkes, B., Meyer auf der Heide, F.: Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. To Appear in Proceedings of SPAA 2012 (2012)","DOI":"10.1145\/2312005.2312009"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30850-5_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T22:43:57Z","timestamp":1743201837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30850-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308499","9783642308505"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30850-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}