{"type":"ScholarlyArticle","title":"General Optimization Framework for Recurrent Reachability Objectives","authors":[{"name":"David Klaska","slug":"david-klaska","given":"David","family":"Klaska","affiliation":"Faculty of Informatics , Masaryk University , Brno , Czech Republic"},{"name":"Antonin Kucera","slug":"antonin-kucera","given":"Antonin","family":"Kucera","affiliation":"Faculty of Informatics , Masaryk University , Brno , Czech Republic"},{"name":"Vit Musil","slug":"vit-musil","given":"Vit","family":"Musil","affiliation":"Faculty of Informatics , Masaryk University , Brno , Czech Republic"},{"name":"Vojtech Rehak","slug":"vojtech-rehak","given":"Vojtech","family":"Rehak","affiliation":"Faculty of Informatics , Masaryk University , Brno , Czech Republic"}],"abstract":"We consider the mobile robot path planning problem for a class of recurrent reachability objectives. These objectives are parameterized by the expected time needed to visit one position from another, the expected square of this time, and also the frequency of moves between two neighboring locations. We design an efficient strategy synthesis algorithm for recurrent reachability objectives and demonstrate its functionality on non-trivial instances.","doi":"10.24963/ijcai.2022/644","url":"https://ijcai.org/proceedings/2022/644","pdf":"https://ijcai.org/proceedings/2022/0644.pdf","markdown":"https://ijcai.org/proceedings/2022/644.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/644","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Planning and Scheduling","track":"Main Track","number":644,"pages":{"first":4642,"last":4648},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Planning and Scheduling: Robot Planning","Agent-based and Multi-agent Systems: Algorithmic Game Theory","Planning and Scheduling: Planning Algorithms","Agent-based and Multi-agent Systems: Mechanism Design"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986911","length_sec":89,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985054","length_sec":358,"provider":"slideslive"}],"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":"[Bhatia et al., 2010] A. Bhatia, L.E. Kavraki, and M.Y. Vardi. Motion planning with hybrid dynamics and tempo- ral goals. In Proceedings of 49th IEEE Conference on De- cision and Control (CDC 2010), pages 1108-1115. IEEE Computer Society Press, 2010.","title":"Motion planning with hybrid dynamics and temporal goals","authors":"A Bhatia, L E Kavraki, M Y Vardi","year":"2010","venue":"Proceedings of 49th IEEE Conference on Decision and Control (CDC 2010)","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":"[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":5,"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":6,"raw":"[Kingma and Ba, 2015] Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization. In Proceed- ings of ICLR 2015, 2015.","title":"Adam: A method for stochastic optimization","authors":"P Diederik, Jimmy Kingma, Ba","year":"2015","venue":"Proceedings of ICLR 2015","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Klaska et al., 2018] David Klaska, Antonín Kucera, Tomás Lamser, and Vojtech Rehák. Automatic synthesis of ef- ficient regular strategies in adversarial patrolling games. In Elisabeth André, Sven Koenig, Mehdi Dastani, and Gita Sukthankar, editors, Proceedings of the 17th Interna- tional Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, July 10-15, 2018, pages 659-666. International Foundation for Au- tonomous Agents and Multiagent Systems Richland, SC, USA / ACM, 2018.","title":"Automatic synthesis of efficient regular strategies in adversarial patrolling games","authors":"David Klaska, Antonín Kucera, Tomás Lamser, Vojtech Rehák","year":"2018","venue":"Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018","doi":null,"url":null,"internal_url":null},{"position":8,"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":9,"raw":"[Paszke et al., 2019] Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith 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":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary Devito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, Soumith Chintala","year":null,"venue":"Advances in Neural Information Processing Systems","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Curran Associates, Inc., 2019.","title":null,"authors":"Curran Associates, Inc","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Patrizi et al., 2011] F. Patrizi, N. Lipovetzky, G. De Gia- como, and H. Geffner. Computing infinite plans for LTL goals using a classical planner. In Proceedings of the Inter- national Joint Conference on Artificial Intelligence (IJCAI 2011), page 2003-2008, 2011.","title":"Computing infinite plans for LTL goals using a classical planner","authors":"F Patrizi, N Lipovetzky, G De Giacomo, H Geffner","year":"2011","venue":"Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI 2011)","doi":null,"url":null,"internal_url":"/proceedings/2011/334"},{"position":12,"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":13,"raw":"[Puterman, 1994] M.L. Puterman. Markov Decision Pro- cesses. Wiley, 1994.","title":"Markov Decision Processes","authors":"M L Puterman","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":14,"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":15,"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":16,"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":17,"raw":"[Ulusoy et al., 2014] A. Ulusoy, S.L. Smith, X.C. Ding, C. Belta, and D. Rus. Optimality and robustness in multi- robot path planning with temporal logic constraints. In- ternational Journal of Robotics Research, 32(8):889-911, 2014.","title":"Optimality and robustness in multirobot path planning with temporal logic constraints","authors":"A Ulusoy, S L Smith, X C Ding, C Belta, D Rus","year":"2014","venue":"International Journal of Robotics Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Wolff et al., 2014] E.M. Wolff, U. Topku, and R.M. Murray. Optimization-based trajectory generation with linear tem- poral logic specification. In Proceedings of ICRA 2014, page 5319-5325. IEEE Computer Society Press, 2014.","title":"Optimization-based trajectory generation with linear temporal logic specification","authors":"E M Wolff, U Topku, R M Murray","year":"2014","venue":"Proceedings of ICRA 2014","doi":null,"url":null,"internal_url":null},{"position":19,"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."}