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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on automatic control Ročník 70; číslo 6; s. 4031 - 4036
Hlavný autor:	Chang, Hyeong Soo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.06.2025 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!