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, a range of heuristics should be developed and implemented that are tailored to certain special cases that occur in practice, such as acyclic hierarchies or totally ordered HTN planning problems.
- Able to code C++.
- A solid understanding of AI planning before starting the project would be highly beneficial.
- Strong foundations in complexity theory is a bonus.