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
- Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals2017 | 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
- UniAGENT: Reduced Time-Expansion Graphs and Goal Decomposition in Sub-optimal Cooperative Path Finding2015 | Faculty of Mathematics and Physics
- Reduced Time-Expansion Graphs for Solving Cooperative Path Finding Sub-optimally2015 | Faculty of Mathematics and Physics
- Solving Abstract Cooperative Path-Finding in Densely Populated Environments2014 | Faculty of Mathematics and Physics
- The Impact of a Bi-connected Graph Decomposition on Solving Cooperative Path-finding Problems2014 | Faculty of Mathematics and Physics
Loading network view...