# A Simple Exact Penalty Function Method for Optimal Control Problem with Continuous Inequality Constraints

Authors: Xiangyu Gao; Xian Zhang; Yantao Wang
Journal: Abstract and Applied Analysis
 (2014)

---

## Abstract

We consider an optimal control problem subject to the terminal state equality constraint and continuous inequality constraints on the control and the state. By using the control parametrization method used in conjunction with a time scaling transform, the constrained optimal control problem is approximated by an optimal parameter selection problem with the terminal state equality constraint and continuous inequality constraints on the control and the state. On this basis, a simple exact penalty function method is used to transform the constrained optimal parameter selection problem into a sequence of approximate unconstrained optimal control problems. It is shown that, if the penalty parameter is sufficiently large, the locally optimal solutions of these approximate unconstrained optimal control problems converge to the solution of the original optimal control problem. Finally, numerical simulations on two examples demonstrate the effectiveness of the proposed method.


---

## Body

## 1. Introduction

Constrained optimal control problems often arise in a wide range of practical applications, including the swing minimization of transferring container [1], the flight maximization with a heating constraint [2], the fuel minimization of the soft landing of moon [3], and the fuel minimization of spacecraft rendezvous with collision avoidance constraint [4]. In these different applications, two types of constraints are often considered. The first one is terminal state equality constraint, which depends only on the final state of the system, whereas the other one is continuous inequality constraints on the control and the state, which restrict control and state at every point in the time horizon. Of these two types, continuous inequality constraints are by far the most difficult, as they include an infinite number of inequality constraints.Most constrained optimal control problems are much too complex to obtain analytical solutions. Thus, they can only be solved by some numerical methods, such as the discretization method [5–7], the nonsmooth Newton method [8–10], and the control parametrization method [11]. Among these numerical methods, the control parametrization method is an efficient one for dealing with constrained optimal problems. Its main idea is that only the control variables are approximated as piecewise constant functions or linear functions while the system states remain unchanged. In [11], this kind of method used in conjunction with a time scaling transform is used to solve optimal control problems subject to continuous state inequality constraints, where the continuous state inequality constraints are handled by the constraint transcription method developed in [12]. It is extended in [13] to a more general case where both the state and control appear explicitly in the continuous inequality constraints. After the application of the control parameterization used in conjunction with the time scaling transform, a constrained optimal parameter selection problem is obtained. Now by using the constraint transcription method, the constrained optimal parameter selection problem can be approximated as a sequence of unconstrained optimal control problems, where two adjustable parameters are involved in these approximate problems—one controls the accuracy and the other one controls the feasibility. It is shown that, for any positive accuracy parameter, if the feasible parameter is sufficiently small, the obtained solution will satisfy the continuous inequality constraints. As the accuracy parameter approaches to zero, the global optimal solution of the approximate optimal control problem will converge to the global optimal solution of the original problem. However, since there are two parameters that need be adjusted, the convergence speed of the method may be slow. In addition, the approximate optimal control problem is usually nonconvex, and only a local optimal solution can be obtained, and it is not known if this local optimal solution will converge to a local optimal solution of the original problem.In this paper, we develop a new computational approach based on the control parametrization method [13] and the exact penalty function method [14] for solving an optimal control problem subject to terminal state equality constraint and continuous inequality constraints on the state and the control. After the control parametrization, together with the time scaling transform, the constrained optimal control problem is approximated by an optimal parameter selection problem with the terminal state equality constraint and continuous inequality constraints on the control and state. A simple exact penalty function method is used to construct the constraint violation function from the terminal state equality constraint and continuous inequality constraints on the control and state, which is added to the object function to form a new one. Thus, the constrained optimal parameter selection problem is transformed into a sequence of unconstrained optimal control problems, where only one penalty parameter is involved in the approximation. It is shown that, if the penalty parameter value is sufficiently large, any local minimizer of the unconstrained optimal control problem is a local minimizer of the constrained optimal control problem. Two numerical examples are provided to illustrate the effectiveness of the proposed method.The rest of the paper is organized as follows. In Section2, based on the nonlinear dynamic model, a constrained optimal control problem is formulated. In Section 3, by using the control parametrization method used in conjunction with a time scaling transform, the constrained optimal control problem is approximated by a constrained optimal parameter selection problem. In Section 4, a simple penalty function method is applied to transform the constrained optimal parameter selection problem into a sequence of unconstrained optimal control problems. In Section 5, it is shown that if the penalty parameter is sufficiently large, the solutions of these approximate unconstrained optimal control problems locally converge to the solution of the original problem. A numerical algorithm is developed to obtain the solution of the original problem through solving a sequence of unconstrained optimal control problems. In Section 6, A pair of numerical simulations are provided to demonstrate the effectiveness of the proposed method. Finally, in Section 7, some concluding remarks are stated.


## 2. Problem Formulation

Consider the following nonlinear dynamical system:(1a)
d
x
(
t
)
d
t
=
f
(
t
,
x
(
t
)
,
u
(
t
)
)
,
t
∈
[
0
,
T
]
with the initial condition
(1b)
x
(
0
)
=
x
0
and the terminal condition
(1c)
x
(
T
)
=
x
f
,respectively, where T is the terminal time, u
(
t
)
∈
ℝ
r and x
(
t
)
∈
ℝ
n are, respectively, control and state vectors at time t, x
0
∈
ℝ
n is the given initial state, and x
f
∈
ℝ
n is the given terminal state. f
(
x
,
u
,
t
)
:
[
0
,
T
]
×
ℝ
n
×
ℝ
r
→
ℝ
n is a continuously differentiable function with respect to all its arguments, and there exists a constant K
∈
ℝ
+ such that
(2)
∥
f
(
t
,
x
,
u
)
∥
≤
K
(
1
+
∥
x
∥
)
,
(
t
,
x
,
u
)
∈
[
0
,
T
]
×
ℝ
n
×
ℝ
r
,
where ℝ
+
=
{
ω
∈
ℝ
:
ω
≥
0
} and ∥
·
∥ is the Euclidean norm.Define(3)
U
=
{
v
=
[
v
1
,
…
,
v
r
]
T
∈
ℝ
r
:
α
i
≤
v
i
≤
β
i
,
i
=
1
,
…
,
r
}
,
where α
i
,
i
=
1
,
…
,
r and β
i
,
i
=
1
,
…
,
r are given real numbers. A piecewise-continuous function u
:
[
0
,
T
]
→
ℝ satisfying u
(
t
)
∈
U for almost all t
∈
[
0
,
T
] is called an admissible control. Let 𝒰 be the class of all such admissible controls, and for each control u
∈
𝒰, the system (1a)-(1b) has a unique solution x
(
·
∣
u
).Consider the following continuous inequality constraints on the control and the state:(4)
g
i
(
t
,
x
(
t
∣
u
)
,
u
(
t
)
)
≤
0
,
i
=
1
,
…
,
N
,
where g
i
(
t
,
x
,
u
)
,
i
=
1
,
…
,
N is continuously differentiable with respect to all its arguments.Now, the optimal control problem considered in this paper is stated formally as follows.Problem (
P
). Given the dynamical system (1a)-(1b), find a control u
∈
𝒰 such that the object function
(5)
J
(
u
)
=
Φ
0
(
x
(
T
)
)
+
∫
0
T
ℒ
0
(
t
,
x
(
t
)
,
u
(
t
)
)
d
t
is minimized subject to the terminal state equality constraint (1c) and the continuous inequality constraints on the state and control (4), where Φ
0
(
x
) is continuously differentiable with respect to x and ℒ
0
(
t
,
x
,
u
) is continuously differentiable with respect to all its arguments.


## 3. Problem Approximation

Let the interval[
0
,
T
] be partitioned into p subintervals [
τ
i
-
1
,
τ
i
)
,
i
=
1,2
,
…
,
p, with a sequence τ
=
{
τ
0
,
τ
1
,
…
,
τ
p
} of time points τ
i
,
i
=
1,2
,
…
,
p
-
1, satisfying τ
i
-
1
<
τ
i
,
i
=
1
,
…
,
p, where τ
0
=
0, τ
p
=
T. χ
[
τ
i
-
1
,
τ
i
]
(
t
) is denoted as the indictor function in [
τ
i
-
1
,
τ
i
) defined by
(6)
χ
[
τ
i
-
1
,
τ
i
)
(
t
)
=
{
1
,
t
∈
[
τ
i
-
1
,
τ
i
)
0
,
t
∉
[
τ
i
-
1
,
τ
i
)
.
The admissible control u
(
t
) is approximated by a piecewise-constant function given below:
(7)
u
p
(
t
∣
σ
)
=
∑
i
=
1
p
σ
i
χ
[
τ
i
-
1
,
τ
i
)
(
t
)
,
where σ
i
=
[
σ
1
i
,
σ
2
i
,
…
,
σ
r
i
]
T
∈
U
,
i
=
1,2
,
…
,
p, are control parameters, and let ∑ denote the set of all such σ
=
[
(
σ
1
)
T
,
(
σ
2
)
T
,
…
,
(
σ
p
)
T
]
T
∈
ℝ
p
r.In order to further improve the accuracy of the approximate optimal control problem, the switching points are also taken as decision variables. We will employ the time scaling transform originally proposed in [11] to map these switching points, τ
k
,
k
=
1
,
…
,
p, into preassigned fixed points, k
/
p
,
k
=
1
,
…
,
p
-
1, in a new time horizon [
0,1
]. This is easily achieved through the following differential equation:(8a)
d
t
(
s
)
d
s
=
v
(
s
)
,
s
∈
[
0,1
]
with initial condition
(8b)
t
(
0
)
=
0
,where
(9)
v
(
s
)
=
∑
i
=
1
p
δ
i
χ
ℐ
i
(
s
)
.
Here, δ
i
≥
0
,
i
=
1,2
,
…
,
p, are the control parameters; let Ξ be the the set containing all such δ
=
[
δ
1
,
δ
2
,
…
,
δ
p
]
T, and ℐ
i is defined by
(10)
ℐ
i
=
{
[
i
-
1
p
,
i
p
)
,
i
=
1,2
,
…
,
p
-
1
[
i
-
1
p
,
1
]
,
i
=
p
.
Taking integration of (8a) and (8b) with initial condition (8b), it is easy to deduce that, for s
∈
ℐ
i,
(11)
t
(
s
)
=
δ
i
p
(
p
s
+
1
-
i
)
+
∑
j
=
1
i
-
1
‍
δ
j
p
.
Clearly, for i
=
1,2
,
…
,
p
-
1,
(12)
τ
i
=
∑
j
=
1
i
‍
δ
j
p
,
(13)
t
(
1
)
=
∑
j
=
1
p
δ
j
p
=
T
.
In the new time horizon [
0,1
], the approximate control given by (7) becomes
(14)
u
^
p
(
s
∣
σ
)
=
∑
i
=
1
p
σ
i
χ
ℐ
i
(
s
)
,
where 1
/
p
,
2
/
p
,
…
,
(
p
-
1
)
/
p are the fixed switching points.Let(15)
x
^
(
s
)
=
[
x
T
(
t
(
s
)
)
,
t
(
s
)
]
T
.
According to (14), the dynamic systems (1a), (1b), (1c), and (8a) can be rewritten as(16a)
d
x
^
(
s
)
d
s
=
f
^
(
s
,
x
^
(
s
)
,
σ
,
δ
)
with the initial condition
(16b)
x
^
(
0
)
=
[
x
0
T
,
0
]
T
and the terminal condition
(16c)
x
^
(
1
)
=
[
x
f
T
,
T
]
T
,where
(17)
f
^
(
s
,
x
^
(
s
)
,
σ
,
δ
)
=
v
(
s
)
[
f
(
t
(
s
)
,
x
(
t
(
s
)
)
,
u
^
p
(
s
∣
σ
)
)
1
]
.
Let x
^
(
·
∣
σ
,
δ
) denote the solution of (16a)-(16b) corresponding to (
σ
,
δ
)
∈
Σ
×
Ξ. The inequality constraints on the state and control (4) and the objective function (5) become
(18)
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
≤
0
,
∀
s
∈
[
0,1
]
,
i
=
1
,
…
,
N
,
(19)
J
^
(
σ
,
δ
)
=
Φ
^
0
(
x
(
1
∣
σ
,
δ
)
)
+
∫
0
1
ℒ
^
0
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
d
s
,
respectively, where
(20)
Φ
^
0
(
x
^
(
1
∣
σ
,
δ
)
)
=
Φ
0
(
x
^
(
1
)
)
,
ℒ
^
0
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
=
v
(
s
)
ℒ
0
(
t
(
s
)
,
x
^
(
s
)
,
u
^
p
(
s
∣
σ
)
)
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
=
g
i
(
t
(
s
)
,
x
^
(
s
)
,
u
^
p
(
s
∣
σ
)
)
,
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
i
=
1
,
…
,
N
.After the control parametrization and a time scaling transformation, the approximate parameter selection problem corresponding to Problem (P) may be stated formally as follows.Problem (
P
^
). Given system (16a)-(16b), find a control parameter (
σ
,
δ
)
∈
Σ
×
Ξ such that the objective function (19) is minimized subject to (16c) and (18).Problem (P
^) is an optimal parameter selection problem in which a finite number of decision variables (the control parameters) need to be optimized subject to a set of constraints. It is very difficult to solve this optimal parameter selection problem because each continuous inequality constraint in (18) actually constitutes an infinite number of constraints one for each point in [
0,1
]. In the next section, we will use an exact penalty method to deal with this approximate problem (P
^).


## 4. A Simple Exact Penalty Function Method

Define the following constraint violation function onΣ
×
Ξ:
(21)
Δ
(
σ
,
δ
)
=
∥
x
^
(
1
∣
σ
,
δ
)
-
x
^
(
1
)
∥
2
+
∑
i
=
1
N
‍
∫
0
1
[
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
]
2
d
s
.
It is clear that Δ
(
σ
,
δ
)
=
0 if and only if (16c) and (18) are both satisfied. Let ε
^
>
0 be a given constant. By applying the exact function method introduced in [2] to (19) and (21), we construct a simple exact penalty function as follows:
(22)
J
^
η
(
σ
,
δ
,
ε
)
=
{
J
^
(
σ
,
δ
)
,
if
ε
=
0
,
Δ
(
σ
,
δ
)
=
0
,
J
^
(
σ
,
δ
)
+
ε
-
α
Δ
(
σ
,
δ
)
+
η
ε
β
,
if
ε
∈
(
0
,
ε
^
]
,
+
∞
,
if
ε
=
0
,
Δ
(
σ
,
δ
)
≠
0
,
where ε
>
0, β
>
α
>
0, β
≥
1, and η
>
0 is a penalty parameter.From the definition ofJ
^
η
(
σ
,
δ
,
ε
), it follows that it involves three different cases, only the second case ε
∈
(
0
,
ε
^
] is useful in practical computation. In the second case, it contains the sum of three terms: the first term penalizes system cost, the second term penalizes constraint violations, and the third term penalizes large values of ε. As the penalty parameter η is increasing, minimizing J
^
η
(
σ
,
δ
,
ε
) forces ε
β to be small, which in turn causes ε
-
α to become large. Consequently, constraint violation functions Δ
(
σ
,
δ
) will approach to zero. In this way, the satisfaction of the equality constraints (16c) and the continuous inequality constraints (18) will eventually be achieved. Thus, problem (P
^) is equivalent to the following problem, which is denoted as problem (P
^
η); we can solve it for an increasing sequence of penalty parameters.Problem (
P
^
η
). Given system (16a)-(16b), find parameter (
σ
,
δ
,
ε
)
∈
Σ
×
Ξ
×
(
0
,
ε
^
] such that the new objective function
(23)
J
^
η
(
σ
,
δ
,
ε
)
=
J
^
(
σ
,
δ
)
+
ε
-
α
Δ
(
σ
,
δ
)
+
η
ε
β
is minimized.Problem (P
^
η) is much easier to solve than problem (P
^). Numerical algorithms for solving such a problem need to use the gradient of the new objective function (23) to find the optimal solution. In the following, we will rewrite (23) in the canonical form as in [15] to obtain its gradient formulas.Let(24)
Φ
^
(
x
p
(
1
∣
σ
,
δ
)
,
ε
)
=
Φ
^
0
(
x
^
(
1
∣
σ
,
δ
)
)
+
ε
-
α
∥
x
^
(
1
∣
σ
,
δ
)
-
x
^
(
1
)
∥
2
+
η
ε
β
,
ℒ
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
)
=
ℒ
^
0
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
+
ε
-
α
∑
i
=
1
N
∫
0
1
[
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
]
2
d
s
.
From (22), it follows that
(25)
J
^
η
(
σ
,
δ
,
ε
)
=
Φ
^
(
x
^
(
1
∣
σ
,
δ
)
,
ε
)
+
∫
0
1
‍
ℒ
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
)
d
s
.
Now, the objective function of problem (P
^
η) is in canonical form. Based on the proof of Theorem 5.2
.
1 in [15], the gradient formulas of the objective functions (22) are given in the following theorem.Theorem 1.
The gradients of the objective functionJ
^
η
(
σ
,
δ
,
ε
) with respect to σ, δ, and ε are
(26)
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
σ
=
∫
0
1
∂
H
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
,
λ
^
(
s
∣
σ
,
δ
,
ε
)
)
∂
σ
d
s
,
(27)
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
δ
=
∫
0
1
∂
H
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
,
λ
^
(
s
∣
σ
,
δ
,
ε
)
)
∂
δ
d
s
,
(28)
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
ε
=
-
α
ε
-
1
-
α
Δ
(
σ
,
δ
)
+
η
β
ε
β
-
1
,
respectively, where H
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
,
λ
^
(
s
∣
σ
,
δ
,
ε
)
) is the Hamiltonian function for the objective function (25) given by
(29)
H
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
,
λ
^
(
s
∣
σ
,
δ
,
ε
)
)
=
ℒ
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
)
+
λ
^
T
(
s
∣
σ
,
δ
,
ε
)
f
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
and λ
^
(
·
∣
σ
,
δ
,
ε
) is the solution of the following system of costate differential equations:(30a)
d
λ
^
T
(
s
)
d
s
=
∂
H
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
,
λ
^
(
s
)
)
∂
x
^
with the boundary condition
(30b)
λ
^
T
(
1
)
=
∂
Φ
^
(
x
^
(
1
∣
σ
,
δ
)
,
ε
)
∂
x
^
.In particular, whenε
=
0, we have J
^
η
(
σ
,
δ
,
ε
)
=
J
^
(
σ
,
δ
). Thus, a corresponding gradient formula of the objective function J
^
(
σ
,
δ
) can also be obtained.In the following, we will turn our attention to the new objective function given by (22). We will see that, under some mild conditions, J
^
η
(
σ
,
δ
,
ε
) is continuously differentiable with respect to all its arguments.Theorem 2.
Suppose that(
σ
,
δ
,
ε
) is a local minimizer of problem (
P
^
η
) and that J
^
η
(
σ
,
δ
,
ε
) is finite. If
(31)
(
σ
,
δ
,
ε
)
⟶
(
σ
*
,
δ
*
,
0
)
,
then,(32a)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
J
^
η
(
σ
,
δ
,
ε
)
=
J
^
(
σ
*
,
δ
*
)
,
(32b)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
ε
=
0
.
(32c)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
J
^
η
(
σ
,
δ
,
ε
)
∂
σ
=
∂
J
^
(
σ
*
,
δ
*
)
∂
σ
,
(32d)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
δ
=
∂
J
^
(
σ
*
,
δ
*
)
∂
δ
.Proof.
First, we will show that (32a) holds.
Following arguments similar to those given for the proof of Lemma6.4
.
3 in [15], we obtain
(33)
lim
⁡
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
x
^
(
s
∣
σ
,
δ
)
=
x
^
(
s
∣
σ
*
,
δ
*
)
,
∀
s
∈
[
0,1
]
.
From (19), (33), and the proof of Lemma 6.4
.
4 in [15], it follows that
(34)
lim
⁡
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
J
^
(
σ
,
δ
)
=
J
^
(
σ
*
,
δ
*
)
.
Since (σ
,
δ
,
ε) is a local minimizer of problem (P
^
η), it is deduced that
(35)
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
ε
=
0
.
That is,
(36)
Δ
(
σ
,
δ
)
=
η
β
α
ε
α
+
β
.
Thus, we have
(37)
lim
⁡
ε
→
0
⁡
ε
-
α
Δ
(
σ
,
δ
)
=
lim
⁡
ε
→
0
η
β
α
ε
β
=
0
.
This, together with (22) and (34), yields (32a).
Next, from the proof process given for (32a), it is easy to conclude that (32b) holds.
Furthermore, we will move on to show that (32c) holds.
From (30a) of Theorem 1, we obtain
(38)
λ
^
T
(
s
∣
σ
,
δ
,
ε
)
-
λ
^
T
(
s
∣
σ
,
δ
,
0
)
=
λ
^
T
(
1
∣
σ
,
δ
,
ε
)
-
λ
^
T
(
1
∣
σ
,
δ
,
0
)
+
2
ε
-
α
∑
i
=
1
N
‍
∫
1
s
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
×
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
d
τ
+
∫
1
s
(
λ
^
T
(
τ
∣
σ
,
δ
,
ε
)
-
λ
^
T
(
τ
∣
σ
,
δ
,
0
)
)
×
∂
f
^
(
τ
,
x
^
(
τ
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
d
τ
,
s
∈
[
0,1
]
.
In view of (30b) and (37), it follows that
(39)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
(
λ
^
T
(
1
∣
σ
,
δ
,
ε
)
-
λ
^
T
(
1
∣
σ
,
δ
,
0
)
)
=
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
a
∂
∥
x
^
(
1
∣
σ
,
δ
)
-
x
^
(
1
)
∥
2
∂
x
^
=
0
.
By Schwarz inequality, we have
(40)
∑
i
=
1
N
(
∫
0
1
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
d
s
)
2
≤
∑
i
=
1
N
∫
0
1
[
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
]
2
d
s
.
This, together with (32b) and (37), yields
(41)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∑
i
=
1
N
∫
0
1
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
d
s
=
0
.
Since g
^
(
s
,
x
^
(
s
)
,
σ
,
δ
) is continuously differentiable with respect to all its arguments, there exists a constant G
x
^ such that
(42)
∥
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
∥
≤
G
x
^
,
i
=
1
,
…
,
N
.
By using (41) and (42), we obtain
(43)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∥
∑
i
=
1
N
∫
1
s
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
×
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
d
τ
∑
i
=
1
N
∫
1
s
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
∥
≤
ε
-
α
∑
i
=
1
N
∥
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
∫
1
s
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
×
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
d
τ
∥
≤
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∫
0
1
‍
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
×
∥
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
∥
d
s
≤
G
x
^
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∑
i
=
1
N
∫
0
1
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)

g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
}
d
s
=
0
.
Thus,
(44)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∑
i
=
1
N
∫
1
s
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
×
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
d
τ
=
0
.
Similar to obtaining (42), there exist constants F
x
^ and F
σ such that(45a)
∥
∂
f
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
x
^
∥
≤
F
x
^
(45b)
∥
∂
f
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
∥
≤
F
σ
.Thus, by applying Gronwall-Bellman’s lemma (see Theorem 2.8
.
6 in [15]) to (38), it follows from (39), (44), (45a), and the Lebesgue dominated convergence theorem (see Theorem 2.6
.
4 in [15]) that
(46)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
λ
^
T
(
s
∣
σ
,
δ
,
ε
)
=
lim
⁡
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
λ
^
T
(
s
∣
σ
,
δ
,
0
)
,
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
g
s
∈
[
0,1
]
.
By arguments similar to those used to obtain (44), it is easy to show that
(47)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∑
i
=
1
N
∫
1
s
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
×
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
τ
=
0
.
From (37) and (45b), we obtain
(48)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
σ
=
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
∫
0
1
∂
H
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
,
λ
^
(
s
∣
σ
,
δ
,
ε
)
)
∂
σ
d
s
=
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
(
∫
0
1
∂
ℒ
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
,
ε
)
∂
σ
d
s
hhhhhhhhhhhhh
+
∫
0
1
λ
^
T
(
s
∣
σ
,
δ
,
ε
)
×
∂
f
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
s
)
=
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
∫
0
1
∂
ℒ
^
0
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
s
+
∫
0
1
λ
^
T
(
s
∣
σ
,
δ
,
ε
)
∂
f
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
s
+
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
ε
-
α
∑
i
=
1
N
∫
0
1
max
⁡
{
0
,
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
}
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
×
∂
g
^
i
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
τ
=
lim
⁡
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
∫
0
1
∂
ℒ
^
0
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
s
+
∫
0
1
λ
^
T
(
s
∣
σ
,
δ
,
0
)
∂
f
^
(
s
,
x
^
(
s
∣
σ
,
δ
)
,
σ
,
δ
)
∂
σ
d
s
=
lim
⁡
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
∂
J
^
(
σ
,
δ
)
∂
σ
=
∂
J
^
(
σ
*
,
δ
*
)
∂
σ
.
Finally, by argument similar to those given for (32c), we can show that
(49)
lim
⁡
ε
→
0
(
σ
,
δ
)
→
(
σ
*
,
δ
*
)
⁡
∂
J
^
η
(
σ
,
δ
,
ε
)
∂
δ
=
∂
J
^
(
σ
*
,
δ
*
)
∂
δ
.
This means that (32d) holds. Thus, the proof is completed.


## 5. Convergence Analysis

In this section, we will show that if (σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)) is a local minimizer of problem (P
^
η
(
k
)) and the parameter η
(
k
) is sufficiently large as k
→
∞, then ε
(
k
)
→
ε
*
=
0 and (
σ
(
k
)
,
δ
(
k
)
)
→
(
σ
*
,
δ
*
) with (σ
*
,
δ
*) being a local minimizer of problem (P
^).Lemma 3.
Suppose that(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is a local minimizer of problem (
P
^
η
(
k
)
), that J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is finite, and that 0
<
ε
(
k
)
<
1. If there exist σ
*, δ
* and a sufficiently large number η
* such that
(50)
lim
⁡
k
→
+
∞
(
σ
(
k
)
,
δ
(
k
)
,
η
(
k
)
)
=
(
σ
*
,
δ
*
,
η
*
)
,
then lim
⁡
k
→
+
∞
⁡
ε
(
k
)
=
0.Proof.
On the contrary, we assume that the conclusion is false. Then, there exists a subsequence of{
ε
(
k
)
}, which is still denoted by the original sequence, such that lim
⁡
k
→
∞
⁡
ε
(
k
)
=
ε
*
≠
0. On one hand, by using the fact that f
^
(
s
,
x
^
(
s
)
,
σ
,
δ
) is continuously differentiable with respect to all its arguments, it follows from the definition of 𝒰 and Lemma 6.4
.
2 in [15] that
(51)
∥
x
^
(
s
∣
σ
,
δ
)
∥
≤
Y
for s
∈
[
0,1
] and (
σ
,
δ
)
∈
Σ
×
Ξ, where Y is a given constant. From (21) and (51), there exists a constant M
>
0 such that Δ
(
σ
,
δ
)
≤
M for all (
σ
,
δ
)
∈
Σ
×
Ξ. In particular, for (
σ
*
,
δ
*
)
∈
Σ
×
Ξ, it is clear that
(52)
Δ
(
σ
*
,
δ
*
)
≤
M
.
On the other hand, since (σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)) is a local minimizer of problem (P
^
η
(
k
)), it follows that
(53)
∂
J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
)
∂
ε
=
0
.
This implies that
(54)
Δ
(
σ
(
k
)
,
δ
(
k
)
)
=
β
η
(
k
)
(
ε
(
k
)
)
α
+
β
α
.
Choose
(55)
η
*
=
α
(
M
+
1
)
β
(
ε
*
)
α
+
β
.
Then,
(56)
lim
⁡
k
→
+
∞
Δ
(
σ
(
k
)
,
δ
(
k
)
)
=
Δ
(
σ
*
,
δ
*
)
=
M
+
1
.
This is a contradiction to (52). The proof is completed.Lemma 4.
Suppose that(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is a local minimizer of problem (
P
^
η
(
k
)
), that J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is finite, and that ε
(
k
)
>
0. Then, x
^
(
1
∣
σ
(
k
)
,
δ
(
k
)
)
≠
x
^
(
1
).Proof.
On the contrary, we assume that the conclusion is false. Then,x
^
(
1
∣
σ
(
k
)
,
δ
(
k
)
)
=
x
^
(
1
). By (28) and the assumption that ε
(
k
)
>
0, we obtain
(57)
∂
J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
)
∂
ε
=
η
k
β
(
ε
(
k
)
)
β
-
1
>
0
.
On one hand, (σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)) is a local minimizer of problem (P
^
η
(
k
)) and ε
(
k
)
>
0. Thus,
(58)
∂
J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
)
∂
ε
=
0
.
This is a contradiction to (57). Hence, x
^
(
1
∣
σ
(
k
)
,
δ
(
k
)
)
≠
x
^
(
1
). The proof is completed.Theorem 5.
Suppose that(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is a local minimizer of problem (
P
^
η
(
k
)
) such that ε
(
k
)
>
0 and J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is finite. If there exits a sufficiently large number η
* such that
(59)
lim
⁡
k
→
+
∞
(
σ
(
k
)
,
δ
(
k
)
,
η
(
k
)
)
=
(
σ
*
,
δ
*
,
η
*
)
,
then x
^
(
1
∣
σ
*
,
δ
*
)
≠
x
^
(
1
) and lim
⁡
k
→
+
∞
⁡
J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
)
=
J
^
(
σ
*
,
δ
*
).Proof.
By Lemma4, we have x
^
(
1
∣
σ
(
k
)
,
δ
(
k
)
)
≠
x
^
(
1
). In the following, we will show that x
^
(
1
∣
σ
*
,
δ
*
)
=
x
^
(
1
). Since (σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)) is a local minimizer of problem (P
^
η
k) and ε
(
k
)
>
0, it follows that
(60)
∂
J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
)
∂
ε
=
0
.
That is,
(61)
-
α
(
ε
(
k
)
)
-
1
-
α
Δ
(
σ
(
k
)
,
δ
(
k
)
)
+
η
β
(
ε
(
k
)
)
β
-
1
=
0
.
It is clear that
(62)
Δ
(
σ
(
k
)
,
δ
(
k
)
)
=
η
(
k
)
β
α
(
ε
(
k
)
)
α
+
β
.
By using (59), (62), and Lemma 3, we obtain Δ
(
σ
*
,
δ
*
)
=
0. Therefore, x
^
(
1
∣
σ
*
,
δ
*
)
≠
x
^
(
1
).
Applying (62) and Lemma 3 to (22), it follows that
(63)
lim
⁡
k
→
+
∞
J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
)
=
lim
⁡
k
→
+
∞
[
J
^
(
σ
(
k
)
,
δ
(
k
)
)
+
(
1
+
β
α
)
η
(
k
)
(
ε
(
k
)
)
β
]
=
J
^
(
σ
*
,
δ
*
)
.
The proof is completed.Theorem 6.
Suppose that(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is a local minimizer of problem (
P
^
η
(
k
)
) such that 0
<
ε
(
k
)
<
1 and J
^
η
(
k
)
(
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) is finite. If there exist σ
*
,
δ
* and a sufficiently large number η
* such that
(64)
lim
⁡
k
→
+
∞
(
σ
(
k
)
,
δ
(
k
)
,
η
(
k
)
)
=
(
σ
*
,
δ
*
,
η
*
)
,
then x
^
(
1
∣
σ
*
,
δ
*
)
=
x
^
(
1
) and (
σ
*
,
δ
*
) is a local minimizer of problem (P
^).Proof.
Since (σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)) is a local minimizer of problem (P
^
η
(
k
)), it follows from Lemma 3 that lim
⁡
k
→
+
∞
⁡
ε
(
k
)
=
0. This means that (
σ
*
,
δ
*
,
0
) is also a local minimizer of problem (P
^
η
*). This, together with Theorem 5, implies that (σ
*
,
δ
*) is a local minimizer of problem (P
^). The proof is completed.Once the optimal parameter(
σ
*
,
δ
*
) of problem (P
^) is determined, the corresponding optimal control u
* can be obtained readily from (7) and (12).Theorem 7.
Letu
p
,
* be an optimal control of the approximate problem (
P
). Then,
(65)
lim
⁡
p
→
+
∞
J
(
u
p
,
*
)
=
J
(
u
*
)
,
where u
* is an optimal control of the problem (P).Proof.
The proof is similar to that given for Theorem8.6
.
2 in [15].Based on the results of the convergence analysis, we are in a position to present the following numerical algorithm for solving problem (P).Algorithm 8.
The steps are as follows.Step 1.
Setη
(
1
)
=
10, η
*
=
1
0
8, ε
*
=
1
0
-
9, choose an initial point (
σ
(
0
)
,
δ
(
0
)
,
ε
(
0
)
), and the iteration index k
=
0. The values of α and β are chosen depending on the specific structure of the concerned problem (
P
), where β
>
1 and β
>
α.Step 2.
Solve problem(
P
η
(
k
)
), and let (
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) be the minimizer obtained.Step 3.
Ifε
(
k
)
>
ε
*, η
(
k
)
<
η
*, set η
(
k
+
1
)
=
10
η
(
k
), k
:
=
k
+
1, and go to Step 2 with (
σ
(
k
)
,
δ
(
k
)
,
ε
(
k
)
) as the new initial point in the new optimization process. Otherwise, set ε
(
k
)
:
=
ε
* and η
(
k
)
:
=
η
*. (
σ
*
,
δ
*
,
ε
*
) is a solution of problem (
P
η
*
).Remark 9.
In Step3, if ε
(
k
)
>
ε
*, it follows from Lemmas 3 and 4, and Theorem 5 that (
σ
(
k
)
,
δ
(
k
)
) cannot be a feasible point. This means that the penalty parameter η
(
k
) is not chosen large enough. Thus, we need to increase η
(
k
). If η
(
k
)
>
1
0
8, but still ε
(
k
)
>
ε
*, then we should choose a different initial condition or adjust the values of α and β such that the conditions of Theorem 2 are satisfied. Then, set η
(
k
+
1
)
=
10
η
(
k
), ε
(
k
+
1
)
=
0.1
ε
(
k
), k
:
=
k
+
1. Go to Step 2.Remark 10.
Although we have proven that a local minimizer of the exact penalty function optimization problem(
P
η
(
k
)
) will converge to a local minimizer of the original problem (
P
), we need, in actual computation, to set a lower bound ε
*
=
1
0
-
9 for ε
(
k
), so as to avoid the situation of being divided by ε
(
k
)
=
0, leading to infinity.


## 6. Simulation Results

Example 1.
In this example, we consider a realistic and complex problem of transferring containers from a ship to a cargo truck at the port of Kobe in [1]. The container crane is driven by a hoist motor and a trolley drive motor. In order to ensure safety, our objective is to minimize the swing during and at the end of the transfer. After appropriate normalization, this problem is summarized as follows: find controls u
1
(
t
) and u
2
(
t
) such that the object function
(66)
J
(
u
)
=
4.5
∫
0
1
(
x
3
2
(
t
)
+
x
6
2
(
t
)
)
d
t
is minimized subject to dynamical equations as follows:
(67)
x
˙
1
(
t
)
=
9
x
4
(
t
)
,
x
˙
2
(
t
)
=
9
x
5
(
t
)
,
x
˙
3
(
t
)
=
9
x
6
(
t
)
,
x
˙
4
(
t
)
=
9
(
u
1
(
t
)
+
17.2656
x
3
(
t
)
)
,
x
˙
5
(
t
)
=
9
u
2
(
t
)
,
x
˙
6
(
t
)
=
-
9
x
2
(
t
)
(
u
1
(
t
)
+
27.0756
x
3
(
t
)
+
2
x
5
(
t
)
x
6
(
t
)
)
,
where the initial and terminal conditions are
(68)
x
(
0
)
=
[
0,22,0
,
0
,
-
1,0
]
T
,
x
(
1
)
=
[
10,14,0
,
2.5,0
,
0
]
T
,
and the control and state inequality constraints are
(69)
|
u
1
(
t
)
|
≤
2.83374
,
-
0.80865
≤
u
2
(
t
)
≤
0.71265
,
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
h
t
∈
[
0,1
]
,
(70)
|
x
4
(
t
)
|
≤
2.5
,
|
x
5
(
t
)
|
≤
1.0
,
t
∈
[
0,1
]
,
respectively. Furthermore, the state inequality constraints can be formulated as follows:
(71)
g
1
(
t
)
=
-
x
4
(
t
)
+
2.5
≥
0
,
g
2
(
t
)
=
x
4
(
t
)
+
2.5
≥
0
,
g
3
(
t
)
=
-
x
5
(
t
)
+
1.0
≥
0
,
g
4
(
t
)
=
x
5
(
t
)
+
1.0
≥
0
.By utilizing the control parametrization method used conjunction with a time scaling transform and the exact penalty function method, the constrained optimal control problem is transformed into the following unconstrained optimal control problem (P
^
η), given the following system:
(72)
x
^
˙
1
(
s
)
=
9
x
^
4
(
s
)
u
^
3
p
(
s
∣
δ
)
x
^
˙
2
(
s
)
=
9
x
^
5
(
s
)
u
^
3
p
(
s
∣
δ
)
x
^
˙
3
(
s
)
=
9
x
^
6
(
s
)
u
^
3
p
(
s
∣
δ
)
x
^
˙
4
(
s
)
=
9
(
u
^
1
p
(
s
∣
σ
)
+
17.2656
x
^
3
(
s
)
)
u
^
3
p
(
s
∣
δ
)
x
^
˙
5
(
s
)
=
9
u
^
2
p
(
s
∣
σ
)
u
^
3
p
(
s
∣
δ
)
x
^
˙
6
(
s
)
=
-
9
x
^
2
(
s
)
(
u
^
1
p
(
s
∣
σ
)
+
27.0756
x
^
3
(
s
)
+
2
x
^
5
(
s
)
x
^
6
(
s
)
)
×
u
^
3
p
(
s
∣
δ
)
,
x
^
˙
7
(
s
)
=
u
^
3
p
(
s
∣
σ
)
with the initial condition x
^
(
0
)
=
[
0,22,0
,
0
,
-
1,0
,
0
]
T. Find control and system parameters (
σ
,
δ
,
ε
) such that the new object function
(73)
J
^
η
(
u
)
=
4.5
∫
0
1
(
x
^
3
2
(
s
∣
σ
,
δ
)
+
x
^
6
2
(
s
∣
σ
,
δ
)
)
u
^
3
p
(
s
∣
σ
)
d
s
+
ε
-
α
Δ
(
σ
,
δ
)
+
η
ε
β
is minimized, where
(74)
Δ
(
σ
,
δ
)
=
(
x
^
1
(
1
∣
σ
,
δ
)
-
10
)
2
+
(
x
^
2
(
1
∣
σ
,
δ
)
-
14
)
2
+
x
^
3
(
1
∣
σ
,
δ
)
2
+
(
x
^
4
(
1
∣
σ
,
δ
)
-
2.5
)
2
+
x
^
5
(
1
∣
σ
,
δ
)
2
+
x
^
6
(
1
∣
σ
,
δ
)
2
+
(
x
^
7
(
1
∣
σ
,
δ
)
-
1
)
2
+
∫
0
1
[
max
⁡
⁡
{
0
,
x
^
4
(
s
∣
σ
,
δ
)
-
2.5
}
]
2
d
s
+
∫
0
1
[
max
⁡
{
0
,
-
x
^
4
(
s
∣
σ
,
δ
)
-
2.5
}
]
2
d
s
+
∫
0
1
[
max
⁡
{
0
,
x
^
5
(
s
∣
σ
,
δ
)
-
1
}
]
2
d
s
+
∫
0
1
[
max
⁡
{
0
,
-
x
^
5
(
s
∣
σ
,
δ
)
-
1
}
]
2
d
s
.
Thus, set p
=
20, α
=
1.5, and β
=
3. Applying Algorithm 8 to problem (P
^
η), the obtained results are shown below. The optimal objective function is J
=
5.2386
×
1
0
-
3, where η
=
2.0
×
1
0
5 and ε
=
1.00032. The optimal controls, the optimal states, and the constraint functions are shown in Figures 2, 3, 4, and 5, respectively. From Figure 1, we observe that the obtained optimal controls are satisfied for the constraint (69). Under the optimal controls, the terminal state equality constraint (68) and the state inequality constraint (71) are both satisfied, which are seen from Figures 2 to 4, respectively. Comparing with the results of Example 6.7
.
3 in [15], our minimum objective function value is slightly larger than one in [15] (it is 4.684
×
1
0
-
3 in [15]). However, in [15], the state inequality constraints (71) are not completely satisfied for all t
∈
[
0,1
].Figure 1
Optimal controls.Figure 2
Optimal states under optimal controls.Figure 3
Optimal states under optimal controls.Figure 4
Constraint functions under optimal controls.Figure 5
Optimal control.Example 2.
The following problem is taken from [16]. Find a control u
:
[
0,4.5
]
→
ℝ that minimizes the objective function
(75)
J
=
∫
0
4.5
(
u
2
(
t
)
+
x
1
2
(
t
)
)
d
t
,
subject to dynamic equations
(76)
x
˙
1
(
t
)
=
x
2
(
t
)
,
x
˙
2
(
t
)
=
-
x
1
(
t
)
+
x
2
(
t
)
(
1.4
-
0.14
x
2
2
(
t
)
)
+
4
u
(
t
)
with initial condition
(77)
x
1
(
0
)
=
-
5
,
x
2
(
0
)
=
-
5
and the continuous inequality constraint on the control and state
(78)
g
1
(
t
)
=
-
u
(
t
)
-
1
6
x
1
(
t
)
≥
0
,
t
∈
[
0,4.5
]
.In this problem, we setp
=
10, α
=
1.5, and β
=
2.2. Similar to solve Example 1, the obtained result is shown below. The optimal objective function value is 45.7717. where σ
=
1.0
×
1
0
4 and ε
=
4.8532
×
1
0
-
5. The optimal control, the optimal states, and the constraint function are shown in Figures 5, 6, 7, and 8, respectively. From Figure 8, we observe that the control and state constraints are satisfied for all t
∈
[
0,4.5
].Figure 6
Optimal state under the optimal control.Figure 7
Optimal state under the optimal control.Figure 8
Constraint function under the optimal control.


## 7. Conclusions

In this paper, we have presented optimal control problems subject to the terminal state equality constraint and continuous inequality constraints on the control and the state. Our aim is to design an optimal control that minimizes total system cost and ensures satisfaction of all constraints. After the control parametrization, together with the time scaling transformation, the constrained optimal control problem is transformed into a constrained approximate optimal parameter selection problem. A simple exact penalty function method is then used to design a computational method to solve the constrained optimal parameter selection problem. Its main idea is to augment the constraint violation function constructed from the terminal state equality constraint and continuous inequality constraints to the objective function, forming a new one. This gives rise to a sequence of unconstrained optimal control problems, which are easily solved by a numerical algorithm. From numerical simulation results, we observe that our proposed method can find a high quality approximate optimal control such that the objective function is minimized, while the terminal state constraint and the constraints on the control and state are both satisfied.



---

*Source: 752854-2014-05-08.xml*