Extending planning graphs to an ADL subset
Date
1997ISSN
0302-9743Source
4th European Conference on Planning, ECP 1997Volume
1348 LNAIPages
273-285Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We describe an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators in such a way that almost all interesting properties of the original graph-plan algorithm are preserved.