Loading AI tools
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]
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]
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]
Wikiwand in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.
