LMBFS Planner — Landmark-based Meta Best-First Search

Unlike state-of-the-art planners, usually based on state-space heuristic search, LMBFS reenacts landmark-based planning problem decomposition. The LMBFS algorithm splits the global problem in a set of subproblems and tries to find a global solution using the solutions found for these subproblems. Several planning techniques have adapted in order to enhance the performance of our base algorithm, making LMBFS a competitive planner.

You can try it online or download the source code.

Feel free to contact me about compilation and execution issues or about the algorithm itself.