{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T01:55:22Z","timestamp":1747878922399,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031210167"},{"type":"electronic","value":"9783031210174"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21017-4_18","type":"book-chapter","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:06:34Z","timestamp":1667930794000},"page":"270-284","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Time Optimal Gathering of\u00a0Myopic Robots on\u00a0an\u00a0Infinite Triangular Grid"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0546-3894","authenticated-orcid":false,"given":"Pritam","family":"Goswami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8940-392X","authenticated-orcid":false,"given":"Avisek","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1747-4037","authenticated-orcid":false,"given":"Satakshi","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7008-6135","authenticated-orcid":false,"given":"Buddhadeb","family":"Sau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"issue":"1","key":"18_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(1), 56\u201382 (2006). https:\/\/doi.org\/10.1137\/050645221","journal-title":"SIAM J. Comput."},{"issue":"5","key":"18_CR2","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 Trans. Rob. Autom. 15(5), 818\u2013828 (1999). https:\/\/doi.org\/10.1109\/70.795787","journal-title":"IEEE Trans. Rob. Autom."},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Augustine, J., Jr., W.K.M.: Dispersion of mobile robots: a study of memory-time trade-offs. In: Bellavista, P., Garg, V.K. (eds.) Proceedings of the 19th International Conference on Distributed Computing and Networking, ICDCN 2018, Varanasi, India, 4\u20137 January 2018, pp. 1:1\u20131:10. ACM (2018). https:\/\/doi.org\/10.1145\/3154273.3154293","DOI":"10.1145\/3154273.3154293"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-15612-5_14","volume-title":"WALCOM: Algorithms and Computation","author":"S Bhagat","year":"2015","unstructured":"Bhagat, S., Gan Chaudhuri, S., Mukhopadhyaya, K.: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. In: Rahman, M.S., Tomita, E. (eds.) WALCOM 2015. LNCS, vol. 8973, pp. 149\u2013160. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15612-5_14"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.tcs.2020.02.016","volume":"815","author":"K Bose","year":"2020","unstructured":"Bose, K., Adhikary, R., Kundu, M.K., Sau, B.: Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor. Comput. Sci. 815, 213\u2013227 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.02.016","journal-title":"Theor. Comput. Sci."},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.tcs.2020.10.015","volume":"849","author":"K Bose","year":"2021","unstructured":"Bose, K., Kundu, M.K., Adhikary, R., Sau, B.: Arbitrary pattern formation by asynchronous opaque robots with lights. Theor. Comput. Sci. 849, 138\u2013158 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.10.015","journal-title":"Theor. Comput. Sci."},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Cicerone, S., Fonso, A.D., Stefano, G.D., Navarra, A.: Arbitrary pattern formation on infinite regular tessellation graphs. In: ICDCN\u201921: International Conference on Distributed Computing and Networking, Virtual Event, Nara, Japan, 5\u20138 January 2021, pp. 56\u201365. ACM (2021). https:\/\/doi.org\/10.1145\/3427796.3427833","DOI":"10.1145\/3427796.3427833"},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00446-017-0293-3","volume":"31","author":"S Cicerone","year":"2017","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms. Distrib. Comput. 31(1), 1\u201350 (2017). https:\/\/doi.org\/10.1007\/s00446-017-0293-3","journal-title":"Distrib. Comput."},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-030-24922-9_12","volume-title":"Structural Information and Communication Complexity","author":"S Cicerone","year":"2019","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies. In: Censor-Hillel, K., Flammini, M. (eds.) SIROCCO 2019. LNCS, vol. 11639, pp. 170\u2013184. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24922-9_12"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.tcs.2014.06.045","volume":"610","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., Stefano, G.D., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610, 158\u2013168 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2014.06.045","journal-title":"Theor. Comput. Sci."},{"key":"18_CR11","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jda.2013.09.006","volume":"26","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Stefano, G.D., Navarra, A.: Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26, 16\u201327 (2014). https:\/\/doi.org\/10.1016\/j.jda.2013.09.006","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"18_CR12","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. Theoret. Comput. Sci. 337(1), 147\u2013168 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.01.001","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR13","unstructured":"Grunbaum, B., Shephard, G.C.: Tilings and Patterns, New York (1987)"},{"issue":"34\u201336","key":"18_CR14","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1016\/j.tcs.2010.05.020","volume":"411","author":"R Klasing","year":"2010","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411(34\u201336), 3235\u20133246 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.020","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 390(1), 27\u201339 (2008). https:\/\/doi.org\/10.1016\/j.tcs.2007.09.032","journal-title":"Theor. Comput. Sci."},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Luna, G.A.D., Flocchini, P., Prencipe, G., Santoro, N.: Black hole search in dynamic rings. In: 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Washington DC, USA, 7\u201310 July 2021, pp. 987\u2013997. IEEE (2021). https:\/\/doi.org\/10.1109\/ICDCS51616.2021.00098","DOI":"10.1109\/ICDCS51616.2021.00098"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"Luna, G.A.D., Uehara, R., Viglietta, G., Yamauchi, Y.: Gathering on a circle with limited visibility by anonymous oblivious robots. In: Attiya, H. (ed.) 34th International Symposium on Distributed Computing, DISC 2020, 12\u201316 October 2020, Virtual Conference. LIPIcs, vol. 179, pp. 12:1\u201312:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2020.12","DOI":"10.4230\/LIPIcs.DISC.2020.12"},{"issue":"11","key":"18_CR18","doi-asserted-by":"publisher","first-page":"448","DOI":"10.3390\/info12110448","volume":"12","author":"P Poudel","year":"2021","unstructured":"Poudel, P., Sharma, G.: Time-optimal gathering under limited visibility with one-axis agreement. Information 12(11), 448 (2021). https:\/\/doi.org\/10.3390\/info12110448","journal-title":"Information"},{"key":"18_CR19","unstructured":"Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens. Wirel. Networks 1(1\u20132), 89\u2013124 (2005). http:\/\/www.oldcitypublishing.com\/journals\/ahswn-home\/ahswn-issue-contents\/ahswn-volume-1-number-1-2-2005\/ahswn-1-1-2-p-89-124\/"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21017-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:09:20Z","timestamp":1667930960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21017-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210167","9783031210174"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21017-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2022.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}