On Heuristics for Parsing-based Verification of Hierarchical Plans with a Goal Task

Open Access
Authors
  • S. Ondrčková
  • R. Barták
  • P. Bercher
  • G. Behnke ORCID logo
Publication date 2022
Book title Proceedings of FLAIRS-35
Series Proceedings of the International Florida AI Research Conference
Event 35th International Florida Artificial Intelligence Research Society Conference
Number of pages 6
Publisher The Florida Artificial Intelligence Research Society
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract Verification of hierarchical plans deals with the problem if a given action sequence is a valid hierarchical plan – the action sequence can be obtained by decomposing a particular (goal) task using given decomposition methods. The existing parsing-based verification approach greedily composes actions until it obtains the goal task. Greediness implies that this approach also generates tasks unrelated to the goal task. In this paper, we study the use of heuristics when creating new tasks. We also ask whether the prior knowledge of the goal task improves efficiency.
Document type Conference contribution
Language English
Published at https://doi.org/10.32473/flairs.v35i.130606
Downloads
Permalink to this page
Back