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
- UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding2015 | Matematicko-fyzikální fakulta
- Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally2015 | Matematicko-fyzikální fakulta
- Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup2014 | Matematicko-fyzikální fakulta
- Theoretical Challenges in Knowledge Discovery in Big Data: a logic reasoning and a graph theoretical point of view2014 | 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
Loading network view...