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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on automatic control Jg. 70; H. 6; S. 4031 - 4036
1. Verfasser:	Chang, Hyeong Soo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.06.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!