Distributed dynamic programming

DOI10.1109/TAC.1982.1102980zbMath0493.49030OpenAlexW2119380668MaRDI QIDQ3955990

Dimitri P. Bertsekas

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1109/tac.1982.1102980

zbMATH Keywords

decentralizationshortest path problemdistributed computational algorithmsscheduling of computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39) Optimal stochastic control (93E20) Decomposition methods (49M27) Existence of optimal solutions to problems involving randomness (49J55)

Related Items (21)

Approximate policy iteration: a survey and some new methods ⋮ A bisection/successive approximation method for computing Gittins indices ⋮ Parallel asynchronous label-correcting methods for shortest paths ⋮ Asynchronous gradient algorithms for a class of convex separable network flow problems ⋮ Q-learning and policy iteration algorithms for stochastic shortest path problems ⋮ Model-based average reward reinforcement learning ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ On the stability of asynchronous iterative processes ⋮ Independent learning in stochastic games ⋮ Robust topological policy iteration for infinite horizon bounded Markov decision processes ⋮ A new class of asynchronous iterative algorithms with order intervals ⋮ Computationally efficient algorithms for on-line optimization of Markov decision processes ⋮ Extended duality for nonlinear programming ⋮ A tutorial survey of reinforcement learning ⋮ Parallel decomposition of multistage stochastic programming problems ⋮ Distributed supply chain management using ant colony optimization ⋮ Quicker Convergence for Iterative Numerical Solutions to Stochastic Problems: Probabilistic Interpretations, Ordering Heuristics, and Parallel Processing ⋮ Robust shortest path planning and semicontractive dynamic programming ⋮ Distributed asynchronous computation of fixed points ⋮ Some aspects of parallel and distributed iterative algorithms - a survey ⋮ Robust event-driven interactions in cooperative multi-agent learning

This page was built for publication: Distributed dynamic programming