{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:45:00Z","timestamp":1782971100235,"version":"3.54.5"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T00:00:00Z","timestamp":1565049600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JSPS KAKENHI Grants No. 23500060"],"award-info":[{"award-number":["JSPS KAKENHI Grants No. 23500060"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["No. 26330020"],"award-info":[{"award-number":["No. 26330020"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["No. 17K00019"],"award-info":[{"award-number":["No. 17K00019"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Agence Nationale de Recherche","award":["R-DISCOVER"],"award-info":[{"award-number":["R-DISCOVER"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s00446-019-00359-x","type":"journal-article","created":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T11:02:25Z","timestamp":1565089345000},"page":"393-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Self-stabilizing gathering of mobile robots under crash or Byzantine faults"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2377-205X","authenticated-orcid":false,"given":"Xavier","family":"D\u00e9fago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6488-8326","authenticated-orcid":false,"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5605-2262","authenticated-orcid":false,"given":"Philippe","family":"Raipin-Parv\u00e9dy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"issue":"1","key":"359_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)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"359_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. Robot. Autom. 15(5), 818\u2013828 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"359_CR3","doi-asserted-by":"crossref","unstructured":"Balabonski, T., Delga, A., Rieg, L., Tixeuil, S., Urbain, X.: Synchronous gathering without multiplicity detection: a certified algorithm. In: Proceedings of the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), LNCS, vol. 10083, pp. 7\u201319, Lyon, France (November 2016)","DOI":"10.1007\/978-3-319-49259-9_2"},{"key":"359_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2015.10.005","volume":"36","author":"S Bhagat","year":"2016","unstructured":"Bhagat, S., Gan Chaudhuri, S., Mukhopadhyaya, K.: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discrete Algorithms 36, 50\u201362 (2016)","journal-title":"J. Discrete Algorithms"},{"key":"359_CR5","doi-asserted-by":"crossref","unstructured":"Bhagat, S., Mukhopadhyaya, K.: Fault-tolerant gathering of semi-synchronous robots. In: Proceedings of the 18th International Conference on Distributed Computing and Networking (ICDCN), number\u00a06, Hyderabad, India (January 2017)","DOI":"10.1145\/3007748.3007781"},{"key":"359_CR6","doi-asserted-by":"crossref","unstructured":"Bhagat, S., Mukhopadhyaya, K.: Optimum gathering of asynchronous robots. In: Proceedings of the 3rd International Conference on Algorithms and Discrete Applied Mathematics (CALDAM), LNCS, vol. 10156, pp. 37\u201349, Sancoale, Goa, India (February 2017)","DOI":"10.1007\/978-3-319-53007-9_4"},{"key":"359_CR7","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: Proceedings of the 33rd IEEE International Conference on Distributed Computing Systems (ICDCS), pp. 337\u2013346, Philadelphia, PA, USA (July 2013)","DOI":"10.1109\/ICDCS.2013.27"},{"key":"359_CR8","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Gradinariu Potop-Butucaru, M., Tixeuil, S.: Byzantine convergence in robot networks: the price of asynchrony. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS), LNCS, vol. 5923, pp. 54\u201370, N\u00eemes, France (December 2009)","DOI":"10.1007\/978-3-642-10877-8_7"},{"issue":"34\u201336","key":"359_CR9","doi-asserted-by":"publisher","first-page":"3154","DOI":"10.1016\/j.tcs.2010.05.006","volume":"411","author":"Z Bouzid","year":"2010","unstructured":"Bouzid, Z., Gradinariu Potop-Butucaru, M., Tixeuil, S.: Optimal Byzantine-resilient convergence in uni-dimensional robot networks. Theor. Comput. Sci. 411(34\u201336), 3154\u20133168 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"359_CR10","doi-asserted-by":"crossref","unstructured":"Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Structural Information and Communication Complexity\u201422nd International Colloquium (SIROCCO), Post-Proceedings, LNCS, vol. 9439, pp. 313\u2013327. Montserrat, Spain (July 2015)","DOI":"10.1007\/978-3-319-25258-2_22"},{"key":"359_CR11","unstructured":"Clement, J., D\u00e9fago, X., Gradinariu Potop-Butucaru, M., Messika, S., Raipin-Parv\u00e9dy, P.: Fault and Byzantine tolerant self-stabilizing mobile robots gathering. Technical Report $$\\langle $$hal-00746087$$\\rangle $$ (February 2012). https:\/\/hal.inria.fr\/hal-00746087"},{"key":"359_CR12","doi-asserted-by":"crossref","unstructured":"Cohen, R., Peleg, D.: Convergence of autonomous mobile robots with inaccurate sensors and movements. In: Durand, B., Thomas, W. (eds.) 23rd Annual Symposium on Theoretical Aspects of Computer Science (STACS\u201906), LNCS, vol. 3884, pp. 549\u2013560. Springer, Marseille, France (2006)","DOI":"10.1007\/11672142_45"},{"key":"359_CR13","doi-asserted-by":"crossref","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Certified universal gathering in $${\\mathbb{R}}^2$$ for oblivious mobile robots. In: Proceedings of the 30th International Symposium on Distributed Computing (DISC), LNCS, vol. 9888, pp. 187\u2013200, Paris, France (September 2016)","DOI":"10.1007\/978-3-662-53426-7_14"},{"key":"359_CR14","unstructured":"D\u00e9fago, X., Gardinariu Potop-Butucaru, M., Cl\u00e9ment, J., Messika, S., Raipin-Parv\u00e9dy, P.: Fault and Byzantine tolerant self-stabilizing mobile robots gathering. Research Report IS-RR-2015-003, Japan Adv. Inst. of Science and Tech. (JAIST), Hokuriku, Japan (February 2015)"},{"key":"359_CR15","unstructured":"D\u00e9fago, X., Gradinariu Potop-Butucaru, M., Cl\u00e9ment, J., Messika, S., Raipin Parv\u00e9dy, P.: Fault and Byzantine tolerant self-stabilizing mobile robots gathering\u2014feasibility study. CoRR, https:\/\/arxiv.org\/abs\/1602.05546"},{"key":"359_CR16","doi-asserted-by":"crossref","unstructured":"D\u00e9fago, X., Gradinariu Potop-Butucaru, M., Messika, S., Raipin-Parv\u00e9dy, P.: Fault-tolerant and self-stabilizing mobile robots gathering: feasibility study. In: DISC\u201906, pp. 46\u201360 (2006)","DOI":"10.1007\/11864219_4"},{"key":"359_CR17","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., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428, 47\u201357 (2012)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"359_CR18","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"key":"359_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"359_CR20","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":"359_CR21","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 mobile robots with limited visibility. Theor. Comput. Sci. 337, 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"359_CR22","doi-asserted-by":"publisher","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."},{"key":"359_CR23","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)"},{"issue":"1","key":"359_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0890-5401(03)00067-1","volume":"185","author":"NA Lynch","year":"2003","unstructured":"Lynch, N.A., Segala, R., Vaandrager, F.W.: Hybrid I\/O automata. Inf. Comput. 185(1), 105\u2013157 (2003)","journal-title":"Inf. Comput."},{"issue":"4","key":"359_CR25","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megido","year":"1983","unstructured":"Megido, N.: Linear-time algorithms for linear programming in $$\\mathbb{R}^3$$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"359_CR26","unstructured":"Pattanayak, D., Mondal, K., Ramesh, H., Sarathi Mandal, P.: Fault-tolerant gathering of mobile robots with weak multiplicity detection. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, Hyderabad, India, January 5\u20137, 2017, p.\u00a07 (2017)"},{"key":"359_CR27","unstructured":"Prencipe, G.: Corda: Distributed coordination of a set of autonomous mobile robots. In: Proceedings of the 4th European Research Seminar on Advances in Distributed Systems (ERSADS\u201901), pp. 185\u2013190, Bertinoro, Italy (May 2001)"},{"key":"359_CR28","doi-asserted-by":"crossref","unstructured":"Prencipe, G.: On the feasibility of gathering by autonomous mobile robots. In: Pelc, A., Raynal, M. (eds.) Proceedings of the Structural Information and Communication Complexity, 12th Intl Coll., SIROCCO 2005, LNCS, vol. 3499, pp. 246\u2013261. Springer, Mont Saint-Michel, France (May 2005)","DOI":"10.1007\/11429647_20"},{"issue":"1","key":"359_CR29","doi-asserted-by":"publisher","first-page":"9: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), 9:1\u201327 (2009)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"4","key":"359_CR30","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(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-019-00359-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-019-00359-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-019-00359-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,25]],"date-time":"2022-09-25T06:45:50Z","timestamp":1664088350000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-019-00359-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,6]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["359"],"URL":"https:\/\/doi.org\/10.1007\/s00446-019-00359-x","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,6]]},"assertion":[{"value":"8 February 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 July 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 August 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}