Multi-objective dynamic programming with limited precision
From MaRDI portal
Publication:2114599
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.
Recommendations
- Solution procedures for multi-objective markov decision processes
- Markov Decision Processes with Multiple Objectives
- Publication:3486378
- A discrete dynamic programming approximation to the multiobjective deterministic finite horizon optimal control problem
- Approximating multi-objective scheduling problems
Cites work
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- A survey of multi-objective sequential decision-making
- Multi-Objective Decision Making
- Multi-Objective Model Checking of Markov Decision Processes
- Multi-objective infinite-horizon discounted Markov decision processes
- Multi-objective reinforcement learning using sets of Pareto dominating policies
- Note on Multiple Objective Dynamic Programming
- Preface on the special issue global optimization with multiple criteria: theory, methods and applications
- Quantitative multi-objective verification for probabilistic systems
- Reinforcement learning. An introduction
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)