Math 2.0

Calculus of variations and optimal control; optimization Definition

Trajectory optimization

Builds on Control systemOptimal controlPontryagin's maximum principle

Definition

Let U⊆ℝmU \subseteq \R^m be nonempty, and let f ⁣:ℝn×U×ℝ→ℝnf \colon \R^n \times U \times \R \to \R^n, L ⁣:ℝn×U×ℝ→ℝL \colon \R^n \times U \times \R \to \R, ϕ ⁣:ℝ×ℝn×ℝ×ℝn→ℝ\phi \colon \R \times \R^n \times \R \times \R^n \to \R be continuous. Let c ⁣:ℝn×U×ℝ→ℝqc \colon \R^n \times U \times \R \to \R^q give path constraints and b ⁣:ℝ×ℝn×ℝ×ℝn→ℝrb \colon \R \times \R^n \times \R \times \R^n \to \R^r give boundary conditions. A trajectory optimization problem asks for times t0<tft_0 < t_f, a measurable control u ⁣:[t0,tf]→Uu \colon [t_0, t_f] \to U and an absolutely continuous state x ⁣:[t0,tf]→ℝnx \colon [t_0, t_f] \to \R^n that minimise ϕ(t0,x(t0),tf,x(tf))+∫t0tfL(x(t),u(t),t) dt\phi(t_0, x(t_0), t_f, x(t_f)) + \int_{t_0}^{t_f} L(x(t), u(t), t) \, dt subject to:

  1. the control system x′(t)=f(x(t),u(t),t)x'(t) = f(x(t), u(t), t) for almost every tt;
  2. the path constraints c(x(t),u(t),t)≤0c(x(t), u(t), t) \le 0 componentwise for almost every tt;
  3. the boundary conditions b(t0,x(t0),tf,x(tf))=0b(t_0, x(t_0), t_f, x(t_f)) = 0.

Trajectory optimization is the numerical solution of such problems, which yields an open-loop control and its trajectory.

Remarks

The problem is an optimal control problem in Bolza form with constraints; the word stresses the computation of one optimal trajectory. Indirect methods solve the conditions of Pontryagin's maximum principle; direct methods discretise xx and uu and solve a finite-dimensional nonlinear program.

Example: n=2n = 2, x=(x1,x2)x = (x_1, x_2), f=(x2,u)f = (x_2, u), U=ℝU = \R, L=u2L = u^2, ϕ=0\phi = 0, no path constraints, t0=0t_0 = 0, tf=1t_f = 1, and boundary conditions x(0)=(0,0)x(0) = (0, 0), x(1)=(1,0)x(1) = (1, 0). The control u(t)=6−12tu(t) = 6 - 12t gives x2(t)=6t−6t2x_2(t) = 6t - 6t^2 and x1(t)=3t2−2t3x_1(t) = 3t^2 - 2t^3, which meet the boundary conditions, with cost ∫01(6−12t)2 dt=12\int_0^1 (6 - 12t)^2 \, dt = 12. The maximum principle forces the optimal uu to be affine in tt, and this is the only affine control that meets the boundary conditions, so it is the solution.

Non-example: finding a feedback law u=κ(x)u = \kappa(x) that is good for all initial states is a synthesis problem, not a trajectory optimization problem in this sense.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Absolute continuity concept
  2. Control system concept
  3. Optimal control concept
  4. Pontryagin's maximum principle statement
  5. Trajectory optimization definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Trajectory_optimization
About this page
TagNAD3RQNJ7V
URIm2://NAD3RQNJ7V
Kinddefinition
WritingW0 stub
MSC49M37, 49M05, 49J15
DefinesTrajectory optimization
UsesControl system, Optimal control, Pontryagin's maximum principle

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.