{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:57:44Z","timestamp":1725937064058},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319727509"},{"type":"electronic","value":"9783319727516"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72751-6_13","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T16:03:05Z","timestamp":1514649785000},"page":"168-181","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Gathering Anonymous, Oblivious Robots on a Grid"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Jung","sequence":"additional","affiliation":[]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering a closed chain of robots on a grid. In: IPDPS 2016, pp. 689\u2013699 (2016). https:\/\/doi.org\/10.1109\/IPDPS.2016.51","DOI":"10.1109\/IPDPS.2016.51"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Ando, H., Suzuki, Y., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: ISIC 1995, pp. 453\u2013460, August 1995","DOI":"10.21236\/ADA296911"},{"key":"13_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. 2719, pp. 1181\u20131196. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_90"},{"key":"13_CR4","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: Kr\u00e1lovic\u0306, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 79\u201388. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27796-5_8"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cord-Landwehr, A., Fischer, M., Jung, D., Meyer auf der Heide, F.: Asymptotically optimal gathering on a grid. In: SPAA 2016, pp. 301\u2013312 (2016). http:\/\/doi.acm.org\/10.1145\/2935764.2935789","DOI":"10.1145\/2935764.2935789"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: SPAA 2011, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"13_CR7","unstructured":"Degener, B., Kempkes, B., Meyer auf der Heide, F.: A local $$O(n^2)$$ O ( n 2 ) gathering algorithm. In: SPAA 2010, pp. 217\u2013223 (2010)"},{"issue":"1","key":"13_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D.R., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46(1), 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"13_CR9","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 TC10, pp. 137\u2013146, 1 January 2006","DOI":"10.1007\/978-0-387-34733-2_14"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-31104-8_28","volume-title":"Structural Information and Communication Complexity","author":"G D\u2019Angelo","year":"2012","unstructured":"D\u2019Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids without multiplicity detection. In: Even, G., Halld\u00f3rsson, M.M. (eds.) SIROCCO 2012. LNCS, vol. 7355, pp. 327\u2013338. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31104-8_28"},{"key":"13_CR11","unstructured":"Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering anonymous, oblivious robots on a grid. CoRR abs\/1702.03400 (2017). http:\/\/arxiv.org\/abs\/1702.03400"},{"key":"13_CR12","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02008-7","volume-title":"Distributed Computing by Oblivious Mobile Robots","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool, San Rafael (2012)"},{"issue":"1","key":"13_CR13","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., Souissi, S., Katayama, Y., Inuzuka, N., D\u00e9fago, X., Wada, K., Yamashita, M.: The gathering problem for two oblivious robots with unreliable compasses. SICOMP 41(1), 26\u201346 (2012)","journal-title":"SICOMP"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-72951-8_22","volume-title":"Structural Information and Communication Complexity","author":"Y Katayama","year":"2007","unstructured":"Katayama, Y., Tomida, Y., Imazu, H., Inuzuka, N., Wada, K.: Dynamic compass models and gathering algorithms for autonomous mobile robots. In: Prencipe, G., Zaks, S. (eds.) SIROCCO 2007. LNCS, vol. 4474, pp. 274\u2013288. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72951-8_22"},{"issue":"1","key":"13_CR15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. TCS 390(1), 27\u201339 (2008)","journal-title":"TCS"},{"issue":"36","key":"13_CR16","doi-asserted-by":"crossref","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. TCS 410(36), 3391\u20133405 (2009)","journal-title":"TCS"},{"issue":"9","key":"13_CR17","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1016\/j.automatica.2009.05.013","volume":"45","author":"S Mart\u00eenez","year":"2009","unstructured":"Mart\u00eenez, S.: Practical multiagent rendezvous through modified circumcenter algorithms. Automatica 45(9), 2010\u20132017 (2009)","journal-title":"Automatica"},{"issue":"2\u20133","key":"13_CR18","doi-asserted-by":"crossref","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. TCS 384(2\u20133), 222\u2013231 (2007)","journal-title":"TCS"},{"issue":"1","key":"13_CR19","first-page":"93","volume":"47","author":"S Saadatmand","year":"2016","unstructured":"Saadatmand, S., Moazzami, D., Moeini, A.: A cellular automaton based algorithm for mobile sensor gathering. JAC 47(1), 93\u201399 (2016)","journal-title":"JAC"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-03578-9_18","volume-title":"Structural Information and Communication Complexity","author":"G Stefano Di","year":"2013","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 213\u2013224. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03578-9_18"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-319-11764-5_15","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Stefano Di","year":"2014","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering on infinite grids. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 211\u2013225. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_15"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72751-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T16:10:50Z","timestamp":1660234250000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}