Pavel Surynek

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 101

Top Venues

Publications

Martin Rames, Pavel Surynek
Action Duration Generalization for Exact Multi-Agent Collective Construction. ICAART (3) (2024)
Irene Saccani, Kristýna Janovská, Pavel Surynek
Spectral Clustering in Rule-based Algorithms for Multi-agent Path Finding (Extended Abstract). SOCS (2024)
Tomás Kolárik, Stefan Ratschan, Pavel Surynek
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. ICAART (1) (2024)
Pavel Surynek
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding (Extended Abstract). SOCS (2024)
Tomás Kolárik, Stefan Ratschan, Pavel Surynek
Multi-Agent Path Finding with Continuous Time Using SAT Modulo Linear Real Arithmetic. CoRR (2023)
Pavel Surynek
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Goal Multi-Robot Path Planning. IROS (2023)
Matous Kulhan, Pavel Surynek
Multi-agent Path Finding for Indoor Quadcopters. PAAMS (2023)
Matous Kulhan, Pavel Surynek
Multi-Agent Pathfinding for Indoor Quadcopters: A Platform for Testing Planning-Acting Loop. ICINCO (1) (2023)
Irene Saccani, Kristýna Janovská, Pavel Surynek
Spectral Clustering in Rule-Based Algorithms for Multi-Agent Path Finding. ICINCO (1) (2023)
Martin Rames, Pavel Surynek
Action Duration Generalization for Exact Multi-Agent Collective Construction. CoRR (2023)
Pavel Surynek
Non-Refined Abstractions in Counterexample Guided Abstraction Refinement for Multi-Agent Path Finding. ICTAI (2023)
Pavel Surynek
Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method. ICAART (3) (2023)
Kristýna Janovská, Pavel Surynek
Agent-Based Modeling in Hierarchical Control of Swarms During Evacuation. SN Comput. Sci. 4 (1) (2023)
Pavel Surynek
Counterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding. CoRR (2023)
Pavel Surynek
Sparse Decision Diagrams for SAT-based Compilation of Multi-Agent Path Finding (Extended Abstract). SOCS (2022)
Vojtech Rybár, Pavel Surynek
Highways in Warehouse Multi-Agent Path Finding: A Case Study. ICAART (1) (2022)
Han Zhang, Jiaoyang Li, Pavel Surynek, T. K. Satish Kumar, Sven Koenig
Multi-agent path finding with mutex propagation. Artif. Intell. 311 (2022)
Filip Beskyd, Pavel Surynek
Parameter Setting in SAT Solver using Machine Learning Techniques. ICAART (2) (2022)
Matous Kulhan, Pavel Surynek
Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters. CoRR (2022)
Pavel Surynek
Problem Compilation for Multi-Agent Path Finding: a Survey. IJCAI (2022)
Zuzana Fílová, Pavel Surynek
Lazy Compilation in Classical Planning (Extended Abstract). SOCS (2022)
Kristýna Janovská, Pavel Surynek
Combining Conflict-based Search and Agent-based Modeling for Evacuation Problems (Extended Abstract). SOCS (2022)
Pavel Surynek, Roni Stern, Eli Boyarski, Ariel Felner
Migrating Techniques from Search-based Multi-Agent Path Finding Solvers to SAT-based Approach. J. Artif. Intell. Res. 73 (2022)
Anton Andreychuk, Konstantin S. Yakovlev, Pavel Surynek, Dor Atzmon, Roni Stern
Multi-agent pathfinding with continuous time. Artif. Intell. 305 (2022)
Filip Beskyd, Pavel Surynek
Domain Dependent Parameter Setting in SAT Solver Using Machine Learning Techniques. ICAART (Revised Selected Paper (2022)
Pavel Surynek
Heuristically Guided Compilation for Multi-Agent Path Finding. CoRR (2022)
Marika Ivanová, Pavel Surynek
Adversarial Multi-Agent Path Finding is Intractable. ICTAI (2021)
Martin Capek, Pavel Surynek
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. SOCS (2021)
Pavel Surynek
Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. IROS (2021)
Pavel Surynek
Compilation-based Solvers for Multi-Agent Path Finding: a Survey, Discussion, and Future Opportunities. CoRR (2021)
Pavel Surynek
Sparse Real-time Decision Diagrams for Continuous Multi-Robot Path Planning. ICTAI (2021)
Pavel Surynek
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. SOCS (2021)
Martin Capek, Pavel Surynek
DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. CoRR (2021)
Ján Chudý, Pavel Surynek
ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding. AAAI (2021)
Kristýna Janovská, Pavel Surynek
Hierarchical Control of Swarms during Evacuation. KEOD (2021)
Pavel Surynek
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. AAAI (2021)
Pavel Surynek
Conceptual Comparison of Compilation-based Solvers for Multi-Agent Path Finding: MIP vs. SAT. SOCS (2021)
Pavel Surynek
Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. SOCS (2021)
Pavel Surynek
Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. CoRR (2021)
Pavel Surynek, Jiaoyang Li, Han Zhang, T. K. Satish Kumar, Sven Koenig
Mutex Propagation for SAT-based Multi-agent Path Finding. PRIMA (2020)
Pavel Surynek
On Satisfisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-based and Search-based Approaches Compared. ICAART (2) (2020)
Ján Chudý, Nestor Popov, Pavel Surynek
Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots. SMC (2020)
Pavel Surynek
At-Most-One Constraints in Efficient Representations of Mutex Networks. CoRR (2020)
Pavel Surynek
Continuous Multi-agent Path Finding via Satisfiability Modulo Theories (SMT). ICAART (Revised Selected Papers) (2020)
Pavel Surynek
Bounded Sub-optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach. IROS (2020)
Pavel Surynek
Logic-Based Multi-agent Path Finding with Continuous Movements and the Sum of Costs Objective. RCAI (2020)
Pavel Surynek
Multi-agent Path Finding Modulo Theory with Continuous Movements and the Sum of Costs Objective. KI (2020)
Ján Chudý, Nestor Popov, Pavel Surynek
Deployment of Multi-agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-based Behavior. ROBOVIS (2020)
Pavel Surynek
Pushing the Envelope: From Discrete to Continuous Movements in Multi-Agent Path Finding via Lazy Encodings. CoRR (2020)
Pavel Surynek
Swarms of Mobile Agents: From Discrete to Continuous Movements in Multi-Agent Path Finding. SMC (2020)
Pavel Surynek
Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. CoRR (2020)
Han Zhang, Jiaoyang Li, Pavel Surynek, Sven Koenig, T. K. Satish Kumar
Multi-Agent Path Finding with Mutex Propagation. ICAPS (2020)
Pavel Surynek
Bounded Suboptimal Token Swapping. ICTAI (2020)
Pavel Surynek
At-Most-One Constraints in Efficient Representations of Mutex Networks. ICTAI (2020)
Vojtech Cahlík, Pavel Surynek
On the Design of a Heuristic based on Artificial Neural Networks for the Near Optimal Solving of the (N2-1)-puzzle. IJCCI (2019)
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding with Capacity Constraints. CoRR (2019)
Pavel Surynek, T. K. Satish Kumar, Sven Koenig
Multi-agent Path Finding with Capacity Constraints. AI*IA (2019)
Pavel Surynek
Multi-Agent Path Finding with Continuous Time and Geometric Agents Viewed through Satisfiability Modulo Theories (SMT). SOCS (2019)
Pavel Surynek
Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories. IJCAI (2019)
Róbert Selvek, Pavel Surynek
Engineering Smart Behavior in Evacuation Planning using Local Cooperative Path Finding Algorithms and Agent-based Simulations. KEOD (2019)
Pavel Surynek
Conflict Handling Framework in Generalized Multi-agent Path finding: Advantages and Shortcomings of Satisfiability Modulo Approach. ICAART (2) (2019)
Pavel Surynek
Lazy Compilation of Variants of Multi-robot Path Planning with Satisfiability Modulo Theory (SMT) Approach. IROS (2019)
Róbert Selvek, Pavel Surynek
Towards Smart Behavior of Agents in Evacuation Planning Based on Local Cooperative Path Finding. IC3K (2019)
Pavel Surynek
On the Tour Towards DPLL(MAPF) and Beyond. CoRR (2019)
Pavel Surynek
Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. SOCS (2019)
Pavel Surynek
Multi-agent Path Finding with Generalized Conflicts: An Experimental Study. ICAART (Revised Selected Papers) (2019)
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding for Large Agents. SOCS (2019)
Pavel Surynek
On the Tour Towards DPLL(MAPF) and Beyond. DDC@AI*IA (2019)
Pavel Surynek
Multi-agent Path Finding with Continuous Time Viewed Through Satisfiability Modulo Theories (SMT). CoRR (2019)
Jiaoyang Li, Pavel Surynek, Ariel Felner, Hang Ma, T. K. Satish Kumar, Sven Koenig
Multi-Agent Path Finding for Large Agents. AAAI (2019)
Marika Ivanová, Pavel Surynek, Katsutoshi Hirayama
Area Protection in Adversarial Path-finding Scenarios with Multiple Mobile Agents on Graphs - A Theoretical and Experimental Study of Strategies for Defense Coordination. ICAART (1) (2018)
Pavel Surynek
Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT. CoRR (2018)
Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. FLAIRS Conference (2018)
Pavel Surynek
Finding Optimal Solutions to Token Swapping by Conflict-Based Search and Reduction to SAT. ICTAI (2018)
Adi Botea, Davide Bonusi, Pavel Surynek
Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract). IJCAI (2018)
Pavel Surynek
Lazy Modeling of Variants of Token Swapping Problem and Multi-agent Path Finding through Combination of Satisfiability Modulo Theories and Conflict-based Search. CoRR (2018)
Pavel Surynek
A Summary of Adaptation of Techniques from Search-based Optimal Multi-Agent Path Finding Solvers to Compilation-based Approach. CoRR (2018)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. SOCS (2018)
Adi Botea, Davide Bonusi, Pavel Surynek
Solving Multi-agent Path Finding on Strongly Biconnected Digraphs. J. Artif. Intell. Res. 62 (2018)
Ariel Felner, Roni Stern, Solomon Eyal Shimony, Eli Boyarski, Meir Goldenberg, Guni Sharon, Nathan R. Sturtevant, Glenn Wagner, Pavel Surynek
Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. SOCS (2017)
Marika Ivanová, Pavel Surynek, Diep Thi Ngoc Nguyen
Maintaining Ad-Hoc Communication Network in Area Protection Scenarios with Adversarial Agents. CoRR (2017)
Jiri Svancara, Pavel Surynek
New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. ICAART (2) (2017)
Marika Ivanová, Pavel Surynek
Area Protection in Adversarial Path-Finding Scenarios with Multiple Mobile Agents on Graphs: a theoretical and experimental study of target-allocation strategies for defense coordination. CoRR (2017)
Pavel Surynek, Petr Michalík
- 1 )-puzzle suboptimally and its applications in rule-based cooperative path-finding. Auton. Agents Multi Agent Syst. 31 (3) (2017)
Pavel Surynek, Petr Michalík
Joint Movement of Pebbles in Solving the (N2-1)-Puzzle and its Applications in Cooperative Path-Finding: (JAAMAS). AAMAS (2017)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. SOCS (2017)
Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski
Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. ICAART (Revised Selected Papers) (2017)
Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. ICAART (2) (2017)
Roman Barták, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek
Modeling and Solving the Multi-agent Pathfinding Problem in Picat. ICTAI (2017)
Pavel Surynek
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems. Ann. Math. Artif. Intell. 81 (3-4) (2017)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants. CoRR (2017)
Petra Surynková, Pavel Surynek
Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals. MMCS (2016)
Pavel Surynek, Petr Michalík
-1)-Puzzle via Joint Relocation of Pebbles and its Applications to Rule-based Cooperative Path-Finding. CoRR (2016)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. SOCS (2016)
Pavel Surynek
Makespan Optimal Solving of Cooperative Path-Finding via Reductions to Propositional Satisfiability. CoRR (2016)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Costs Objective: (Extended Abstract). AAMAS (2016)
Pavel Surynek, Ariel Felner, Roni Stern, Eli Boyarski
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. ECAI (2016)
Pavel Surynek
Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally. IJCAI (2015)
Pavel Surynek
On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundam. Informaticae 137 (4) (2015)
Adi Botea, Pavel Surynek
Multi-Agent Path Finding on Strongly Biconnected Digraphs. AAAI (2015)

Pavel Surynek.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Pavel Surynek