{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:57Z","timestamp":1760202717874,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"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":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_23","type":"book-chapter","created":{"date-parts":[[2017,10,5]],"date-time":"2017-10-05T23:30:06Z","timestamp":1507246206000},"page":"323-340","source":"Crossref","is-referenced-by-count":10,"title":["Universally Optimal Gathering Under Limited\u00a0Visibility"],"prefix":"10.1007","author":[{"given":"Pavan","family":"Poudel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Agathangelou, C. Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: PODC, pp. 250\u2013259 (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Ando, H., Suzuki, I., Yamashita, M.: Formation and agreement problems for synchronous mobile robots with limited visibility. In: ISIC, pp. 453\u2013460 (1995)","DOI":"10.1109\/ISIC.1995.525098"},{"key":"23_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). doi: 10.1007\/3-540-45061-0_90"},{"issue":"4","key":"23_CR4","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."},{"issue":"6","key":"23_CR5","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 J. Comput. 34(6), 1516\u20131528 (2005)","journal-title":"SIAM J. Comput."},{"key":"23_CR6","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., et al.: 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. 6543, pp. 178\u2013189. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-18381-2_15"},{"key":"23_CR7","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., et al.: A new approach for analyzing convergence algorithms for mobile robots. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 650\u2013661. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22012-8_52"},{"key":"23_CR8","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, pp. 301\u2013312 (2016)","DOI":"10.1145\/2935764.2935789"},{"key":"23_CR9","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). doi: 10.1007\/978-3-642-31104-8_28"},{"key":"23_CR10","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, pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Degener, B. Kempkes, B., Meyer auf der Heide, F.: A local o(n$$^{2}$$) gathering algorithm. In: SPAA, pp. 217\u2013223 (2010)","DOI":"10.1145\/1810479.1810523"},{"key":"23_CR12","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). doi: 10.1007\/978-3-319-11764-5_15"},{"issue":"2","key":"23_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-016-0278-7","volume":"30","author":"G Stefano Di","year":"2017","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distrib. Comput. 30(2), 75\u201386 (2017)","journal-title":"Distrib. Comput."},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-319-72751-6_13","volume-title":"Algorithms for Sensor Systems","author":"Matthias Fischer","year":"2017","unstructured":"Fischer, M., Jung, D., Meyer auf der Heide, F.: Gathering anonymous, oblivious robots on a grid. CoRR, abs\/1702.03400 (2017)"},{"issue":"2","key":"23_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume":"3","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theory 3(2), 1\u2013185 (2012)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"issue":"1\u20133","key":"23_CR16","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":"23_CR17","unstructured":"Izumi, T., Kawabata, Y., Kitamura, N.: Toward time-optimal gathering for limited visibility model (2015). https:\/\/sites.google.com\/site\/micromacfrance\/abstract-tasuke"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Kempkes, B., Kling, P., Meyer auf der Heide, F. Optimal and competitive runtime bounds for continuous, local gathering of mobile robots. In: SPAA, pp. 18\u201326 (2012)","DOI":"10.1145\/2312005.2312009"},{"key":"23_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-319-14472-6_17","volume-title":"Principles of Distributed Systems","author":"T Lukovszki","year":"2014","unstructured":"Lukovszki, T., Meyer auf der Heide, F.: Fast collisionless pattern formation by anonymous, position-aware robots. In: Aguilera, M.K., Querzoni, L., Shapiro, M. (eds.) OPODIS 2014. LNCS, vol. 8878, pp. 248\u2013262. Springer, Cham (2014). doi: 10.1007\/978-3-319-14472-6_17"},{"issue":"2\u20133","key":"23_CR20","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."},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/978-3-642-45346-5_2","volume-title":"Algorithms for Sensor Systems","author":"G Prencipe","year":"2014","unstructured":"Prencipe, G.: Autonomous mobile robots: a distributed computing perspective. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 6\u201321. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-45346-5_2"},{"issue":"1","key":"23_CR22","doi-asserted-by":"publisher","first-page":"3:1","DOI":"10.1145\/3056460","volume":"12","author":"G Sharma","year":"2017","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S., Malveaux, C.: Tight analysis of a collisionless robot gathering algorithm. ACM Trans. Auton. Adapt. Syst. 12(1), 3:1\u20133:20 (2017)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/11945529_24","volume-title":"Principles of Distributed Systems","author":"S Souissi","year":"2006","unstructured":"Souissi, S., D\u00e9fago, X., Yamashita, M.: Gathering asynchronous mobile robots with inaccurate compasses. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 333\u2013349. Springer, Heidelberg (2006). doi: 10.1007\/11945529_24"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T05:17:09Z","timestamp":1570166229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}