Publications
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | Faculty of Mathematics and Physics
- Pre-processing in Boolean Satisfiability Using Bounded (2,k)-Consistency on Regions with Locally Difficult Constraint Setup2014 | Faculty of Mathematics and Physics
- Compact Representations of Cooperative Path-Finding as SAT Based on Matchings in Bipartite Graphs2014 | Faculty of Mathematics and Physics
- Lessons Learned from the Effort to Solve Cooperative Path-Finding Optimally: Reductions to Propositional Satisfiability2014 | Faculty of Mathematics and Physics
- A Simple Approach to Solving Cooperative Path-Finding as Propositional Satisfiability Works Well2014 | Faculty of Mathematics and Physics
- Simple Direct Propositional Encoding of Cooperative Path Finding Simplified Yet More2014 | Faculty of Mathematics and Physics
- Propositional Satisfiability Benchmarks Constructed from Multi-Robot Path Planning on Graphs2013 | Faculty of Mathematics and Physics
- On Propositional Encodings of Cooperative Path-finding2012 | Faculty of Mathematics and Physics
- Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals2017 | Faculty of Mathematics and Physics
- Modeling and Solving the Multi-agent Pathfinding Problem in Picat2017 | Faculty of Mathematics and Physics
Loading network view...