{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T02:46:53Z","timestamp":1769827613593,"version":"3.49.0"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,25]],"date-time":"2017-01-25T00:00:00Z","timestamp":1485302400000},"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":["Distrib. Comput."],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s00446-017-0293-3","type":"journal-article","created":{"date-parts":[[2017,1,25]],"date-time":"2017-01-25T22:30:54Z","timestamp":1485383454000},"page":"1-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Gathering of robots on meeting-points: feasibility and optimal resolution algorithms"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8893-9335","authenticated-orcid":false,"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,25]]},"reference":[{"key":"293_CR1","unstructured":"Abshoff, S., Cord-Landwehr, A., Jung, D., Meyer auf der Heide, F.: Towards gathering robots with limited view in linear time: the closed chain case. CoRR abs\/1501.04877 (2015). http:\/\/arxiv.org\/abs\/1501.04877"},{"key":"293_CR2","doi-asserted-by":"crossref","unstructured":"Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of 32nd ACM Symposium on Principles of Distributed Computing (PODC) (2013)","DOI":"10.1145\/2484239.2484266"},{"issue":"1","key":"293_CR3","doi-asserted-by":"crossref","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)","journal-title":"SIAM J. Comput."},{"key":"293_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-34690-6","volume-title":"Stigmergic Optimization, Studies in Computational Intelligence","author":"A Ajith","year":"2006","unstructured":"Ajith, A., Crina, G., Vitorino, R.: Stigmergic Optimization, Studies in Computational Intelligence, vol. 31. Springer, Berlin (2006)"},{"issue":"5","key":"293_CR5","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1287\/opre.50.5.772.363","volume":"50","author":"S Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search: a personal perspective. Oper. Res. 50(5), 772\u2013795 (2002)","journal-title":"Oper. Res."},{"key":"293_CR6","doi-asserted-by":"crossref","unstructured":"Anderegg, L., Cieliebak, M., Prencipe, G.: Efficient algorithms for detecting regular point configurations. In: Proceedings of 9th Italian Conference on Theoretical Computer Science (ICTCS), LNCS, vol. 3701, pp. 23\u201335. Springer (2005)","DOI":"10.1007\/11560586_4"},{"key":"293_CR7","volume-title":"Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties.","author":"G Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)"},{"issue":"1","key":"293_CR8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02187906","volume":"3","author":"C Bajaj","year":"1988","unstructured":"Bajaj, C.: The algebraic degree of geometric optimization problems. Discrete Comput. Geom. 3(1), 177\u2013191 (1988)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"293_CR9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1142\/S1793830911001346","volume":"3","author":"B Balamohan","year":"2011","unstructured":"Balamohan, B., Flocchini, P., Miri, A., Santoro, N.: Time optimal algorithms for black hole search in rings. Discrete Math. Algorithm Appl. 3(4), 457\u2013472 (2011)","journal-title":"Discrete Math. Algorithm Appl."},{"key":"293_CR10","doi-asserted-by":"crossref","unstructured":"Bampas, E., Czyzowicz, J., Gasieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Proceedings of 24th International Symposium on Distributed Computing (DISC), LNCS, vol. 6343, pp. 297\u2013311 (2010)","DOI":"10.1007\/978-3-642-15763-9_28"},{"issue":"1","key":"293_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"MA Bender","year":"2002","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: exploring and mapping directed graphs. Inf. Comput. 176(1), 1\u201321 (2002)","journal-title":"Inf. Comput."},{"key":"293_CR12","doi-asserted-by":"crossref","unstructured":"Bolla, K., Kov\u00e1cs, T., Fazekas, G.: Investigating the rate of failure of asynchronous gathering in a swarm of fat robots with limited visibility. In: Proceedings of 13th International Conference on Artificial Intelligence and Soft Computing (ICAISC), LNCS, vol. 8468, pp. 249\u2013256. Springer (2014)","DOI":"10.1007\/978-3-319-07176-3_22"},{"key":"293_CR13","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: Proceedings of IEEE 33rd International Conference on Distributed Computing Systems (ICDCS), pp. 337\u2013346 (2013)","DOI":"10.1109\/ICDCS.2013.27"},{"key":"293_CR14","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Dolev, S., Potop-Butucaru, M., Tixeuil, S.: Robocast: Asynchronous communication in robot networks. In: Principles of Distributed Systems\u201414th International Conference, OPODIS 2010. LNCS, vol. 6490, pp. 16\u201331. Springer (2010)","DOI":"10.1007\/978-3-642-17653-1_2"},{"key":"293_CR15","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S.: Rendezvous of mobile agents without agreement on local orientation. In: Proceedings of 37th International Confernce on Automata, Languages and Programming (ICALP), LNCS, vol. 6199, pp. 515\u2013526 (2010)","DOI":"10.1007\/978-3-642-14162-1_43"},{"key":"293_CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tcs.2013.02.010","volume":"509","author":"J Chalopin","year":"2013","unstructured":"Chalopin, J., Das, S., Labourel, A., Markou, E.: Tight bounds for black hole search with scattered agents in synchronous rings. Theor. Comput. Sci. 509, 70\u201385 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR17","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Das, S., Widmayer, P.: Rendezvous of mobile agents in directed graphs. In: Proceedings of 24th International Symposium on Distributed Computing (DISC), LNCS, vol. 6343, pp. 282\u2013296. Springer (2010)","DOI":"10.1007\/978-3-642-15763-9_27"},{"issue":"3","key":"293_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00446-015-0259-2","volume":"29","author":"J Chalopin","year":"2016","unstructured":"Chalopin, J., Dieudonn\u00e9, Y., Labourel, A., Pelc, A.: Rendezvous in networks in spite of delay faults. Distributed Comput. 29(3), 187\u2013205 (2016)","journal-title":"Distributed Comput."},{"key":"293_CR19","doi-asserted-by":"crossref","unstructured":"Chatterjee, A., Chaudhuri, S.G., Mukhopadhyaya, K.: Gathering asynchronous swarm robots under nonuniform limited visibility. In: Proceedings of 11th International Confernce on Distributed Computing and Internet Technology (ICDCIT), LNCS, vol. 8956, pp. 174\u2013180. Springer (2015)","DOI":"10.1007\/978-3-319-14977-6_11"},{"key":"293_CR20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.jda.2015.04.001","volume":"33","author":"SG Chaudhuri","year":"2015","unstructured":"Chaudhuri, S.G., Mukhopadhyaya, K.: Leader election and gathering for asynchronous fat robots without common chirality. J. Discrete Algorithms 33, 171\u2013192 (2015)","journal-title":"J. Discrete Algorithms"},{"key":"293_CR21","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Minimum-traveled-distance gathering of oblivious robots over given meeting-points. In: Proceedings of 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Algosensors), LNCS, vol. 8847, pp. 57\u201372. Springer (2014)","DOI":"10.1007\/978-3-662-46018-4_4"},{"key":"293_CR22","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Gathering of robots on meeting-points. In: Proceedings of 11th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics (Algosensors), LNCS, vol. 9536, pp. 183\u2013195. Springer (2015)","DOI":"10.1007\/978-3-319-28472-9_14"},{"key":"293_CR23","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Minmax-distance gathering on given meeting-points. In: Proceedings of 9th International Confernce on Algorithms and Complexity (CIAC), LNCS, vol. 9079, pp. 127\u2013139. Springer (2015)","DOI":"10.1007\/978-3-319-18173-8_9"},{"key":"293_CR24","doi-asserted-by":"crossref","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Asynchronous embedded pattern formation without orientation. In: Gavoille, C., Ilcinkas, D. (eds.) Distributed Computing. DISC 2016. Lecture Notes in Computer Science, vol.\u00a09888, pp.\u00a085\u201398. Springer, Berlin, Heidelberg (2016)","DOI":"10.1007\/978-3-662-53426-7_7"},{"key":"293_CR25","doi-asserted-by":"crossref","unstructured":"Cieliebak, M.: Gathering non-oblivious mobile robots. In: Proceedings of 6th Latin American Symposium on Theoretical Informatics (LATIN), LNCS, vol. 2976, pp. 577\u2013588. Springer (2004)","DOI":"10.1007\/978-3-540-24698-5_60"},{"issue":"4","key":"293_CR26","doi-asserted-by":"crossref","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":"4","key":"293_CR27","doi-asserted-by":"crossref","first-page":"206","DOI":"10.2307\/2688541","volume":"42","author":"EJ Cockayne","year":"1969","unstructured":"Cockayne, E.J., Melzak, Z.A.: Euclidean constructibility in graph-minimization problems. Math. Mag. 42(4), 206\u2013208 (1969)","journal-title":"Math. Mag."},{"issue":"6","key":"293_CR28","doi-asserted-by":"crossref","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."},{"issue":"1","key":"293_CR29","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1137\/060665257","volume":"38","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. SIAM J. Comput. 38(1), 276\u2013302 (2008)","journal-title":"SIAM J. Comput."},{"key":"293_CR30","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Dobrev, S., Georgiou, K., Kranakis, E., MacQuarrie, F.: Evacuating two robots from multiple unknown exits in a circle. In: Proceeding of 17th International Confernce on Distributed Computing and Networking (ICDCN), pp. 28:1\u201328:8. ACM (2016)","DOI":"10.1145\/2833312.2833318"},{"issue":"6\u20137","key":"293_CR31","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6\u20137), 481\u2013499 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR32","doi-asserted-by":"crossref","unstructured":"Czyzowicz, J., Georgiou, K., Kranakis, E., Narayanan, L., Opatrny, J., Vogtenhuber, B.: Evacuating robots from a disk using face-to-face communication (extended abstract). In: Proceedings of 9th International Confernce on Algorithms and Complexity (CIAC), LNCS, vol. 9079, pp. 140\u2013152. Springer (2015)","DOI":"10.1007\/978-3-319-18173-8_10"},{"issue":"2","key":"293_CR33","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s00446-011-0141-9","volume":"25","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: How to meet when you forget: log-space rendezvous in arbitrary graphs. Distributed Comput. 25(2), 165\u2013178 (2012)","journal-title":"Distributed Comput."},{"issue":"2","key":"293_CR34","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s00446-013-0201-4","volume":"27","author":"J Czyzowicz","year":"2014","unstructured":"Czyzowicz, J., Kosowski, A., Pelc, A.: Time versus space trade-offs for rendezvous in trees. Distributed Comput. 27(2), 95\u2013109 (2014)","journal-title":"Distributed Comput."},{"issue":"4","key":"293_CR35","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/2344422.2344427","volume":"8","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Pelc, A., Labourel, A.: How to meet asynchronously (almost) everywhere. ACM Trans. Algorithms 8(4), 37 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"293_CR36","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.tcs.2014.06.045","volume":"610","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610, 158\u2013168 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR37","doi-asserted-by":"crossref","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. In: Search Theory: A Game Theoretic Perspective, pp. 197\u2013222. Springer (2013)","DOI":"10.1007\/978-1-4614-6825-7_13"},{"issue":"4","key":"293_CR38","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00446-014-0212-9","volume":"27","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distributed Comput. 27(4), 255\u2013285 (2014)","journal-title":"Distributed Comput."},{"issue":"4","key":"293_CR39","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1007\/s00453-014-9892-6","volume":"72","author":"G D\u2019Angelo","year":"2015","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica 72(4), 1055\u20131096 (2015)","journal-title":"Algorithmica"},{"key":"293_CR40","doi-asserted-by":"crossref","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":"293_CR41","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Gradinariu, M., Messika, S., Parv\u00e9dy, P.R.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Proceedings of 20th International Symposium on Distributed Computing (DISC), LNCS, vol. 4167, pp. 46\u201360. Springer (2006)","DOI":"10.1007\/11864219_4"},{"key":"293_CR42","doi-asserted-by":"crossref","unstructured":"Degener, B., Kempkes, B., Langner, T., Meyer auf\u00a0der Heide, F., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of 23rd ACM Symposium on Parallelism in algorithms and architectures (SPAA), pp. 139\u2013148 (2011)","DOI":"10.1145\/1989493.1989515"},{"key":"293_CR43","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.tcs.2015.09.002","volume":"605","author":"M D\u2019Emidio","year":"2015","unstructured":"D\u2019Emidio, M., Frigioni, D., Navarra, A.: Explore and repair graphs with black holes using mobile entities. Theor. Comput. Sci. 605, 129\u2013145 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR44","doi-asserted-by":"crossref","unstructured":"D\u2019Emidio, M., Frigioni, D., Navarra, A.: Characterizing the computational power of anonymous mobile robots. In: Proceedings of 36th IEEE International Confernce on Distributed Computing Systems, (ICDCS), pp. 293\u2013302. IEEE (2016)","DOI":"10.1109\/ICDCS.2016.58"},{"key":"293_CR45","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., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica 46, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"293_CR46","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs. In: Proceedings of 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS, vol. 8179, pp. 213\u2013224 (2013)","DOI":"10.1007\/978-3-319-03578-9_18"},{"key":"293_CR47","doi-asserted-by":"crossref","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering on infinite grids. In: Proceedings of 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, vol. 8756, pp. 211\u2013225. Springer (2014)","DOI":"10.1007\/978-3-319-11764-5_15"},{"key":"293_CR48","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Dolev, S., Petit, F., Segal, M.: Deaf, dumb, and chatting asynchronous robots. In: Proceedings of 13th International Confernce on Principles of Distributed Systems (OPODIS), LNCS, vol. 5923, pp. 71\u201385. Springer (2009)","DOI":"10.1007\/978-3-642-10877-8_8"},{"issue":"1","key":"293_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2629656","volume":"11","author":"Y Dieudonn\u00e9","year":"2014","unstructured":"Dieudonn\u00e9, Y., Pelc, A., Peleg, D.: Gathering despite mischief. ACM Trans. Algorithms 11(1), 1 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"293_CR50","doi-asserted-by":"crossref","unstructured":"Dieudonn\u00e9, Y., Petit, F., Villain, V.: Leader election problem versus pattern formation problem. In: Proceedings of 24th International Symposium on Distributed Computing (DISC), LNCS, vol. 6343, pp. 267\u2013281. Springer (2010)","DOI":"10.1007\/978-3-642-15763-9_26"},{"key":"293_CR51","doi-asserted-by":"crossref","unstructured":"Farrugia, A., Gasieniec, L., Kuszner, L., Pacheco, E.: Deterministic rendezvous in restricted graphs. In: Proceedings of 41st International Confernce on Current Trends in Theory and Practice of Computer Science (SOFSEM), LNCS, vol. 8939, pp. 189\u2013200. Springer (2015)","DOI":"10.1007\/978-3-662-46078-8_16"},{"key":"293_CR52","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 Publishers, San Rafael (2012)"},{"key":"293_CR53","doi-asserted-by":"crossref","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, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR54","doi-asserted-by":"crossref","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."},{"key":"293_CR55","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Pelc, A.: Deterministic rendezvous in trees with little memory. In: Proceedings of 22nd International Symposium on Distributed Computing (DISC), LNCS, vol. 5218, pp. 242\u2013256 (2008)","DOI":"10.1007\/978-3-540-87779-0_17"},{"key":"293_CR56","doi-asserted-by":"crossref","unstructured":"Fujinaga, N., Ono, H., Kijima, S., Yamashita, M.: Pattern formation through optimum matching by oblivious corda robots. In: Proceedings of 14th International Conference on Principles of Distributed Systems (OPODIS), LNCS, vol. 6490, pp. 1\u201315. Springer-Verlag (2010)","DOI":"10.1007\/978-3-642-17653-1_1"},{"issue":"3","key":"293_CR57","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1137\/140958682","volume":"44","author":"N Fujinaga","year":"2015","unstructured":"Fujinaga, N., Yamauchi, Y., Ono, H., Kijima, S., Yamashita, M.: Pattern formation by oblivious asynchronous mobile robots. SIAM J. Comput. 44(3), 740\u2013785 (2015)","journal-title":"SIAM J. Comput."},{"key":"293_CR58","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/j.tcs.2012.07.004","volume":"509","author":"S Guilbault","year":"2013","unstructured":"Guilbault, S., Pelc, A.: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theor. Comput. Sci. 509, 86\u201396 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2014.08.004","volume":"557","author":"A Honorat","year":"2014","unstructured":"Honorat, A., Potop-Butucaru, M., Tixeuil, S.: Gathering fat mobile robots with slim omnidirectional cameras. Theor. Comput. Sci. 557, 1\u201327 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR60","doi-asserted-by":"crossref","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile robots gathering algorithm with local weak multiplicity in rings. In: Proceedings of 17th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS, vol. 6058, pp. 101\u2013113 (2010)","DOI":"10.1007\/978-3-642-13284-1_9"},{"issue":"4","key":"293_CR61","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TPDS.2012.212","volume":"24","author":"T Izumi","year":"2013","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Feasibility of polynomial-time randomized gathering for oblivious mobile robots. IEEE Trans. Parallel Distrib. Syst. 24(4), 716\u2013723 (2013)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"6","key":"293_CR62","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1587\/transfun.E96.A.1072","volume":"96\u2013A","author":"T Izumi","year":"2013","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings. IEICE Trans. 96\u2013A(6), 1072\u20131080 (2013)","journal-title":"IEICE Trans."},{"key":"293_CR63","doi-asserted-by":"crossref","unstructured":"Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: An optimal result. In: Proceedings of 21st International Symposium on Distributed Computing (DISC), LNCS, vol. 4731, pp. 298\u2013312. Springer (2007)","DOI":"10.1007\/978-3-540-75142-7_24"},{"issue":"1","key":"293_CR64","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. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"293_CR65","doi-asserted-by":"crossref","unstructured":"Kamei, S., Lamani, A., Ooshita, F.: Asynchronous ring gathering by oblivious robots with limited vision. In: Proceedings of 33rd IEEE International Symposium on Reliable Distributed Systems Workshops, SRDS, pp. 46\u201349 (2014)","DOI":"10.1109\/SRDSW.2014.15"},{"key":"293_CR66","doi-asserted-by":"crossref","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S.: Asynchronous mobile robot gathering from symmetric configurations without global multiplicity detection. In: Proceedings of 37th International Symposium on Mathematical Foundations of Computer Science (MFCS), vol. 7464, pp. 542\u2013553. Springer-Verlag (2012)","DOI":"10.1007\/978-3-642-32589-2_48"},{"key":"293_CR67","doi-asserted-by":"crossref","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, 3235\u20133246 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR68","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. Theor. Comput. Sci. 390, 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR69","doi-asserted-by":"crossref","unstructured":"Komuravelli, A., Mihal\u00e1k, M.: Exploring polygonal environments by simple robots with faulty combinatorial vision. In: Proceeding of 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, vol. 5873, pp. 458\u2013471. Springer (2009)","DOI":"10.1007\/978-3-642-05118-0_32"},{"issue":"41","key":"293_CR70","doi-asserted-by":"crossref","first-page":"5752","DOI":"10.1016\/j.tcs.2011.05.054","volume":"412","author":"A Kosowski","year":"2011","unstructured":"Kosowski, A., Navarra, A., Pinotti, M.C.: Synchronous black hole search in directed graphs. Theor. Comput. Sci. 412(41), 5752\u20135759 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"293_CR71","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Markou, E.: The Mobile Agent Rendezvous Problem in the Ring. Morgan & Claypool, San Rafael (2010)","DOI":"10.2200\/S00278ED1V01Y201004DCT001"},{"key":"293_CR72","unstructured":"Kupitz, Y., Martini, H.: Geometric aspects of the generalized Fermat-Torricelli problem. No.\u00a06 in Intuitive Geometry. Bolyai Society Math Studies (1997)"},{"issue":"3","key":"293_CR73","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/net.21453","volume":"59","author":"A Pelc","year":"2012","unstructured":"Pelc, A.: Deterministic rendezvous in networks: a comprehensive survey. Networks 59(3), 331\u2013347 (2012)","journal-title":"Networks"},{"key":"293_CR74","volume-title":"Design and Analysis of Distributed Algorithms","author":"N Santoro","year":"2007","unstructured":"Santoro, N.: Design and Analysis of Distributed Algorithms. Wiley, New York (2007)"},{"issue":"3","key":"293_CR75","doi-asserted-by":"crossref","first-page":"193","DOI":"10.2307\/2589675","volume":"106","author":"J Sekino","year":"1999","unstructured":"Sekino, J.: n-Ellipses and the minimum distance sum problem. Am. Math. Mon. 106(3), 193\u2013202 (1999)","journal-title":"Am. Math. Mon."},{"key":"293_CR76","doi-asserted-by":"publisher","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) (2009). doi: 10.1145\/1462187.1462196","DOI":"10.1145\/1462187.1462196"},{"key":"293_CR77","doi-asserted-by":"crossref","unstructured":"Viglietta, G.: Rendezvous of two robots with visible bits. In: Proceedings of 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, (Algosensors), LNCS, vol. 8243, pp. 291\u2013306. Springer (2013)","DOI":"10.1007\/978-3-642-45346-5_21"},{"key":"293_CR78","first-page":"355","volume":"43","author":"E Weiszfeld","year":"1936","unstructured":"Weiszfeld, E.: Sur le point pour lequel la somme des distances de $$n$$ n points donn\u00e9s est minimum. Tohoku Math. 43, 355\u2013386 (1936)","journal-title":"Tohoku Math."},{"key":"293_CR79","unstructured":"Weiszfeld, E., Plastria, F.: On the point for which the sum of the distances to n given points is minimum. Ann. Oper. Res. 167(1), 7\u201341 (2009)"},{"key":"293_CR80","doi-asserted-by":"crossref","unstructured":"Yamashita, M., Souissi, S., D\u00e9fago, X.: Gathering two stateless mobile robots using very inaccurate compasses in finite time. In: Proceedings of 1st International Conference on Robot Communication and Coordination (RoboComm), pp. 48:1\u201348:4 (2007)","DOI":"10.4108\/ICST.ROBOCOMM2007.2199"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-017-0293-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0293-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-017-0293-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T20:08:06Z","timestamp":1658520486000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-017-0293-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,25]]},"references-count":80,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["293"],"URL":"https:\/\/doi.org\/10.1007\/s00446-017-0293-3","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,25]]}}}