HDDL -- A Language to Describe Hierarchical Planning Problems

Autor: Höller, D., Behnke, G., Bercher, P., Biundo, S., Fiorino, H., Pellier, D., Alford, R.

The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophistica

Externí odkaz: http://arxiv.org/abs/1911.05499

Encoding Lifted Classical Planning in Propositional Logic

Autor: Höller, D., Behnke, G., Kumar, A., Thiébaux, S., Varakantham, P., Yeoh, W.

Publikováno v: Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling: June 13-24, 2022, virtual conference, 134-144
STARTPAGE=134;ENDPAGE=144;TITLE=Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling

Planning models are usually defined in lifted, i.e. first order formalisms, while most solvers need (variable-free) grounded representations. Though techniques for grounding prune unnecessary parts of the model, grounding might – nevertheless – b

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a719e4ff625f7fee77408357be317d03
https://doi.org/10.1609/icaps.v32i1.19794

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

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

Autor: Lin, S., Behnke, G., Ondrčková, S., Barták, R., Bercher, P.

Publikováno v: HPLAN 2022 : Proceedings of the 5th Workshop on Hierarchical Planning: 32nd International Conference on Automated Planning and Scheduling : June 13-24, 2022, virtually from Singapore, 52-58
STARTPAGE=52;ENDPAGE=58;TITLE=HPLAN 2022 : Proceedings of the 5th Workshop on Hierarchical Planning

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. Curren

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::22463bb0ba5aa6ecc762390b85d4a4f3
https://dare.uva.nl/personal/pure/en/publications/on-totalorder-htn-plan-verification-with-method-preconditions(7662f2cd-6501-4f43-8a2d-d1e22f5dcdcc).html

Exploiting Solution Order Graphs and Path Decomposition Trees for More Efficient HTN Plan Verification via SAT Solving

Autor: Lin, S., Behnke, G., Bercher, P.

Publikováno v: HPLAN 2022 : Proceedings of the 5th Workshop on Hierarchical Planning: 32nd International Conference on Automated Planning and Scheduling : June 13-24, 2022, virtually from Singapore, 24-28
STARTPAGE=24;ENDPAGE=28;TITLE=HPLAN 2022 : Proceedings of the 5th Workshop on Hierarchical Planning

The task of plan verification is to decide 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. Concretely, we will develop a new S

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::23426ff60caf0fd83e2936d9ba6686b1
https://dare.uva.nl/personal/pure/en/publications/exploiting-solution-order-graphs-and-path-decomposition-trees-for-more-efficient-htn-plan-verification-via-sat-solving(60b4f6e1-e896-40d7-b998-09c86f2c5049).html