Optimal
Geometric
Control Theory and Pontryagin's Maximum Principle (PMP)
Per [1], let be a closed manifold (say, the configuration
space
[c-space] of a robot or a machine [see, for instance, this webpage or this webage]), be the tangent bundle of ,
the double tangent bundle of , a
Lagrangian on , the inertial Riemannian
metric on induced by , the
Lagrangian vector field corrsponding to , be a Raleigh dissipative term, an
external force, a control distribution that is a
sub-vector bundle of
, a parameterization of
(where , so that is the
equation of motion (EoM),
a cost quadratic on , a
cost quadratic on , and
a cost quadratic on . Let in
be given, and consider an inital
cost
function , a running cost function , a final cost
function
, and a (total) cost funtion , where with
, with
,
and
with (the co-state
variable, encoding the dynamics of the system as a Lagrange
multipliers problem of sorts) are to be determined,
and
typically either (the final time)
or (the final point of ) are
specified.
Then we call a nonlinear quadratic
regulator
(NQR) problem. It is typically desired to find a deterministic function
with "automatically"
producing
the minimum of (for a then uniquely-determined ). We
call
given by the Hamiltonian
of the NQR problem.
Per [4], the NQR problem is solved in a coordinate patch by solving the
following set of simultaneous equations:
Recall that we have as the EoM.
Per [3], this may be rewitten , where
is the Cristoffel
symbol of the Riemannian metric. The EoM then becomes
. Write . The Hamiltonian then becomes and the equations to be solved then become
The type of solution to the above system of equations may be
checked by applying Sylvester's criterion for The Second Derivative
Test
to the symmetric matrix , which states that a symmetric matrix is (a) positive
definite if
and only if the determinants of all the leading diagonal submatrices
are positive,
meaning all the eigenvalues are positive and the solution is a local
minimum, (b) negative definite if and
only if the determinant of the first leading "diagonal submatrix"
(entry) is negative, then
the determinants of the remaining leading diagonal submatrices strictly
alternate in sign, meaning all the eigenvalues are negative and the
solution is a local maximum, (c)
indefinite if any other pattern for the determinants of the leading
diagonal submatrices holds but the determinant of the overall matrix is
non-zero, meaning some eigenvalues are positive and some are negative
but none are 0, and the solution is a saddle point, or (d) the
determinant of the overall matrix is zero, meaning at least one
eigenvalue is 0 and The Second
Derivative Test fails for this solution.
Per [2], if we call with points given by , then by Pontryagin's Maximum Principle (PMP), for
any optimal
(cost minimizing) solution to the NQR
problem,
the variations of in
form an
upwards-pointing cone at each point. Hence, for any
optimal solution, there is a
"path" of hyperplanes (contact structure) along
orthogonal to
the symmetry
line of the cone and passing through the cone point, and hence a 1-form
along on , called the Hamiltonian
evolution
of the NQR problem, with . If for all (so that
does not lie in any of the hyperplanes ), we call
normal; otherwise,
we call abnormal.
Bibliography:
[1] Agrachev, A. A. & Sachkov, Y. L. (2004). Control Theory
from the Geometric Viewpoint. Springer. https://doi.org/10.1007/978-3-662-06404-7
[2] Jóźwikowski, M. & Respondek, W. A contact covariant approach to
optimal control with applications to sub-Riemannian geometry. Math.
Control Signals Syst. 28, 27 (2016) https://doi.org/10.1007/s00498-016-0176-3
[3]
Lynch, K. M., & Park, F. C. (2017). Modern Robotics: Mechanics,
Planning, and Control. Cambridge: Cambridge University Press.https://doi.org/10.1017/9781316661239
[4] Vrabie, D.L., Vamvoudakis, K.G., & Lewis, F.L. (2012).
Optimal Adaptive Control and
Differential Games by Reinforcement
Learning Principles. https://doi.org/10.1049/PBCE081