Publications
- Encoding HTN Planning as a Dynamic CSP +12005 | Faculty of Mathematics and Physics
- An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems +12005 | Faculty of Mathematics and Physics
- Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding A Novel SAT-based Optimal MAPF Solver2017 | 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
- Boolean Satisfiability Approach to Optimal Multi-agent Path Finding under the Sum of Cost Objective2016 | Faculty of Mathematics and Physics
- An Emprical Comparison of the Hardness of Multi-agent Path Finding under the Makespan and the Sum of Costs Objectives2016 | Faculty of Mathematics and Physics
- Efficient SAT Approach to Multi-Agent Path Finding under the Sum of Costs Objective2016 | Faculty of Mathematics and Physics
- Multi-Agent Path Finding on Biconnected Directed Graphs2015 | Faculty of Mathematics and Physics
- Linear Ordering in the SAT Encoding of the All-Different Constraint over Bit-Vectors2015 | Faculty of Mathematics and Physics
Loading network view...