Pascal Bercher
28 papers · 2015–2026 · 2 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+8 more ↓ Show less ↑
🗺️ Taxonomy Completionist (15) 🏃 Academic Marathon · Half 🌍 Conference Polyglot · Bronze 🌉 Interdisciplinary Bridge · Silver 🐣 Hot Topic Early Bird
🏆
Keyword Champion
(12)
🧬
Topic Evolution
🔬
Deep Specialist
(19)
💎
Century Club · Bronze
🔥
Unstoppable · Silver
❓
The Questioner
(3)
🗃️
Keyword Collector
(84)
📈
Trend Setter
Venues
Top co-authors
Research topics
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
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
Symmetries and Other Variations of “End-Recursive” HTN Problems: Mapping the Border Between Decidable and Undecidable Restrictions
AAAI 2026
A Survey on Model Repair in AI Planning
IJCAI 2025
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 Plan Optimization
IJCAI 2024
Laying the Foundations for Solving FOND HTN Problems: Grounding, Search, Heuristics (and Benchmark Problems)
IJCAI 2024
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence
AAAI 2024
On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm
AAAI 2023
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
Making Translations to Classical Planning Competitive with Other HTN Planners
AAAI 2022
On the Computational Complexity of Model Reconciliations
IJCAI 2022
Tight Bounds for Hybrid Planning
IJCAI 2022
Change the World - How Hard Can that Be? On the Computational Complexity of Fixing Planning Models
IJCAI 2021
Landmark Generation in HTN Planning
AAAI 2021
Revealing Hidden Preconditions and Effects of Compound HTN Planning Tasks – A Complexity Analysis
AAAI 2021
Delete- and Ordering-Relaxation Heuristics for HTN Planning
IJCAI 2020
HDDL: An Extension to PDDL for Expressing Hierarchical Planning Problems
AAAI 2020
On Succinct Groundings of HTN Planning Problems
AAAI 2020
POP ≡ POCL, Right? Complexity Results for Partial Order (Causal Link) Makespan Minimization
AAAI 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
Coherence Across Components in Cognitive Systems — One Ontology to Rule Them All
IJCAI 2015
Tight Bounds for HTN Planning with Task Insertion
IJCAI 2015