Optimal Symbolic Planning with Action Costs and Preferences
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 1690-1694.
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
@inproceedings{ijcai2009p282,
title = {Optimal Symbolic Planning with Action Costs and Preferences},
author = {Edelkamp, Stefan and Kissmann, Peter},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {1690--1694},
year = {2009},
url = {https://ijcai.org/proceedings/2009/282},
}
TY - CPAPER TI - Optimal Symbolic Planning with Action Costs and Preferences AU - Edelkamp, Stefan AU - Kissmann, Peter T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 1690 EP - 1694 UR - https://ijcai.org/proceedings/2009/282 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
