Publikace
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Matematicko-fyzikální fakulta
- Modeling and Solving the Multi-agent Pathfinding Problem in Picat2017 | Matematicko-fyzikální fakulta
- Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective2016 | Matematicko-fyzikální fakulta
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Matematicko-fyzikální fakulta
- Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors2015 | 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
- Optimal Cooperative Path-Finding with Generalized Goals in Difficult Cases2013 | Matematicko-fyzikální fakulta
Loading network view...