Improving Cost-Optimal Domain-Independent Symbolic Planning

Authors

  • Peter Kissmann University of Bremen
  • Stefan Edelkamp University of Bremen

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.

Downloads

Published

2011-08-04

How to Cite

Kissmann, P., & Edelkamp, S. (2011). Improving Cost-Optimal Domain-Independent Symbolic Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 992-997. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/8009

Issue

Section

Reasoning about Plans, Processes and Actions