Bounded depth-first search for automated planning
Title: Bounded depth-first search for automated planning
SNIC Project: SNIC 2021/5-330
Project Type: SNIC Medium Compute
Principal Investigator: Jendrik Seipp <jendrik.seipp@liu.se>
Affiliation: Linköpings universitet
Duration: 2021-07-01 – 2022-07-01
Classification: 10201
Keywords:

Abstract

We will design and evaluate new search algorithms and heuristic functions for automated planning. In contrast to existing work, we will focus on algorithms based on depth-first exploration of the search space. Another novelty of our work will be to derive and use use upper bounds on plan cost for pruning the search space.