KPKristýna Pantůčková

Kristýna Pantůčková

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Kristýna Pantůčková has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    The Effect of Decomposition Rule Modeling on the Efficiency of Hierarchical Planners

    by Roman Bartak, Simona Ondrčková, Kristýna Pantůčková

    Hierarchical planning is a widely used approach in automated planning that breaks down complex tasks into manageable subtasks, facilitating more efficient problem-solving. The task decomposition is modelled via decomposition rules that resemble rewriting rules of context-free grammars. Normal forms for rewriting rules, namely Chomsky Normal Form and Greibach Normal Form, have been proposed in the context of formal grammars and also applied to hierarchical planning models, specifically for hierarchical plan verification. This paper examines whether the format of decomposition rules also influences the efficiency of hierarchical planners.

  • Open Access

    What to Do if a Plan Does Not Comply with an HTN Model?

    by Kristýna Pantůčková, Roman Barták

    Plan verification deals with the problem of checking whether a given sequence of actions is a valid plan according to a planning domain model. If the action sequence is not a valid plan, the next question is where the problem is. This question can be addressed by plan correction – modifying the plan to get a valid plan. The paper presents the first system to correct totally ordered hierarchical plans by action deletion and action insertion. Supporting action insertion, which is the major novelty here, significantly extends the applicability of plan correction to areas such as plan recognition and even planning itself. The new system is also faster than the existing plan correction system when only action deletion is allowed.

  • Open Access

    Hierarchical Plan Repair via Plan Recognition and Plan Correction

    by Kristýna Pantůčková, Roman Barták

    Hierarchical planning extends classical planning by introducing a hierarchy of tasks describing how tasks decompose into subtasks until primitive tasks -- actions -- forming a plan are obtained. Plan repair deals with plans that failed to execute due to a sudden state change. In particular, plan repair modifies the not-yet executed suffix of the plan to achieve the original goal. Hierarchical plan repair aims to modify a partially executed plan while respecting the task hierarchy. This paper describes how hierarchical plan repair can be realized by solving closely related hierarchical plan recognition and correction problems.

  • Open Access

    Using Earley Parser for Verification of Totally Ordered Hierarchical Plans

    by Kristýna Pantůčková, Simona Ondrčková, Roman Barták

    Hierarchical planning extends classical planning by capturing the hierarchical structure of tasks via decomposition of tasks to subtasks. Hierarchical plan verification is the problem of determining whether a given plan is valid according to that structure. As decomposition trees in totally ordered hierarchical planning domains resemble parsing trees of context-free grammars, one may exploit the techniques for context-free grammars also for hierarchical plans. In this paper, we study how the Earley parser, proposed for checking whether a given word belongs to a language defined by context-free grammar, can be extended to verification of totally ordered hierarchical plans.


  • Open Access

    Handling Empty Decomposition Methods in Hierarchical Planning

    by Simona Ondrčková, Kristýna Pantůčková, Roman Barták

    Hierarchical planning is a form of planning where tasks decompose into sub-tasks until primitive tasks (actions) are obtained. These decompositions might contain additional constraints, such as subtask ordering and state constraints. If a task is already fulfilled, it does not need to decompose into anything, but it may still require satisfaction of a particular state constraint (to check that the task is fulfilled). Such decomposition methods are called empty. Despite practical usefulness, many hierarchical planning models do not support empty methods fully. This paper shows that two recently introduced hierarchical planning formalisms are equivalent with respect to empty methods. We also discuss the possibility of compiling such methods away. In particular, we show how to compile them away in totally ordered domains and discuss the difficulties in partially ordered domains.

  • Open Access

    Using Earley Parser for Recognizing Totally Ordered Hierarchical Plans

    by Kristýna Pantůčková, Roman Barták

    Earley Parser is a top-down parser proposed for contextfree grammars and used, for example, in the grammar constraint. Parsing trees of context-free grammars are very close to task decomposition trees used in hierarchical planning, specifically when the actions are totally ordered. This paper suggests using the Earley Parser to recognize totally ordered hierarchical plans. Given a sequence of actions-a prefix of the plan-and a task decomposition model, the plan recognition problem asks which task decomposes to a plan containing the given plan prefix. We will show that the Earley parser significantly increases the speed of plan recognition compared to the existing bottom-up parsing-based plan recognizer. The Earley parser's performance is also on a par with the planning-based plan recognizer despite not using any planning heuristics.


  • Open Access

    Parsing-Based Recognition of Hierarchical Plans Using the Grammar Constraint

    by Kristýna Pantůčková, Simona Ondrčková, Roman Barták

    Plan recognition is the problem of recognizing a goal task and an agent’s plan based on the observed actions. Plan recognition techniques can be employed in multiagent systems, behaviour recognition, computer security, and other fields related to artificial intelligence. Hierarchical task networks (HTN) describe the decomposition hierarchy of tasks in planning problems. In HTN plan recognition, a prefix of the plan (actions observed so far) is given as an input, and the aim is to find a task that decomposes into a sequence of actions with the given prefix. In this paper, we show how the performance of parsing-based HTN plan recognition can be improved by restricting possible suffixes of the given prefix based on generalized arc consistency of a corresponding context-free grammar.