A multivalued planning model

Abstract

In this work a model for planning with multivalued fluents and graded actions, based on the infinity-valued Lukasiewicz logic, is introduced. In multivalued planning, fluents and actions can assume truth values in [0, 1]. Multivalued fluents and graded actions allow to model many real situations where some features of the world cannot be modelled with boolean values and where actions can be executed with varying strength which produces graded effects as well. A correct/complete algorithm which solves bounded multivalued planning problems based on MIP compilation is also described and a prototype implementation is presented.