← Authors

Pascal Bercher

28 papers · 2015–2026 · 2 conferences · across top CS/AI conferences

Achievements

🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge 🧭 Keyword Pioneer 🌍 Conference Polyglot (2) πŸƒ Academic Marathon (10) 🐝 Cross-Pollinator (9) 🌈 Renaissance Researcher (5) πŸ—ΊοΈ Taxonomy Completionist (15) πŸ† Keyword Champion (12) πŸ”¬ Deep Specialist (19) 🧬 Topic Evolution πŸ’Ž Century Club (25) πŸ—ƒοΈ Keyword Collector (85) ❓ The Questioner (3) πŸ”₯ Unstoppable (9) πŸ“ˆ Trend Setter

Conferences

AAAI (14) IJCAI (14)

Top co-authors

Gregor Behnke (9) Daniel HΓΆller (8) Songtuan Lin (7) Susanne Biundo (7) Ron Alford (5) Conny Olz (3) Sarath Sreedharan (2) Birte Glimm (2) Alban Grastien (2) Marvin Schiller (2)

Keywords

automated planning (12) hierarchical task network (11) htn planning (8) computational complexity (7) hierarchical planning (6) classical planning (5) heuristic search (4) planning domain (4) plan verification (4) complexity analysis (4) hierarchical task network planning (4) task decomposition (3) planning algorithm (2) model repair (2) lifted representation (2) polynomial time (2) problem grounding (2) causal link (2) context-free grammar (2) plan optimization (2)

Papers

Symmetries and Other Variations of β€œEnd-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions AAAI 2026
Automated Repair of Totally-Ordered Hierarchical Task Network Domains via Context-Free Grammars with Large Language Model Support AAAI 2026
Makespan Investigations of Sequential, Parallel, PO, and POCL Plans AAAI 2026
Computational Complexity of Planning for Recursive Primitive Task Networks: Selective Action Nullification with State Preservation IJCAI 2025
Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans AAAI 2025
A Survey on Model Repair in AI Planning IJCAI 2025
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence AAAI 2024
A Survey on Plan Optimization IJCAI 2024
Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems) IJCAI 2024
Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains AAAI 2023
Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains AAAI 2023
On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm AAAI 2023
On the Computational Complexity of Model Reconciliations IJCAI 2022
Tight Bounds for Hybrid Planning IJCAI 2022
Making Translations to Classical Planning Competitive with Other HTN Planners AAAI 2022
Landmark Generation in HTN Planning AAAI 2021
Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis AAAI 2021
Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models IJCAI 2021
On Succinct Groundings of HTN Planning Problems AAAI 2020
POP ≑ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization AAAI 2020
HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems AAAI 2020
Delete- and Ordering-Relaxation Heuristics for HTN Planning IJCAI 2020
A Survey on Hierarchical Planning – One Abstract Idea, Many Concrete Realizations IJCAI 2019
On Guiding Search in HTN Planning with Classical Planning Heuristics IJCAI 2019
Instructing Novice Users on How to Use Tools in DIY Projects IJCAI 2018
An Admissible HTN Planning Heuristic IJCAI 2017
Tight Bounds for HTN Planning with Task Insertion IJCAI 2015
Coherence Across Components in Cognitive Systems β€” One Ontology to Rule Them All IJCAI 2015