We propose a novel centralized and decoupled algorithm, DDM, for solving multi-robot path
planning problems in grid graphs, targeting on-demand and automated warehouse-like …

A pattern database (PDB) stores shortest distances from abstract states to a set of abstract
goal states. For many search problems the best heuristic function is obtained using PDBs …

The typical objective of path planning is to find the shortest feasible path. Many times,
however, there may be no solution given the existence of constraints, such as obstacles. In …

This study presents a framework that procedurally generates maze-like levels and leverages
an automated verification technique called model checking to verify and produce a winning …

The typical objective in path planning is to find the shortest feasible path. Many times,
however, such paths may not be available given constraints, such as movable obstacles …

Puzzles and board games represent several important classes of AI problems, but also
represent difficult complexity classes. In this paper, we propose a deep learning based …

We present a novel admissible pattern database heuristic (D) and tie-breaking rule (L) for
Sokoban, allowing us to increase the number of optimally solved standard Sokoban …

Move pruning increases the efficiency of heuristic search techniques by not expanding parts
of the state space. In this article, we propose an admissible domain-dependent move …

In this thesis, we study the class of moving-blocks problems. A moving-blocks problem
consists of k movable blocks placed on a grid-square maze where there is an additional …

Some results are reported on an approach to the vote collecting phase of the Hough
transform, particularly of the generalized Hough transform (GHT). The purpose of the …