Follow
Pavel Surynek
Pavel Surynek
Czech Technical University, Faculty of Information Technology
Verified email at fit.cvut.cz - Homepage
Title
Cited by
Cited by
Year
Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges
A Felner, R Stern, S Shimony, E Boyarski, M Goldenberg, G Sharon, ...
Proceedings of the International Symposium on Combinatorial Search 8 (1), 29-37, 2017
2572017
An Optimization Variant of Multi-Robot Path Planning Is Intractable.
P Surynek
24th AAAI Conference on Artificial Intelligence, 1261-1263, 2010
2472010
Multi-agent pathfinding with continuous time
A Andreychuk, K Yakovlev, P Surynek, D Atzmon, R Stern
Artificial Intelligence 305, 103662, 2022
2222022
Efficient SAT approach to multi-agent path finding under the sum of costs objective
P Surynek, A Felner, R Stern, E Boyarski
ECAI 2016, 810-818, 2016
2002016
A novel approach to path planning for multiple robots in bi-connected graphs
P Surynek
2009 IEEE international conference on robotics and automation, 3613-3619, 2009
1882009
Multi-agent path finding for large agents
J Li, P Surynek, A Felner, H Ma, TKS Kumar, S Koenig
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7627-7634, 2019
1492019
Towards optimal cooperative path planning in hard setups through satisfiability solving
P Surynek
Pacific Rim international conference on artificial intelligence, 564-576, 2012
1462012
Unifying search-based and compilation-based approaches to multi-agent path finding through satisfiability modulo theories
P Surynek
Proceedings of the International Symposium on Combinatorial Search 10 (1 …, 2019
842019
Modeling and solving the multi-agent pathfinding problem in picat
R Barták, NF Zhou, R Stern, E Boyarski, P Surynek
2017 IEEE 29th International Conference on Tools with Artificial …, 2017
572017
Compact representations of cooperative path-finding as SAT based on matchings in bipartite graphs
P Surynek
2014 IEEE 26th International Conference on Tools with Artificial …, 2014
552014
Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally.
P Surynek
IJCAI 15, 1916-1922, 2015
532015
An application of pebble motion on graphs to abstract multi-robot path planning
P Surynek
2009 21st IEEE International Conference on Tools with Artificial …, 2009
532009
Multi-agent path finding with mutex propagation
H Zhang, J Li, P Surynek, TKS Kumar, S Koenig
Artificial Intelligence 311, 103766, 2022
492022
An empirical comparison of the hardness of multi-agent path finding under the makespan and the sum of costs objectives
P Surynek, A Felner, R Stern, E Boyarski
Proceedings of the International Symposium on Combinatorial Search 7 (1 …, 2016
422016
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
P Surynek
Annals of Mathematics and Artificial Intelligence 81, 329-375, 2017
402017
On propositional encodings of cooperative path-finding
P Surynek
2012 IEEE 24th International Conference on Tools with Artificial …, 2012
402012
Multi-goal multi-agent path finding via decoupled and integrated goal vertex ordering
P Surynek
arXiv preprint arXiv:2009.05161, 2020
342020
Multi-agent path finding on strongly biconnected digraphs
A Botea, P Surynek
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
322015
Solving abstract cooperative path‐finding in densely populated environments
P Surynek
Computational Intelligence 30 (2), 402-450, 2014
322014
Solving multi-agent path finding on strongly biconnected digraphs
A Botea, D Bonusi, P Surynek
Journal of Artificial Intelligence Research 62, 273-314, 2018
222018
The system can't perform the operation now. Try again later.
Articles 1–20