Pascal Bercher

Venues

Frequent coauthors

Papers

1. Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model Support
   AAAI 2026 ·

   Daniel Lutalo

   DBLP profile ↗ORCID search ↗
2. Makespan Investigations of Sequential, Parallel, PO, and POCL Plans
   AAAI 2026 ·

   Harrison Oates

   DBLP profile ↗ORCID search ↗
3. Symmetries and Other Variations of "End-Recursive" HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions
   AAAI 2026 ·

   Hadyn Tang

   DBLP profile ↗ORCID search ↗
4. A Survey on Model Repair in AI Planning
   IJCAI 2025 · Pascal Bercher
5. Calculating Optimal Corrections for Unsolvable Planning Problems
   ECAI 2025 ·

   Michael Welt

   DBLP profile ↗ORCID search ↗
6. Computational Complexity of Planning for Recursive Primitive Task Networks: Selective Action Nullification with State Preservation
   IJCAI 2025 ·

   Yifan Zhang

   DBLP profile ↗ORCID search ↗
7. How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning
   ICAPS 2025 ·

   Mohammad Yousefi

   DBLP profile ↗ORCID search ↗
8. Probabilistic HTN Planning: Formalization and Computational Complexity Analysis
   KR 2025 ·

   Mohammad Yousefi

   DBLP profile ↗ORCID search ↗
9. Repairing Planning Domains Based on Lifted Test Plans
   ECAI 2025 ·

   Nader Karimi Bavandpour

   DBLP profile ↗ORCID search ↗
10. Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence
    ICAPS 2025 ·

    Pascal Lauer

    DBLP profile ↗ORCID search ↗
11. Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans
    AAAI 2025 ·

    Songtuan Lin

    DBLP profile ↗ORCID search ↗
12. A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming
    ECAI 2024 ·

    Conny Olz

    DBLP profile ↗ORCID search ↗
13. A Survey on Plan Optimization
    IJCAI 2024 · Pascal Bercher
14. Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)
    IJCAI 2024 ·

    Mohammad Yousefi

    DBLP profile ↗ORCID search ↗
15. On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence
    AAAI 2024 ·

    Songtuan Lin

    DBLP profile ↗ORCID search ↗