scispace - formally typeset
Proceedings ArticleDOI

Sample average approximations in optimal control of uncertain systems

Reads0
Chats0
TLDR
An optimality function is provided for both the uncertain optimal control problem and its approximation, and it is shown that the approximation based on the sample average approach is consistent in the sense of Polak.
Abstract
This paper focuses on an optimal control problem in which the objective is to minimize the expectation of a cost functional with stochastic parameters. The inclusion of the stochastic parameters in the objective raises new theoretical and computational challenges not present in a standard nonlinear optimal control problem. In this paper, we provide a numerical framework for the solution of this uncertain optimal control problem by taking a sample average approximation approach. An independent random sample is taken from the parameter space, and the expectation is approximated by the sample average. The result is a family of standard nonlinear optimal control problems which can be solved using existing techniques. We provide an optimality function for both the uncertain optimal control problem and its approximation, and show that the approximation based on the sample average approach is consistent in the sense of Polak. We illustrate the approach with a numerical example arising in optimal search for a moving target.

read more

Citations
More filters
Journal ArticleDOI

I and i

Kevin Barraclough
- 08 Dec 2001 - 
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Journal ArticleDOI

A Multi-Stage Stochastic Programming-Based Offloading Policy for Fog Enabled IoT-eHealth

TL;DR: The proposed Multi-Stage Stochastic Programming (MSSP) examines joint decisions of offloading, resource allocation, and migration, advancing the understanding of the interactions among these decisions, and designs an efficient sub-optimal offloading policy based on Sample Average Approximation, called SAA-MSSP.
Journal ArticleDOI

Optimal Control of Uncertain Systems Using Sample Average Approximations

TL;DR: This paper presents a computational framework for the numerical solution of the uncertain optimal control problem, wherein an independently drawn random sample is taken from the space of uncertain parameters, and the expectation in the objective functional is approximated by a sample average.
Journal ArticleDOI

Riemann–Stieltjes Optimal Control Problems for Uncertain Dynamic Systems

TL;DR: In this paper, the authors define a nonclassical optimal control problem where the cost functional is given by a Riemann-Stieltjes "functional of a functional" and generate a minimum principle from the limit of a semidiscretization.
Journal ArticleDOI

Consistent approximation of a nonlinear optimal control problem with uncertain parameters

TL;DR: This paper proposes a framework based on the approximation of the integral in the parameter space for the considered uncertain optimal control problem and proves that accumulation points of a sequence of optimal solutions to the approximate problem are optimal solutions of the original problem.
References
More filters
Journal ArticleDOI

I and i

Kevin Barraclough
- 08 Dec 2001 - 
TL;DR: There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.
Journal ArticleDOI

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

TL;DR: An SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems is discussed.
Book

Lectures on Stochastic Programming: Modeling and Theory

TL;DR: The authors dedicate this book to Julia, Benjamin, Daniel, Natan and Yael; to Tsonka, Konstatin and Marek; and to the Memory of Feliks, Maria, and Dentcho.
Book

Infinite Dimensional Analysis: A Hitchhiker's Guide

TL;DR: In this paper, Riesz spaces are used to represent the topology of the space of sequences of sequences and correspondences of correspondences in Markov transitions, where the correspondences correspond to Markov transition.
Journal ArticleDOI

SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization

TL;DR: An SQP algorithm that uses a smooth augmented Lagrangian merit function and makes explicit provision for infeasibility in the original problem and the QP subproblems is discussed and a reduced-Hessian semidefinite QP solver (SQOPT) is discussed.
Related Papers (5)