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
- Multi-Agent Path Finding on Biconnected Directed Graphs2015 | 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
- Optimal Cooperative Path Planning through Satisfiability Solving2013 | Faculty of Mathematics and Physics
- Towards Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving2012 | Faculty of Mathematics and Physics
- Near Optimal Cooperative Path Planning in Hard Setups through Satisfiability Solving2012 | Faculty of Mathematics and Physics
- Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems +12011 | 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
Loading network view...