Next Article in Journal
Acknowledgment to Reviewers of Games in 2020
Next Article in Special Issue
Optimal Control and Positional Controllability in a One-Sector Economy
Previous Article in Journal / Special Issue
Boltzmann Distributed Replicator Dynamics: Population Games in a Microgrid Context
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Necessary Optimality Conditions for a Class of Control Problems with State Constraint

Faculty of Electrical Engineering, Automatics, Computer Science and Biomedical Engineering, AGH University of Science and Technology, al. Mickiewicza 30, 30-059 Kraków, Poland
*
Author to whom correspondence should be addressed.
Games 2021, 12(1), 9; https://doi.org/10.3390/g12010009
Submission received: 23 November 2020 / Revised: 7 January 2021 / Accepted: 13 January 2021 / Published: 18 January 2021
(This article belongs to the Special Issue Optimal Control Theory)

Abstract

:
An elementary approach to a class of optimal control problems with pathwise state constraint is proposed. Based on spike variations of control, it yields simple proofs and constructive necessary conditions, including some new characterizations of optimal control. Two examples are discussed.

1. Introduction

Necessary optimality conditions for control problems with pathwise state constraints have been widely studied since the beginnings of optimal control theory [1], and this domain of research is still vivid nowadays [2]. Most of the existing approaches may be divided into two streams [3]. The first one, characterized by the use of classical methods of analysis with often heuristic proofs, yields results of limited generality (see the review [4], and [3]). The other is based on the abstract theory of infinite-dimensional optimization and its results encompass a wide class of problems, with rigorous but demanding proofs (see [5,6,7,8,9]). However, these results are difficult for practical verification, because of too general characterizations of the adjoint variables and multiplier functions. Generally, the existing approaches are hardly constructive, meaning they do not give sufficient indications how to improve a nonoptimal control.
We propose an elementary approach to necessary optimality conditions for problems in Mayer form with free final state and a scalar state constraint. The controls are scalar functions and nontangentiality is assumed at all entry and exit points. As is well known, the proof of the minimum principle with free final state and without pathwise state constraints can be made elementary and simple by considering the cost increment caused by a single spike variation of control. Our first purpose is to show that a similar proof technique may be effective when a pathwise state constraint is present, with the difference that additionally a coordinated pair of spikes is used. A second purpose is to extend the known results for state constraints of index one, mainly to nonregular problems in which the optimal control and the corresponding state trajectory may at the same time take values on the boundaries of their respective admissible sets. In particular, we allow for discrete sets of admissible control values. From a conceptual point of view, this work also offers a clear geometrical interpretation of the results. On the practical side, an advantage of our approach is that the obtained conditions are readily verifiable and constructive: if they are not fulfilled, a gradient optimization procedure can be indicated and initialized which guarantees an improvement of the control, up to numerical precision (as in the method of Monotone Structural Evolution [10]). Of course, the other approaches clearly prevail in a wider perspective, when problems of greater complexity are also taken into account. They then produce optimality conditions, which can be effectively used in optimal control computations (see [11,12,13,14]).
Consider a control system described by a state equation
x ˙ ( t ) = f ( x ( t ) , u ( t ) ) ,   t [ 0 , T ] ,   x ( 0 ) = x 0 ,   x ( t ) R n ,
with a given initial condition x 0 and a given time horizon T. The controls u : [ 0 , T ] R are piecewise continuous functions of time, taking values in a given set U, that is, they belong to P C ( 0 , T ; U ) . 1 The function f : R n × R R n is of class C 1 in its both arguments. We make a general assumption that all solutions of (1) appearing in the sequel are well defined in the whole time interval [ 0 , T ] . The state is subject to a scalar pathwise constraint,
g ( x ( t ) ) 0 ,   t [ 0 , T ] .
The function g : R n R is of class C 2 , and g ( ξ ) 0 if g ( ξ ) = 0 . We assume g ( x 0 ) 0 . A performance index (or cost),
Q ( u ) = q ( x ( T ) ) ,
is minimized on the trajectories of (1). The function q : R n R is of class C 1 .
For a control u P C ( 0 , T ; U ) , let x be the corresponding solution of the initial value problem (1). The control u is admissible if the trajectory x satisfies the state constraint (2). The control u is optimal if it is admissible and minimizes the cost Q in the set of all admissible controls. A boundary interval of u is defined as any nonempty and right-open interval of time in which g ( x ( t ) ) 0 . Any nonempty and right-open interval of time, such that g ( x ( t ) ) < 0 for every t in that interval, is nonboundary. If [ t 1 , t 2 [ is an inclusion-maximal boundary interval of u and t 1 > 0 , then t 1 is called an entry point of u. If t 2 < T , then t 2 is an exit point. Denote
g ˙ ( ξ , v ) = g ( ξ ) T f ( ξ , v )   for   ξ R n ,   v R .
The derivative of the function t g ( x ( t ) ) along the trajectories of (1) is equal to g ˙ ( x ( t ) , u ( t ) ) .
For admissible controls we introduce the concept of verifiability, aiming to distinguish the controls to which the spike technique of (non)optimality verification, developed below, can be effectively applied. Let u be an admissible control with the corresponding state trajectory x. We call this control verifiable if
(i)
it has a finite number of inclusion-maximal boundary intervals,
(ii)
an implication holds that if g ( x ( t ) ) = 0 for a certain t, then t belongs to the closure of some boundary interval of u, 2
(iii)
the conditions of nontangentiality
g ˙ ( x ( t en ) , u ( t en ) ) > 0 , g ˙ ( x ( t ex ) , u ( t ex ) ) < 0
hold at all entry points t en and all exit points t ex of u,
(iv)
there is an open set X u R n containing all points x ( t ) such that g ( x ( t ) ) = 0 , and there is a C 1 function w : X u R such that
( w ( ξ ) U   and   g ˙ ( ξ , w ( ξ ) ) = 0 ) if ( ξ X u   and   g ( ξ ) 0 ) .
Note that if (4) is true, then the functions u and t g ˙ ( x ( t ) , u ( t ) ) are discontinuous at t en and t ex . Claim (iv) may be regarded as a weakened form of the assumption that the state constraint (2) is of index (or order) one (cf. [3,4,8]). From the implicit function theorem it follows that if ξ X u , g ( ξ ) 0 and 2 g ˙ ( ξ , w ( ξ ) ) 0 , then
w ( ξ ) = 1 g ˙ ( ξ , w ( ξ ) ) 2 g ˙ ( ξ , w ( ξ ) ) = 1 f ( ξ , w ( ξ ) ) g ( ξ ) + 2 g ( ξ ) f ( ξ , w ( ξ ) ) g ( ξ ) T 2 f ( ξ , w ( ξ ) ) .
For any verifiable control u define a function F : [ 0 , T ] × R n R n
F ( t , ξ ) = { f ( ξ , w ( ξ ) ) , t Θ u , ξ X u f ( ξ , u ( t ) ) , elsewhere ,
where Θ u denotes the union of all boundary intervals of u. Obviously, the corresponding state trajectory satisfies x ˙ ( t ) = F ( t , x ( t ) ) for almost all t [ 0 , T ] .

2. The One-Spike Control Variation and Trajectory Variation

Let u be a verifiable control, and x, the corresponding state trajectory. Denote
U t = { { v U : g ˙ ( x ( t ) , v ) < 0 } , g ( x ( t ) ) = 0        U ,      g ( x ( t ) ) < 0 .
For any τ [ 0 , T [ , any v U τ , and any sufficiently small ε > 0 , we shall define a control u ε P C ( 0 , T ; U ) . We also define x ε as the solution of the initial value problem
x ˙ ε ( t ) = f ( x ε ( t ) , u ε ( t ) ) ,   t [ 0 , T ] ,   x ε ( 0 ) = x 0 .
We put u ε ( t ) = u ( t ) if t < τ , and u ε ( t ) = v if τ t < τ + ε . To define u ε ( t ) for t τ + ε , suppose first that τ Θ u . Then
(i)
u ε ( t ) = w ( x ε ( t ) ) if g ( x ε ( t 1 ) ) = 0 for some t 1 t , and u has no exit points in [ t 1 , t ] ,
(ii)
u ε ( t ) = u ( t en ) if g ( x ( t ) ) = 0 and g ( x ε ( t ) ) < 0 , where t en is the greatest entry point of u less than or equal to t,
(iii)
u ε ( t ) = u ( t ) otherwise.
Let now τ belong to θ , an inclusion-maximal boundary interval of u, and t τ + ε . Then u ε ( t ) = w ( x ε ( t ) ) for t θ , and (i), (ii), (iii) are valid for t θ .
The spike variation of control is the difference u ε u . Note that the control u ε is admissible for every sufficiently small positive ε .
Lemma 1.
The trajectory increment Δ x = x ε x satisfies
Δ x ( t ) = ε δ x ( t ) + o ( ε )
for every t [ τ , T ] , where the trajectory variation δ x : [ τ , T ] R n is absolutely continuous except, possibly, at the entry points of u, and independent of ε . For almost every t [ τ , T ]
δ x ˙ ( t ) = 2 F ( t , x ( t ) ) T δ x ( t ) ,
moreover,
δ x ( τ ) = f ( x ( τ ) , v ) f ( x ( τ ) , u ( τ ) )
and at every entry point t en > τ of u
δ x ( t en + ) = Z ( t en ) T δ x ( t en ) .
Here
Z ( t en ) = I g ( x ( t en ) ) Δ f ( t en ) T g ( x ( t en ) ) T Δ f ( t en )
Δ f ( t en ) = f ( x ( t en ) , u ( t en ) ) f ( x ( t en ) , w ( x ( t en ) ) ) .
Proof. 
If the control u has no entry points in ] τ , T [ , the lemma is obviously true by virtue of the classical theorems on ordinary differential equations. Suppose that u has exactly one entry point t en in ] τ + ε , T [ . From the mentioned theorems it directly follows that (5) holds in the time interval [ τ , t en [ , with an absolutely continuous function δ x , satisfying (7) and (6) in that interval. We shall prove that the relationships (5) and (6) may be extended to the whole interval [ τ , T ] , with the function δ x absolutely continuous in ] t en , T ] . To this end, let us first notice that for every sufficiently small ε > 0 the control u ε has an entry point t en ε = t en + ε δ t en + o ( ε ) , where δ t en is a real number independent of ε . This follows from the verifiability of u (see (4)) and from the construction of u ε . Let Δ t en = t en ε t en . To fix attention, assume Δ t en > 0 . We then have
x ( t en ε ) = x ( t en ) + f ( x ( t en ) , w ( x ( t en ) ) ) Δ t en + o ( Δ t en ) x ε ( t en ε ) = x ε ( t en ) + f ( x ε ( t en ) , u ε ( t en ) ) Δ t en + o ( Δ t en ) = x ε ( t en ) + f ( x ( t en ) , u ( t en ) ) Δ t en + o ( Δ t en ) ,
as f ( x ε ( t en ) , u ( t en ) ) = f ( x ( t en ) , u ( t en ) ) + 1 f ( x ( t en ) , u ( t en ) ) T Δ x ( t en ) + o ( Δ x ( t en ) ) . Hence
Δ x ( t en ε ) = Δ x ( t en ) + Δ f ( t en ) Δ t en + o ( Δ t en ) .
By the definition of entry points, g ( x ( t en ) ) = g ( x ε ( t en ε ) ) = 0 . Thus
g ( x ε ( t en ε ) ) = g ( x ( t en ) + Δ x ( t en ) + f ( x ( t en ) , u ( t en ) ) Δ t en + o ( Δ t en ) ) = g ( x ( t en ) ) T ( Δ x ( t en ) + f ( x ( t en ) , u ( t en ) ) Δ t en ) + o ( Δ t en ) = 0 ,
and so
Δ t en = g ( x ( t en ) ) T Δ x ( t en ) g ( x ( t en ) ) T f ( x ( t en ) , u ( t en ) ) + o ( Δ t en ) .
Substituting this into (10), we obtain
Δ x ( t en ε ) = ( I Δ f ( t en ) g ( x ( t en ) ) T g ( x ( t en ) ) T f ( x ( t en ) , u ( t en ) ) ) Δ x ( t en ) + o ( Δ t en ) .
As g ( x ( t en ) ) T f ( x ( t en ) , u ( t en ) ) = g ( x ( t en ) ) T Δ f ( t en ) and Δ x ( t en ) = ε δ x ( t en ) + o ( ε ) , we get
Δ x ( t en ε ) = ε Z ( t en ) T δ x ( t en ) + o ( ε ) .
Defining δ x ( t en + ) by (8), we arrive at the extension of (5) and (6) to [ τ , T ] because of the same classical theorems on differential equations. For Δ t en < 0 , an analogous argument leads to the same result. The proof can be easily generalized to an arbitrary finite number of entry points. □

3. The Adjoint Function and The One-Spike Necessary Optimality Condition

As in Section 2, let u be a verifiable control and x, the corresponding solution of (1). With every such control we associate an adjoint function ψ : [ 0 , T ] R n , defined as a solution of the adjoint equation
ψ ˙ ( t ) = 2 F ( t , x ( t ) ) ψ ( t ) ,
absolutely continuous except at the entry points of u and satisfying the final condition
ψ ( T ) = q ( x ( T ) ) .
At every entry point t en , ψ ( t en ) = ψ ( t en + ) and
ψ ( t en ) = Z ( t en ) ψ ( t en + ) .
Let τ be an arbitrary point from [ 0 , T [ , and δ x , the trajectory variation determined in Lemma 1. It is easy to notice that the function t ψ ( t ) T δ x ( t ) is constant in the whole time interval [ τ , T ] . Indeed, its derivative ψ ˙ ( t ) T δ x ( t ) + ψ ( t ) T δ x ˙ ( t ) equals zero at every t where ψ and δ x are differentiable, and at the entry points t en > τ we have by virtue of (13) and (8): ψ ( t en ) T δ x ( t en ) = ψ ( t en + ) T Z ( t en ) T δ x ( t en ) = ψ ( t en + ) T δ x ( t en + ) . Thus,
ψ ( τ ) T ( f ( x ( τ ) , v ) f ( x ( τ ) , u ( τ ) ) ) = q ( x ( T ) ) T δ x ( T ) .
Define the pre-Hamiltonian H : R n × R n × R R , H ( ψ , x , u ) = ψ T f ( x , u ) , and its increment
Δ H ( τ , v ) = H ( ψ ( τ ) , x ( τ ) , v ) H ( ψ ( τ ) , x ( τ ) , u ( τ ) )
for any v U and τ [ 0 , T ] (note that Δ H is only defined for a uniquely predetermined control u). We can now express the value of cost on the control u ε , defined in Section 2
Q ( u ε ) = q ( x ε ( T ) ) = Q ( u ) + ε q ( x ( T ) ) T δ x ( T ) + o ( ε ) = Q ( u ) + ε Δ H ( τ , v ) + o ( ε ) .
A sufficient condition for the existence of spike variations which improve the cost is a straightforward consequence.
Lemma 2.
Assume that τ [ 0 , T [ , v U τ , and Δ H ( τ , v ) < 0 . Then the control u ε is admissible and Q ( u ε ) < Q ( u ) for every sufficiently small ε > 0 .
A theorem on optimal control of the minimum principle type follows from Lemma 2.
Theorem 1.
Assume that the control u is optimal. Then:
(i)
Δ H ( t , v ) 0 for every t [ 0 , T ] and every v U t ,
(ii)
the function [ 0 , T ] t χ ( t ) = H ( ψ ( t ) , x ( t ) , u ( t ) ) is constant.
Proof. 
Conclusion (i) is a direct consequence of Lemma 2. Conclusion (ii) for the nonboundary intervals is proved exactly as in the classical proofs of the minimum principle without pathwise state constraints. In the interior of every boundary interval, the function χ is of class C 1 with the derivative identically zero. The continuity of χ at entry points readily follows from (13) and (9). Let now t ex be an exit point of u. By (i) and (4), there is a δ > 0 such that Δ H ( t , u ( t ex ) ) 0 for all t [ t ex δ , t ex [ , and Δ H ( t , w ( x ( t ex ) ) ) 0 for all t ] t ex , t ex + δ ] . The continuity of χ at t ex is shown by limit passages: t t ex for the first of these inequalities, and t t ex + for the second. □
Corollary 1.
Assume that the control u is optimal and g ( x ( t ) ) = 0 for some t [ 0 , T ] . Then Δ H ( t , v ) 0 or g ˙ ( x ( t ) , v ) 0 for every v U .

4. The Two-Spike Necessary Optimality Condition

For a verifiable control u and the corresponding state trajectory x, we shall define a two-spike control variation. Let θ be an inclusion-maximal boundary interval of u. For any quintuple τ 1 , τ 2 , v 1 , v 2 , η such that τ 1 , τ 2 θ , τ 1 < τ 2 , v 1 , v 2 U , η > 0 , and for any sufficiently small ε > 0 we define a control u ε P C ( 0 , T ; U ) (not to be confused with the control u ε defined in Section 2) and the corresponding state trajectory x ε . We put u ε ( t ) = u ( t ) if t < τ 1 , u ε ( t ) = v 1 if τ 1 t < τ 1 + ε , u ε ( t ) = v 2 if τ 2 t < τ 2 + η ε , and u ε ( t ) = w ( x ε ( t ) ) for any other t in θ . Points (i), (ii) and (iii) of the definition in Section 2 apply to all the remaining values of t. The two-spike control variation is the difference u ε u .
The control u may sometimes be improved even if it fulfills the necessary optimality condition (i) of Theorem 1. We shall now give conditions, sufficient for the existence of a two-spike control variation in θ which is admissible and guarantees a cost improvement.
Lemma 3.
Assume that τ 1 , τ 2 θ , τ 1 < τ 2 , v 1 , v 2 U , η > 0 , and
g ˙ ( x ( τ 1 ) , v 1 ) < 0
g ˙ ( x ( τ 1 ) , v 1 ) + η g ˙ ( x ( τ 2 ) , v 2 ) < 0
Δ H ( τ 1 , v 1 ) + η Δ H ( τ 2 , v 2 ) < 0 .
Then for every sufficiently small ε > 0 the control u ε is admissible, and Q ( u ε ) < Q ( u ) .
Proof. 
It follows from the definition of u ε and the inequalities (15), (16) that for every sufficiently small ε > 0 the function t g ( x ε ( t ) ) is negative in the time interval ] τ 1 , sup θ ] and constant in the intervals [ τ 1 + ε , τ 2 ] and [ τ 2 + η ε , sup θ ] ,
g ( x ε ( t ) ) = ε g ˙ ( x ( τ 1 ) , v 1 ) + o ( ε ) ,   t [ τ 1 + ε , τ 2 ] ,
g ( x ε ( t ) ) = ε ( g ˙ ( x ( τ 1 ) , v 1 ) + η g ˙ ( x ( τ 2 ) , v 2 ) ) + o ( ε ) , t [ τ 2 + η ε , sup θ ] .
From this we infer that the control u ε is admissible for all sufficiently small ε > 0 . Reasoning similarly as in Section 3 and using the adjoint function defined therein, we estimate the value of the performance index on the control u ε .
Q ( u ε ) = Q ( u ) + ε ( Δ H ( τ 1 , v 1 ) + η Δ H ( τ 2 , v 2 ) + o ( ε ) .
Hence, (17) is a sufficient condition for the two-spike control variation to reduce the cost for every sufficiently small ε > 0 . □
Lemma 4.
Assume that τ 1 , τ 2 θ , τ 1 < τ 2 , v 1 , v 2 U , and
g ˙ ( x ( τ 1 ) , v 1 ) < 0 ,   Δ H ( τ 1 , v 1 ) 0
g ˙ ( x ( τ 2 ) , v 2 ) 0 ,   Δ H ( τ 2 , v 2 ) < 0 .
Assume also that if g ˙ ( x ( τ 2 ) , v 2 ) > 0 , then
Δ H ( τ 1 , v 1 ) g ˙ ( x ( τ 1 ) , v 1 ) > Δ H ( τ 2 , v 2 ) g ˙ ( x ( τ 2 ) , v 2 ) .
Under these assumptions there is an η > 0 , such that for every sufficiently small ε > 0 the control u ε is admissible, and Q ( u ε ) < Q ( u ) .
Proof. 
We shall show that the assumptions of Lemma 3 follow from the assumptions of Lemma 4. Denote
η 1 = Δ H ( τ 1 , v 1 ) Δ H ( τ 2 , v 2 )   and   η 2 = g ˙ ( x ( τ 1 ) , v 1 ) g ˙ ( x ( τ 2 ) , v 2 )   for   g ˙ ( x ( τ 2 ) , v 2 ) > 0 .
Of course η 1 0 and η 2 > 0 . The inequality (15) is obvious. In view of (18), (17) is true for every η > η 1 . If g ˙ ( x ( τ 2 ) , v 2 ) = 0 , then (16) holds for every η > 0 , and the assumptions of Lemma 3 are satisfied. If g ˙ ( x ( τ 2 ) , v 2 ) > 0 , then the inequality (16) holds for η < η 2 . We thus have a two-sided bound on η , η 1 < η < η 2 . The interval of admissible values of η is nonempty if η 1 < η 2 , and this inequality follows from (19). □
By contradicting the sufficient nonoptimality conditions of Lemma 4 we obtain new necessary conditions of optimality.
Theorem 2 (main result).
Assume that the control u is optimal and verifiable, and has a boundary interval θ . Let also t 1 , t 2 θ , t 1 t 2 , and v 1 , v 2 U . Under these assumptions:
(i)
if g ˙ ( x ( t 1 ) , v 1 ) < 0 and Δ H ( t 1 , v 1 ) = 0 , then Δ H ( t 2 , v 2 ) 0 ,
(ii)
if g ˙ ( x ( t 2 ) , v 2 ) = 0 and Δ H ( t 2 , v 2 ) < 0 , then g ˙ ( x ( t 1 ) , v 1 ) 0 ,
(iii)
if g ˙ ( x ( t 1 ) , v 1 ) < 0 and Δ H ( t 2 , v 2 ) < 0 , then g ˙ ( x ( t 2 ) , v 2 ) > 0 and
Δ H ( t 1 , v 1 ) g ˙ ( x ( t 1 ) , v 1 ) Δ H ( t 2 , v 2 ) g ˙ ( x ( t 2 ) , v 2 ) .
Proof. 
Let first t 1 < t 2 . Suppose, contrary to (i), that g ˙ ( x ( t 1 ) , v 1 ) < 0 , Δ H ( t 1 , v 1 ) = 0 and Δ H ( t 2 , v 2 ) < 0 . From Corollary 1, g ˙ ( x ( t 2 ) , v 2 ) 0 . By Lemma 4, this contradicts the assumption that u is optimal. The implication (ii) is similarly proved. Let g ˙ ( x ( t 2 ) , v 2 ) = 0 , Δ H ( t 2 , v 2 ) < 0 and g ˙ ( x ( t 1 ) , v 1 ) < 0 . By Corollary 1, Δ H ( t 1 , v 1 ) 0 and the assumptions of Lemma 4 are fulfilled (with τ 1 : = t 1 and τ 2 : = t 2 ). To prove (iii), assume that g ˙ ( x ( t 1 ) , v 1 ) < 0 and Δ H ( t 2 , v 2 ) < 0 . It follows from Corollary 1 that Δ H ( t 1 , v 1 ) 0 and g ˙ ( x ( t 2 ) , v 2 ) 0 . If g ˙ ( x ( t 2 ) , v 2 ) = 0 , the assumptions of Lemma 4 hold. If g ˙ ( x ( t 2 ) , v 2 ) > 0 , the inequality opposite to (19), that is (20), is true.
Let now t 1 = t 2 = τ 1 . The proof goes similarly, however, we additionally have to use a simple observation (rc): the functions t g ˙ ( x ( t ) , v ) and t Δ H ( t , v ) are right-continuous in [ 0 , T [ for every v U . Let g ˙ ( x ( τ 1 ) , v 1 ) < 0 , Δ H ( τ 1 , v 1 ) = 0 and Δ H ( τ 1 , v 2 ) < 0 . By virtue of (rc) and Corollary 1, there is a τ 2 > τ 1 such that Δ H ( τ 2 , v 2 ) < 0 and g ˙ ( x ( τ 2 ) , v 2 ) 0 . Lemma 4 then gives a contradiction. To prove (ii), assume g ˙ ( x ( τ 1 ) , v 2 ) = 0 , Δ H ( τ 1 , v 2 ) < 0 and g ˙ ( x ( τ 1 ) , v 1 ) < 0 . By (rc) and Corollary 1, Δ H ( τ 1 , v 1 ) 0 and there is a τ ^ θ , τ ^ > τ 1 , such that Δ H ( τ 2 , v 2 ) < 0 and g ˙ ( x ( τ 2 ) , v 2 ) 0 for every τ 2 ] τ 1 , τ ^ ] . If g ˙ ( x ( τ 2 ) , v 2 ) = 0 for some τ 2 ] τ 1 , τ ^ ] , Lemma 4 again yields a contradiction. If g ˙ ( x ( τ 2 ) , v 2 ) > 0 for every τ 2 ] τ 1 , τ ^ ] , then (19) holds for every τ 2 > τ 1 sufficiently close to τ 1 , since g ˙ ( x ( τ 2 ) , v 2 ) 0 as τ 2 τ 1 + , and so Lemma 4 gives a contradiction. We shall now prove (iii). Let g ˙ ( x ( τ 1 ) , v 1 ) < 0 and Δ H ( τ 1 , v 2 ) < 0 . It follows from (rc) and Corollary 1 that Δ H ( τ 1 , v 1 ) 0 and there is a τ ^ θ , τ ^ > τ 1 , such that Δ H ( τ 2 , v 2 ) < 0 and g ˙ ( x ( τ 2 ) , v 2 ) 0 for every τ 2 ] τ 1 , τ ^ ] . If g ˙ ( x ( τ 2 ) , v 2 ) = 0 for some τ 2 ] τ 1 , τ ^ ] , a contradiction follows from Lemma 4. Similarly, Lemma 4 gives a contradiction if for some τ 2 ] τ 1 , τ ^ ] the relationships g ˙ ( x ( τ 2 ) , v 2 ) > 0 and (19) are fulfilled. In consequence, the inequalities g ˙ ( x ( τ 2 ) , v 2 ) > 0 and (20) with t 1 : = τ 1 and t 2 : = τ 2 hold true for every τ 2 ] τ 1 , τ ^ ] . By (rc), Δ H ( τ 2 , v 2 ) Δ H ( τ 1 , v 2 ) < 0 and g ˙ ( x ( τ 2 ) , v 2 ) g ˙ ( x ( τ 1 ) , v 2 ) 0 as τ 2 τ 1 + .
If g ˙ ( x ( τ 1 ) , v 2 ) = 0 , then (19) is true for all τ 2 > τ 1 , sufficiently close to τ 1 . We have thus come to a contradiction. Hence g ˙ ( x ( τ 1 ) , v 2 ) > 0 , and the inequality (20) holds by virtue of (rc). □

5. A Geometrical Interpretation and a Minimum Condition

Let u be a verifiable control with a boundary interval θ . The corresponding state and adjoint trajectories are denoted by x and ψ , respectively. Define a family of sets
C t = { y R 2 : y 1 = g ˙ ( x ( t ) , v ) , y 2 = Δ H ( t , v ) , v U } ,   t θ .
It readily follows from this definition that 0 C t for every t θ . In the sequel we implicitly assume that | C t | > 1 .
We shall now characterize the properties of the sets C t which result from control optimality. For an arbitrary nonzero vector y R 2 , define arg y as the angle between col ( 1 , 0 ) and y, measured anticlockwise and taking values in the interval ] π , π ] . Let also
ϕ min ( t ) = inf { arg y : y C t \ { 0 } } ,   ϕ max ( t ) = sup { arg y : y C t \ { 0 } }
for every t θ . Corollary 1 says that if u is optimal, then C t has no points in quadrant III of the coordinate system y 1 y 2 . The following theorem is a straightforward consequence of that corollary and of Theorem 2.
Theorem 3.
Assume that the control u is optimal. Then
(i)
1 2 π ϕ min ( t ) ϕ max ( t ) π for every t θ ,
(ii)
ϕ max ( t 1 ) ϕ min ( t 2 ) π for every pair t 1 , t 2 θ such that t 1 t 2 .
From this it easily follows that if the control u is optimal and ϕ max ( t ) = ϕ min ( t ) + π for every t θ , then 1 2 π ϕ max ( t ) π for every t θ , and the function ϕ max is nondecreasing in θ .
It proves useful to describe the consequences of control optimality in terms of the straight lines supporting the sets C t at zero. This allows easier verification of the necessary conditions of optimality, and also expressing a partial optimality criterion as a minimum condition imposed on the extended pre-Hamiltonian. We say that a straight line is a supporting line of C t at the origin (SLO) if it is given by ρ T y = 0 with ρ , y R 2 , ρ 0 , and ρ T y 0 for every y C t . Generally, the set C t may have many SLOs, whether the control is optimal or not. If u is optimal, then every set C t , t θ , has an SLO with ρ 0 . The set C t has a unique SLO if and only if ϕ max ( t ) = ϕ min ( t ) + π .
The equality ϕ max ( t ) = ϕ min ( t ) + π occurs in two practically important situations (mutually nonexclusive). One of them, in which the right-hand side of the system equation (1) is affine in control, will be discussed in Section 7. Here we consider the other situation, in which C t has a tangent at the origin. A sufficient condition for that reads
u ( t ) int U   and   | 2 g ˙ ( x ( t ) , u ( t ) ) | + | 2 Δ H ( t , u ( t ) ) | > 0 .
Under this condition, the tangent has the equation ρ T y = 0 with
ρ 1 = 2 Δ H ( t , u ( t ) ) , ρ 2 = 2 g ˙ ( x ( t ) , u ( t ) ) .
Of course, if C t has both an SLO and a tangent at the origin, they coincide.
Suppose u is optimal and ϕ max ( t ) = ϕ min ( t ) + π for every t θ . Then every set C t , t θ , has a unique SLO. The SLO is vertical if ϕ max ( t ) = 1 2 π ; if ϕ max ( t ) > 1 2 π , the SLO equation may be written as y 2 = p ( t ) y 1 with a nonpositive directional coefficient p ( t ) = tan ϕ max ( t ) . If, additionally, the condition (21) is fulfilled with 2 g ˙ ( x ( t ) , u ( t ) ) 0 , then
p ( t ) = lim v u ( t ) v u ( t ) Δ H ( t , v ) g ˙ ( x ( t ) , v ) = 2 Δ H ( t , u ( t ) ) 2 g ˙ ( x ( t ) , u ( t ) ) = 3 H ( ψ ( t ) , x ( t ) , u ( t ) ) 2 g ˙ ( x ( t ) , u ( t ) ) .
The function p thus defined is nondecreasing in all that part of θ where it is determined.
Define the extended pre-Hamiltonian H ^ ( ψ , p , x , v ) = ψ T f ( x , v ) p g ˙ ( x , v ) . If the control u is optimal and the function p is determined as above in all the interval θ , then the following minimum condition is straightforward by the properties of SLO
H ^ ( ψ ( t ) , p ( t ) , x ( t ) , u ( t ) ) H ^ ( ψ ( t ) , p ( t ) , x ( t ) , v )   v U   t θ .
This necessary optimality condition is similar to the minimum condition of indirect adjoining. We postpone a discussion of relations with the classical results to Section 9.

6. Example 1

In this example we apply the above necessary conditions to verify optimality of two controls, the first of which is optimal, and the second is not. We show that the nonoptimality is easily detected. The control system is described by state equations
x ˙ 1 = 2 1 2 x 1 + ( x 1 2 ) x 2 + a u ( b u ) ,   x ˙ 2 = u ,
with the initial conditions x 1 ( 0 ) = x 2 ( 0 ) = 1 . The set of admissible control values consists of three elements, U = { 1 , 0 , 1 } . The state is subject to a pathwise constraint g ( x ) = x 2 1 0 . The cost to be minimized is given by Q ( u ) = 1 2 ( x 1 ( T ) 6 ) 2 + 1 2 x 2 ( T ) 2 . We take a = 0.125 , b = 1.025 , T = 4 .
Let u be a verifiable control, and x and ψ , respectively, the corresponding state trajectory and adjoint function. Let us write the pre-Hamiltonian
H ( ψ , x , u ) = ψ 1 ( 2 1 2 x 1 + ( x 1 2 ) x 2 + a u ( b u ) ) + ψ 2 u
and the adjoint equations in nonboundary intervals of time
ψ ˙ 1 = ( 1 2 x 2 ) ψ 1 ,   ψ ˙ 2 = ( 2 x 1 ) ψ 1 .
The adjoints satisfy the final conditions ψ 1 ( T ) = x 1 ( T ) 6 , ψ 2 ( T ) = x 2 ( T ) . As g ˙ ( x , u ) = u , we have w ( x ) = 0 . In consequence, the state and adjoint equations in the boundary intervals take the form
x ˙ 1 = 1 2 x 1 ,   x ˙ 2 = 0
ψ ˙ 1 = 1 2 ψ 1 ,   ψ ˙ 2 = ( 2 x 1 ) ψ 1 .
To determine the behavior of the adjoint function at entry points, we calculate the matrix (9)
Z ( t en ) = [ 1 0 a ( u ( t en ) b ) 0 ] .
Hence by (13), ψ 1 ( t en ) = ψ 1 ( t en + ) and ψ 2 ( t en ) = a ( u ( t en ) b ) ψ 1 ( t en + ) . In accordance with (14), Δ H ( t , v ) = ( a b ψ 1 ( t ) + ψ 2 ( t ) ) v a ψ 1 ( t ) v 2 in every boundary interval.
It is evident that the nontangentiality conditions (4) are fulfilled at all entry and exit points. The optimality of u should be verified with Theorem 1(i) in the whole interval [ 0 , T ] , and additionally with Theorem 2 or 3 in the boundary intervals. Every set C t introduced in Section 5 consists of three points, C t = { y ( t ) , 0 , z ( t ) } , where y 1 ( t ) = 1 , y 2 ( t ) = Δ H ( t , 1 ) , z 1 ( t ) = + 1 , and z 2 ( t ) = Δ H ( t , + 1 ) . If the control u is optimal, then it follows from part (i) of Theorem 3 that y 2 ( t ) 0 t θ , and from part (ii), that y 2 ( t 1 ) z 2 ( t 2 ) for every pair t 1 , t 2 θ such that t 1 t 2 . By Lemmas 2 and 4, u is nonoptimal if y 2 ( t ) < 0 for some t θ or y 2 ( t 1 ) > z 2 ( t 2 ) for some t 1 , t 2 θ , t 1 t 2 .
Example 1a.
A numerically computed approximation of optimal control and optimal state trajectory is presented in Figure 1. The control has discontinuities at s 1 = 0.49483839 , s 2 = 0.99973751 , s 3 = 1.4945759 and s 4 = 3.1366809 . Figure 2 shows the corresponding adjoint trajectory. Let us verify the necessary conditions of optimality. Figure 3 shows that the condition of Theorem 1(i) is fulfilled. In the boundary interval θ = [ s 3 , s 4 [ , we additionally have to verify the conditions of Theorem 2 or 3. It can be seen in Figure 3 that Δ H ( t , 1 ) > 0 for all t θ . Thus, implications (i) and (ii) of Theorem 2 are vacuously true for all v 1 , v 2 , t 1 , t 2 satisfying the assumptions of the theorem, and so is (iii) except the case where v 1 = 1 , v 2 = 1 and Δ H ( t 2 , 1 ) < 0 . In that case, g ˙ ( x ( t 2 ) , v 2 ) = 1 and (20) reads Δ H ( t 1 , 1 ) Δ H ( t 2 , 1 ) . As can be checked by inspection, (20) holds for all t 1 , t 2 θ , t 1 t 2 , and so (iii) is true. Alternatively and equivalently, we can use Theorem 3. We see in Figure 4 that 1 2 π < ϕ min ( t ) < ϕ max ( t ) and ϕ max ( t ) π < 0 for every t θ , then conclusion (i) of Theorem 3 is true. It can be also seen that ϕ max ( t 1 ) π < ϕ min ( t 2 ) for every t 1 θ and t 2 [ t 1 , s 4 [ , and so conclusion (ii) holds too. Thus, the necessary optimality conditions of Theorems 1, 2 and 3 are satisfied.
Example 1b.
Consider a nonoptimal control
u ( t ) = { 0 , 0 t < s 1 1 , s 1 t T ,
where s 1 = 3.2429037 . It is plotted in Figure 5 together with the corresponding state trajectory. The adjoint function is depicted in Figure 6. As follows from Figure 7, the necessary optimality condition of Theorem 1(i) is satisfied and in consequence, there are no one-spike variations described in Section 2 which guarantee an improvement of the cost. Let us now check the conditions of Theorem 3 in the boundary interval θ = [ 0 , s 1 [ . To this end we define ϕ min ( t ) = inf { ϕ min ( s ) : t < s s 1 } and ϕ max ( t ) = sup { ϕ max ( s ) : 0 s < t } for t θ . The inequalities ϕ min ( t ) ϕ max ( t ) π in conclusion (i) of Theorem 3 directly follow from the definitions. Figure 8 shows that ϕ min ( t ) > 1 2 π , and the more so ϕ min ( t ) > 1 2 π for every t θ . Let us rewrite conclusion (ii) of the theorem in an equivalent form, ϕ max ( t ) π ϕ min ( t ) t θ . Figure 8 shows that this inequality holds only in [ t , s 1 [ , with t > 0 . This proves that the control u is not optimal and there are two-spike variations in the boundary interval (defined in Section 4) which yield a cost reduction for any sufficiently small positive value of the parameter ε . A closer analysis of the conditions of Lemma 4 shows that the difference τ 2 τ 1 , that is, the distance between the spikes in such a variation cannot be arbitrarily small.

7. The Control Affine Case

Consider the system (1) with the function f affine in control, f ( x , u ) = a ( x ) + b ( x ) u . Many of the results obtained so far may then be significantly simplified, or even strengthened. In this section, u stands for a certain verifiable control, x for the corresponding state trajectory, and ψ for the corresponding adjoint. We also denote
α 1 ( t ) = g ( x ( t ) ) T b ( x ( t ) ) ,   α 2 ( t ) = ψ ( t ) T b ( x ( t ) ) .
In consequence we have Δ H ( t , v ) = α 2 ( t ) ( v u ( t ) ) , where t [ 0 , T ] and v U . The formula (3) in every boundary interval θ of u may be written as g ˙ ( x ( t ) , v ) = α 1 ( t ) ( v u ( t ) ) , for t θ and v U . The equality (9) is simplified to
Z ( t en ) = I g ( x ( t en ) ) b ( x ( t en ) ) T α 1 ( t en ) .
It follows from (13) that the left-hand limit of the switching function α 2 equals zero at every entry point t en , α 2 ( t en ) = 0 . If the control u is optimal, then α 2 vanishes at every exit point t ex , α 2 ( t ex ) = 0 . Indeed, α 2 ( t ex ) u ( t ex ) = α 2 ( t ex ) u ( t ex ) by Theorem 1(ii), and u ( t ex ) u ( t ex ) by (4).
We shall now formulate the results of Section 3 for the control affine case, beginning with Lemma 2.
Lemma 5.
Assume that τ [ 0 , T [ , v U τ , and α 2 ( τ ) ( v u ( τ ) ) < 0 . Then for every sufficient-ly small ε > 0 , the control u ε defined inSection 2is admissible and Q ( u ε ) < Q ( u ) .
Theorem 1(i) takes the following form.
Theorem 4.
Assume that the control u is optimal. Then α 2 ( t ) ( v u ( t ) ) 0 for every t [ 0 , T ] and every v U t .
Corollary 2.
Assume that u is optimal and t [ 0 , T ] . Then the following implications hold:
(i)
if ( g ( x ( t ) ) < 0   a n d   α 2 ( t ) > 0 ) or ( t Θ u , α 1 ( t ) > 0   a n d   α 2 ( t ) > 0 ) , then min U exists and u ( t ) = min U ,
(ii)
if ( g ( x ( t ) ) < 0   a n d   α 2 ( t ) < 0 ) or ( t Θ u , α 1 ( t ) < 0   a n d   α 2 ( t ) < 0 ) , then max U exists and u ( t ) = max U .
From here till the end of this section, u is a verifiable control with a boundary interval θ . Let us pass to the results of Section 4. For all t [ 0 , T ] such that α 1 ( t ) 0 , define
p ( t ) = α 2 ( t ) α 1 ( t ) .
Note that this is an extension of the function p given by (22). The following lemma is an immediate consequence of Lemma 4.
Lemma 6.
Assume that τ 1 , τ 2 θ , τ 1 < τ 2 , v 1 , v 2 U , and
α 1 ( τ 1 ) ( v 1 u ( τ 1 ) ) < 0 ,   α 2 ( τ 1 ) ( v 1 u ( τ 1 ) ) 0
α 1 ( τ 2 ) ( v 2 u ( τ 2 ) ) 0 ,   α 2 ( τ 2 ) ( v 2 u ( τ 2 ) ) < 0 .
Let also p ( τ 1 ) > p ( τ 2 ) if α 1 ( τ 2 ) 0 . Then there is an η > 0 , such that for every sufficiently small ε > 0 the control u ε defined inSection 4is admissible and Q ( u ε ) < Q ( u ) .
The question arises how to choose η in the construction of u ε under the assumptions of Lemma 6. It follows from the proof of Lemma 4 that if α 1 ( τ 2 ) = 0 , then η may be any positive number, whereas if α 1 ( τ 2 ) 0 , then η 1 < η < η 2 with
η 1 = α 2 ( τ 1 ) ( v 1 u ( τ 1 ) ) α 2 ( τ 2 ) ( v 2 u ( τ 2 ) ) ,   η 2 = α 1 ( τ 1 ) ( v 1 u ( τ 1 ) ) α 1 ( τ 2 ) ( v 2 u ( τ 2 ) )
If the control u has nonextremal values in the boundary interval θ , a simple consequence follows from Lemma 6.
Corollary 3.
Assume that v < u ( t ) < v ^ and α 1 ( t ) α 2 ( t ) < 0 for some v , v ^ U and every t θ . Let also the function p be strictly decreasing in θ . Then there exist τ 1 , τ 2 θ , v 1 , v 2 U and η > 0 , such that the control u ε defined inSection 4is admissible and Q ( u ε ) < Q ( u ) for every sufficiently small ε > 0 .
The following theorem is a straightforward consequence of Theorem 2.
Theorem 5.
Assume that the control u is optimal, t 1 , t 2 θ , t 1 t 2 , and v 1 , v 2 U . Under these assumptions:
(i)
if α 1 ( t 1 ) ( v 1 u ( t 1 ) ) < 0 and α 2 ( t 1 ) = 0 , then α 2 ( t 2 ) ( v 2 u ( t 2 ) ) 0 ,
(ii)
if α 1 ( t 2 ) = 0 and α 2 ( t 2 ) ( v 2 u ( t 2 ) ) < 0 , then α 1 ( t 1 ) ( v 1 u ( t 1 ) ) 0 ,
(iii)
if α 1 ( t 1 ) ( v 1 u ( t 1 ) ) < 0 and α 2 ( t 2 ) ( v 2 u ( t 2 ) ) < 0 , then α 1 ( t 2 ) 0 and p ( t 1 ) p ( t 2 ) < 0 .
Corollary 4.
Assume that u is optimal, v 1 , v 2 U , α 1 ( t ) ( v 1 u ( t ) ) < 0 and α 2 ( t ) ( v 2 u ( t ) ) < 0 for every t θ . Then the function p is negative and nondecreasing in θ .
The analysis of Section 5 applied to the control affine case leads to the following conclusions. Every set C t is included in a certain straight line in R 2 , passing through the origin. If α 1 ( t ) 2 + α 2 ( t ) 2 > 0 , this line has parametric equations y 1 ( s ) = α 1 ( t ) s , y 2 ( s ) = α 2 ( t ) s , s R . If | C t | = 2 , then ϕ max ( t ) = ϕ min ( t ) , and if | C t | > 2 , then either ϕ max ( t ) = ϕ min ( t ) + π or ϕ max ( t ) = ϕ min ( t ) . Theorem 3 remains unchanged.
Suppose that the control u is optimal. We then have by Theorem 3 that for every t θ the set C t has an SLO given by ρ T y = 0 with ρ 0 . If α 1 ( t ) 2 + α 2 ( t ) 2 > 0 , we can put ρ 1 = | α 2 ( t ) | and ρ 2 = | α 1 ( t ) | . Let us now assume that for every t θ there are v , v ^ U such that v < u ( t ) < v ^ , and in consequence ϕ max ( t ) = ϕ min ( t ) + π . Let also 1 2 π < ϕ max ( t ) < π . It then follows from the reasoning in Section 5 that the equality y 2 = p ( t ) y 1 holds for every t θ and every y C t , with the function p (25) negative and nondecreasing in the interval θ .
Finally, note that the minimum condition on the extended pre-Hamiltonian (23) is trivially satisfied with equality (independently of whether the control u is optimal or not).

8. Example 2: The Pendulum on a Cart

We shall now consider a problem with the right-hand side of the state Equation (1) affine in control. The system is described by state equations
x ˙ 1 = x 3
x ˙ 2 = x 4
x ˙ 3 = f 3 ( x , u ) = u x 4 2 sin x 2 + sin x 2 cos x 2 1 + sin 2 x 2
x ˙ 4 = f 4 ( x , u ) = ( u x 4 2 sin x 2 ) cos x 2 + 2 sin x 2 1 + sin 2 x 2 .
The initial state x ( 0 ) = x 0 and the time horizon T are fixed. The performance index
Q ( u ) = 1 2 x ( T ) T x ( T )
is minimized subject to control bounds and a pathwise state constraint
u min u ( t ) u max ,   g ( x ( t ) ) = x 3 ( t ) x 3 max 0 ,   t [ 0 , T ] .
We write the pre-Hamiltonian
H = ψ 1 x 3 + ψ 2 x 4 + ψ 3 f 3 + ψ 4 f 4
and the adjoint equations in the nonboundary time intervals
ψ ˙ 1 = 0 ψ ˙ 2 = ψ 3 f 3 x 2 ψ 4 f 4 x 2 ψ ˙ 3 = ψ 1 ψ ˙ 4 = ψ 2 + 2 x 4 sin x 2 ( ψ 3 + ψ 4 cos x 2 ) 1 + sin 2 x 2 ,
where
f 3 x 2 = cos 2 x 2 x 4 2 cos x 2 f 3 sin 2 x 2 1 + sin 2 x 2
f 4 x 2 = 2 cos x 2 u sin x 2 x 4 2 cos 2 x 2 f 4 sin 2 x 2 1 + sin 2 x 2 .
The adjoint function satisfies the final condition ψ ( T ) = x ( T ) . The state equations in the bound-ary intervals are obtained by the substitution u = w ( x ) = ( x 4 2 cos x 2 ) sin x 2 in (27), which gives
x ˙ 1 = x 3 ,   x ˙ 2 = x 4 ,   x ˙ 3 = 0 ,   x ˙ 4 = sin x 2 .
Hence the pre-Hamiltonian and the adjoint equations in the boundary intervals read
H = ψ 1 x 3 + ψ 2 x 4 + ψ 4 sin x 2
ψ ˙ 1 = 0 ,   ψ ˙ 2 = ψ 4 cos x 2 ,   ψ ˙ 3 = ψ 1 ,   ψ ˙ 4 = ψ 2 .
At every entry point t en the jump condition (13) is valid with the matrix (24), whence ψ i ( t en ) = ψ i ( t en + ) , i = 1 , 2 , 4 , ψ 3 ( t en ) = cos x 2 ( t en ) ψ 4 ( t en + ) . We further compute
α 1 ( t ) = ( 1 + sin 2 x 2 ( t ) ) 1 ,
α 2 ( t ) = ( ψ 3 ( t ) + ψ 4 ( t ) cos x 2 ( t ) ) ( 1 + sin 2 x 2 ( t ) ) 1 ,
and from (25), p ( t ) = ψ 3 ( t ) + ψ 4 ( t ) cos x 2 ( t ) for every t [ 0 , T ] . Note that α 1 ( t ) is always positive, and p ( t ) and α 2 ( t ) have the same sign.
Assume that the control u is optimal. It follows from Corollary 2 that for every t in any nonboundary interval of u
u ( t ) = { u min , α 2 ( t ) > 0 u max , α 2 ( t ) < 0 .
Let now θ be a boundary interval of u. We infer from Corollary 2 that if t θ , then u ( t ) = u min or α 2 ( t ) 0 . If these relations are not satisfied at some t θ , then the control u can be improved in accordance with Lemma 5, by means of a spike control variation described in Section 2. We deduce from Theorem 5 that if t 1 , t 2 θ , t 1 t 2 , and u ( t 1 ) > u min , then
(i)
u ( t 2 ) = u max if α 2 ( t 1 ) = 0 and α 2 ( t 2 ) < 0 ,
(ii)
u ( t 2 ) = u min if α 2 ( t 1 ) = 0 and α 2 ( t 2 ) > 0 ,
(iii)
p ( t 1 ) p ( t 2 ) < 0 if α 2 ( t 2 ) 0 and u min < u ( t 2 ) < u max .
If some of the necessary conditions of Theorem 5 or Corollary 4 are not fulfilled, then—as follows from Lemma 6—the control u can be improved with the use of a two-spike control variation (Section 4).
We shall now numerically analyze two cases, taking x 0 = col ( 0.4 , 3.5 , 1 , 1.1 ) , u min = 4 , u max = 4 , T = 1.5 , and x 3 max = 1 .
Example 2a.
The optimal control in the considered problem is of the form
u ( t ) = { u min ,     0 t < s 1 u max ,     s 1 t < s 2 w ( x ( t ) ) ,    s 2 t < s 3 u min ,     s 3 t T ,
where s 1 = 0.20359164 , s 2 = 0.36709680 , s 3 = 1.1925492 , with Q ( u ) = 2.6850568 . Figure 9 shows the control u, the switching function α 2 , and the function p (25). It is easy to see that the necessary optimality conditions of Theorems 4 and 5 are fulfilled in the whole interval [ 0 , T ] . The optimal state trajectory is depicted in Figure 10. Notice the cusps of x 3 at t en = s 2 and t ex = s 3 , indicating that u satisfies the nontangentiality conditions and is verifiable.
Example 2b.
Consider a verifiable, but nonoptimal control with a boundary interval
u ( t ) = { w ( x ( t ) ) , 0 t < s 1 u min ,    s 1 t T ,   s 1 = 1.1825443
The corresponding value of cost is Q ( u ) = 2.7408438 . Figure 11 presents the control u, the switching function α 2 , and the function p (25). It can be seen that the necessary conditions of Theorem 4 and Corollary 2 are satisfied, which means that there are no one-spike control variations described in Section 2, guaranteeing an improvement of the cost. Figure 12 shows the state trajectory. The plot of x 3 has a cusp at the exit point t ex = s 1 , and so the control u is verifiable. We can also see in Figure 11 that in the time interval [0, 0.2948] the function p is decreasing, hence it is possible to construct a two-spike control variation in that interval (according to Section 4) which reduces the cost. In order to verify this numerically, consider also Figure 13 which presents a contour plot of the difference p ( τ 2 ) p ( τ 1 ) . Let for instance τ 1 = 0 , τ 2 = 0.2948 , v 1 = 4 , v 2 = 4 (red cross on the left y-axis). By (26), the parameter η may have an arbitrary value from the interval ] 0.5410 , 0.7134 [ ; we choose η = 0.713 . Figure 14 demonstrates the dependence of the cost increment on the width of the first spike ε . The greatest improvement takes place at ε 0.073 . For ε = 0.073 , Figure 15 shows the state trajectory, and Figure 16, an enlargement of the plot of x 3 ε .

9. Connections with Some Classical Results

There are essential connections between some of our results presented in Section 5 and Section 7, and certain classical results obtained by the so called indirect adjoining method, dating back to the works of R.V. Gamkrelidze, A.E. Bryson, H. Maurer, D.H. Jacobson, and many others (see [1,3,4,5]). As we have no space to discuss all similarities and analogies that can be found in the vast literature, we shall concentrate on one representative theorem due to H. Maurer [3]. We shall use a reduced version of that theorem, specialized to the case of state constraint of order one, verifiable control, fixed initial state and free final state.
Consider the optimal control problem formulated in Section 1, with the additional assumption that U is a closed interval with nonempty interior. Define
H 1 ( x , u , λ 1 , η 1 ) = ( λ 1 ) T f ( x , u ) + η 1 g ˙ ( x , u ) ,   λ 1 R n ,   η 1 R .
Theorem 6 ([3], Theorem 5.1).
Let u be a verifiable optimal control and x, the corre-sponding state trajectory. Suppose that f and g are of class C 2 , and let 2 g ˙ ( x ( t ) , u ( t ) ) 0 and u ( t ) int   U for every t in any boundary interval. Additionally, assume that there are finitely many entry points. Then there exist a number λ 0 0 and functions λ 1 : [ 0 , T ] R n , η 1 : [ 0 , T ] R such that
λ ˙ 1 = 1 H 1 ( x , u , λ 1 , η 1 ) = 1 f ( x , u ) λ 1 η 1 1 g ˙ ( x , u )
λ 1 ( T ) = λ 0 q ( x ( T ) ) .
The following jump condition holds
λ 1 ( t en + ) = λ 1 ( t en ) β 1 ( t en ) g ( x ( t en ) ) ,   β 1 ( t en ) 0 ,
at every entry point t en , and λ 1 is continuous at every exit point.The function η 1 satisfies η 1 ( t ) g ( x ( t ) ) = 0 on [ 0 , T ] and is a C 1 function in the interior ] t 1 , t 2 [ of every boundary interval, given by
η 1 ( t ) = λ 1 ( t ) T 2 f ( x ( t ) , u ( t ) ) 2 g ˙ ( x ( t ) , u ( t ) ) .
Moreover, η 1 ( t ) 0 and η ˙ 1 ( t ) 0 for t 1 < t < t 2 . It also holds that for a.e. t [ 0 , T ]
min v U H 1 ( x ( t ) , v , λ 1 ( t ) , η 1 ( t ) ) = H 1 ( x ( t ) , u ( t ) , λ 1 ( t ) , η 1 ( t ) ) = c o n s t .
Let us first notice that if λ 1 in (31) is identical with the adjoint ψ , then the multiplier η 1 is equal to the function p given by (22) in Section 5. The function p , similarly to η 1 , is nonnegative and nonincreasing in every boundary interval. The adjoint Equation (28) is then identical with (11) almost everywhere. Indeed, in every boundary interval the Equation (11) takes the form
ψ ˙ = 1 f ( x , w ( x ) ) ψ w ( x ) 2 f ( x , w ( x ) ) T ψ .
By virtue of Section 1 and (22),
w ( x ) = 1 g ˙ ( x , u ) 2 g ˙ ( x , u ) ,   p = ψ T 2 f ( x , u ) 2 g ˙ ( x , u ) .
Hence if η 1 = p , then η 1 1 g ˙ ( x , u ) = w ( x ) 2 f ( x , w ( x ) ) T ψ . The final condition (29) coin-cides with (12) if λ 0 = 1 . This last equality is ensured in [3] by special regularity conditions. Further, it is evident that the jump condition (13) can be written in the form
ψ ( t en ) = ψ ( t en + ) Δ H ( t en , u ( t en ) ) g ˙ ( t en , u ( t en ) ) g ( x ( t en ) ) .
Thus, in this case (30) is identical with (13) if
β 1 ( t en ) = Δ H ( t en , u ( t en ) ) g ˙ ( t en , u ( t en ) ) 0 .
In the control affine case discussed in Section 7 the condition (13) is readily transformed to
ψ ( t en ) = ψ ( t en + ) p ( t en + ) g ( x ( t en ) ) ,
with p determined by (25). Hence, we have β 1 ( t en ) = p ( t en + ) 0 by Corollary 4. We skip the proof of the inequality sign in the general case, which is more complicated. The identity of the adjoints λ 1 and ψ entails the equivalence between the minimum conditions (32) and (23). In conclusion, the results obtained in this work for the case where in the boundary intervals u ( t ) int U , ϕ max ( t ) = ϕ min ( t ) + π and p ( t ) is given by (22) or (25), are in agreement with Theorem 5.1 in [3].
Finally, note that this work’s approach does not require that the optimal control in the boundary intervals takes values in the interior of U, whereas that assumption is essential in [3]. Also, in contrast to [3], we give an explicit representation of the jump of the adjoint function (Section 3, see also [11,12]).

Author Contributions

Conceptualization, methodology, investigation, writing—A.K. and M.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data sharing not applicable.

Acknowledgments

The authors thank the two anonymous reviewers for their comments that helped to improve the paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Pontryagin, L.S.; Boltyanskii, V.G.; Gamkrelidze, R.V.; Mishchenko, E.F. The Mathematical Theory of Optimal Processes; Nauka: Moscow, Russia, 1961; (in Russian, first English language edition: Wiley & Sons, Inc., New York, 1962). [Google Scholar]
  2. Karamzin, D.; Pereira, F.L. On a Few Questions Regarding the Study of State-Constrained Problems in Optimal Control. J. Optimiz. Theory App. 2019, 180, 235–255. [Google Scholar] [CrossRef]
  3. Maurer, H. On the Minimum Principle for Optimal Control Problems with State Constraints; Universität Münster: Münster, Germany, 1979. [Google Scholar]
  4. Hartl, R.F.; Sethi, S.P.; Vickson, R.G. A survey of the maximum principles for optimal control problems with state constraints. SIAM Rev. 1995, 37, 181–218. [Google Scholar] [CrossRef]
  5. Arutyunov, A.V.; Karamzin, D.Y.; Pereira, F.L. The maximum principle for optimal control problems with state constraints by R.V. Gamkrelidze: Revisited. J. Optimiz. Theory Appl. 2011, 149, 474–493. [Google Scholar] [CrossRef]
  6. Bonnans, J.F. Course on Optimal Control. Part I: The Pontryagin approach (Version of 21 August 2019). Available online: http://www.cmap.polytechnique.fr/~bonnans/notes/oc/ocbook.pdf (accessed on 30 December 2020).
  7. Bourdin, L. Note on Pontryagin Maximum Principle with Running State Constraints and Smooth Dynamics—Proof based on the Ekeland Variational Principle; University of Limoges: Limoges, France, 2016; Available online: https://arxiv.org/pdf/1604.04051v1.pdf (accessed on 30 December 2020).
  8. Dmitruk, A.; Samylovskiy, I. On the relation between two approaches to necessary optimality conditions in problems with state constraints. J. Optimiz. Theory Appl. 2017, 173, 391–420. [Google Scholar] [CrossRef]
  9. Vinter, R. Optimal Control; Birkhäuser: Boston, MA, USA, 2000. [Google Scholar]
  10. Korytowski, A.; Szymkat, M. On convergence of the Monotone Structural Evolution. Control Cybern. 2016, 45, 483–512. [Google Scholar]
  11. Bonnans, J.F. The shooting approach to optimal control problems. IFAC Proc. Vol. 2013, 46, 281–292. [Google Scholar] [CrossRef] [Green Version]
  12. Bonnans, J.F.; Hermant, A. Well-posedness of the shooting algorithm for state constrained optimal control problems with a single constraint and control. SIAM J. Control Optim. 2007, 46, 1398–1430. [Google Scholar] [CrossRef] [Green Version]
  13. Chertovskih, R.; Karamzin, D.; Khalil, N.T.; Pereira, F.L. Regular path-constrained time-optimal control problems in three-dimensional flow fields. Eur. J. Control 2020, 56, 98–106. [Google Scholar] [CrossRef] [Green Version]
  14. Cortez, K.; de Pinho, M.R.; Matos, A. Necessary conditions for a class of optimal multiprocess with state constraints. Int. J. Robust Nonlinear Control 2020, 30, 6021–6041. [Google Scholar] [CrossRef]
1
PC(0,T; U) is the space of all functions [0,T] → U which have a finite number of discontinuities, are right-continuous in [0,T[, left-continuous at T, and have a finite left-hand limit at every point.
2
Controls leading to state trajectories with boundary touch points are not verifiable.
Figure 1. Optimal control (left scale) and optimal state trajectory (right scale).
Figure 1. Optimal control (left scale) and optimal state trajectory (right scale).
Games 12 00009 g001
Figure 2. Adjoint trajectory.
Figure 2. Adjoint trajectory.
Games 12 00009 g002
Figure 3. Verifying conditions of Theorems 1 and 2.
Figure 3. Verifying conditions of Theorems 1 and 2.
Games 12 00009 g003
Figure 4. Verifying the conditions of Theorem 3.
Figure 4. Verifying the conditions of Theorem 3.
Games 12 00009 g004
Figure 5. Control (left scale) and state trajectory (right scale).
Figure 5. Control (left scale) and state trajectory (right scale).
Games 12 00009 g005
Figure 6. Adjoint trajectory.
Figure 6. Adjoint trajectory.
Games 12 00009 g006
Figure 7. Verifying the condition of Theorem 1(i).
Figure 7. Verifying the condition of Theorem 1(i).
Games 12 00009 g007
Figure 8. Verifying the conditions of Theorem 3.
Figure 8. Verifying the conditions of Theorem 3.
Games 12 00009 g008
Figure 9. Optimal control (left scale), switching function and p (right scale).
Figure 9. Optimal control (left scale), switching function and p (right scale).
Games 12 00009 g009
Figure 10. Optimal state trajectory.
Figure 10. Optimal state trajectory.
Games 12 00009 g010
Figure 11. Control (left scale), switching function and p (right scale).
Figure 11. Control (left scale), switching function and p (right scale).
Games 12 00009 g011
Figure 12. State trajectory.
Figure 12. State trajectory.
Games 12 00009 g012
Figure 13. Contour plot of p ( τ 2 ) p ( τ 1 ) .
Figure 13. Contour plot of p ( τ 2 ) p ( τ 1 ) .
Games 12 00009 g013
Figure 14. Cost increment vs. width of first spike.
Figure 14. Cost increment vs. width of first spike.
Games 12 00009 g014
Figure 15. State trajectory x ε .
Figure 15. State trajectory x ε .
Games 12 00009 g015
Figure 16. Blow-up of x 3 ε .
Figure 16. Blow-up of x 3 ε .
Games 12 00009 g016
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Korytowski, A.; Szymkat, M. Necessary Optimality Conditions for a Class of Control Problems with State Constraint. Games 2021, 12, 9. https://doi.org/10.3390/g12010009

AMA Style

Korytowski A, Szymkat M. Necessary Optimality Conditions for a Class of Control Problems with State Constraint. Games. 2021; 12(1):9. https://doi.org/10.3390/g12010009

Chicago/Turabian Style

Korytowski, Adam, and Maciej Szymkat. 2021. "Necessary Optimality Conditions for a Class of Control Problems with State Constraint" Games 12, no. 1: 9. https://doi.org/10.3390/g12010009

APA Style

Korytowski, A., & Szymkat, M. (2021). Necessary Optimality Conditions for a Class of Control Problems with State Constraint. Games, 12(1), 9. https://doi.org/10.3390/g12010009

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop