Publikace
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | 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
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Matematicko-fyzikální fakulta
- Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability2014 | Matematicko-fyzikální fakulta
- A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well2014 | Matematicko-fyzikální fakulta
- Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More2014 | Matematicko-fyzikální fakulta
- Mutex reasoning in cooperative path finding modeled as propositional satisfiability2013 | Matematicko-fyzikální fakulta
- Shortening Plans by Local Re-Planning2012 | Matematicko-fyzikální fakulta
- Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals2017 | Matematicko-fyzikální fakulta
Loading network view...