Publikace
- Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective2016 | Matematicko-fyzikální fakulta
- An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives2016 | Matematicko-fyzikální fakulta
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Matematicko-fyzikální fakulta
- Adversarial Cooperative Path-finding: Complexity and Algorithms2014 | Matematicko-fyzikální fakulta
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Matematicko-fyzikální fakulta
- Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals2017 | Matematicko-fyzikální fakulta
- Modeling and Solving the Multi-agent Pathfinding Problem in Picat2017 | Matematicko-fyzikální fakulta
- Multi-Agent Path Finding on Biconnected Directed Graphs2015 | Matematicko-fyzikální fakulta
- Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors2015 | Matematicko-fyzikální fakulta
- UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding2015 | Matematicko-fyzikální fakulta
Loading network view...