An Extensive Empirical Evaluation of Inferring Preconditions and Effects of Compound Tasks in Ground HTN Planning Problems.
J. Artif. Intell. Res., 2025
Exploring the hierarchy: extracting and exploiting state information of compound tasks in HTN planning
PhD thesis, 2024
A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming.
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements.
Proceedings of the Sixteenth International Symposium on Combinatorial Search, 2023
Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023
Step-by-Step Task Plan Explanations Beyond Causal Links.
Proceedings of the 31st IEEE International Conference on Robot and Human Interactive Communication, 2022
Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks - A Complexity Analysis.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020
Eliminating Redundant Actions in Partially Ordered Plans - A Complexity Analysis.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019