Optimal Symbolic Planning with Action Costs and Preferences
Abstract
This paper studies the solving of finite-domain action planning problems with discrete action costs and soft constraints. For sequential optimal planning, a symbolic perimeter database heuristic is addressed in a bucket implementation of A*. For computing net-benefits, we propose symbolic branch-and-bound search together with some search refinements. The net-benefit we optimize is the total benefit of satisfying the goals, minus the total action cost to achieve them. This results in an objective function to be minimized that is a linear expression over the violation of the preferences added to the action cost total. Stefan Edelkamp, Peter Kissmann
Cite
Text
Edelkamp and Kissmann. "Optimal Symbolic Planning with Action Costs and Preferences." International Joint Conference on Artificial Intelligence, 2009.Markdown
[Edelkamp and Kissmann. "Optimal Symbolic Planning with Action Costs and Preferences." International Joint Conference on Artificial Intelligence, 2009.](https://mlanthology.org/ijcai/2009/edelkamp2009ijcai-optimal/)BibTeX
@inproceedings{edelkamp2009ijcai-optimal,
title = {{Optimal Symbolic Planning with Action Costs and Preferences}},
author = {Edelkamp, Stefan and Kissmann, Peter},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2009},
pages = {1690-1695},
url = {https://mlanthology.org/ijcai/2009/edelkamp2009ijcai-optimal/}
}