Convergence of discretization procedures in dynamic programming

From MaRDI portal
Revision as of 05:06, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4071039

DOI10.1109/TAC.1975.1100984zbMath0311.90079MaRDI QIDQ4071039

Dimitri P. Bertsekas

Publication date: 1975

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)




Related Items (34)

A convex optimization approach to dynamic programming in continuous state and action spacesAttention allocation for decision making queuesComputable approximations for continuous-time Markov decision processes on Borel spaces based on empirical measuresOn hedging in finite security marketsNonasymptotic Analysis of Monte Carlo Tree SearchOn the construction of \(\epsilon\)-optimal strategies in partially observed MDPsAn application-oriented approach to dual control with excitation for closed-loop identificationModel predictive control of cash balance in a cash concentration and disbursements systemApproximations for optimal stopping of a piecewise-deterministic processSome basic concepts of numerical treatment of Markov decision modelsFrom Infinite to Finite Programs: Explicit Error Bounds with Applications to Approximate Dynamic ProgrammingDiscretization procedures for adaptive Markov control processesProbabilistic reachability and control synthesis for stochastic switched systems using the tamed Euler methodNear optimality of quantized policies in stochastic control under weak continuity conditionsOptimal aquaculture planning while accounting for the size spectrumContinuity of cost in Borkar control topology and implications on discrete space and time approximations for controlled diffusions under several criteriaCertified reinforcement learning with logic guidanceApproximation of Markov decision processes with general state spaceShortest path stochastic control for hybrid electric vehiclesERROR ANALYSIS OF AN APPROXIMATE OPTIMAL POLICY FOR AN INVENTORY SYSTEM WITH STOCHASTIC AND CONTINUOUS DEMANDSOn Finite Approximations to Markov Decision Processes with Recursive and Nonlinear DiscountingUnnamed ItemUnnamed ItemA constructive geometrical approach to the uniqueness of Markov stationary equilibrium in stochastic games of intergenerational altruismDynamic Bayesian networks for formal verification of structured stochastic processesEfficient sampling in approximate dynamic programming algorithmsLipschitz continuous dynamic programming with discountThe complexity of dynamic programmingConcepts and methods for discrete and continuous time control under uncertaintyExplicit solutions for multivariate, discrete-time control problems under uncertaintyDifferential equations in control synthesis problems. I: Ordinary systemsZur konstruktfon ∊-optimaler polltiken in markovschen entscheidungsmodellen mit überabzämbarem zustandsraumApproximations and bounds for a generalized optimal stopping problemA stability result for linear Markovian stochastic optimization problems






This page was built for publication: Convergence of discretization procedures in dynamic programming