|
|
Click here for Pavel's personal webpage.
- P. Surynek. Candidate Path Selection Heuristics for Multi-Agent Path Finding: A Novel Compilation-Based Method. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 2023.
- H. Zhang, J. Li, P. Surynek, S. Kumar and S. Koenig. Multi-Agent Path Finding with Mutex Propagation. Artificial Intelligence, 311, 103766, 2022.
- P. Surynek. Problem Compilation for Multi-Agent Path Finding: A Survey. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 2022.
- A. Andreychuk, K. Yakovlev, P. Surynek, D. Atzmon and R. Stern. Multi-Agent Pathfinding with Continuous Time. Artificial Intelligence, 305, 103662, 2022.
- P. Surynek, R. Stern, E. Boyarski and A. Felner. Migrating Techniques from Search-Based Multi-Agent Path Finding Solvers to SAT-Based Approach. Journal of Artificial Intelligence Research (JAIR), 73, 553-618, 2022.
- J. Chudy and P. Surynek. ESO-MAPF: Bridging Discrete Planning and Continuous Execution in Multi-Agent Pathfinding. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2021.
- P. Surynek. Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2021.
- P. Surynek. Sum of Costs Optimal Multi-Agent Path Finding with Continuous Time via Satisfiability Modulo Theories. In Proceedings of the International Symposium on Combinatorial Search (SoCS), 200-202, 2021.
- P. Surynek. Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering. In Proceedings of the International Symposium on Combinatorial Search (SoCS), 197-199, 2021.
- P. Surynek. Conceptual Comparison of Compilation-Based Solvers for Multi-Agent Path Finding: MIP vs. SAT. In Proceedings of the Fourteenth International Symposium on Combinatorial Search (SoCS), 203-205, 2021.
- M. Capek and P. Surynek. DPLL(MAPF): an Integration of Multi-Agent Path Finding and SAT Solving Technologies. In Proceedings of the International Symposium on Combinatorial Search (SoCS), 153-155, 2021.
- M. Ivanova and P. Surynek. Adversarial Multi-Agent Path Finding is Intractable. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI), 481-486, 2021.
- P. Surynek. Sparse Real-Time Decision Diagrams for Continuous Multi-Robot Path Planning. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI), 91-96, 2021.
- K. Janovska and P. Surynek. Hierarchical Control of Swarms during Evacuation. In Proceedings of the International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management (KEOD), 61-73, 2021.
- P. Surynek. Sparsification for Fast Optimal Multi-Robot Path Planning in Lazy Compilation Schemes. In Proceedings of the International Conference on Intelligent Robots and Systems (IROS), 7931-7938, 2021.
- H. Zhang, J. Li, P. Surynek, S. Koenig and S. Kumar. Multi-Agent Path Finding with Mutex Propagation. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), (in print), 2020. Outstanding ICAPS Student Paper Award.
- P. Surynek, J. Li, H. Zhang, S. Kumar and S. Koenig. Mutex Propagation for SAT-Based Multi-Agent Path Finding. In Proceedings of the International Conference on Principles and Practice of Multi-Agent Systems (PRIMA), 2020.
- P. Surynek. On Satisfiability Modulo Theories in Continuous Multi-Agent Path Finding: Compilation-Based and Search-Based Approaches Compared. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 2020.
- P. Surynek. Bounded Sub-Optimal Multi-Robot Path Planning Using Satisfiability Modulo Theory (SMT) Approach. In Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), 2020.
- J. Chudy, N. Popov and P. Surynek. Deployment of Multi-Agent Pathfinding on a Swarm of Physical Robots Centralized Control via Reflex-Based Behavior. In Proceedings of the International Conference on Robotics, Computer Vision and Intelligent Systems (ROBOVIS), 2020.
- J. Chudy, N. Popov and P. Surynek. Emulating Centralized Control in Multi-Agent Pathfinding Using Decentralized Swarm of Reflex-Based Robots. In Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics (SMC), 2020.
- P. Surynek. Continuous Multi-Agent Path Finding via Satisfiability Modulo Theories (SMT). In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 399-420, 2020. Revised Selected Papers.
- J. Li, P. Surynek, A. Felner, H. Ma, S. Kumar and S. Koenig. Multi-Agent Path Finding for Large Agents. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), (in print), 2019.
- P. Surynek. Unifying Search-Based and Compilation-Based Approaches to Multi-Agent Path Finding through Satisfiability Modulo Theories. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1177-1183, 2019.
- P. Surynek. Conflict Handling Framework in Generalized Multi-Agent Path Finding: Advantages and Shortcomings of Satisfiability Modulo Approach. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 192-203, 2019.
- P. Surynek. Lazy Compilation of Variants of Multi-Robot Path Planning with Satisfiability Modulo Theory (SMT) Approach. In Proceedings of the International Conference on Intelligent Robots and Systems (IROS), 3282-3287, 2019.
- P. Surynek. Multi-Agent Path Finding with Generalized Conflicts: An Experimental Study. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 118-142, 2019.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Sub-Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem. In Proceedings of the Symposium on Combinatorial Search (SoCS), 90-105, 2018.
- A. Botea, D. Bonusi and P. Surynek. Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs. Journal of Artificial Intelligence Research (JAIR), 62, (06/18), 273-314, 2018.
- A. Botea, D. Bonusi and P. Surynek. Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 5563-5567, 2018.
- P. Surynek, J. Svancara, A. Felner and E. Boyarski. Integration of Independence Detection into SAT-Based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 85-95, 2017.
- P. Surynek, J. Svancara, A. Felner and E. Boyarski. Variants of Independence Detection in SAT-Based Optimal Multi-Agent Path Finding. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 116-136, 2017.
- A. Felner, R. Stern, E. Shimony, M. Goldenberg, G. Sharon, N. Sturtevant, G. Wagner and P. Surynek. Search-Based Optimal Solvers for the Multi-Agent Pathfinding Problem: Summary and Challenges. In Proceedings of the Symposium on Combinatorial Search (SoCS), 28-37, 2017.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Modifying Optimal SAT-Based Approach to Multi-Agent Path-Finding Problem to Suboptimal Variants. In Proceedings of the Symposium on Combinatorial Search (SoCS), 169-170, 2017.
- J. Svancara and P. Surynek. New Flow-based Heuristic for Search Algorithms Solving Multi-Agent Path Finding. In Proceedings of the International Conference on Agents and Artificial Intelligence (ICAART), 451-458, 2017.
- R. Barak, N. Zhou, R. Stern, E. Boyarski and P. Surynek. Modeling and Solving the Multi-Agent Pathfinding Problem in Picat. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI), 959-966, 2017.
- P. Surynek. Time-Expanded Graph-Based Propositional Encodings for Makespan-Optimal Solving of Cooperative Path Finding Problems. Annals of Mathematics and Artificial Intelligence, 81, (3-4), 329-375, 2017.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Boolean Satisfiability Approach to Optimal Multi-Agent Path Finding under the Sum of Costs Objective. In Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), 1435-1436, 2016.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective. In Proceedings of the European Conference on Artificial Intelligence (ECAI), 810-818, 2016.
- P. Surynek, A. Felner, R. Stern and E. Boyarski. An Empirical Comparison of the Hardness of Multi-Agent Path Finding under the Makespan and the Sum of Costs Objectives. In Proceedings of the Symposium on Combinatorial Search (SoCS), 145-147, 2016.
- P. Surynek and P. Michalik. The Joint Movement of Pebbles in Solving the (N^2-1)-Puzzle Suboptimally and its Applications in Rule-Based Cooperative Path-Finding. Autonomous Agents and Multi-Agent Systems, 31, (3), 715-763, 2016.
- P. Surynek. Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-Optimally. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1916-1922, 2015.
- A. Botea and P. Surynek. Multi-Agent Path Finding on Strongly Biconnected Digraphs. In Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), 2024-2030, 2015.
- P. Surynek. Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs. In Proceedings of the 26th International Conference on Tools with Artificial Intelligence (ICTAI), 875-882, 2014.
- M. Ivanova and P. Surynek. Adversarial Cooperative Path-Finding: Complexity and Algorithms. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI), 75-82, 2014.
- P. Surynek. On the Complexity of Optimal Parallel Cooperative Path-Finding. Fundamenta Informaticae, 137, (4), 517-548, 2014.
- P. Surynek. Solving Abstract Cooperative Path-Finding in Densely Populated Environments. Computational Intelligence, 30, (2), 402-450, 2014.
- P. Surynek. Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving. In Proceedings of the Pacific Rim International Conference on Artificial Intelligence (PRICAI), 564-576, 2012.
- P. Surynek. A Novel Approach to Path Planning for Multiple Robots in Bi-Connected Graphs. In Proceedings of the International Conference on Robotics and Automation (ICRA), 3613-3619, 2009.
|
