Paper Info
Title
Partial Symbolic Pattern Databases for Optimal Sequential Planning
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.
Year
DOI
Venue
2008
10.1007/978-3-540-85845-4_24
KI
Keywords
Field
DocType
heuristic search,admissible heuristic,partial symbolic pattern databases,small pattern set,selected pattern,multiple partial symbolic pattern,optimal sequential planning,symbolic bidirectional,domain-independent action planning problem,symbolic heuristic search
Mathematical optimization,Heuristic,Incremental heuristic search,Abstraction,Disjoint sets,Admissible heuristic,Theoretical computer science,Priority queue,Operator (computer programming),Action planning,Database,Mathematics
Conference
Volume
ISSN
Citations 
5243
0302-9743
8
PageRank 
References 
Authors
0.50
17
2
Name
Order
Citations
PageRank
Stefan Edelkamp11557125.46
Peter Kissmann218113.93