Pontryagin's Maximum Principle
Author: Tianjiang Shuo
Website: https://cislunarspace.cn
Definition
Pontryagin's Maximum Principle (PMP; Pontryagin et al. 1962) gives a set of necessary conditions that any optimal control must satisfy. It supersedes the classical calculus of variations by admitting control sets with inequality constraints (e.g. bounded thrust). Given the dynamics and an augmented cost, PMP introduces a costate and an Hamiltonian , and states that the optimal control pointwise maximizes (Russian convention) or minimizes (engineering convention, used in fuel/time problems) over the admissible control set (Pontryagin et al. 1962; Bryson & Ho 1975; Betts 2010). The two conventions are related by a sign flip of and ; they yield the same trajectory.
The full first-order necessary conditions
For the Bolza problem with terminal constraints :
- State equation .
- Costate (adjoint) equation .
- Optimality (stationarity) — minimize pointwise over . For interior controls with no bounds: ; for bounded controls the optimum lies on the boundary of .
- Transversality .
- Parameter condition — if is free, ; for time-independent data this reduces to , and if is autonomous then .
These five items together form the first-order necessary conditions; solving them is an indirect method, which yields a TPBVP in .
Switching function and bang-bang structure
When the control enters linearly — typical for thrust magnitude — the Hamiltonian is minimized by an extreme value of . Define a scalar switching function multiplying in ; then when and when , producing the bang-bang / bang-off-bang structure (Lawden 1963; Conway 2010, Ch.1–2). Singular arcs arise when on a finite interval — then is determined by higher-order conditions.
For the thrust direction, the optimum is , defining the primer vector used to evaluate and improve impulsive transfers (Lawden 1963; Primer Vector).
Variational foundation
PMP is the modern form of the calculus of variations (CoV). For smooth, unconstrained problems the classical Euler–Lagrange equation
is recovered as the stationarity condition of the action ; the Legendre transform yields the Hamiltonian form . PMP extends CoV to cases with bounded control, inequality constraints, and non-smooth dynamics — the Euler–Lagrange equations are the special case when is unconstrained.
A discrete Euler–Lagrange formulation underlies DMOC (Discrete Mechanics and Optimal Control): replacing the action by a discrete sum and enforcing the discrete Lagrange–d'Alembert principle yields discrete necessary conditions that preserve the symplectic structure of the continuous problem.
Application notes
- PMP gives necessary, not sufficient, conditions. Sufficiency requires convexity or additional second-order tests (Legendre–Clebsch, conjugate point).
- For the Lagrangian linear in (e.g. fuel-optimal), the smooth stationarity condition degenerates and PMP's boundary-of- rule is what determines the control.
- The autonomous Hamiltonian is constant along the optimal trajectory — a useful check on the numerical accuracy of TPBVP solutions.
Related concepts
- Costate Variables and Adjoint Equations
- Hamiltonian
- Two-Point Boundary-Value Problem (TPBVP)
- Primer Vector
- Bang-Bang Control
- Conjugate Point & Second-Order Optimality
References
- Pontryagin, L. S., et al. (1962). The Mathematical Theory of Optimal Processes.
- Bryson, A. E., & Ho, Y.-C. (1975). Applied Optimal Control.
- Lawden, D. F. (1963). Optimal Trajectories for Space Navigation.
- Betts, J. T. (2010). Practical Methods for Optimal Control and Estimation Using Nonlinear Programming.
- Conway, B. A. (Ed.) (2010). Spacecraft Trajectory Optimization, Ch. 1–2.
- Marsden, J. E., & West, M. (2001). Discrete mechanics and variational integrators. Acta Numerica, 10, 357–514.
