MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Chance Constrained Finite Horizon Optimal Control

Author(s)
Ono, Masahiro; Williams, Brian Charles; Blackmore, Lars
Thumbnail
DownloadWilliams-2010-Chance Constrained Finite Horizon Optimal Control.pdf (528.5Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
This paper considers finite-horizon optimal control for dynamic systems subject to additive Gaussian-distributed stochastic disturbance and a chance constraint on the system state defined on a non-convex feasible space. The chance constraint requires that the probability of constraint violation is below a user-specified risk bound. A great deal of recent work has studied joint chance constraints, which are defined on the a conjunction of linear state constraints. These constraints can handle convex feasible regions, but do not extend readily to problems with non-convex state spaces, such as path planning with obstacles. In this paper we extend our prior work on chance constrained control in non-convex feasible regions to develop a new algorithm that solves the chance constrained control problem with very little conservatism compared to prior approaches. In order to address the non-convex chance constrained optimization problem, we present two innovative ideas in this paper. First, we develop a new bounding method to obtain a set of decomposed chance constraints that is a sufficient condition of the original chance constraint. The decomposition of the chance constraint enables its efficient evaluation, as well as the application of the branch and bound method. However, the slow computation of the branch and bound algorithm prevents practical applications. This issue is addressed by our second innovation called Fixed Risk Relaxation (FRR), which efficiently gives a tight lower bound to the convex chance-constrained optimization problem. Our empirical results show that the FRR typically makes branch and bound algorithm 10-20 times faster. In addition we show that the new algorithm is significantly less conservative than the existing approach.
Date issued
2010-07
URI
http://hdl.handle.net/1721.1/67480
Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Journal
American Control Conference, 2010. ACC '10.
Publisher
American Automatic Control Council
Citation
Ono, M., L. Blackmore, and B.C. Williams. “Chance constrained finite horizon optimal control with nonconvex constraints.” Proceedings of the American Control Conference (ACC), Marriott Waterfront, Baltimore, MD, USA June 30-July 02, 2010. 1145-1152.© 2010 American Automatic Control Council.
Version: Final published version
ISBN
978-1-4244-7426-4
ISSN
0743-1619

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.