A Multivalued planning model for soft preconditions and preferences
نویسندگان
چکیده
In this work a model for planning with multivalued fluents and graded actions, that allows preferences specifications and plan metric, is introduced. This model is based on the infinity-valued Łukasiewicz logic. In multivalued planning, fluents can assume truth values in the interval [0, 1] and actions can be executed at different application degrees also varying in [0, 1]. The notions of planning problem and solution plan also reflect a multivalued approach. Multivalued fluents and graded actions allow to model many real situations where some features of the world are fuzzy and where actions can be executed with varying strength. Moreover, the specification of soft preconditions allows a more flexible model for the solution plan while the use of soft preferences increases the expressive power of the plan quality specification. A correct/complete algorithm which solves bounded multivalued planning problems based on MIP compilation is also described and a prototype implementation is presented.
منابع مشابه
A Multivalued Logic Model of Planning
In this work a model for planning with multivalued fluents and graded actions, based on the infinite valued Lukasiewicz logic, is introduced. In multivalued planning, fluents can assume truth values in the interval [0, 1] and actions can be executed at different application degrees also varying in [0, 1]. The notions of planning problem and solution plan also reflect a multivalued approach. Mul...
متن کاملSoft Goals Can Be Compiled Away
Soft goals extend the classical model of planning with a simple model of preferences. The best plans are then not the ones with least cost but the ones with maximum utility, where the utility of a plan is the sum of the utilities of the soft goals achieved minus the plan cost. Finding plans with high utility appears to involve two linked problems: choosing a subset of soft goals to achieve and ...
متن کاملPlanning with Always Preferences by Compilation into STRIPS with Action Costs
We address planning with always preferences in propositional domains, proposing a new compilation schema for translating a STRIPS problem enriched with always preferences (and possibly also soft goals) into a STRIPS problem with action costs. Our method allows many STRIPS planners to effectively address planning with always preferences and soft goals. An experimental analysis indicates that suc...
متن کاملComplexity Results in Epistemic Planning
Epistemic planning is a very expressive framework that extends automated planning by the incorporation of dynamic epistemic logic (DEL). We provide complexity results on the plan existence problem for multi-agent planning tasks, focusing on purely epistemic actions with propositional preconditions. We show that moving from epistemic preconditions to propositional preconditions makes it decidabl...
متن کاملSearch Strategies for Partial-Order Causal-Link Planning with Preferences
This paper studies how to solve classical planning problems with preferences by means of a partial-order causal-link (POCL) planning algorithm. Preferences are given by soft goals – optional goals which increase a plan’s benefit if satisfied at the end of a plan. Thus, we aim at finding a plan with the best net-benefit, which is the difference of the achieved preferences’ benefit minus the cost...
متن کامل