Abstract
The problem of hierarchical plan verification focuses on checking whether an action sequence is a valid hierarchical plan the action sequence is executable and a goal task can be decomposed into it. The existing parsing-based verifier works on lifted domain models. In this paper we study whether grounding of the models could improve efficiency of the verifier. We also explore additional implementation improvements to increase the speed of the verifier.
| Original language | English |
|---|---|
| Pages (from-to) | 92-99 |
| Number of pages | 8 |
| Journal | International Conference on Agents and Artificial Intelligence |
| Volume | 3 |
| DOIs | |
| Publication status | Published - 2023 |
| Event | 15th International Conference on Agents and Artificial Intelligence, ICAART 2023 - Lisbon, Portugal Duration: 22 Feb 2023 → 24 Feb 2023 |
Fingerprint
Dive into the research topics of 'On the Impact of Grounding on HTN Plan Verification via Parsing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver