Dynamic programming subject to total variation distance ambiguity
From MaRDI portal
Publication:5502181
Abstract: The aim of this paper is to address optimality of stochastic control strategies via dynamic programming subject to total variation distance ambiguity on the conditional distribution of the controlled process. We formulate the stochastic control problem using minimax theory, in which the control minimizes the pay-off while the conditional distribution, from the total variation distance set, maximizes it. First, we investigate the maximization of a linear functional on the space of probability measures on abstract spaces, among those probability measures which are within a total variation distance from a nominal probability measure, and then we give the maximizing probability measure in closed form. Second, we utilize the solution of the maximization to solve minimax stochastic control with deterministic control strategies, under a Markovian and a non-Markovian assumption, on the conditional distributions of the controlled process. The results of this part include: 1) Minimax optimization subject to total variation distance ambiguity constraint; 2) new dynamic programming recursions, which involve the oscillator seminorm of the value function, in addition to the standard terms; 3) new infinite horizon discounted dynamic programming equation, the associated contractive property, and a new policy iteration algorithm. Finally, we provide illustrative examples for both the finite and infinite horizon cases. For the infinite horizon case we invoke the new policy iteration algorithm to compute the optimal strategies.
Recommendations
- Infinite Horizon Average Cost Dynamic Programming Subject to Total Variation Distance Ambiguity
- Optimal control of uncertain stochastic systems subject to total variation distance uncertainty
- Robust Dynamic Programming
- Minimax control for discrete-time time-varying stochastic systems
- scientific article; zbMATH DE number 5780386
Cites work
- scientific article; zbMATH DE number 4160608 (Why is no real title available?)
- scientific article; zbMATH DE number 193291 (Why is no real title available?)
- scientific article; zbMATH DE number 722978 (Why is no real title available?)
- scientific article; zbMATH DE number 837313 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- A Finite-Dimensional Risk-Sensitive Control Problem
- A risk-sensitive maximum principle: the case of imperfect state observation
- Connections between stochastic control and dynamic games
- Dynamic programming and optimal control. Vol. 1.
- Extremum Problems With Total Variation Distance and Their Applications
- Finite horizon minimax optimal control of stochastic partially observed time varying uncertain systems
- Minimax optimal control of stochastic uncertain systems with relative entropy constraints
- Minimum principle for partially observable nonlinear risk-sensitive control problems using measure-valued decompositions
- On the optimal control of stochastic systems with an exponential-of- integral performance index
- Optimal control of uncertain stochastic systems subject to total variation distance uncertainty
- Risk-sensitive control and dynamic games for partially observed discrete-time nonlinear systems
- Stochastic Uncertain Systems Subject to Relative Entropy Constraints: Induced Norms and Monotonicity Properties of Minimax Games
- Stochastic optimal control. The discrete time case
- \(H^ \infty\)-optimal control and related minimax design problems. A dynamic game approach.
Cited in
(6)- Infinite Horizon Average Cost Dynamic Programming Subject to Total Variation Distance Ambiguity
- Optimal control of uncertain stochastic systems subject to total variation distance uncertainty
- Distributional Robustness in Minimax Linear Quadratic Control with Wasserstein Distance
- Robustness to incorrect system models in stochastic control
- Robustness to Incorrect Priors in Partially Observed Stochastic Control
- Robust Markov Decision Processes with Data-Driven, Distance-Based Ambiguity Sets
This page was built for publication: Dynamic programming subject to total variation distance ambiguity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5502181)
