Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. A stochastic minimum principle and an adaptive pathwise algorithm for stochastic optimal control

A stochastic minimum principle and an adaptive pathwise algorithm for stochastic optimal control

Thumbnail Image
Download
Name

Webster_A stochastic minimum.pdf

Size

584.92 KB

Format

Adobe PDF

Checksum (MD5)

6e438a4ad04f6e6dee67509ab5e562fb

Author(s)
Parpas, Panos
•
Webster, Mort
Date Issued
April 2013
Journal
Automatica
Publisher
Elsevier
Citation
Parpas, Panos, and Mort Webster. “A Stochastic Minimum Principle and an Adaptive Pathwise Algorithm for Stochastic Optimal Control.” Automatica 49, no. 6 (June 2013): 1663–1671.
Version
Author's final manuscript
Abstract
We present a numerical method for finite-horizon stochastic optimal control models. We derive a stochastic minimum principle (SMP) and then develop a numerical method based on the direct solution of the SMP. The method combines Monte Carlo pathwise simulation and non-parametric interpolation methods. We present results from a standard linear quadratic control model, and a realistic case study that captures the stochastic dynamics of intermittent power generation in the context of optimal economic dispatch models.
MIT Department
Massachusetts Institute of Technology. Engineering Systems Division
Terms of Use
Creative Commons Attribution-Noncommercial-NoDerivatives
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/99483
DOI of Published Version
https://doi.org/10.1016/j.automatica.2013.02.053
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.