{"type":"ScholarlyArticle","title":"Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems","authors":[{"name":"David Klaška","slug":"david-klaska","given":"David","family":"Klaska","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Antonín Kučera","slug":"antonin-kucera","given":"Antonin","family":"Kucera","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Martin Kurečka","slug":"martin-kurecka","given":"Martin","family":"Kurečka","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Vít Musil","slug":"vit-musil","given":"Vit","family":"Musil","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Petr Novotný","slug":"petr-novotny","given":"Petr","family":"Novotný","affiliation":"Masaryk University , Brno , Czech Republic"},{"name":"Vojtěch Řehák","slug":"vojtech-rehak","given":"Vojtech","family":"Rehak","affiliation":"Masaryk University , Brno , Czech Republic"}],"abstract":"We consider the problem of synthesizing resilient and stochastically stable strategies for systems of cooperating agents striving to minimize the expected time between consecutive visits to selected locations in a known environment. A strategy profile is resilient if it retains its functionality even if some of the agents fail, and stochastically stable if the visiting time variance is small. We design a novel specification language for objectives involving resilience and stochastic stability, and we show how to efficiently compute strategy profiles (for both autonomous and coordinated agents) optimizing these objectives. Our experiments show that our strategy synthesis algorithm can construct highly non-trivial and efficient strategy profiles for environments with general topology.","doi":"10.24963/ijcai.2023/20","url":"https://ijcai.org/proceedings/2023/20","pdf":"https://ijcai.org/proceedings/2023/0020.pdf","markdown":"https://ijcai.org/proceedings/2023/20.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/20","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Agent-based and Multi-agent Systems","track":"Main Track","number":20,"pages":{"first":171,"last":179},"keywords":["Planning and Scheduling: PS: Robot planning","Agent-based and Multi-agent Systems: MAS: Multi-agent planning","Agent-based and Multi-agent Systems: MAS: Coordination and cooperation"],"videos":[],"references":[{"position":1,"raw":"[Almeida et al., 2004] A. Almeida, G. Ramalho, H. Santana, P. Tedesco, T. Menezes, V. Corruble, and Y. Chevaleyr. Recent advances on multi-agent patrolling. Advances in Artificial Intelligence -SBIA, 3171:474-483, 2004.","title":"Recent advances on multi-agent patrolling","authors":"A Almeida, G Ramalho, H Santana, P Tedesco, T Menezes, V Corruble, Y Chevaleyr","year":"2004","venue":"Advances in Artificial Intelligence -SBIA","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Basilico et al., 2016] N. Basilico, A. Lanzi, and M. Monga. A security game model for remote software protection. In Proceedings of ARES 2016, pages 437-443, 2016.","title":"A security game model for remote software protection","authors":"N Basilico, A Lanzi, M Monga","year":"2016","venue":"Proceedings of ARES 2016","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Brázdil et al., 2017] T. Brázdil, K. Chatterjee, V. Forejt, and A. Kučera. Trading performance for stability in Markov decision processes. Journal of Computer and System Sci- ences, 84:144-170, 2017.","title":"Trading performance for stability in Markov decision processes","authors":"T Brázdil, K Chatterjee, V Forejt, A Kučera","year":"2017","venue":"Journal of Computer and System Sciences","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ceccato and Tonella, 2011] M. Ceccato and P. Tonella. Codebender: Remote software protection using orthogo- nal replacement. IEEE Software, 28(2):28-34, 2011.","title":"Codebender: Remote software protection using orthogonal replacement","authors":"M Ceccato, P Tonella","year":"2011","venue":"IEEE Software","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Choset, 2005] H.M. Choset. Principles of Robot Motion: Theory, Algorithms, and Implementation. MIT Press, 2005.","title":"Principles of Robot Motion: Theory, Algorithms, and Implementation","authors":"H M Choset","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Collberg et al., 2012] C. Collberg, S. Martin, J. Myers, and J. Nagra. Distributed application tamper detection via con- tinuous software updates. In Proceedings of the 28th An- nual Computer Security Applications Conference, pages 319-328. ACM Press, 2012.","title":"Distributed application tamper detection via continuous software updates","authors":"C Collberg, S Martin, J Myers, J Nagra","year":"2012","venue":"Proceedings of the 28th Annual Computer Security Applications Conference","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Czyzowicz et al., 2017] J. Czyzowicz, L. Gasieniec, A. Kosowski, E. Kranakis, D. Krizanc, and N. Taleb. When patrolmen become corrupted: Monitoring a graph using faulty mobile robots. Algorithmica, 79:925-940, 2017.","title":"When patrolmen become corrupted: Monitoring a graph using faulty mobile robots","authors":"J Czyzowicz, L Gasieniec, A Kosowski, E Kranakis, D Krizanc, N Taleb","year":"2017","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dixon, 2019] A. Dixon. Multi-Agent Systems: Design, Syn- thesis and Analysis. Clanrye International, 2019.","title":"Multi-Agent Systems: Design, Synthesis and Analysis","authors":"A Dixon","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Gronauer and Diepold, 2022] S. Gronauer and K. Diepold. Multi-agent deep reinforcement learning: A survey. Arti- ficial Intelligence Review, 55:895-943, 2022.","title":"Multi-agent deep reinforcement learning: A survey","authors":"S Gronauer, K Diepold","year":"2022","venue":"Artificial Intelligence Review","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Hazon and Kaminka, 2005] N. Hazon and G.A. Kaminka. Redundancy, efficiency and robustness in multi-robot cov- erage. In Proceedings of ICRA 2005, pages 735-741. IEEE Computer Society Press, 2005.","title":"Redundancy, efficiency and robustness in multi-robot coverage","authors":"N Hazon, G A Kaminka","year":"2005","venue":"Proceedings of ICRA 2005","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Huang et al., 2019] L. Huang, M. Zhou, K. Hao, and E. Hou. A survey of multi-robot regular and adversar- ial patrolling. IEEE/CAA Journal of Automatica Sinica, 6(4):894-903, 2019.","title":"A survey of multi-robot regular and adversarial patrolling","authors":"L Huang, M Zhou, K Hao, E Hou","year":"2019","venue":"IEEE/CAA Journal of Automatica Sinica","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Kawamura and Soejima, 2020] A. Kawamura and M. Soe- jima. Simple strategies versus optimal schedules in multi- agent patrolling. Theoretical Computer Science, 839:195- 206, 2020.","title":"Simple strategies versus optimal schedules in multiagent patrolling","authors":"A Kawamura, M Soejima","year":"2020","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Kingma and Ba, 2015] D. P. Kingma and J. Ba. Adam: A method for stochastic optimization. In Proceedings of ICLR 2015, 2015.","title":"Adam: A method for stochastic optimization","authors":"D P Kingma, J Ba","year":"2015","venue":"Proceedings of ICLR 2015","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Klaška et al., 2021] D. Klaška, A. Kučera, V. Musil, and V. Řehák. Regstar: Efficient strategy synthesis for adver- sarial patrolling games. In Proceedings of UAI 2021, pages 471-481, 2021.","title":"Regstar: Efficient strategy synthesis for adversarial patrolling games","authors":"D Klaška, A Kučera, V Musil, V Řehák","year":"2021","venue":"Proceedings of UAI 2021","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Klaška et al., 2022] D. Klaška, A. Kučera, V. Musil, and V. Řehák. General optimization framework for recurrent reachability objectives. In Proceedings of the Interna- tional Joint Conference on Artificial Intelligence (IJCAI- ECAI 2022), pages 4642-4648, 2022.","title":"General optimization framework for recurrent reachability objectives","authors":"D Klaška, A Kučera, V Musil, V Řehák","year":"2022","venue":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2022)","doi":null,"url":null,"internal_url":"/proceedings/2022/644"},{"position":16,"raw":"[Klaška et al., 2023] D. Klaška, A. Kučera, M. Kurečka, V. Musil, P. Novotný and V. Řehák. Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems. arXiv:2305.10070 [cs.MA], 2023.","title":"Synthesizing Resilient Strategies for Infinite-Horizon Objectives in Multi-Agent Systems","authors":"D Klaška, A Kučera, M Kurečka, V Musil, P Novotný, V Řehák","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[LaValle, 2006] S.M. LaValle. Planning Algorithms. Cam- bridge University Press, 2006.","title":"Planning Algorithms","authors":"S M Lavalle","year":"2006","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Norris, 1998] J.R. Norris. Markov Chains. Cambridge Uni- versity Press, 1998.","title":"Markov Chains","authors":"J R Norris","year":"1998","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Paszke et al., 2019] A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, A. Desmaison, A. Kopf, E. Yang, Z. DeVito, M. Raison, A. Tejani, S. Chilamkurthy, B. Steiner, Lu Fang, J. Bai, and S. Chintala. Pytorch: An imperative style, high- performance deep learning library. In Advances in Neu- ral Information Processing Systems 32, pages 8024-8035.","title":"Pytorch: An imperative style, highperformance deep learning library","authors":"A Paszke, S Gross, F Massa, A Lerer, J Bradbury, G Chanan, T Killeen, Z Lin, N Gimelshein, L Antiga, A Desmaison, A Kopf, E Yang, Z Devito, M Raison, A Tejani, S Chilamkurthy, B Steiner, Lu Fang, J Bai, S Chintala","year":null,"venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"Curran Associates, Inc., 2019. [Portugal and Rocha, 2011]","title":"Portugal and Rocha","authors":"Curran Associates, Inc","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"D. Portugal and R. Rocha. A survey on multi-robot patrolling algorithms. Technolog- ical Innovation for Sustainability, 349:139-146, 2011.","title":"A survey on multi-robot patrolling algorithms","authors":"D, R Rocha","year":"2011","venue":"Technological Innovation for Sustainability","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Shoham, 2008] Y. Shoham. Multiagent Systems. Cambridge University Press, 2008.","title":"Multiagent Systems","authors":"Y Shoham","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Sinha et al., 2018] A. Sinha, F. Fang, B. An, C. Kiekintveld, and M. Tambe. Stackelberg security games: Looking be- yond a decade of success. In Proceedings of the Inter- national Joint Conference on Artificial Intelligence (IJCAI 2018), pages 5494-5501, 2018.","title":"Stackelberg security games: Looking beyond a decade of success","authors":"A Sinha, F Fang, B An, C Kiekintveld, M Tambe","year":"2018","venue":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2018)","doi":null,"url":null,"internal_url":"/proceedings/2018/775"},{"position":24,"raw":"[Smith et al., 2011] S.L. Smith, J. Tůmová, C. Belta, and D. Rus. Optimal path planning for surveillance with temporal-logic constraints. International Journal of Robotics Research, 30(14):1695-1708, 2011.","title":"Optimal path planning for surveillance with temporal-logic constraints","authors":"S L Smith, J Tůmová, C Belta, D Rus","year":"2011","venue":"International Journal of Robotics Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Tarjan, 1972] R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal of Computing, 1(2), 1972.","title":"Depth-first search and linear graph algorithms","authors":"R Tarjan","year":"1972","venue":"SIAM Journal of Computing","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Toth and Vigo, 2001] P. Toth and D. Vigo. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathe- matics and Applications. SIAM, 2001.","title":"The Vehicle Routing Problem","authors":"P Toth, D Vigo","year":"2001","venue":"SIAM Monographs on Discrete Mathematics and Applications","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[van der Hoek and Wooldridge, 2012] W. van der Hoek and M. Wooldridge. Logics for multiagent systems. AI Maga- zine, 33(3):92-105, 2012.","title":"Logics for multiagent systems","authors":"Hoek Van Der, ] W Wooldridge, M Van Der Hoek, Wooldridge","year":"2012","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Wooldridge, 2009] M. Wooldridge. Introduction to MultiA- gent Systems. Wiley, 2009.","title":"Introduction to MultiAgent Systems","authors":"M Wooldridge","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Yin et al., 2010] Z. Yin, D. Korzhyk, C. Kiekintveld, V. Conitzer, and M. Tambe. Stackelberg vs. Nash in se- curity games: Interchangeability, equivalence, and unique- ness. In Proceedings of AAMAS 2010, pages 1139-1146, 2010.","title":"Stackelberg vs. Nash in security games: Interchangeability, equivalence, and uniqueness","authors":"Z Yin, D Korzhyk, C Kiekintveld, V Conitzer, M Tambe","year":"2010","venue":"Proceedings of AAMAS 2010","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}