On Total-Order HTN Plan Verification with Method Preconditions An Extension of the CYK Parsing Algorithm
| Authors |
|
|---|---|
| Publication date | 2023 |
| Host editors |
|
| Book title | Proceedings of the 37th AAAI Conference on Artificial Intelligence |
| Book subtitle | AAAI-2023 : Washington, DC, USA, February 7-14, 2023 |
| ISBN |
|
| ISBN (electronic) |
|
| Event | the 37th AAAI Conference on Artificial Intelligence |
| Volume | Issue number | 10 |
| Pages (from-to) | 12041–12048 |
| Publisher | Washington, DC: AAAI Press |
| Organisations |
|
| Abstract |
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.
|
| Document type | Conference contribution |
| Language | English |
| Related dataset | Experimental Results for the AAAI 2023 Paper "On Total-Order HTN Plan Verification with Method Preconditions -- An Extension of the CYK Parsing Algorithm" |
| Related publication | On Total-Order HTN Plan Verification with Method Preconditions |
| Published at | https://doi.org/10.1609/aaai.v37i10.26420 |
| Other links | https://www.proceedings.com/70606.html |
| Downloads |
26420-Article Text-30483-1-2-20230626
(Final published version)
|
| Permalink to this page | |
