@InProceedings{Olz2024TOILPHeuristic,
  author    = {Conny Olz and Alexander Lodemann and Pascal Bercher},
  booktitle = {Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024)},
  title     = {An ILP Heuristic for Total-Order HTN Planning},
  year      = {2024},
  pages     = {10--18},
  abstract  = {Heuristic Search is still the most successful approach to hierarchical planning, both for finding any and for finding an optimal solution. Yet, there exist only a very small handful heuristics for HTN planning -- so there is still huge potential for improvements. It is especially noteworthy that there does not exist a single heuristic that's tailored towards special cases. In this work we propose the very first specialized HTN heuristic, tailored towards totally ordered HTN problems. Our heuristic builds on an existing NP-complete and admissible delete-and-ordering relaxation ILP heuristic but partially incorporates ordering constraints while reducing the number of ILP constraints. It exploits inferred preconditions and effects of compound tasks and is also admissible. Our current heuristic proves to be more efficient than the one we build on, though it still performs worse than other existing (admissible) heuristics.},
  url_Paper  = {https://bercher.net/publications/2024/Olz2024aTOILPHeuristic.pdf},
  keywords   = {workshop,DECRA}
}

{"_id":"bL7dZoLT73JgdpfQT","bibbaseid":"olz-lodemann-bercher-anilpheuristicfortotalorderhtnplanning-2024","author_short":["Olz, C.","Lodemann, A.","Bercher, P."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Conny"],"propositions":[],"lastnames":["Olz"],"suffixes":[]},{"firstnames":["Alexander"],"propositions":[],"lastnames":["Lodemann"],"suffixes":[]},{"firstnames":["Pascal"],"propositions":[],"lastnames":["Bercher"],"suffixes":[]}],"booktitle":"Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024)","title":"An ILP Heuristic for Total-Order HTN Planning","year":"2024","pages":"10–18","abstract":"Heuristic Search is still the most successful approach to hierarchical planning, both for finding any and for finding an optimal solution. Yet, there exist only a very small handful heuristics for HTN planning – so there is still huge potential for improvements. It is especially noteworthy that there does not exist a single heuristic that's tailored towards special cases. In this work we propose the very first specialized HTN heuristic, tailored towards totally ordered HTN problems. Our heuristic builds on an existing NP-complete and admissible delete-and-ordering relaxation ILP heuristic but partially incorporates ordering constraints while reducing the number of ILP constraints. It exploits inferred preconditions and effects of compound tasks and is also admissible. Our current heuristic proves to be more efficient than the one we build on, though it still performs worse than other existing (admissible) heuristics.","url_paper":"https://bercher.net/publications/2024/Olz2024aTOILPHeuristic.pdf","keywords":"workshop,DECRA","bibtex":"@InProceedings{Olz2024TOILPHeuristic,\n author = {Conny Olz and Alexander Lodemann and Pascal Bercher},\n booktitle = {Proceedings of the 7th ICAPS Workshop on Hierarchical Planning (HPlan 2024)},\n title = {An ILP Heuristic for Total-Order HTN Planning},\n year = {2024},\n pages = {10--18},\n abstract = {Heuristic Search is still the most successful approach to hierarchical planning, both for finding any and for finding an optimal solution. Yet, there exist only a very small handful heuristics for HTN planning -- so there is still huge potential for improvements. It is especially noteworthy that there does not exist a single heuristic that's tailored towards special cases. In this work we propose the very first specialized HTN heuristic, tailored towards totally ordered HTN problems. Our heuristic builds on an existing NP-complete and admissible delete-and-ordering relaxation ILP heuristic but partially incorporates ordering constraints while reducing the number of ILP constraints. It exploits inferred preconditions and effects of compound tasks and is also admissible. Our current heuristic proves to be more efficient than the one we build on, though it still performs worse than other existing (admissible) heuristics.},\n url_Paper = {https://bercher.net/publications/2024/Olz2024aTOILPHeuristic.pdf},\n keywords = {workshop,DECRA}\n}\n\n","author_short":["Olz, C.","Lodemann, A.","Bercher, P."],"key":"Olz2024TOILPHeuristic-1","id":"Olz2024TOILPHeuristic-1","bibbaseid":"olz-lodemann-bercher-anilpheuristicfortotalorderhtnplanning-2024","role":"author","urls":{" paper":"https://bercher.net/publications/2024/Olz2024aTOILPHeuristic.pdf"},"keyword":["workshop","DECRA"],"metadata":{"authorlinks":{}},"downloads":10},"bibtype":"inproceedings","biburl":"https://bercher.net/bibtex/bibliography.bib","dataSources":["sjPNkpyhvwaEdytSD","jTtEZEw8NJc375xGA","obo5j8TzJxMFi59JG","bPpsmYWjffAy6QHP5","wYF8yPQT6a4TgShWe"],"keywords":["workshop","decra"],"search_terms":["ilp","heuristic","total","order","htn","planning","olz","lodemann","bercher"],"title":"An ILP Heuristic for Total-Order HTN Planning","year":2024,"downloads":10}