Ross–Fahroo lemma

Named after I. Michael Ross and F. Fahroo, the Ross–Fahroo lemma is a fundamental result in optimal control theory.[1][2][3][4]

It states that dualization and discretization are, in general, non-commutative operations. The operations can be made commutative by an application of the covector mapping principle.[5]

Description of the theory

A continuous-time optimal control problem is information rich. A number of interesting properties of a given problem can be derived by applying the Pontryagin's minimum principle or the Hamilton–Jacobi–Bellman equations. These theories implicitly use the continuity of time in their derivation.[6] When an optimal control problem is discretized, the Ross–Fahroo lemma asserts that there is a fundamental loss of information. This loss of information can be in the primal variables as in the value of the control at one or both of the boundary points or in the dual variables as in the value of the Hamiltonian over the time horizon.[7][8] To address the information loss, Ross and Fahroo introduced the concept of closure conditions which allow the known information loss to be put back in. This is done by an application of the covector mapping principle.[5]

Applications to pseudospectral optimal control

When pseudospectral methods are applied to discretize optimal control problems, the implications of the Ross–Fahroo lemma appear in the form of the discrete covectors seemingly being discretized by the transpose of the differentiation matrix.[1][2][3]

When the covector mapping principle is applied, it reveals the proper transformation for the adjoints. Application of the transformation generates the Ross–Fahroo pseudospectral methods.[9][10]

gollark: What? Why?
gollark: It's run ENTIRELY by esodiscord members!
gollark: We have three servers!
gollark: #█ ←→ also <#348702212110680064>.
gollark: Can we bridge APIONET to <#348702212110680064> here? Pleeeeease?

See also

References
  1. I. M. Ross and F. Fahroo, A Pseudospectral Transformation of the Covectors of Optimal Control Systems, Proceedings of the First IFAC Symposium on System Structure and Control, Prague, Czech Republic, 29–31 August 2001.
  2. Ross, I. M.; Fahroo, F. (2003). "Legendre Pseudospectral Approximations of Optimal Control Problems". Lecture Notes in Control and Information Sciences. 295.
  3. I. M. Ross and F. Fahroo, Discrete Verification of Necessary Conditions for Switched Nonlinear Optimal Control Systems, Proceedings of the American Control Conference, Invited Paper, June 2004, Boston, MA.
  4. N. Bedrossian, M. Karpenko, and S. Bhatt, "Overclock My Satellite: Sophisticated Algorithms Boost Satellite Performance on the Cheap", IEEE Spectrum, November 2012.
  5. Ross, I. M.; Karpenko, M. (2012). "A Review of Pseudospectral Optimal Control: From Theory to Flight". Annual Reviews in Control. 36 (2): 182–197. doi:10.1016/j.arcontrol.2012.09.002.
  6. B. S. Mordukhovich, Variational Analysis and Generalized Differentiation: Basic Theory, Vol.330 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences] Series, Springer, Berlin, 2005.
  7. F. Fahroo and I. M. Ross, Pseudospectral Methods for Infinite Horizon Nonlinear Optimal Control Problems, AIAA Guidance, Navigation and Control Conference, August 15–18, 2005, San Francisco, CA.
  8. Fahroo, F.; Ross, I. M. (2008). "Pseudospectral Methods for Infinite-Horizon Optimal Control Problems". Journal of Guidance, Control and Dynamics. 31 (4): 927–936. doi:10.2514/1.33117.
  9. A. M. Hawkins, Constrained Trajectory Optimization of a Soft Lunar Landing From a Parking Orbit, S.M. Thesis, Dept. of Aeronautics and Astronautics, Massachusetts Institute of Technology, 2005.
  10. J. R. Rea, A Legendre Pseudospectral Method for Rapid Optimization of Launch Vehicle Trajectories, S.M. Thesis, Dept. of Aeronautics and Astronautics, Massachusetts Institute of Technology, 2001.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.