Distributed dynamic programming
From MaRDI portal
Publication:3955990
DOI10.1109/TAC.1982.1102980zbMath0493.49030MaRDI QIDQ3955990
Publication date: 1982
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
decentralization; shortest path problem; distributed computational algorithms; scheduling of computation
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
49L20: Dynamic programming in optimal control and differential games
90C39: Dynamic programming
93E20: Optimal stochastic control
49M27: Decomposition methods
49J55: Existence of optimal solutions to problems involving randomness
Related Items
A new class of asynchronous iterative algorithms with order intervals, Model-based average reward reinforcement learning, Computationally efficient algorithms for on-line optimization of Markov decision processes, Parallel decomposition of multistage stochastic programming problems, Parallel asynchronous label-correcting methods for shortest paths, Asynchronous gradient algorithms for a class of convex separable network flow problems, A bisection/successive approximation method for computing Gittins indices