Preference planning for Markov decision processes

7Citations
Citations of this article
22Readers
Mendeley users who have this article in their library.

Abstract

The classical planning problem can be enriched with quantitative and qualitative user-defined preferences on how the system behaves on achieving the goal. In this paper, we propose the probabilistic preference planning problem for Markov decision processes, where the preferences are based on an enriched probabilistic LTL-style logic. We develop P4Solver, an SMT-based planner computing the preferred plan by reducing the problem to quadratic programming problem, which can be solved using SMT solvers such as Z3. We illustrate the framework by applying our approach on two selected case studies.

Cite

CITATION STYLE

APA

Li, M., She, Z., Turrini, A., & Zhang, L. (2015). Preference planning for Markov decision processes. In Proceedings of the National Conference on Artificial Intelligence (Vol. 5, pp. 3313–3319). AI Access Foundation. https://doi.org/10.1609/aaai.v29i1.9654

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free