Multi-objective dynamic programming with limited precision

From MaRDI portal
Publication:2114599

DOI10.1007/S10898-021-01096-XzbMATH Open1486.90177arXiv2009.08198OpenAlexW3209838302MaRDI QIDQ2114599FDOQ2114599

Yanyan Li

Publication date: 15 March 2022

Published in: Journal of Global Optimization (Search for Journal in Brave)

Abstract: This paper addresses the problem of approximating the set of all solutions for Multi-objective Markov Decision Processes. We show that in the vast majority of interesting cases, the number of solutions is exponential or even infinite. In order to overcome this difficulty we propose to approximate the set of all solutions by means of a limited precision approach based on White's multi-objective value-iteration dynamic programming algorithm. We prove that the number of calculated solutions is tractable and show experimentally that the solutions obtained are a good approximation of the true Pareto front.


Full work available at URL: https://arxiv.org/abs/2009.08198




Recommendations




Cites Work


Cited In (3)





This page was built for publication: Multi-objective dynamic programming with limited precision

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114599)