6.231 Dynamic Programming and Stochastic Control, Fall 2008

Bertsekas, Dimitri

Author(s)

Bertsekas, Dimitri

Download6-231-fall-2008/contents/index.htm (28.29Kb)

Alternative title

Dynamic Programming and Stochastic Control

Terms of use

Usage Restrictions: This site (c) Massachusetts Institute of Technology 2012. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.

Metadata

Show full item record

Abstract

This course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). We will consider optimal control of a dynamical system over both a finite and an infinite number of stages (finite and infinite horizon). We will also discuss some approximation methods for problems involving large state spaces. Applications of dynamic programming in a variety of fields will be covered in recitations.

Date issued

2008-12

URI

http://hdl.handle.net/1721.1/75813

Other identifiers

6.231-Fall2008

local: 6.231

local: IMSCP-MD5-5c25e9035021832542e5f35f56b312cc

Keywords

dynamic programming, stochastic control, decision making, uncertainty, sequential decision making, finite horizon, infinite horizon, approximation methods, state space, large state space, optimal control, dynamical system, dynamic programming and optimal control, deterministic systems, shortest path, state information, rollout, stochastic shortest path, approximate dynamic programming

Collections

Electrical Engineering and Computer Science (6) -