Skip to main content
Conference Proceedings

Partial symbolic pattern databases for optimal sequential planning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5243 LNAI 193-200
DOI: 10.1007/978-3-540-85845-4_24
8Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper investigates symbolic heuristic search with BDDs for solving domain-independent action planning problems cost-optimally. By distributing the impact of operators that take part in several abstractions, multiple partial symbolic pattern databases are added for an admissible heuristic, even if the selected patterns are not disjoint. As a trade-off between symbolic bidirectional and heuristic search with BDDs on rather small pattern sets, partial symbolic pattern databases are applied. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Edelkamp, S., & Kissmann, P. (2008). Partial symbolic pattern databases for optimal sequential planning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5243 LNAI, pp. 193–200). https://doi.org/10.1007/978-3-540-85845-4_24

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