By Topic

A fast algorithm for stochastic model predictive control with probabilistic constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Minyong Shin ; Dept. of Aeronaut. & Astronaut., Stanford Univ., Stanford, CA, USA ; Primbs, J.A.

A fast suboptimal algorithm for finite horizon stochastic linear-quadratic control under probabilistic constraints is presented. This type of control problem is solved repeatedly in stochastic model predictive control. Under the assumption of affine state feedback, the control problem is converted to an equivalent deterministic problem using the mean and covariance matrix as the state. An interior point method is proposed to solve this optimization problem, where the step direction can be quickly computed via a Riccati difference equation. On a two state, two constraint numerical example in this paper, the algorithm is over 200 times faster than a convex formulation that uses a general purpose solver when the time horizon is 25.

Published in:

American Control Conference (ACC), 2010

Date of Conference:

June 30 2010-July 2 2010