Skip to main content
Conference Proceedings

Extending planning graphs to an ADL subset

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1348 LNAI 273-285
DOI: 10.1007/3-540-63912-8_92
106Citations
Citations of this article
57Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

Koehler, J., Nebel, B., Hoffmann, J., & Dimopoulos, Y. (1997). Extending planning graphs to an ADL subset. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1348 LNAI, pp. 273–285). Springer Verlag. https://doi.org/10.1007/3-540-63912-8_92

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free