Exercises
Verification of a computed optimal trajectory
Suppose a direct-collocation solver returns the discrete solution
for
subject to
(a) Define a dynamic-defect residual on each mesh interval.
(b) Define the maximum endpoint-constraint residual.
(c) Define the maximum path-constraint violation.
(d) Explain how to re-simulate the reconstructed control using an independent differential-equation solver.
(e) Define a mesh-refinement table containing the objective, terminal residual, maximum defect, and maximum path violation.
(f) State what convergence behavior would support the claim that the numerical result is credible.
(g) Explain why a solver-success message alone is not evidence that the engineering conclusion is correct.
Complete derivation of the bilinear tangent steering law
Consider
with
where is fixed. The terminal values and are free, and the objective is
(a) Convert the problem to minimization form.
(b) Construct the Hamiltonian.
(c) Derive and integrate all four costate equations.
(d) Derive the interior stationarity condition
(e) Apply terminal transversality to show that
(f) Show that the general bilinear tangent law reduces to
(g) Explain why the correct branch of must still be checked against the minimum principle.
Analytical state reconstruction for fixed-time ascent
Let
(a) Show that
(b) Starting from
derive
(c) Starting from
derive
(d) Use to show that the nontrivial solution satisfies
(e) Derive
(f) Show that
(g) Explain the symmetry of the steering law about .
Altitude equation and terminal horizontal velocity
For the fixed-time ascent problem, the analytical vertical position is
(a) Substitute
and derive the scalar altitude equation
(b) Explain why the original trajectory-optimization problem has now been reduced to one scalar nonlinear equation.
(c) Derive the expression for the terminal horizontal velocity .
(d) Describe a numerical procedure for solving for .
(e) State the endpoint and minimum-principle checks that must be performed after a root is obtained.
Necessary conditions for fuel-optimal lunar landing
Consider
with
and free . Minimize
Use the chapter’s normal Hamiltonian convention
(a) Derive the costate equations and their general solutions.
(b) Define the switching function
(c) Derive the bang–bang control law.
(d) Prove that a nondegenerate singular arc cannot exist.
(e) Show that the optimal control has at most one switching time.
(f) Derive the free-final-time condition
Piecewise analytical lunar-landing trajectory
For the lunar-landing model, first derive the state solution on an interval when the initial values at are and .
(a) For , derive and .
(b) For , derive and .
(c) Assume a coast-then-burn structure,
Derive and .
(d) Enforce continuity and derive the two algebraic equations produced by
(e) Express the fuel cost in terms of and .
(f) Repeat the formulation for a burn-then-coast structure.
(g) State how the admissible structures should be compared and verified.
Direct and indirect verification of lunar landing
Formulate a numerical verification study for the lunar-landing problem.
(a) Write a direct-shooting formulation using and as decision variables for a coast-then-burn control.
(b) Write a direct-collocation formulation with state variables and , control , and free final time.
(c) State the boundary and control constraints.
(d) Define the terminal residuals.
(e) Define the Hamiltonian residual at the final time.
(f) Explain how to compare the shooting and collocation solutions.
(g) Explain why a smooth numerical approximation of the switch does not by itself disprove the bang–bang analytical structure.
Total specific energy and constant-energy contours
Consider the longitudinal aircraft equations
Define
(a) Differentiate with respect to time.
(b) Show explicitly that the gravitational terms cancel.
(c) Derive
(d) Under the small-angle approximation, derive
(e) For constant , derive
(f) Derive
(g) Derive the altitude loss required to accelerate from to at constant energy.
Energy-state minimum-time optimality conditions
Consider the reduced model
with
(a) Rewrite the final time as
(b) Explain directly from this integral why minimum time requires maximum specific excess power at each energy level.
(c) Construct the reduced Hamiltonian
(d) Derive the stationarity condition
(e) Derive the costate equation and show that cannot change sign along a normal extremal.
(f) Use the free-final-time condition to show that for a feasible climb with .
(g) Show that the speed schedule satisfies
(h) State the second-derivative condition required for a local maximum of specific excess power.
Full-model refinement of the energy-state solution
Let the full aircraft state and control be
The objective is to minimize .
(a) Write the full longitudinal dynamics used in the chapter.
(b) Write the minimum-time Hamiltonian for an indirect formulation.
(c) State the interior stationarity equations with respect to and .
(d) Write the normalized-time dynamics on .
(e) List the flight-envelope constraints discussed in the chapter.
(f) Explain how an energy-state speed schedule can be converted into an initial guess for the full problem.
(g) Define verification checks for terminal feasibility, path feasibility, mesh convergence, Hamiltonian consistency, and independent re-simulation.
(h) Explain why agreement in qualitative dive–climb structure is useful but does not prove quantitative accuracy of the reduced model.