Approximate Constrained Discounted Dynamic Programming With Uniform Feasibility and Optimality

An important question about finite constrained Markov decision process (CMDP) problem is if there exists a condition under which a uniformly optimal and uniformly feasible policy exists in the set of deterministic, history-independent, and stationary policies that achieves the optimal value at all i...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on automatic control Vol. 70; no. 6; pp. 4031 - 4036
Main Author:	Chang, Hyeong Soo
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Approximation algorithms Constraints Costs Dynamic programming Dynamic programming (DP) Feasibility Markov decision process Markov processes optimality equation Optimization Probability distribution Programming Reviews Scheduling Scheduling algorithms Throughput Trajectory uniform-optimality
ISSN:	0018-9286, 1558-2523
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!