Publications
- Application of Longest Common Subsequence Algorithms to Meshing of Planar Domains with Quadrilaterals2017 | 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
- 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
- Adversarial Cooperative Path-finding: Complexity and Algorithms2014 | Faculty of Mathematics and Physics
- On Improving Plan Quality via Local Enhancements2012 | Faculty of Mathematics and Physics
- Shortening Plans by Local Re-Planning2012 | Faculty of Mathematics and Physics
- Redundancy Elimination in Highly Parallel Solutions of Motion Coordination Problems +12011 | Faculty of Mathematics and Physics
- A Novel Approach to Path Planning for Multiple Robots in Bi-connected Graphs2009 | Faculty of Mathematics and Physics
Loading network view...