Project Overview#

HTN Planning is a powerful formalism to express control rules on how plans may be generated. Here, action sequences are generated from an initially given abstract task, which is step-wise refined until an executable primitive action sequence is obtained (similar to formal grammars/languages). Due to the framework’s high expressiveness, finding solutions is very challenging – search algorithms require highly informed heuristics that guide the search towards a solution.

In this project, an already existing heuristic (based on ILPs) should be extended to be tailored towards the special case of totally ordered HTN planning problems.

Requirements#

  • Have some experience with ILPs, e.g., you should be able to model basic problems as ILPs and be able to run a solver and to interpret the solution.
  • Able to code C++.
  • A solid understanding of AI planning before starting the project would be highly beneficial.

Info#

bars search times arrow-up