{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T16:57:01Z","timestamp":1780073821271,"version":"3.54.0"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030110710","type":"print"},{"value":"9783030110727","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-11072-7_10","type":"book-chapter","created":{"date-parts":[[2019,1,12]],"date-time":"2019-01-12T08:03:00Z","timestamp":1547280180000},"page":"234-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fault-Tolerant Mobile Robots"],"prefix":"10.1007","author":[{"given":"Xavier","family":"D\u00e9fago","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Maria","family":"Potop-Butucaru","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S\u00e9bastien","family":"Tixeuil","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,1,13]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/11516798_17","volume-title":"Principles of Distributed Systems","author":"I Abraham","year":"2005","unstructured":"Abraham, I., Amit, Y., Dolev, D.: Optimal resilience asynchronous approximate agreement. In: Higashino, T. (ed.) OPODIS 2004. LNCS, vol. 3544, pp. 229\u2013239. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11516798_17"},{"issue":"1","key":"10_CR2","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."},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-319-03089-0_13","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Auger","year":"2013","unstructured":"Auger, C., Bouzid, Z., Courtieu, P., Tixeuil, S., Urbain, X.: Certified impossibility results for Byzantine-tolerant mobile robots. In: Higashino, T., Katayama, Y., Masuzawa, T., Potop-Butucaru, M., Yamashita, M. (eds.) SSS 2013. LNCS, vol. 8255, pp. 178\u2013190. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03089-0_13"},{"issue":"3","key":"10_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/116873.116880","volume":"23","author":"F Aurenhammer","year":"1991","unstructured":"Aurenhammer, F.: Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv. 23(3), 345\u2013405 (1991)","journal-title":"ACM Comput. Surv."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-319-49259-9_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T Balabonski","year":"2016","unstructured":"Balabonski, T., Delga, A., Rieg, L., Tixeuil, S., Urbain, X.: Synchronous gathering without multiplicity detection: a certified algorithm. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 7\u201319. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_2"},{"key":"10_CR6","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":"10_CR7","doi-asserted-by":"crossref","unstructured":"Bhagat, S., Mukhopadhyaya, K.: Fault-tolerant gathering of semi-synchronous robots. In: Proceedings of 18th International Conference on Distributed Computing and Networking (ICDCN), Hyderabad, India, p. 6, January 2017","DOI":"10.1145\/3007748.3007781"},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/PL00008933","volume":"14","author":"E Borowsky","year":"2001","unstructured":"Borowsky, E., Gafni, E., Lynch, N.A., Rajsbaum, S.: The BG distributed simulation algorithm. Distrib. Comput. 14(3), 127\u2013146 (2001)","journal-title":"Distrib. Comput."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: Proceedings of 33rd IEEE International Conference on Distributed Computing Systems (ICDCS), Philadelphia, PA, USA, pp. 337\u2013346, July 2013","DOI":"10.1109\/ICDCS.2013.27"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-10877-8_7","volume-title":"Principles of Distributed Systems","author":"Z Bouzid","year":"2009","unstructured":"Bouzid, Z., Gradinariu Potop-Butucaru, M., Tixeuil, S.: Byzantine convergence in robot networks: the price of asynchrony. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol. 5923, pp. 54\u201370. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10877-8_7"},{"issue":"34\u201336","key":"10_CR11","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., Potop-Butucaru, M.G., Tixeuil, S.: Optimal Byzantine-resilient convergence in uni-dimensional robot networks. Theoret. Comput. Sci. 411(34\u201336), 3154\u20133168 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-25258-2_22","volume-title":"Structural Information and Communication Complexity","author":"Q Bramas","year":"2015","unstructured":"Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 313\u2013327. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25258-2_22"},{"issue":"2","key":"10_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1142\/S0129054117500083","volume":"28","author":"Q Bramas","year":"2017","unstructured":"Bramas, Q., Tixeuil, S.: The random bit complexity of mobile robots scattering. Int. J. Found. Comput. Sci. 28(2), 111\u2013134 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-49259-9_8","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"D Canepa","year":"2016","unstructured":"Canepa, D., Defago, X., Izumi, T., Potop-Butucaru, M.: Flocking with oblivious robots. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 94\u2013108. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49259-9_8"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-76627-8_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"D Canepa","year":"2007","unstructured":"Canepa, D., Potop-Butucaru, M.G.: Stabilizing flocking via leader election in robot networks. In: Masuzawa, T., Tixeuil, S. (eds.) SSS 2007. LNCS, vol. 4838, pp. 52\u201366. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76627-8_7"},{"issue":"11","key":"10_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.ipl.2010.04.006","volume":"110","author":"J Cl\u00e9ment","year":"2010","unstructured":"Cl\u00e9ment, J., D\u00e9fago, X., Potop-Butucaru, M.G., Izumi, T., Messika, S.: The cost of probabilistic agreement in oblivious robot networks. Inf. Process. Lett. 110(11), 431\u2013438 (2010)","journal-title":"Inf. Process. Lett."},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-27796-5_8","volume-title":"Structural Information and Communication Complexity","author":"R Cohen","year":"2004","unstructured":"Cohen, R., Peleg, D.: Robot convergence via center-of-gravity algorithms. In: Kr\u00e1lovic\u0306, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol. 3104, pp. 79\u201388. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27796-5_8"},{"issue":"6","key":"10_CR18","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."},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","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."},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.ipl.2014.11.001","volume":"115","author":"P Courtieu","year":"2015","unstructured":"Courtieu, P., Rieg, L., Tixeuil, S., Urbain, X.: Impossibility of gathering, a certification. Inf. Process. Lett. 115(3), 447\u2013452 (2015)","journal-title":"Inf. Process. Lett."},{"key":"10_CR21","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. Theoret. Comput. Sci. 609, 171\u2013184 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11864219_4","volume-title":"Distributed Computing","author":"X D\u00e9fago","year":"2006","unstructured":"D\u00e9fago, X., Gradinariu, M., Messika, S., Raipin-Parv\u00e9dy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46\u201360. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11864219_4"},{"key":"10_CR23","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. CoRR abs\/1602.05546 (2016)"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2013.07.033","volume":"506","author":"Y Dieudonn\u00e9","year":"2013","unstructured":"Dieudonn\u00e9, Y., Lev\u00e9, F., Petit, F., Villain, V.: Deterministic geoleader election in disoriented anonymous systems. Theoret. Comput. Sci. 506, 43\u201354 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10_CR25","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.ipl.2006.09.008","volume":"101","author":"Y Dieudonne","year":"2007","unstructured":"Dieudonne, Y., Petit, F.: Circle formation of weak robots and Lyndon words. Inf. Process. Lett. 101(4), 156\u2013162 (2007)","journal-title":"Inf. Process. Lett."},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-72914-3_11","volume-title":"Fun with Algorithms","author":"Y Dieudonn\u00e9","year":"2007","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Robots and demons (the code of the origins). In: Crescenzi, P., Prencipe, G., Pucci, G. (eds.) FUN 2007. LNCS, vol. 4475, pp. 108\u2013119. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72914-3_11"},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1142\/S0129626409000146","volume":"19","author":"Y Dieudonn\u00e9","year":"2009","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Scatter of robots. Parallel Process. Lett. 19(1), 175\u2013184 (2009)","journal-title":"Parallel Process. Lett."},{"key":"10_CR28","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. Theoret. Comput. Sci. 428, 47\u201357 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"10_CR29","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974)","journal-title":"Commun. ACM"},{"issue":"3","key":"10_CR30","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 (JACM) 33(3), 499\u2013516 (1986)","journal-title":"J. ACM (JACM)"},{"issue":"1\u20133","key":"10_CR31","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\u20133), 147\u2013168 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR32","unstructured":"Gervasi, V., Prencipe, G.: Flocking by a set of autonomous mobile robots. Technical report TR-01-24, Universitat di Pisa (2001)"},{"key":"10_CR33","unstructured":"Gervasi, V., Prencipe, G.: Coordination without communication: the case of the flocking problem. Discret. Appl. Math. (2003)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Heriban, A., D\u00e9fago, X., Tixeuil, S.: Optimally gathering two robots. In: Bellavista, P., Garg, V.K. (eds.) Proceedings of the 19th International Conference on Distributed Computing and Networking. ICDCN 2018, 4\u20137 January 2018, Varanasi, India, pp. 3:1\u20133:10. ACM, New York (2018)","DOI":"10.1145\/3154273.3154323"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Izumi, T., Bouzid, Z., Tixeuil, S., Wada, K.: The BG-simulation for Byzantine mobile robots. CoRR abs\/1106.0113 (2011)","DOI":"10.1007\/978-3-642-24100-0_32"},{"key":"10_CR36","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":"10_CR37","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2018.04.047","volume":"738","author":"T Izumi","year":"2018","unstructured":"Izumi, T., Kaino, D., Potop-Butucaru, M.G., Tixeuil, S.: On time complexity for connectivity-preserving scattering of mobile robots. Theoret. Comput. Sci. 738, 42\u201352 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10_CR38","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":"10_CR39","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TMECH.2006.871100","volume":"11","author":"A Qadi","year":"2006","unstructured":"Qadi, A., Huang, J., Farritor, S., Goddard, S.: Localization and follow-the-leader control of a heterogeneous group of mobile robots. IEEE\/ASME Trans. Mechatron. 11, 205\u2013215 (2006)","journal-title":"IEEE\/ASME Trans. Mechatron."},{"key":"10_CR40","unstructured":"Lindhe, M.: A flocking and obstacle avoidance algorithm for mobile robots. Ph.D. thesis, KTH Stockholm (2004)"},{"key":"10_CR41","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2014.12.008","volume":"568","author":"F Ooshita","year":"2015","unstructured":"Ooshita, F., Tixeuil, S.: On the self-stabilization of mobile oblivious robots in uniform rings. Theoret. Comput. Sci. 568, 84\u201396 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Pattanayak, D., Mondal, K., Ramesh, H., Mandal, P.S.: Fault-tolerant gathering of mobile robots with weak multiplicity detection. In: Proceedings of the 18th International Conference on Distributed Computing and Networking, 5\u20137 January 2017, Hyderabad, India, p. 7. ACM (2017)","DOI":"10.1145\/3007748.3007786"},{"key":"10_CR43","unstructured":"Prencipe, G.: Corda: distributed coordination of a set of autonomous mobile robots. In: Proceedings of ERSADS, May 2001, pp. 185\u2013190 (2001)"},{"key":"10_CR44","unstructured":"Renaud, P., Cervera, E., Martinet, P.: Towards a reliable vision-based mobile robot formation control. In: 2004 IEEE\/RSJ International Conference on Intelligent Robots and Systems, Sendai, Japan, 28 September\u20132 October 2004, pp. 3176\u20133181. IEEE (2004)"},{"key":"10_CR45","unstructured":"Souissi, S.: Fault-resilient cooperation of autonomous mobile robots with unreliable compass sensors. Ph.D. thesis, Graduate School of Information Science, Japan Advanced Institute of Science and Technology (JAIST), September 2007"},{"issue":"1","key":"10_CR46","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\u20139:27 (2009)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"issue":"33","key":"10_CR47","doi-asserted-by":"publisher","first-page":"4350","DOI":"10.1016\/j.tcs.2010.11.011","volume":"412","author":"S Souissi","year":"2011","unstructured":"Souissi, S., Izumi, T., Wada, K.: Oracle-based flocking of mobile robots in crash-recovery model. Theoret. Comput. Sci. 412(33), 4350\u20134360 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR48","unstructured":"Suzuki, I., Yamashita, M.: A theory of distributed anonymous mobile robots formation and agreement problems. Technical report, Department of Electrical Engineering and Computer Science, Wisconsin University of Milwaukee, June 1994"},{"issue":"4","key":"10_CR49","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."},{"key":"10_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-45346-5_21","volume-title":"Algorithms for Sensor Systems","author":"G Viglietta","year":"2014","unstructured":"Viglietta, G.: Rendezvous of two robots with visible bits. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 291\u2013306. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-45346-5_21"},{"issue":"1","key":"10_CR51","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.jss.2010.08.026","volume":"84","author":"Y Yang","year":"2011","unstructured":"Yang, Y., Souissi, S., D\u00e9fago, X., Takizawa, M.: Fault-tolerant flocking for a group of autonomous mobile robots. J. Syst. Softw. 84(1), 29\u201336 (2011)","journal-title":"J. Syst. Softw."}],"container-title":["Lecture Notes in Computer Science","Distributed Computing by Mobile Entities"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-11072-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:25:53Z","timestamp":1710249953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-11072-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030110710","9783030110727"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-11072-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}