On the Expressive Power of Planning Formalisms in Conjunction with LTL

Lin, Songtuan; Bercher, Pascal

doi:10.1609/icaps.v32i1.19806

Cited by 3 publications

(3 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One such example, as mentioned early, is the field of diagnosis on which we develop our approach. In our earlier work (Lin, Grastien, and Bercher 2022), we have rigorously framed a grounded domain repair problem without negative preconditions as a diagnosis problem, providing an in-depth insight into the connection between these two problems. Additionally, Crow and Rushby (1991) and Stumptner and Wotawa (1999) proposed to use diagnosis techniques to reconfigure a system, which is an alternative view of the domain repair problem.…”

Section: Discussion and Related Workmentioning

confidence: 99%

Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains

Lin

Grastien

Bercher

2023

AAAI

View full text Add to dashboard Cite

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 are concerned with the scenario where a domain contradicts a plan that is known to be valid. Our goal is to repair the domain so as to turn the plan into a solution. Specifically, we consider both grounded and lifted representations support for negative preconditions and show how to explore the space of repairs to find the optimal one efficiently. As an evidence of the efficiency of our approach, the experiment results show that all flawed domains except one in the benchmark set can be repaired optimally by our approach within one second.

show abstract

Section: Discussion and Related Workmentioning

confidence: 99%

Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains

Lin

Grastien

Bercher

2023

AAAI

View full text Add to dashboard Cite

show abstract

“…Hierarchical planning has received increasing attention in the last decade. It is strictly more expressive than non-hierarchical planning (Höller et al 2014(Höller et al , 2016Lin and Bercher 2022) and hence can model a broader range of problems.…”

Section: Introductionmentioning

confidence: 99%

Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions

Lin,

Höller,

Bercher

2024

SOCS

View full text Add to dashboard Cite

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 errors in a planning domain are of great importance. Previous works have devoted efforts to developing such approaches for correcting classical (non-hierarchical) domains. However, no approaches exist for hierarchical planning, which is what we offer here. More specifically, our approach takes as input a flawed hierarchical domain together with a plan known to be a solution but actually contradicting the domain (due to errors in the domain) and outputs corrections to the domain that add missing actions to the domain which turn the plan into a solution. The approach achieves this by compiling the problem of finding corrections to another hierarchical planning problem.

show abstract

“…The core of our TO plan verification approach is the CYK parsing algorithm (Sakai 1961), which can be employed here because a TOHTN planning problem is semantically equivalent to a context-free grammar (CFG) (Höller et al 2014;Lin and Bercher 2022), and hence, the TOHTN plan verification problem is essentially the parsing problem for CFG. However, that result by Höller et al (2014) does not take into account so-called method preconditions which occur quite often in practice in many TOHTN planning benchmarks and thus also become an obstacle to directly applying the CYK algorithm to plan verification.…”

Section: Introductionmentioning

confidence: 99%

On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm

Lin

Behnke

Ondrčková

et al. 2023

AAAI

View full text Add to dashboard Cite

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 grammars. Currently, most HTN plan verification approaches do not have special treatments for the TO configuration, and the only one features such an optimization still relies on an exhaustive search. Hence, we will develop a new TOHTN plan verification approach in this paper by extending the standard CYK parsing algorithm which acts as the best decision procedure in general.

show abstract

On the Expressive Power of Planning Formalisms in Conjunction with LTL

Cited by 3 publications

References 15 publications

Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains

Towards Automated Modeling Assistance: An Efficient Approach for Repairing Flawed Planning Domains

Modeling Assistance for Hierarchical Planning: An Approach for Correcting Hierarchical Domains with Missing Actions

On Total-Order HTN Plan Verification with Method Preconditions – An Extension of the CYK Parsing Algorithm

Contact Info

Product

Resources

About