Over-Subscription Planning with Numeric Goals
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence. Pages 1207-1212.
Abstract
By relaxing the hard-goal constraints from classical planning and associating them with reward values, over-subscription planning allows users to concentrate on presenting what they want and leaves the task of deciding the best goals to achieve to the planner. In this paper, we extend the over-subscription planning problem and its limited goal specification to allow numeric goals with continuous utility values and goals with mixed hard and soft constraints. Together they considerably extend the modeling power of goal specification and allow the user to express goal constraints that were not possible before. To handle these new goal constraints, we extend the Sapaps planner’s planning graph based techniques to help it choose the best beneficial subset of goals that can include both hard or soft logical and numeric goals. We also provide empirical results in several benchmark domains to demonstrate that our technique helps return quality plans.
@inproceedings{ijcai2005p171,
title = {Over-Subscription Planning with Numeric Goals},
author = {Benton, J. and Do, Minh Binh and Kambhampati, Subbarao},
booktitle = {Proceedings of the Nineteenth International Joint Conference on
Artificial Intelligence, {IJCAI-05}},
publisher = {International Joint Conferences on Artificial Intelligence},
pages = {1207--1212},
year = {2005},
url = {https://ijcai.org/proceedings/2005/171},
}
TY - CPAPER TI - Over-Subscription Planning with Numeric Goals AU - Benton, J. AU - Do, Minh Binh AU - Kambhampati, Subbarao T2 - Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 PB - International Joint Conferences on Artificial Intelligence PY - 2005 SP - 1207 EP - 1212 UR - https://ijcai.org/proceedings/2005/171 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: