Problemcore
HTN planning
Also called hierarchical task network planning.
Find a primitive plan obtained by decomposing a given initial task network.
Find a primitive plan obtained by decomposing a given initial task network.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 1801NR Edit this page History Report an error