Pascal Bercher
YOU?
Author Swipe
View article: Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence
Tight Bounds for Lifted HTN Plan Verification and Bounded Plan Existence Open
Plan verification is a canonical problem within any planning setting to ensure correctness. This problem is closely linked to the bounded plan existence problem. We analyze the complexity of these problems on lifted representations for Hie…
View article: How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning
How Good is Perfect? On the Incompleteness of A* for Total-Order HTN Planning Open
This paper reveals the inherent limitations of A* in HTN planning by identifying various cycle types induced by the task hierarchy and analyzing their effects on the termination of the algorithm. We prove that A* even with the perfect heur…
View article: Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans
Told You That Will Not Work: Optimal Corrections to Planning Domains Using Counter-Example Plans Open
Hardness of modeling a planning domain is a major obstacle for making automated planning techniques accessible. We developed a tool that helps modelers correct domains based on available information such as the known feasibility or infeasi…
View article: An Extensive Empirical Evaluation of Inferring Preconditions and Effects of Compound Tasks in Ground HTN Planning Problems
An Extensive Empirical Evaluation of Inferring Preconditions and Effects of Compound Tasks in Ground HTN Planning Problems Open
HTN planning requires the decomposition of compound tasks into primitive and executable actions. In the currently most frequently used formalism, compound tasks lack explicit preconditions and effects. Those are, however, useful, e.g., for…
View article: A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming
A Heuristic for Optimal Total-Order HTN Planning Based on Integer Linear Programming Open
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 of heuristics for HTN planning – so there is still huge p…
View article: A Priori Estimation of the Approximation, Optimization and Generalization Errors of Random Neural Networks for Solving Partial Differential Equations
A Priori Estimation of the Approximation, Optimization and Generalization Errors of Random Neural Networks for Solving Partial Differential Equations Open
In recent years, neural networks have achieved remarkable progress in various fields and have also drawn much attention in applying them on scientific problems. A line of methods involving neural networks for solving partial differential e…
View article: Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions
Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions Open
The complexity of modeling planning domains is a major obstacle for making automated planning techniques more accessible, raising the demand of tools for providing modeling assistance. In particular, tools that can automatically correct er…
View article: On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence Open
In this paper we study the computational complexity of several reasoning tasks centered around the bounded plan existence problem. We do this for standard classical planning and hierarchical task network (HTN) planning and each for a groun…
View article: Intractability of Optimal Multi-Agent Pathfinding on Directed Graphs
Intractability of Optimal Multi-Agent Pathfinding on Directed Graphs Open
In Multi-Agent Pathfinding (MAPF) problems, multiple agents move simultaneously to reach their individual destinations without colliding with each other. The computational complexity of the problem has been extensively studied for undirect…
View article: Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning
Accelerating SAT-Based HTN Plan Verification by Exploiting Data Structures from HTN Planning Open
Plan verification is the task of deciding whether a given plan is a solution to a planning problem. In this paper, we study the plan verification problem in the context of Hierarchical Task Network (HTN) planning, which has been proved to …
View article: Experimental Results for the PRICAI 2023 Paper ``Detecting AI Planning Modelling Mistakes -- Potential Errors and Benchmark Domains''
Experimental Results for the PRICAI 2023 Paper ``Detecting AI Planning Modelling Mistakes -- Potential Errors and Benchmark Domains'' Open
This repository contains data related to the following paper: An overview of which domains have been tested on which software, refer to the following paper: @InProceedings{Sleath2023PossibleModelingErrors, author = {Kayleigh Sleath and Pas…
View article: Experimental Results for the PRICAI 2023 Paper ``Detecting AI Planning Modelling Mistakes -- Potential Errors and Benchmark Domains''
Experimental Results for the PRICAI 2023 Paper ``Detecting AI Planning Modelling Mistakes -- Potential Errors and Benchmark Domains'' Open
This repository contains data related to the following paper: An overview of which domains have been tested on which software, refer to the following paper: @InProceedings{Sleath2023PossibleModelingErrors, author = {Kayleigh Sleath and Pas…
View article: A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements
A Look-Ahead Technique for Search-Based HTN Planning: Reducing the Branching Factor by Identifying Inevitable Task Refinements Open
In HTN planning the choice of decomposition methods used to refine compound tasks is key to finding a valid plan. Based on inferred preconditions and effects of compound tasks, we propose a look-ahead technique for search-based total-order…
View article: Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks
Can They Come Together? A Computational Complexity Analysis of Conjunctive Possible Effects of Compound HTN Planning Tasks Open
Recently, inferred effects of compound (totally ordered) HTN planning tasks were introduced. Guaranteed effects are those which hold true after all executable refinements of such a task, whereas possible effects are only required to hold a…
View article: On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm
On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm Open
In this paper, we consider the plan verification problem for totally ordered (TO) HTN planning. The problem is proved to be solvable in polynomial time by recognizing its connection to the membership decision problem for context-free gramm…
View article: Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains
Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains Open
Designing a planning domain is a difficult task in AI planning. Assisting tools are thus required if we want planning to be used more broadly. In this paper, we are interested in automatically correcting a flawed domain. In particular, we …
View article: Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains
Was Fixing This Really That Hard? On the Complexity of Correcting HTN Domains Open
Automated modeling assistance is indispensable to the AI planning being deployed in practice, notably in industry and other non-academic contexts. Yet, little progress has been made that goes beyond smart interfaces like programming enviro…
View article: Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans
Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans Open
Verification of hierarchical plans deals with the problem of whether an action sequence is causally consistent and can be obtained by a decomposition of a goal task. This second sub-problem (finding the decomposition) makes the verificatio…
View article: Experimental Results for the AAAI 2023 Paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm"
Experimental Results for the AAAI 2023 Paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm" Open
This is the collection of the experimental results reported in the paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm". For a detailed explanation, please read the README.md f…
View article: Experimental Results for the AAAI 2023 Paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm"
Experimental Results for the AAAI 2023 Paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm" Open
This is the collection of the experimental results reported in the paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm". For a detailed explanation, please read the README.md f…
View article: Experimental Results for the AAAI 2023 Paper "Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains"
Experimental Results for the AAAI 2023 Paper "Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains" Open
This is the collection of all experimental outputs described in the paper "Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains" by Songtuan Lin, Alban Grastien, and Pascal Bercher, accepted by…
View article: Experimental Results for the AAAI 2023 Paper "Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains"
Experimental Results for the AAAI 2023 Paper "Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains" Open
This is the collection of all experimental outputs described in the paper "Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains" by Songtuan Lin, Alban Grastien, and Pascal Bercher, accepted by…
View article: Hierarchical planning and reasoning about partially ordered plans—From theory to practice
Hierarchical planning and reasoning about partially ordered plans—From theory to practice Open
This invited paper (part of the New Faculty Highlights Invited Speaker Program of AAAI'21 * ) surveys my work done until today. The reviewed work focuses on hierarchical task network (HTN) planning as well as on partial order causal link (…
View article: On the Computational Complexity of Model Reconciliations
On the Computational Complexity of Model Reconciliations Open
Model-reconciliation explanation is a popular framework for generating explanations for planning problems. While the framework has been extended to multiple settings since its introduction for classical planning problems, there is little a…
View article: Tight Bounds for Hybrid Planning
Tight Bounds for Hybrid Planning Open
Several hierarchical planning systems feature a rich level of language features making them capable of expressing real-world problems. One such feature that's used by several current planning systems is causal links, which are used to trac…
View article: Making Translations to Classical Planning Competitive with Other HTN Planners
Making Translations to Classical Planning Competitive with Other HTN Planners Open
Translation-based approaches to planning allow for solving problems in complex and expressive formalisms via the means of highly efficient solvers for simpler formalisms. To be effective, these translations have to be constructed appropria…
View article: Compiling HTN Plan Verification Problems into HTN Planning Problems
Compiling HTN Plan Verification Problems into HTN Planning Problems Open
Plan Verification is the task of deciding whether a sequence of actions is a solution for a given planning problem. In HTN planning, the task is computationally expensive and may be up to NP-hard. However, there are situations where it nee…
View article: Flexible FOND HTN Planning: A Complexity Analysis
Flexible FOND HTN Planning: A Complexity Analysis Open
Hierarchical Task Network (HTN) planning is an expressive planning formalism that has often been advocated to address real-world problems. Yet few extensions exist that can deal with the many challenges encountered in the real world, one b…