Partial Symbolic Pattern Databases for Optimal Sequential Planning

Authors:
Stefan Edelkamp;Peter Kissmann
Affiliations:
Faculty of Computer Science TU Dortmund, Germany;Faculty of Computer Science TU Dortmund, Germany
Venue:
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Year:
2008

Citing 12
Cited 1

Faster algorithms for the shortest path problem

Journal of the ACM (JACM)
Perimeter search

Artificial Intelligence
Algorithm 360: shortest-path forest with topological ordering [H]

Communications of the ACM
Symbolic Heuristic Search Using Decision Diagrams

Proceedings of the 5th International Symposium on Abstraction, Reformulation and Approximation
OBDDs in Heuristic Search

KI '98 Proceedings of the 22nd Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
SetA*: an efficient BDD-based heuristic search algorithm

Eighteenth national conference on Artificial intelligence
Frontier search

Journal of the ACM (JACM)
New admissible heuristics for domain-independent planning

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Domain-independent construction of pattern database heuristics for cost-optimal planning

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Compressed pattern databases

Journal of Artificial Intelligence Research
Partial pattern databases

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Combining perimeter search and pattern database abstractions

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation

Scaling Search with Pattern Databases

Model Checking and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.