Using planning graphs for solving htn planning problems
From Semantic Portal Wiki
{{#vardefine:category|Publication}}{{#vardefine:templatename|i.publication}}{{#vardefine:package|smwbp_instance_templates}}
| Edit |
Reference: {{#vardefine:pagename|using planning graphs for solving htn planning problems }}
- [[]]
bibtex
{{#vardefine:pagename|Using planning graphs for solving htn planning problems }}{{#vardefine:key| }}
abstract:
download:
- paper:
- slides:
Facts about Using planning graphs for solving htn planning problemsRDF feed
| Author | Amnon Lotem +, Dana S. Nau +, and James A. Hendler + |
| Bibtype | inproceedings + |
| Booktitle | AAAI/IAAI + |
| Key | dblp:conf/aaai/lotemnh99 + |
| Pages | 534-540 + |
| Source | http://dblp.uni-trier.de/rec/bibtex/conf/aaai/LotemNH99 + |
| Tag | Computer science + |
| Title | Using Planning Graphs for Solving HTN Planning Problems + |
| Year | 1999 + |
