Pavel Surynek
Pavel Surynek
Czech Technical University, Faculty of Information Technology
Vahvistettu sähköpostiosoite verkkotunnuksessa fit.cvut.cz - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
An Optimization Variant of Multi-Robot Path Planning Is Intractable.
P Surynek
24th AAAI Conference on Artificial Intelligence, 1261-1263, 2010
1442010
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
1322009
Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges
A Felner, R Stern, SE Shimony, E Boyarski, M Goldenberg, G Sharon, ...
Tenth Annual Symposium on Combinatorial Search, 2017
1182017
Towards optimal cooperative path planning in hard setups through satisfiability solving
P Surynek
Pacific Rim International Conference on Artificial Intelligence, 564-576, 2012
1032012
Efficient SAT approach to multi-agent path finding under the sum of costs objective
P Surynek, A Felner, R Stern, E Boyarski
Proceedings of the Twenty-second European Conference on Artificial …, 2016
962016
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
622019
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
472009
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
442014
Unifying search-based and compilation-based approaches to multi-agent path finding through satisfiability modulo theories
P Surynek
Twelfth Annual Symposium on Combinatorial Search, 2019
372019
Reduced time-expansion graphs and goal decomposition for solving cooperative path finding sub-optimally
P Surynek
Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015
332015
On propositional encodings of cooperative path-finding
P Surynek
2012 IEEE 24th International Conference on Tools with Artificial …, 2012
302012
Solving abstract cooperative path‐finding in densely populated environments
P Surynek
Computational Intelligence 30 (2), 402-450, 2014
292014
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
252017
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
Ninth Annual Symposium on Combinatorial Search, 2016
222016
Multi-agent path finding on strongly biconnected digraphs
A Botea, P Surynek
Proceedings of the AAAI Conference on Artificial Intelligence 29 (1), 2015
212015
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
P Surynek
Annals of Mathematics and Artificial Intelligence 81 (3), 329-375, 2017
202017
A new algorithm for maintaining arc consistency after constraint retraction
P Surynek, R Barták
International Conference on Principles and Practice of Constraint …, 2004
152004
A SAT-Based Approach to Cooperative Path-Finding Using All-Different Constraints.
P Surynek
SOCS, 2012
142012
Towards shorter solutions for problems of path planning for multiple robots in theta-like environments
P Surynek
Twenty-Second International FLAIRS Conference, 2009
142009
Towards Shorter Solutions for Problems of Path Planning for Multiple Robots in Theta-like Environments.
P Surynek
FLAIRS Conference, 2009
142009
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20