{"id":46,"date":"2025-09-17T09:00:41","date_gmt":"2025-09-17T09:00:41","guid":{"rendered":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/?page_id=46"},"modified":"2025-12-05T13:35:39","modified_gmt":"2025-12-05T13:35:39","slug":"publications","status":"publish","type":"page","link":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<div style=\"height:10px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n\n\n<nav class=\"is-responsive wp-block-navigation is-layout-flex wp-block-navigation-is-layout-flex\" aria-label=\"Navigation\" \n\t\t data-wp-interactive=\"core\/navigation\" data-wp-context='{\"overlayOpenedBy\":{\"click\":false,\"hover\":false,\"focus\":false},\"type\":\"overlay\",\"roleAttribute\":\"\",\"ariaLabel\":\"Menu\"}'><button aria-haspopup=\"dialog\" aria-label=\"Open menu\" class=\"wp-block-navigation__responsive-container-open\" \n\t\t\t\tdata-wp-on-async--click=\"actions.openMenuOnClick\"\n\t\t\t\tdata-wp-on--keydown=\"actions.handleMenuKeydown\"\n\t\t\t><svg width=\"24\" height=\"24\" xmlns=\"http:\/\/www.w3.org\/2000\/svg\" viewBox=\"0 0 24 24\" aria-hidden=\"true\" focusable=\"false\"><rect x=\"4\" y=\"7.5\" width=\"16\" height=\"1.5\" \/><rect x=\"4\" y=\"15\" width=\"16\" height=\"1.5\" \/><\/svg><\/button>\n\t\t\t\t<div class=\"wp-block-navigation__responsive-container\"  id=\"modal-1\" \n\t\t\t\tdata-wp-class--has-modal-open=\"state.isMenuOpen\"\n\t\t\t\tdata-wp-class--is-menu-open=\"state.isMenuOpen\"\n\t\t\t\tdata-wp-watch=\"callbacks.initMenu\"\n\t\t\t\tdata-wp-on--keydown=\"actions.handleMenuKeydown\"\n\t\t\t\tdata-wp-on-async--focusout=\"actions.handleMenuFocusout\"\n\t\t\t\ttabindex=\"-1\"\n\t\t\t>\n\t\t\t\t\t<div class=\"wp-block-navigation__responsive-close\" tabindex=\"-1\">\n\t\t\t\t\t\t<div class=\"wp-block-navigation__responsive-dialog\" \n\t\t\t\tdata-wp-bind--aria-modal=\"state.ariaModal\"\n\t\t\t\tdata-wp-bind--aria-label=\"state.ariaLabel\"\n\t\t\t\tdata-wp-bind--role=\"state.roleAttribute\"\n\t\t\t>\n\t\t\t\t\t\t\t<button aria-label=\"Close menu\" class=\"wp-block-navigation__responsive-container-close\" \n\t\t\t\tdata-wp-on-async--click=\"actions.closeMenuOnClick\"\n\t\t\t><svg xmlns=\"http:\/\/www.w3.org\/2000\/svg\" viewBox=\"0 0 24 24\" width=\"24\" height=\"24\" aria-hidden=\"true\" focusable=\"false\"><path d=\"m13.06 12 6.47-6.47-1.06-1.06L12 10.94 5.53 4.47 4.47 5.53 10.94 12l-6.47 6.47 1.06 1.06L12 13.06l6.47 6.47 1.06-1.06L13.06 12Z\"><\/path><\/svg><\/button>\n\t\t\t\t\t\t\t<div class=\"wp-block-navigation__responsive-container-content\" \n\t\t\t\tdata-wp-watch=\"callbacks.focusFirstElement\"\n\t\t\t id=\"modal-1-content\">\n\t\t\t\t\t\t\t\t<ul class=\"wp-block-navigation__container is-responsive wp-block-navigation\"><li class=\" wp-block-navigation-item wp-block-navigation-link\"><a class=\"wp-block-navigation-item__content\"  href=\"https:\/\/ktiml.mff.cuni.cz\/~svancara\/\"><span class=\"wp-block-navigation-item__label\">Home<\/span><\/a><\/li><li class=\" wp-block-navigation-item wp-block-navigation-link\"><a class=\"wp-block-navigation-item__content\"  href=\"https:\/\/ktiml.mff.cuni.cz\/~svancara\/teaching\/\"><span class=\"wp-block-navigation-item__label\">Teaching<\/span><\/a><\/li><li class=\" wp-block-navigation-item wp-block-navigation-link\"><a class=\"wp-block-navigation-item__content\"  href=\"https:\/\/ktiml.mff.cuni.cz\/~svancara\/publications\/\"><span class=\"wp-block-navigation-item__label\">Publications<\/span><\/a><\/li><li class=\" wp-block-navigation-item wp-block-navigation-link\"><a class=\"wp-block-navigation-item__content\"  href=\"https:\/\/ktiml.mff.cuni.cz\/~svancara\/thesis_topics\/\"><span class=\"wp-block-navigation-item__label\">Thesis topics<\/span><\/a><\/li><\/ul>\n\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div><\/nav>\n\n\n<hr class=\"wp-block-separator alignwide has-alpha-channel-opacity\"\/>\n\n\n\n<p class=\"has-medium-font-size\"><strong>2025<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>On Path Selection for Reduction-Based Solving of Multi-Agent Pathfinding Using Graph Pruning<\/strong>. [<a href=\"https:\/\/ktiml.mff.cuni.cz\/~svancara\/files\/socs2025_path_selection.pdf\" data-type=\"link\" data-id=\"\/files\/socs2025_path_selection.pdf\">PDF<\/a>]<br>Matej Hus\u00e1r, Ji\u0159\u00ed \u0160vancara, Roman Bart\u00e1k. In proceedings of the 18th International Symposium on Combinatorial Search (SOCS), 2025.<\/li>\n\n\n\n<li><strong>Towards Holistic Approach to Robust Execution of MAPF Plans.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2025_MAPF_execution.pdf\">PDF<\/a>]<br>David Zahr\u00e1dka, Denisa Muz\u00edkov\u00e1, Miroslav Kulich, Jir\u00ed Svancara, Roman Bart\u00e1k. In proceedings of the 17th International Conference on Agents and Artificial Intelligence (ICAART), 2025.<\/li>\n\n\n\n<li><strong>Generating Safe Policies for Multi-Agent Path Finding with Temporal Uncertainty.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2025_408_CR.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, David Zahr\u00e1dka, Mrinalini Subramanian, Roman Bart\u00e1k, and Miroslav Kulich. In proceedings of the 17th International Conference on Agents and Artificial Intelligence (ICAART), 2025.<\/li>\n<\/ul>\n\n\n\n<p><strong>2024<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>The Effectiveness of Autonomous Intersections in a City.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/FLAIRS_37_174.pdf\">PDF<\/a>]<br>Eli\u00e1\u0161 Cizl, Ji\u0159\u00ed \u0160vancara, Roman Bart\u00e1k. In proceedings of the 37th International Florida Artificial Intelligence Research Society Conference (FLAIRS), 2024.<\/li>\n\n\n\n<li><strong>Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2024_15_CR.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara,Dor Atzmon, Klaus Strauch, Roland Kaminski and Torsten Schaub. In proceedings of the 16th International Conference on Agents and Artificial Intelligence (ICAART), 2024.<\/li>\n\n\n\n<li><strong>Improving the Sum-of-Cost Methods for Reduction-based Multi-agent Pathfinding Solvers<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2024_114_CR.pdf\">PDF<\/a>]<br>Roland Kaminski, Torsten Schaub, Klaus Strauch and Ji\u0159\u00ed \u0160vancara. In proceedings of the 16th International Conference on Agents and Artificial Intelligence (ICAART), 2024.<\/li>\n<\/ul>\n\n\n\n<p><strong>2023<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract].<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/socs2023.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Etienne Tignon, Roman Bart\u00e1k, Torsten Schaub, Philipp Wanko, Roland Kaminski. In proceedings of the 16th International Symposium on Combinatorial Search (SOCS), 2023.<\/li>\n\n\n\n<li><strong>Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2023_SP_study.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Philipp Obermeier, Matej Hus\u00e1r, Roman Bart\u00e1k and Torsten Schaub. In proceedings of the 15th International Conference on Agents and Artificial Intelligence (ICAART), 2023.<\/li>\n\n\n\n<li><strong>Routing and Scheduling in different ways: Abridged Preliminary Report<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICLP_2023_workshop.pdf\">PDF<\/a>]<br>Jan Behrens, Roland Kaminski, Torsten Schaub, Tran Cao Son, Jiri Svancara, Philipp Wanko. At workshop at the 39th International Conference on Logic Programming (ICLP), 2023.<\/li>\n\n\n\n<li><strong>Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/AAAI_WoMAPF_SP_study.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Philipp Obermeier, Matej Hus\u00e1r, Roman Bart\u00e1k and Torsten Schaub. At workshop on Multi-Agent Path Finding at the 37th AAAI Conference on Artificial Intelligence (AAAI), 2023.<\/li>\n\n\n\n<li><strong>To Wait, or Not to Wait, That Is the Question.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/AAAI_WoMAPF_SP_waits.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Etienne Tignon, Roman Bart\u00e1k, Torsten Schaub, Philipp Wanko, Roland Kaminski. At workshop on Multi-Agent Path Finding at the 37th AAAI Conference on Artificial Intelligence (AAAI), 2023.<\/li>\n<\/ul>\n\n\n\n<p><strong>2022<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way?<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/SOCS_2022.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Philipp Obermeier, Matej Hus\u00e1r, Roman Bart\u00e1k and Torsten Schaub. In proceedings of the Fifteenth International Symposium on Combinatorial Search (SOCS), 2022.<\/li>\n\n\n\n<li><strong>Reduction-based Solving of Multi-agent Pathfinding on Large Maps Using Graph Pruning.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/AAMAS_2022.pdf\">PDF<\/a>]<br>Matej Hus\u00e1r, Ji\u0159\u00ed \u0160vancara, Philipp Obermeier, Roman Bart\u00e1k, Torsten Schaub. In proceedings of the 21st International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 2022.<\/li>\n\n\n\n<li><strong>Coordinated Collision-free Movement of Groups of Agents.<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2022_ColoredMAPF.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Marika Ivanov\u00e1, Roman Bart\u00e1k. In proceedings of the 14th International Conference on Agents and Artificial Intelligence (ICAART), 2022.<\/li>\n\n\n\n<li><strong>Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2022_vlaky.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Roman Bart\u00e1k. In proceedings of the 14th International Conference on Agents and Artificial Intelligence (ICAART), 2022.<\/li>\n<\/ul>\n\n\n\n<p><strong>2021<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>From Classical to Colored Multi-Agent Path Finding<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/colored_MAPF_socs2021.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Marika Ivanov\u00e1, Ji\u0159\u00ed \u0160vancara. In proceedings of the Fourteenth International Symposium on Combinatorial Search (SOCS), 2021.<\/li>\n\n\n\n<li><strong>Colored Multi-Agent Path Finding: Solving Approaches<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/FLAIRS_colored_MAPF.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Marika Ivanov\u00e1, Ji\u0159\u00ed \u0160vancara. The proceedings of the 34th International Florida Artificial Intelligence Research Society Conference (FLAIRS), 2021.<\/li>\n<\/ul>\n\n\n\n<p><strong>2020<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>On Modelling Multi-Agent Path Finding as a Classical Planning Problem<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICTAI2020_PDDL_MAPF.pdf\">PDF<\/a>]<br>Jindrich Vodr\u00e1\u017eka, Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara. In proceedings of the 32th International Conference on Tools with Artificial Intelligence (ICTAI), 2020.<\/li>\n\n\n\n<li><strong>MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/AAAI20_demo.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara, Ivan Krasi\u010denko. In proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2020.<\/li>\n\n\n\n<li><strong>On Modelling Multi-Agent Path Finding as a Classical Planning Problem<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/socs2020_MAPF_PDDL.pdf\">PDF<\/a>]<br>Jindrich Vodr\u00e1\u017eka, Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara. In proceedings of the Thirteenth International Symposium on Combinatorial Search (SOCS), 2020.<\/li>\n\n\n\n<li><strong>What Does Multi-agent Path-finding Tell Us About Intelligent Intersections<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2020_188.pdf\">PDF<\/a>]<br>V\u011bra \u0160kopkov\u00e1, Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara. In proceedings of the 12th International Conference on Agents and Artificial Intelligence (ICAART), 2020.<\/li>\n<\/ul>\n\n\n\n<p><strong>2019<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>Multi-Agent Path Finding on Real Robots (Demo session)<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/demo_icaps.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ivan Krasi\u010denko, Ji\u0159\u00ed \u0160vancara. International Conference on Automated Planning and Scheduling (ICAPS), 2019.<\/li>\n\n\n\n<li><strong>Multi-Agent Path Finding on Ozobots (Demo session)<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/demo_ijcai.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ivan Krasi\u010denko, Ji\u0159\u00ed \u0160vancara. In proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI), 2019.<\/li>\n\n\n\n<li><strong>On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/socs_soc.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara. In proceedings of the Twelfth International Symposium on Combinatorial Search (SOCS), 2019.<\/li>\n\n\n\n<li><strong>Multi-agent path finding on real robots<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/Ozobots_jurnal.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara, V\u011bra \u0160kopkov\u00e1, David Nohejl, Ivan Krasi\u010denko. AI Communications 32 (2019) journal.<\/li>\n\n\n\n<li><strong>Multi-Agent Path Finding on Real Robots (Demo session)<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/demo_aamas.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ivan Krasi\u010denko, Ji\u0159\u00ed \u0160vancara. In proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS), 2019.<\/li>\n\n\n\n<li><strong>Combining Strengths of Optimal Multi-Agent Path Finding Algorithms<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2019_145.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Roman Bart\u00e1k. In proceedings of the 11th International Conference on Agents and Artificial Intelligence (ICAART), 2019.<\/li>\n\n\n\n<li><strong>Online Multi-Agent Pathfinding<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/AAAI_CR.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Marek Vlk, Roni Stern, Dor Atzmon, Roman Bart\u00e1k. In proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2019.<\/li>\n<\/ul>\n\n\n\n<p><strong>2018<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>Multi-agent Path Finding on Real Robots: First Experience with Ozobots<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/iberamia2018.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara, V\u011bra \u0160kopkov\u00e1, David Nohejl. In proceedings of the Ibero-American Conference on Artificial Intelligence (IBERAMIA), 2018. Lecture Notes in Computer Science, vol 11238.<br><a href=\"http:\/\/svancara.net\/files\/IBERAMIA2018_best_paper.jpeg\">Best Paper Award<\/a><\/li>\n\n\n\n<li><strong>A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/aamas2018.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara, Marek Vlk. In proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 2018.<\/li>\n\n\n\n<li><strong>Bringing Multi-agent Path Finding Closer to Reality (Doctoral Consortium)<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/dc_aamas.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara. AAMAS 2018 &#8211; Doctoral Consortium.<\/li>\n\n\n\n<li><strong>Bringing Multi-agent Path Finding Closer to Reality (Doctoral Consortium)<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/dc_ijcai.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara. IJCAI 2018 &#8211; Doctoral Consortium.<\/li>\n\n\n\n<li><strong>Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/LNAI_2018.pdf\">PDF<\/a>]<br>Pavel Surynek, Ji\u0159\u00ed \u0160vancara, Ariel Felner, Eli Boyarski. Agents and Artificial Intelligence &#8211; 9th International Conference (ICAART 2017), Revised Selected Papers, pp. 116-136, Lecture Notes in Computer Science 10839, Springer 2018, ISBN 978-3-319-93580-5.<\/li>\n<\/ul>\n\n\n\n<p><strong>2017<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list has-small-font-size\">\n<li><strong>Scheduling Models for Multi-Agent Path Finding<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/MISTA_2017_paper_44.pdf\">PDF<\/a>]<br>Roman Bart\u00e1k, Ji\u0159\u00ed \u0160vancara, Marek Vlk. In proceedings of the 8th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA), 2017.<\/li>\n\n\n\n<li><strong>Independence Detection in SAT-based Multi-Agent Path Finding<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/JSAI_2017.pdf\">PDF<\/a>]<br>Pavel Surynek, Ji\u0159\u00ed \u0160vancara, Ariel Felner, Eli Boyarski. In proceedings of the 31st Annual Conference of The Japanese Society for Artificial Intelligence (JSAI), 2017.<\/li>\n\n\n\n<li><strong>New Flow-based Heuristic for Search Algorithms Solving Multi-Agent Path Finding<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2017_46_CR.pdf\">PDF<\/a>]<br>Ji\u0159\u00ed \u0160vancara, Pavel Surynek. In proceedings of the 9th International Conference on Agents and Artificial Intelligence (ICAART), 2017<\/li>\n\n\n\n<li><strong>Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding: A Novel SAT-Based Optimal MAPF Solver<\/strong>&nbsp;[<a href=\"http:\/\/svancara.net\/files\/ICAART_2017_36_CR.pdf\">PDF<\/a>]<br>Pavel Surynek, Ji\u0159\u00ed \u0160vancara, Ariel Felner, Eli Boyarski. In proceedings of the 9th International Conference on Agents and Artificial Intelligence (ICAART), 2017.<\/li>\n<\/ul>\n\n\n\n<div style=\"height:50px\" aria-hidden=\"true\" class=\"wp-block-spacer\"><\/div>\n","protected":false},"excerpt":{"rendered":"<p>2025 2024 2023 2022 2021 2020 2019 2018 2017<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-46","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/pages\/46","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/comments?post=46"}],"version-history":[{"count":13,"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/pages\/46\/revisions"}],"predecessor-version":[{"id":102,"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/pages\/46\/revisions\/102"}],"wp:attachment":[{"href":"https:\/\/ktiml.mff.cuni.cz\/~svancara\/wp-json\/wp\/v2\/media?parent=46"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}