Extending planning graphs to an ADL subset (1997)
Cached
Download Links
- [www.isi.edu]
- [www.informatik.uni-freiburg.de]
- [www.informatik.uni-freiburg.de]
- [members.deri.at]
- [www-i5.informatik.rwth-aachen.de]
- DBLP
Other Repositories/Bibliography
by
Jana Koehler
,
Bernhard Nebel
,
Jörg Hoffmann
,
Yannis Dimopoulos
| Citations: | 159 - 22 self |
BibTeX
@INPROCEEDINGS{Koehler97extendingplanning,
author = {Jana Koehler and Bernhard Nebel and Jörg Hoffmann and Yannis Dimopoulos},
title = {Extending planning graphs to an ADL subset},
booktitle = {},
year = {1997},
pages = {273--285},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe an extension of graphplan to a subset of ADL that allows conditional and universally quantified effects in operators in such away that almost all interesting properties of the original graphplan algorithm are preserved.
