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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Artificial Intelligence and Soft Computing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
