{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:22:16Z","timestamp":1742912536009,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983547"},{"type":"electronic","value":"9783319983554"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-98355-4_25","type":"book-chapter","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T10:34:57Z","timestamp":1533724497000},"page":"434-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rendezvous of Asynchronous Mobile Robots with Lights"],"prefix":"10.1007","author":[{"given":"Takashi","family":"Okumura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Katayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,9]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/050645221","volume":"36","author":"N Agmon","year":"2006","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36, 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: Proceedings of 33rd ICDCS (2013)","DOI":"10.1109\/ICDCS.2013.27"},{"issue":"4","key":"25_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2015.09.018","volume":"609","author":"S Das","year":"2016","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theor. Comput. Sci. 609, 171\u2013184 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR5","unstructured":"D\u00e9fago, X., Potop-Butucaru, M.G., Cl\u00e9ment, J., Messika, S., Raipin Parv\u00e9dy, P.: Fault and byzantine tolerant self-stabilizing mobile robots gathering - feasibility study - CoRRabs\/1602.05546 (2016)"},{"key":"25_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: Proceedings of 23rd ACM SPAA, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"issue":"13","key":"25_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2011.12.010","volume":"428","author":"Y Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Petite, F.: Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428(13), 47\u201357 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02008-7","volume-title":"Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory","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)"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.01.025","volume":"621","author":"P Flocchini","year":"2016","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous with constant memory. Theor. Comput. Sci. 621, 57\u201372 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"25_CR10","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. 337(1\u20133), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Heriban, A., D\u00e9fago, X., Tixeuil, S.: Optimally gathering two robots. Research Report HAL Id: hal-01575451. UPMC Sorbonne Universit\u00e9s, August 2017","DOI":"10.1145\/3154273.3154323"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-24100-0_32","volume-title":"Distributed Computing","author":"T Izumi","year":"2011","unstructured":"Izumi, T., Bouzid, Z., Tixeuil, S., Wada, K.: Brief announcement: the BG-simulation for byzantine mobile robots. In: Peleg, D. (ed.) DISC 2011. LNCS, vol. 6950, pp. 330\u2013331. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24100-0_32"},{"key":"25_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-75142-7_24","volume-title":"Distributed Computing","author":"T Izumi","year":"2007","unstructured":"Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: an optimal result. In: Pelc, A. (ed.) DISC 2007. LNCS, vol. 4731, pp. 298\u2013312. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75142-7_24"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., et al.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"25_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-642-22212-2_14","volume-title":"Structural Information and Communication Complexity","author":"S Kamei","year":"2011","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol. 6796, pp. 150\u2013161. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22212-2_14"},{"issue":"6","key":"25_CR16","doi-asserted-by":"publisher","first-page":"2096","DOI":"10.1137\/040620552","volume":"46","author":"J Lin","year":"2007","unstructured":"Lin, J., Morse, A.S., Anderson, B.D.O.: The multi-agent rendezvous problem. Parts 1 and 2. SIAM J. Control Optim. 46(6), 2096\u20132147 (2007)","journal-title":"SIAM J. Control Optim."},{"issue":"2\u20133","key":"25_CR17","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. Theor. Comput. Sci. 384(2\u20133), 222\u2013231 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462187.1462196","volume":"4","author":"S Souissi","year":"2009","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. 4(1), 1\u201327 (2009)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"25_CR20","unstructured":"Terai, S., Wada, K., Katayama, Y.: Gathering problems for autonomous mobile robots with lights. Technical report of Wada Labo., Hosei University, TRW-16-1 (2016)"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Viglietta, G.: Rendezvous of two robots with visible bits. Technical report arXiv:1211.6039 (2012)","DOI":"10.1007\/978-3-642-45346-5_21"}],"container-title":["Lecture Notes in Computer Science","Adventures Between Lower Bounds and Higher Altitudes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98355-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:18:53Z","timestamp":1710335933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-98355-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983547","9783319983554"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98355-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"9 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}