{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:34:38Z","timestamp":1759847678166,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T00:00:00Z","timestamp":1581033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T00:00:00Z","timestamp":1581033600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003176","name":"Ministerio de Educaci\u00f3n, Cultura y Deporte","doi-asserted-by":"publisher","award":["FPU14\/04705"],"award-info":[{"award-number":["FPU14\/04705"]}],"id":[{"id":"10.13039\/501100003176","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["MTM2016-76272-R"],"award-info":[{"award-number":["MTM2016-76272-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100010665","name":"H2020 Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["2016-734922"],"award-info":[{"award-number":["2016-734922"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10878-020-00533-z","type":"journal-article","created":{"date-parts":[[2020,2,7]],"date-time":"2020-02-07T11:04:05Z","timestamp":1581073445000},"page":"988-1016","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the robustness of a synchronized multi-robot system"],"prefix":"10.1007","volume":"39","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Brunner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6847-4283","authenticated-orcid":false,"given":"Luis-Evaristo","family":"Caraballo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9-Miguel","family":"D\u00edaz-B\u00e1\u00f1ez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario A.","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,7]]},"reference":[{"key":"533_CR1","unstructured":"Abdulla AEAA, Fadlullah ZMd, Nishiyama H, Kato N, Ono F, Miura R (2014) An optimal data collection technique for improved utility in uas-aided networks. In: 2014 IEEE conference on computer communications, INFOCOM 2014, pp 736\u2013744"},{"key":"533_CR2","unstructured":"Alena O, Niels A, James C, Bruce G, Erwin P (2018) Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: a survey. Networks, to appear"},{"key":"533_CR3","doi-asserted-by":"crossref","unstructured":"Almeida A, Ramalho G, Santana H, Tedesco P, Menezes T, Corruble V, Chevaleyre Y (2004) Recent advances on multi-agent patrolling. In: Brazilian symposium on artificial intelligence. Springer, pp 474\u2013483","DOI":"10.1007\/978-3-540-28645-5_48"},{"issue":"2","key":"533_CR4","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10878-018-0297-3","volume":"36","author":"S Bereg","year":"2018","unstructured":"Bereg S, Caraballo L-E, D\u00edaz-B\u00e1\u00f1ez J-M, Lopez MA (2018) Computing the $$k$$-resilience of a synchronized multi-robot system. J Comb Optim 36(2):365\u2013391","journal-title":"J Comb Optim"},{"issue":"4","key":"533_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1002\/jgt.3190080406","volume":"8","author":"F Boesch","year":"1984","unstructured":"Boesch F, Tindell R (1984) Circulants and their connectivities. J Graph Theory 8(4):487\u2013499","journal-title":"J Graph Theory"},{"issue":"1\u20134","key":"533_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1016639210559","volume":"31","author":"H Choset","year":"2001","unstructured":"Choset H (2001) Coverage for robotics-a survey of recent results. Ann Math Artif Intell 31(1\u20134):113\u2013126","journal-title":"Ann Math Artif Intell"},{"key":"533_CR7","doi-asserted-by":"crossref","unstructured":"Clark CM, Rock SM, Latombe J-C (2003) Motion planning for multiple mobile robots using dynamic networks. In: Proceedings of the 2003 IEEE international conference on robotics and automation, ICRA\u201903, vol\u00a03. IEEE, pp 4222\u20134227","DOI":"10.1109\/ROBOT.2003.1242252"},{"key":"533_CR8","doi-asserted-by":"crossref","unstructured":"Collins A, Czyzowicz J, Gasieniec L, Kosowski A, Kranakis E, Krizanc D, Martin R, Ponce OM (2013) Optimal patrolling of fragmented boundaries. In: Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures. ACM, pp 241\u2013250","DOI":"10.1145\/2486159.2486176"},{"key":"533_CR9","doi-asserted-by":"crossref","unstructured":"Czyzowicz J, Gasieniec L, Kosowski A, Kranakis E (2011) Boundary patrolling by mobile agents with distinct maximal speeds. In: European symposium on algorithms. Springer, pp 701\u2013712","DOI":"10.1007\/978-3-642-23719-5_59"},{"key":"533_CR10","unstructured":"Czyzowicz J, Kosowski A, Kranakis E, Taleb N (2016) Patrolling trees with mobile robots. In: International symposium on foundations and practice of security. Springer, pp 331\u2013344"},{"key":"533_CR11","doi-asserted-by":"crossref","unstructured":"D\u00edaz-B\u00e1\u00f1ez J-M, Caraballo L-E, Lopez M, Bereg S, Maza I, Ollero A (2015) The synchronization problem for information exchange between aerial robots under communication constraints. In: 2015 International conference on robotics and automation (ICRA). IEEE","DOI":"10.1109\/ICRA.2015.7139843"},{"issue":"4","key":"533_CR12","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1109\/TRO.2017.2676123","volume":"33","author":"J-M D\u00edaz-B\u00e1\u00f1ez","year":"2017","unstructured":"D\u00edaz-B\u00e1\u00f1ez J-M, Caraballo L-E, Lopez M, Bereg S, Maza I, Ollero A (2017) A general framework for synchronizing a team of robots under communication constraints. IEEE Trans Robotics 33(4):748\u2013755","journal-title":"IEEE Trans Robotics"},{"key":"533_CR13","doi-asserted-by":"publisher","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 (2016) Rendezvous with constant memory. Theor. Comput. Sci. 621:57\u201372","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"533_CR14","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran E, Carreras M (2013) A survey on coverage path planning for robotics. Robotics Auton Syst 61(12):1258\u20131276","journal-title":"Robotics Auton Syst"},{"key":"533_CR15","doi-asserted-by":"crossref","unstructured":"Hamacher HW (1992) Combinatorial optimization models motivated by robotic assembly problems. In: Combinatorial optimization. Springer, pp 187\u2013198","DOI":"10.1007\/978-3-642-77489-8_9"},{"issue":"12","key":"533_CR16","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1016\/j.robot.2008.01.006","volume":"56","author":"N Hazon","year":"2008","unstructured":"Hazon N, Kaminka GA (2008) On redundancy, efficiency, and robustness in coverage for multiple robots. Robotics Auton Syst 56(12):1102\u20131114","journal-title":"Robotics Auton Syst"},{"issue":"2","key":"533_CR17","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/jagm.1999.1055","volume":"34","author":"MR Henzinger","year":"2000","unstructured":"Henzinger MR, Rao S, Gabow HN (2000) Computing vertex connectivity: new bounds from old techniques. J Algorithms 34(2):222\u2013250","journal-title":"J Algorithms"},{"issue":"1\u20132","key":"533_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1002\/rob.20221","volume":"25","author":"MA Hsieh","year":"2008","unstructured":"Hsieh MA, Cowley A, Kumar V, Taylor CJ (2008) Maintaining network connectivity and performance in robot teams. J Field Robotics 25(1\u20132):111\u2013131","journal-title":"J Field Robotics"},{"issue":"3","key":"533_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1023\/A:1011449311477","volume":"5","author":"S-I Hwang","year":"2001","unstructured":"Hwang S-I, Cheng S-T (2001) Combinatorial optimization in real-time scheduling: theory and algorithms. J Comb Optim 5(3):345\u2013375","journal-title":"J Comb Optim"},{"key":"533_CR20","unstructured":"Kranakis E, Krizanc D (2015) Optimization problems in infrastructure security. In: International symposium on foundations and practice of security. Springer, pp 3\u201313"},{"issue":"1\u201346","key":"533_CR21","first-page":"4","volume":"2","author":"L Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz L (1993) Random walks on graphs. Comb Paul Erdos Eighty 2(1\u201346):4","journal-title":"Comb Paul Erdos Eighty"},{"issue":"4","key":"533_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10776-016-0319-y","volume":"23","author":"A Mazayev","year":"2016","unstructured":"Mazayev A, Correia N, Sch\u00fctz G (2016) Data gathering in wireless sensor networks using unmanned aerial vehicles. Int J Wireless Inf Netw 23(4):297\u2013309","journal-title":"Int J Wireless Inf Netw"},{"key":"533_CR23","unstructured":"Meijer PT (1991) Connectivities and diameters of circulant graphs. Master\u2019s thesis, Simon Fraser University, 12"},{"issue":"3","key":"533_CR24","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1137\/15M1010737","volume":"37","author":"R Patel","year":"2016","unstructured":"Patel R, Carron A, Bullo F (2016) The hitting time of multiple random walks. SIAM J Matrix Anal Appl 37(3):933\u2013954","journal-title":"SIAM J Matrix Anal Appl"},{"issue":"2","key":"533_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1023\/A:1011219024159","volume":"11","author":"N Roy","year":"2001","unstructured":"Roy N, Dudek G (2001) Collaborative robot exploration and rendezvous: algorithms, performance bounds and observations. Auton Robots 11(2):117\u2013136","journal-title":"Auton Robots"},{"key":"533_CR26","doi-asserted-by":"publisher","DOI":"10.1090\/stml\/030","volume-title":"Geometry and billiards","author":"S Tabachnikov","year":"2005","unstructured":"Tabachnikov S (2005) Geometry and billiards. Amer. Math. Soc, Providence"},{"key":"533_CR27","unstructured":"Tetali P, Winkler P (1991) On a random walk problem arising in self-stabilizing token management. In: Proceedings of the tenth annual ACM symposium on principles of distributed computing. ACM, pp 273\u2013280"},{"key":"533_CR28","doi-asserted-by":"crossref","unstructured":"Winfield AFT (2000) Distributed sensing and data collection via broken ad hoc wireless connected networks of mobile robots. In: Distributed autonomous robotic systems, vol 4. Springer, pp 273\u2013282","DOI":"10.1007\/978-4-431-67919-6_26"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00533-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00533-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00533-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T22:25:56Z","timestamp":1612823156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00533-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,7]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00533-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,2,7]]},"assertion":[{"value":"7 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}