Distributed Dynamic Programming

Research output: Contribution to journalArticlepeer-review

103 Scopus citations

Abstract

— We consider distributed algorithms for solving dynamic programming problems whereby several processors participate simultaneously in the computation while maintaining coordination by information exchange via communication links. A model of asynchronous distributed computation is developed which requires very weak assumptions on the ordering of computations, the timing of information exchange, the amount of local information needed at each computation node. and the initial conditions for the algorithm. The class of problems considered is very broad and includes shortest path problems, and finite and infinite horizon stochastic optimal control problems. When specialized to a shortest path problem the algorithm reduces to the algorithm originally implemented for routing of messages in the ARPANET.

Original languageEnglish (US)
Pages (from-to)610-616
Number of pages7
JournalIEEE Transactions on Automatic Control
Volume27
Issue number3
DOIs
StatePublished - Jun 1982

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Distributed Dynamic Programming'. Together they form a unique fingerprint.

Cite this