Improving Cost-Optimal Domain-Independent Symbolic Planning
Abstract
Symbolic search with BDDs has shown remarkable performance for cost-optimal deterministic planning by exploiting a succinct representation and exploration of state sets. In this paper we enhance BDD-based planning by applying a combination of domain-independent search techniques: the optimization of the variable ordering in the BDD by approximating the linear arrangement problem, pattern selection for improved construction of search heuristics in form of symbolic partial pattern databases, and a decision procedure for the amount of bidirection in the symbolic search process.
Cite
Text
Kissmann and Edelkamp. "Improving Cost-Optimal Domain-Independent Symbolic Planning." AAAI Conference on Artificial Intelligence, 2011. doi:10.1609/AAAI.V25I1.8009Markdown
[Kissmann and Edelkamp. "Improving Cost-Optimal Domain-Independent Symbolic Planning." AAAI Conference on Artificial Intelligence, 2011.](https://mlanthology.org/aaai/2011/kissmann2011aaai-improving/) doi:10.1609/AAAI.V25I1.8009BibTeX
@inproceedings{kissmann2011aaai-improving,
title = {{Improving Cost-Optimal Domain-Independent Symbolic Planning}},
author = {Kissmann, Peter and Edelkamp, Stefan},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2011},
pages = {992-997},
doi = {10.1609/AAAI.V25I1.8009},
url = {https://mlanthology.org/aaai/2011/kissmann2011aaai-improving/}
}