Linear Hamilton Jacobi Bellman Equations in high dimensions
Abstract
The Hamilton Jacobi Bellman Equation (HJB) provides the globally optimal solution to large classes of control problems. Unfortunately, this generality comes at a price, the calculation of such solutions is typically intractible for systems with more than moderate state space size due to the curse of dimensionality. This work combines recent results in the structure of the HJB, and its reduction to a linear Partial Differential Equation (PDE), with methods based on low rank tensor representations, known as a separated representations, to address the curse of dimensionality. The result is an algorithm to solve optimal control problems which scales linearly with the number of states in a system, and is applicable to systems that are nonlinear with stochastic forcing in finite-horizon, average cost, and first-exit settings. The method is demonstrated on inverted pendulum, VTOL aircraft, and quadcopter models, with system dimension two, six, and twelve respectively.
Additional Information
© 2014 IEEE. Anil Damle is supported by NSF Fellowship DGE-1147470.Attached Files
Accepted Version - 1404.1089.pdf
Files
Name | Size | Download all |
---|---|---|
md5:49335d72617a6098b380f7b1e7c7b9f3
|
851.6 kB | Preview Download |
Additional details
- Eprint ID
- 94637
- Resolver ID
- CaltechAUTHORS:20190410-120647917
- NSF Graduate Research Fellowship
- DGE-1147470
- Created
-
2019-04-10Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field