One would possibly encounter a variety of irritating difficulties when attempting to numerically clear up a tough nonlinear and nonconvex optimum management drawback. On this article I’ll think about such a tough drawback, that of discovering the shortest path between two factors by way of an impediment subject for a widely known mannequin of a wheeled robotic. I’ll study frequent points that come up when attempting to resolve such an issue numerically (specifically, nonsmoothness of the associated fee and chattering within the management) and tackle them. Examples assist to make clear the ideas. Get all of the code right here: https://github.com/willem-daniel-esterhuizen/car_OCP
1.1 Define
First, I’ll introduce the automobile mannequin that we’ll examine all through the article. Then, I’ll state the optimum management drawback in all its element. The subsequent part then exposes all of the numerical difficulties that come up, ending with a “wise nonlinear programme” that makes an attempt to cope with them. I’ll then current the small print of a homotopy technique, which helps in guiding the solver in direction of a great resolution. I’ll then present you some numerical experiments to make clear every part, and end off with references for additional studying.
2. A automobile mannequin
We’ll think about the next equations of movement,
[
begin{align}
dot x_1(t) &= u_1(t)cos(x_3(t)),
dot x_2(t) &= u_1(t)sin(x_3(t)),
dot x_3(t) &= u_2(t),
end{align}
]
the place (t geq 0) denotes time, (x_1inmathbb{R}) and (x_2inmathbb{R}) denote the automobile’s place, (x_3inmathbb{R}) denotes its orientation, (u_1inmathbb{R}) its velocity and (u_2inmathbb{R}) its price of turning. This can be a frequent mannequin of a differential-drive robotic, which consists of two wheels that may flip independently. This permits it to drive forwards and backwards, rotate when stationary and carry out different elaborate driving manoeuvres. Word that, as a result of (u_1) may be 0, the mannequin permits the automobile to cease instantaneously.
All through the article we’ll let (mathbf{x} := (x_1, x_2, x_3)^topinmathbb{R}^3) denote the state, (mathbf{u} := (u_1, u_2)inmathbb{R}^2) denote the management, and outline (f:mathbb{R}^3timesmathbb{R}^2 rightarrow mathbb{R}^3) to be,
[
f(mathbf{x},mathbf{u}) :=
left(
begin{array}{c}
u_1cos(x_3)
u_1sin(x_3)
u_2
end{array}
right),
]
in order that we are able to succinctly write the system as,
[
dot{mathbf{x}}(t) = f(mathbf{x}(t), mathbf{u}(t)),quad tgeq 0.
]
3. Optimum path planning drawback
Contemplating the automobile mannequin within the earlier part, we wish to discover the shortest path connecting an preliminary and goal place whereas avoiding a variety of obstacles. To that finish, we’ll think about the next optimum management drawback:
[
newcommand{u}{mathbf{u}}
newcommand{x}{mathbf{x}}
newcommand{PC}{mathrm{PC}}
newcommand{C}{mathrm{C}}
newcommand{mbbR}{mathbb{R}}
newcommand{dee}{mathrm{d}}
newcommand{NLP}{mathrm{NLP}}
mathrm{OCP}:
begin{cases}
minlimits_{x, u} quad & J(x, u)
mathrm{subject to:}quad & dot{x}(t) = f(x(t),u(t)), quad & mathrm{a.e.},, t in[0,T], &
quad & x(0) = x^{mathrm{ini}}, & &
quad & x(T) = x^{mathrm{tar}}, & &
quad & u(t) in mathbb{U}, quad & mathrm{a.e.},, t in[0,T], &
quad & (x_1(t) – c_1^i)^2 + (x_2(t) – c_2^i)^2 geq r_i^2, quad & forall tin[0,T],, forall iin mathbb{I}, &
quad & (x, u) in C_T^3timesPC_T^2,
finish{circumstances}
]
the place (Tgeq 0) is the finite time horizon, (J:C_T^3timesPC_T^2rightarrow mbbR_{geq 0}) is the associated fee useful, (x^{mathrm{ini}} inmbbR^3) is the preliminary state and (x^{mathrm{tar}}inmbbR^3) is the goal state. The management is constrained to (mathbb{U}:= [underline{u}_1, overline{u}_1]instances [underline{u}_2, overline{u}_2]), with (underline{u}_j < 0 <overline{u}_j), (j=1,2). Round obstacles are given by a centre, ((c_1^i, c_2^i)inmbbR^2), and a radius, (r_iinmbbR_{geq 0}), with (mathbb{I}) indicating the indices of all obstacles. For the associated fee useful we’ll think about the arc size of the curve connecting (x^{mathrm{ini}}) and (x^{mathrm{tar}}), that’s,
[
J(x,u) = int_0^Tleft(dot x_1^2(s) + dot x_2^2(s)right)^{frac{1}{2}}, dee s.
]
I’ve use the short-hand (PC_T^m) (respectively (C_T^m)) to indicate all piece-wise steady features (respectively steady features) mapping the interval ([0,T]) to (mbbR^m). The acronym “(mathrm{a.e.},, t in[0,T])” stands for “nearly each t in ([0,T])”, in different phrases, the spinoff might not exist at a finite variety of factors in ([0,T]), for instance, the place the management is discontinuous.
3.1 Some feedback on the OCP
The equations of movement and the presence of obstacles make the optimum management drawback nonlinear and nonconvex, which is tough to resolve typically. A solver might converge to regionally optimum options, which aren’t essentially globally optimum, or it could fail to discover a possible resolution despite the fact that one exists.
For simplicity the obstacles are circles. These are good as a result of they’re differentiable, so we are able to use a gradient-based algorithm to resolve the OCP. (We’ll use IPOPT, which implements an interior-point technique.) The arc size operate, (J), is not differentiable when the automobile’s velocity is zero. Nevertheless, as we’ll see, we are able to remove this drawback by including a small (varepsilon > 0) underneath the square-root.
Relying on the scheme used to discretise the equations of movement, there could also be chattering within the management sign. As we’ll see, this could simply be handled by penalising extreme management motion in the associated fee operate.
The horizon size thought-about in the issue, (T), is fastened. Thus, as the issue is posed, we truly wish to discover the curve of shortest arc size for which the automobile reaches the goal in precisely (T) seconds. That is truly not a problem for our automobile as a result of it may well cease instantaneously and rotate on the spot. So, the options to the OCP (if the solver can discover them) would possibly include lengthy boring chunks firstly and/or finish of the time interval if (T) could be very massive. If we needed to make the horizon size a call variable in the issue then we have now two choices.
First, if we use a direct technique to numerically clear up the issue (as we’ll do within the subsequent part) we may range the horizon size by making the discretisation step dimension (h), which seems within the numerical integration scheme, a call variable. It is because the dimension of the choice house should be set on the time at which you invoke the numerical nonlinear programme solver.
The second choice is to resort to an oblique technique (in a nutshell, it’s worthwhile to clear up a boundary-value drawback that you just get from an evaluation of the issue through Pontryagin’s precept, usually through the capturing technique). Nevertheless, for an issue like ours, the place you could have many state constraints, this may be fairly tough.
In case you are discovering this text fascinating, please think about trying out the weblog topicincontrol.com. It presents deep dives into management principle, optimization, and associated matters, usually with freely obtainable code.
4. Deriving a wise nonlinear programme
We’ll clear up the optimum management drawback utilizing direct single capturing. Extra exactly, we’ll take the management to be piecewise fixed over a uniform grid of time intervals and propagate the state trajectory from the preliminary situation utilizing the fourth-order Runge-Kutta (RK4) technique. We’ll then type a finite-dimensional nonlinear programme (NLP), the place the choice variables include the state and management at every discrete time step. This part reveals type a “wise” NLP, which offers with the assorted numerical difficulties.
4.1 The RK4 scheme
Contemplate the automobile’s differential equation, with preliminary situation, (x^{mathrm{ini}}), over an interval, ([0,T]),
[
dot{x}(t) = f(x(t), u(t)), quad tin[0,T], quad x(0) = x^{mathrm{ini}}.
]
Let (h>0) denote the fixed time step, and let (Ok := mathrm{ground}(T/h)). Then the RK4 scheme reads,
[
x[k+1] = x[k] + frac{h}{6}mathrm{RK}_4(x[k], u[k]), quad forall ,, ok in[0:K-1], quad x[0] = x(0),
]
the place (mathrm{RK}_4:mbbR^3times mbbR^2 rightarrow mbbR^3) reads,
[
mathrm{RK}_4(x, u) = k_1 + 2k_2 + 2k_3 + k_4,
]
and
[
k_1 = f(x, u),quad k_2 = f(x+ frac{h}{2}k_1, u), quad k_3 = f(x + frac{h}{2}k_2, u),quad k_4 = f(x + hk_3, u).
]
The notation (x[k]) and (u[k]) is supposed to indicate the discretised state and management, respectively, in order to tell apart them from their continuous-time counterparts.
4.2 Singularity of the associated fee useful
You could be tempted to think about the polygonal arc size as the associated fee within the NLP, specifically,
[
sum_{k=0}^{K-1}Vertx[k+1] – x[k]Vert = sum_{ok=0}^{Ok-1}left((x_{1}[k+1] – x_1[k])^2 + (x_2[k+1] – x_2[k])^2right)^{frac{1}{2}}.
]
Nevertheless, this operate is not differentiable if for some (kin{0,1,dots,Ok-1}),
[
Vertx[k+1] – x[k]Vert = 0,
]
which frequently results in the solver failing. You would possibly see the error EXIT: Invalid quantity in NLP operate or spinoff detected should you clear up an issue with this text’s code (which makes use of IPOPT, a gradient-based solver).
One resolution is to approximate the polygonal arc size with,
[
sum_{k=0}^{K-1}left((x_{1}[k+1] – x_1[k])^2 + (x_2[k+1] – x_2[k])^2 + varepsilonright)^{frac{1}{2}},
]
with (varepsilon > 0) a small quantity. We see that, for an arbitrary (kin{1,dots,Ok-1}) and (iin{1,2}),
[
begin{align*}
frac{partial}{partial x_i[k]} &left( sum_{m=0}^{Ok-1} left(x_1[m+1] – x_1[m])^2 + (x_2[m+1] – x_2[m])^2 + varepsilonright)^{frac{1}{2}} proper) [6pt]
&= frac{x_i[k] – x_i[k-1]}{left((x_1[k] – x_1[k-1])^2 + (x_2[k] – x_2[k-1])^2 + varepsilonright)^{frac{1}{2}}}
&quad + frac{x_i[k] – x_i[k+1]}{left((x_1[k+1] – x_1[k])^2 + (x_2[k+1] – x_2[k])^2 + varepsilon proper)^{frac{1}{2}}}
finish{align*}
]
and so this operate is repeatedly differentiable, guaranteeing easy gradients for IPOPT. (You get comparable expressions should you take a look at (frac{partial}{partial x_i[K]}) and (frac{partial}{partial x_i[0]})).
4.3 Management chattering
Management chattering is the fast leaping/oscillation/switching of the optimum management sign. There could also be elements of the answer that really chatter (this will likely happen when the optimum management is bang-bang, for instance) or a numerical solver might discover a resolution that chatters artificially. Delving into this deep subject is out of this text’s scope however, very briefly, you would possibly encounter this phenomenon in issues the place the optimum resolution displays so-called lively arcs. These are parts of the answer alongside which the state constraints are lively, which, in our setting, corresponds to the automobile travelling alongside the boundaries of the obstacles alongside its optimum path. When fixing issues exhibiting such arcs through a direct technique, as we’re doing, the numerical solver might approximate the true resolution alongside these arcs with fast oscillation.
Fortunately, a easy strategy to eliminate chattering is to only penalise management motion by including the time period:
[
deltasum_{k=0}^{K-1}Vert u[k] Vert^2
]
in the associated fee operate, for some small (delta). (This at the least works nicely for our drawback, even for very small (delta).)
4.4 Scaling for good numerical conditioning
A well-scaled nonlinear programme is one the place small modifications within the determination variable end in small modifications in the associated fee and the values of the constraint features (the so-called constraint residuals). We will test how nicely our drawback is scaled by wanting on the magnitude of the associated fee operate, at its gradient and Hessian, as nicely the Jacobian of the constraint operate at factors within the determination house (in particuar, on the preliminary heat begin and factors near the answer). If these portions are of comparable order then the solver can be strong, which means it is going to normally converge in comparatively few steps. A badly-scaled drawback might take extraordinarily lengthy to converge (as a result of it’d must take very small steps of the choice variable) or just fail.
Contemplating our drawback, it is smart to scale the associated fee by roughly the size we count on the ultimate path to be. A sensible choice is the size of the road connecting the preliminary and goal positions, name this (L). Furthermore, it then is smart to scale the constraints by (1/L^2) (as a result of we’re squaring portions right here).
4.5 The wise nonlinear programme
Taking the discussions of the earlier subsections under consideration, the wise NLP that we’ll think about within the numerics part reads,
[
NLP_{varepsilon, delta}:
begin{cases}
minlimits_{x, u} quad & J_{varepsilon,delta}(x, u)
mathrm{subject to:}
quad & x[k+1] = x[k] + frac{h}{6}mathrm{RK}_4(x[k], u[k]), & forall ok in[0:K-1], &
quad & x[0] = x^{mathrm{ini}}, &
quad & x[K] = x^{mathrm{tar}}, &
quad & u[k]in mathbb{U}, & forall ok in[0:K-1], &
quad & frac{1}{L^2}left( x_1[k] – c_1^i proper)^2 + frac{1}{L^2}left( x_2[k] – c_2^i proper)^2 geq frac{1}{L^2} r_i^2, quad & forall ok in[0:K], & forall iin mathbb{I},
quad & (x, u) in (mbbR^{3})^Ok instances (mbbR^{2})^{Ok-1}, &
finish{circumstances}
]
the place (J_{varepsilon,delta}: (mbbR^{3})^Ok instances (mbbR^{2})^{Ok-1} rightarrow mbbR_{>0}) is outlined to be,
[
J_{varepsilon,delta}(x, u) := frac{1}{L} left(sum_{k=0}^{K-1}left(Vert x[k+1] – x[k]Vert^2 + varepsilon proper)^{frac{1}{2}} + deltasum_{ok=0}^{Ok-1}Vert u[k] Vert^2 proper).
]
To help upcoming dialogue, outline the possible set, (Omega), to be the set of all pairs ((x,u)) that fulfill the constraints of (NLP_{varepsilon, delta}). A possible pair ((x^{(varepsilon,delta)}, u^{(varepsilon,delta)})) is alleged to be globally optimum supplied that,
[
J_{varepsilon,delta}(x^{(varepsilon,delta)}, u^{(varepsilon,delta)}) leq J_{varepsilon,delta}(x, u),quadforall(x, u) in Omega.
]
A possible pair ((x^{(varepsilon,delta)}, u^{(varepsilon,delta)})) is alleged to be regionally optimum supplied that there exists a sufficiently small (gamma >0) for which,
[
J_{varepsilon,delta}(x^{(varepsilon,delta)}, u^{(varepsilon,delta)}) leq J_{varepsilon,delta}(x, u),quadforall(x, u) in Omegacap mathbf{B}_{gamma}(x^{(varepsilon,delta)}, u^{(varepsilon,delta)}).
]
Right here (mathbf{B}_{gamma}(x^{(varepsilon,delta)}, u^{(varepsilon,delta)}) ) denotes a Euclidean ball of radius (gamma>0) centred in regards to the level ((x^{(varepsilon,delta)}, u^{(varepsilon,delta)}) ).
5. A homotopy technique
Recall that the issue is nonlinear and nonconvex. Thus, if we have been to only select a small (varepsilon>0) and (delta>0) and throw (NLP_{varepsilon, delta}) at a solver, then it may fail despite the fact that possible pairs would possibly exist, or it could discover “unhealthy” regionally optimum pairs. One method to cope with these points is to information the solver in direction of an answer by successively fixing simpler issues that converge to the tough drawback.
That is the concept behind utilizing a homotopy technique. We’ll information the solver in direction of an answer with a easy algorithm that successively offers the solver a great heat begin:
Homotopy algorithm
[
begin{aligned}
&textbf{Input:}text{ Initial parameters } varepsilon_{mathrm{ini}}>0, delta_{mathrm{ini}}>0. text{ Tolerances } mathrm{tol}_{varepsilon}>0, mathrm{tol}_{delta}>0.
&textbf{Output:} text{ Solution } (x^{(mathrm{tol}_{varepsilon}, mathrm{tol}_{delta})}, u^{(mathrm{tol}_{varepsilon}, mathrm{tol}_{delta})}) text{ (if it can find one)}
&quad text{Get initial warm start}, (x^{mathrm{warm}}, u^{mathrm{warm}}) text{ (not necessarily feasible)}
&quad i gets 0
&quad textbf{ While } varepsilon > mathrm{tol}_{varepsilon} text{ and } delta > mathrm{tol}_{delta}:
&quadquad varepsilongets max { varepsilon_{mathrm{ini}} / 2^i, mathrm{tol}_{varepsilon} }
&quadquad deltagets max { delta_{mathrm{ini}} / 2^i, mathrm{tol}_{delta} }
& quadquad text{ Solve } NLP_{varepsilon, delta} text{ with warm start } (x^{mathrm{warm}}, u^{mathrm{warm}})
& quadquad text{Label the solution } (x^{(varepsilon, delta)}, u^{(varepsilon, delta)}).
&quadquad (x^{mathrm{warm}}, u^{mathrm{warm}})gets (x^{(varepsilon, delta)}, u^{(varepsilon, delta)}).
&quadquad igets i + 1
&textbf{end while}
&textbf{return}, (x^{(mathrm{tol}_{varepsilon}, mathrm{tol}_{delta})}, u^{(mathrm{tol}_{varepsilon}, mathrm{tol}_{delta})})
end{aligned}
]
NOTE!: The homotopy algorithm is supposed to assist the solver discover a good resolution. Nevertheless, there may be no assure that it’ll efficiently discover even a possible resolution, nevermind a globally optimum one. For some principle concerning so-called globallly convergent homotopies you possibly can seek the advice of the papers, [1] and [2].
6. Numerical experiments
On this part we’ll think about (NLP_{varepsilon, delta}) with preliminary and goal states (x^{mathrm{ini}} = (2,0,frac{pi}{2})) and (x^{mathrm{tar}} = (-2,0,mathrm{free})), respectively (thus (L = 4)). We’ll take the horizon as (T=10) and maintain the discretisation step dimension within the RK4 scheme fixed at (h=0.1), thus (Ok=100). Because the management constraints we’ll take (mathbb{U} = [-1,1] instances [-1, 1]), and we’ll think about this fascinating impediment subject:
6.1 Checking conditioning
First, we’ll test the issue’s scaling on the heat begin. Stack the state and management into a protracted vector, (mathbf{d}inmbbR^{3K + 2(Ok-1)}), as follows:
[
mathbf{d} := (x_1[0],x_2[0],x_3[0],x_1[1],x_2[1],x_3[1],dots,u_1[0],u_2[0],u_1[1],u_2[1],dots,u_1[K-1],u_2[K-1]),
]
and write (NLP_{varepsilon, delta}) as:
[
newcommand{d}{mathbf{d}}
newcommand{dini}{mathbf{d}^{mathrm{ini}}}
begin{cases}
minlimits_{mathbf{d}} quad & J_{varepsilon,delta}(d)
mathrm{subject to:}
quad & g(d) leq mathbf{0},
end{cases}
]
the place (g) collects all of the constraints. As a heat begin, name this vector (dini), we’ll take the road connecting the preliminary and goal positions, with (u_1[k] equiv 0.1) and (u_2[k] equiv 0).
We must always take a look on the magnitudes of the next portions on the level (dini):
- The price operate, (J_{varepsilon,delta}(dini))
- Its gradient, (nabla J_{varepsilon,delta}(dini))
- Its Hessian, (mathbf{H}(J_{varepsilon,delta}(dini)))
- The constraint residual, (g(dini))
- Its Jacobian, (mathbf{J}(g(dini)))
We will do that with the code from the repo:
import numpy as np
from car_OCP import get_initial_warm_start, build_and_check_scaling
x_init = np.array([[2],[0],[np.pi/2]])
x_target = np.array([[-2],[0]])
T = 10 # Horizon size
h = 0.1 # RK4 time step
obstacles = [
{'centre': (0,0), 'radius': 0.5},
{'centre': (-0.5,-0.5), 'radius': 0.2},
{'centre': (1,0.5), 'radius': 0.3},
{'centre': (1,-0.35), 'radius': 0.3},
{'centre': (-1.5,-0.2), 'radius': 0.2},
{'centre': (1.5,-0.2), 'radius': 0.2},
{'centre': (-0.75,0), 'radius': 0.2},
{'centre': (-1.25,0.2), 'radius': 0.2}
]
constraints = {
'u1_min' : -1,
'u1_max' : 1,
'u2_min' : -1,
'u2_max' : 1,
}
warm_start = get_initial_warm_start(x_init, x_target, T, h)
build_and_check_scaling(x_init, x_target, obstacles, constraints, T, h, warm_start, eps=1e-4, delta=1e-4)=== SCALING DIAGNOSTICS ===
Goal J : 1.031e+00
||∇J||_2 : 3.430e-01
||Hess J||_Frob : 1.485e+02
||g||_2 : 7.367e+00
||Jac g||_Frob : 2.896e+01
============================
With small (varepsilon) and (delta), and with our chosen (dini), the target ought to clearly be near 1. The dimensions of its gradient and of the constraint residuals on the heat begin must be of comparable order. Within the print-out, (Vert nabla J Vert_2) denotes the Euclidean norm. The price operate’s Hessian may be of bigger order (this will increase with a finer time step). Within the print-out, (Vert nabla mathrm{Hess} J Vert_{mathrm{Frob}}) is the Frobenius norm of the Hessian matrix, which, intuitively talking, tells you “how huge” the linear transformation is “on common”, so it’s a great measure to think about. The Jacobian of (g) will also be of barely bigger order.
The print-out reveals that our drawback is well-scaled, nice. However one last item we’ll additionally do is inform IPOPT to scale the issue earlier than we clear up it, with "ipopt.nlp_scaling_method":
.... arrange drawback ....
opts = {"ipopt.print_level": 0,
"print_time": 0,
"ipopt.sb": "sure",
"ipopt.nlp_scaling_method": "gradient-based"}
opti.decrease(price)
opti.solver("ipopt", opts)6.2 Fixing WITHOUT homotopy
This subsection reveals the impact of the parameters (varepsilon) and (delta) on the answer, with out working the homotopy algorithm. In different phrases, we repair (varepsilon) and (delta), and clear up (NLP_{varepsilon, delta}) straight, with out even specifying a great preliminary guess. Right here is an instance of how you need to use the article’s repo to resolve an issue:
import numpy as np
from car_OCP import solve_OCP, get_arc_length, plot_solution_in_statespace_and_control
eps=1e-2
delta=1e-2
x_init = np.array([[2],[0],[np.pi/2]])
x_target = np.array([[-2],[0]])
T = 10 # Horizon size
h = 0.1 # RK4 time step
obstacles = [
{'centre': (0,0), 'radius': 0.5},
{'centre': (-0.5,-0.5), 'radius': 0.2},
{'centre': (1,0.5), 'radius': 0.3},
{'centre': (1,-0.35), 'radius': 0.3},
{'centre': (-1.5,-0.2), 'radius': 0.2},
{'centre': (1.5,-0.2), 'radius': 0.2},
{'centre': (-0.75,0), 'radius': 0.2},
{'centre': (-1.25,0.2), 'radius': 0.2}
]
constraints = {
'u1_min' : -1,
'u1_max' : 1,
'u2_min' : -1,
'u2_max' : 1,
}
x_opt, u_opt = solve_OCP(x_init, x_target, obstacles, constraints, T, h, warm_start=None, eps=eps, delta=delta)
plot_solution_in_statespace_and_control(x_opt, u_opt, obstacles, arc_length=np.spherical(get_arc_length(x_opt), 2), obstacles_only=False, eps=eps, delta=delta)Word how the solver would possibly discover regionally optimum options which might be clearly not so good, like within the case (varepsilon) = (delta) = 1e-4. That is one motivation for utilizing homotopy: you possibly can information the solver to a greater regionally optimum resolution. Word how (delta) impacts the chattering, with it being actually unhealthy when (delta=0). The solver simply fails when (varepsilon=0).
6.3 Fixing WITH homotopy
Let’s now clear up the issue with the homotopy algorithm. I.e., we iterate over (i) and feed the solver the earlier drawback’s resolution as a heat begin on every iteration. The preliminary guess we offer (at (i=0)) is similar one we used once we checked the conditioning, that’s, it’s simply the road connecting the preliminary and goal positions, with (u_1[k] equiv 0.1) and (u_2[k] equiv 0).
The figures beneath present the answer obtained at numerous steps of the iteration within the homotopy algorithm. The parameter (delta) is stored above 1e-4, so we don’t have chattering.
As one would count on, the arc size of the answer obtained through the homotopy algorithm monotonically decreases with growing (i). Right here, (delta)=1e-4 all through.
7. Conclusion
I’ve thought-about a tough optimum management drawback and gone by way of the steps one must comply with to resolve it intimately. I’ve proven how one can virtually cope with problems with nondifferentiability and management chattering, and the way a easy homotopy technique can result in options of higher high quality.
8. Additional studying
A basic guide on sensible points surrounding optimum management is [3]. Seek the advice of the papers [4] and [5] for well-cited surveys of numerical strategies in optimum management. The guide [6] is one other wonderful reference on numerical strategies.
References
[1] Watson, Layne T. 2001. “Concept of Globally Convergent Chance-One Homotopies for Nonlinear Programming.” SIAM Journal on Optimization 11 (3): 761–80. https://doi.org/10.1137/S105262349936121X.
[2] Esterhuizen, Willem, Kathrin Flaßkamp, Matthias Hoffmann, and Karl Worthmann. 2025. “Globally Convergent Homotopies for Discrete-Time Optimum Management.” SIAM Journal on Management and Optimization 63 (4): 2686–2711. https://doi.org/10.1137/23M1579224.
[3] Bryson, Arthur Earl, and Yu-Chi Ho. 1975. Utilized Optimum Management: Optimization, Estimation and Management. Taylor; Francis.
[4] Betts, John T. 1998. “Survey of Numerical Strategies for Trajectory Optimization.” Journal of Steering, Management, and Dynamics 21 (2): 193–207.
[5] Rao, Anil V. 2009. “A Survey of Numerical Strategies for Optimum Management.” Advances within the Astronautical Sciences 135 (1): 497–528.
[6] Gerdts, Matthias. 2023. Optimum Management of ODEs and DAEs. Walter de Gruyter GmbH & Co KG.
