{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:35:04Z","timestamp":1742938504774,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222115"},{"type":"electronic","value":"9783642222122"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22212-2_13","type":"book-chapter","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T03:22:50Z","timestamp":1311218570000},"page":"138-149","source":"Crossref","is-referenced-by-count":8,"title":["Energy-Efficient Strategies for Building Short Chains of Mobile Robots Locally"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Brandes","sequence":"first","affiliation":[]},{"given":"Bastian","family":"Degener","sequence":"additional","affiliation":[]},{"given":"Barbara","family":"Kempkes","sequence":"additional","affiliation":[]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_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":"13_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, pp. 137\u2013146 (2006)","DOI":"10.1007\/978-0-387-34733-2_14"},{"key":"13_CR3","unstructured":"Kling, P.: Unifying the Analysis of Communication Chain Strategies. Master\u2019s thesis, University of Paderborn, masters thesis (2010)"},{"key":"13_CR4","unstructured":"Kutylowski, J.: Using Mobile Relays for Ensuring Connectivity in Sparse Networks. Dissertation, International Graduate School of Dynamic Intelligent Systems (2007)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Dynia, M., Kuty\u0142owski, 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: Proc. of the 19th annual ACM symposium on Parallel algorithms and architectures, pp. 260\u2013269 (2007)","DOI":"10.1145\/1248377.1248420"},{"issue":"36","key":"13_CR6","doi-asserted-by":"publisher","first-page":"3391","DOI":"10.1016\/j.tcs.2008.04.010","volume":"410","author":"J. Kuty\u0142owski","year":"2009","unstructured":"Kuty\u0142owski, 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":"13_CR7","doi-asserted-by":"crossref","unstructured":"Ando, H., Suzuki, Y., Yamashita, M.: Formation agreement problems for synchronous mobile robotswith limited visibility. In: Proc. IEEE Syp. of Intelligent Control, pp. 453\u2013460 (1995)","DOI":"10.21236\/ADA296911"},{"issue":"6","key":"13_CR8","doi-asserted-by":"publisher","first-page":"1516","DOI":"10.1137\/S0097539704446475","volume":"34","author":"R. Cohen","year":"2005","unstructured":"Cohen, R., Peleg, D.: Convergence properties of the gravitational algorithm in asynchronous robot systems. SIAM Journal on Computing\u00a034(6), 1516\u20131528 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Self-stabilizing deterministic gathering. In: Algorithmic Aspects of Wireless Sensor Networks, pp. 230\u2013241 (2009)","DOI":"10.1007\/978-3-642-05434-1_23"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Gathering asynchronous mobile robots with inaccurate compasses. Principles of Distributed Systems, 333\u2013349 (2006)","DOI":"10.1007\/11945529_24"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: An optimal result. Distributed Computing, 298\u2013312 (2007)","DOI":"10.1007\/978-3-540-75142-7_24"},{"issue":"2-3","key":"13_CR12","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(2-3), 222\u2013231 (2007); Structural Information and Communication Complexity (SIROCCO 2005)","journal-title":"Theoretical Computer Science"},{"key":"13_CR13","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. In: SODA 2004: Proc. of the 15th annual ACM-SIAM symposium on Discrete algorithms, pp. 1070\u20131078 (2004)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Konagaya, A.: Circle formation for oblivious anonymous mobile robots with no common sense of orientation. In: International Workshop on Principles of Mobile Computing, POMC, pp. 97\u2013104 (2002)","DOI":"10.1145\/584506.584509"},{"key":"13_CR15","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.: 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":"13_CR16","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local O(n 2) gathering algorithm. In: SPAA 2010: Proc. of the 22nd ACM symposium on parallelism in algorithms and architectures, pp. 217\u2013223 (2010)","DOI":"10.1145\/1810479.1810523"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., auf\u00a0der Heide, F.M., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: SPAA 2011: Proc. of the 23rd annual ACM symposium on parallel algorithms and architectures (accepted for publication)","DOI":"10.1145\/1989493.1989515"},{"issue":"5","key":"13_CR18","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":"13_CR19","doi-asserted-by":"crossref","unstructured":"Brandes, P., Degener, B., Kempkes, B., auf\u00a0der Heide, F.M.: Energy-efficient strategies for building short chains of mobile robots locally (2011), http:\/\/wwwhni.uni-paderborn.de\/alg\/publikationen","DOI":"10.1007\/978-3-642-22212-2_13"},{"key":"13_CR20","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)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22212-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T01:06:42Z","timestamp":1560388002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22212-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222115","9783642222122"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22212-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}