Publikace
- Modeling and Solving the Multi-agent Pathfinding Problem in Picat2017 | Matematicko-fyzikální fakulta
- Solving Abstract Cooperative Path-Finding in Densely Populated Environments2014 | Matematicko-fyzikální fakulta
- Propositional Satisfiability Benchmarks Constructed from Multi-Robot Path Planning on Graphs2013 | Matematicko-fyzikální fakulta
- Mutex reasoning in cooperative path finding modeled as propositional satisfiability2013 | Matematicko-fyzikální fakulta
- Relocation Tasks and a Hierarchical Subclass2012 | 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
- 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
Loading network view...
