Weapon target assignment (WTA) is a typical problem in the command and control of modern warfare. Despite the significance of the problem, traditional algorithms still have shortcomings in terms of efficiency, solution quality, and generalization. This paper presents a novel multi-objective evolutionary optimization algorithm (MOEA) that integrates a deep Q-network (DQN)-based adaptive mutation operator and a greedy-based crossover operator, designed to enhance the solution quality for the multi-objective WTA (MO-WTA). Our approach (NSGA-DRL) evolves NSGA-II by embedding these operators to strike a balance between exploration and exploitation. The DQN-based adaptive mutation operator is developed for predicting high-quality solutions, thereby improving the exploration process and maintaining diversity within the population. In parallel, the greedy-based crossover operator employs domain knowledge to minimize ineffective searches, focusing on exploitation and expediting convergence. Ablation studies revealed that our proposed operators significantly boost the algorithm performance. In particular, the DQN mutation operator shows its predictive effectiveness in identifying candidate solutions. The proposed NSGA-DRL outperforms state-and-art MOEAs in solving MO-WTA problems by generating high-quality solutions.
Citation: Shiqi Zou, Xiaoping Shi, Shenmin Song. MOEA with adaptive operator based on reinforcement learning for weapon target assignment[J]. Electronic Research Archive, 2024, 32(3): 1498-1532. doi: 10.3934/era.2024069
[1] | Yanfang Li, Yanmin Liu, Xianghu Liu, He Jun . On the approximate controllability for some impulsive fractional evolution hemivariational inequalities. AIMS Mathematics, 2017, 2(3): 422-436. doi: 10.3934/Math.2017.3.422 |
[2] | Ebrahem A. Algehyne, Abdur Raheem, Mohd Adnan, Asma Afreen, Ahmed Alamer . A study of nonlocal fractional delay differential equations with hemivariational inequality. AIMS Mathematics, 2023, 8(6): 13073-13087. doi: 10.3934/math.2023659 |
[3] | Yongwei Jia . Approximate controllability of evolution hemivariational inequalities under nonlocal conditions. AIMS Mathematics, 2025, 10(2): 3581-3596. doi: 10.3934/math.2025165 |
[4] | Yan Ning, Daowei Lu . A critical point theorem for a class of non-differentiable functionals with applications. AIMS Mathematics, 2020, 5(5): 4466-4481. doi: 10.3934/math.2020287 |
[5] | Chunli You, Linxin Shu, Xiao-bao Shu . Approximate controllability of second-order neutral stochastic differential evolution systems with random impulsive effect and state-dependent delay. AIMS Mathematics, 2024, 9(10): 28906-28930. doi: 10.3934/math.20241403 |
[6] | Ramkumar Kasinathan, Ravikumar Kasinathan, Dumitru Baleanu, Anguraj Annamalai . Well posedness of second-order impulsive fractional neutral stochastic differential equations. AIMS Mathematics, 2021, 6(9): 9222-9235. doi: 10.3934/math.2021536 |
[7] | Qi Wang, Chenxi Xie, Qianqian Deng, Yuting Hu . Controllability results of neutral Caputo fractional functional differential equations. AIMS Mathematics, 2023, 8(12): 30353-30373. doi: 10.3934/math.20231550 |
[8] | Rajesh Dhayal, Muslim Malik, Syed Abbas . Solvability and optimal controls of non-instantaneous impulsive stochastic neutral integro-differential equation driven by fractional Brownian motion. AIMS Mathematics, 2019, 4(3): 663-683. doi: 10.3934/math.2019.3.663 |
[9] | Chengbo Yi, Rui Guo, Jiayi Cai, Xiaohu Yan . Pinning synchronization of dynamical neural networks with hybrid delays via event-triggered impulsive control. AIMS Mathematics, 2023, 8(10): 25060-25078. doi: 10.3934/math.20231279 |
[10] | Gokula Nanda Chhatria . On oscillatory second order impulsive neutral difference equations. AIMS Mathematics, 2020, 5(3): 2433-2447. doi: 10.3934/math.2020161 |
Weapon target assignment (WTA) is a typical problem in the command and control of modern warfare. Despite the significance of the problem, traditional algorithms still have shortcomings in terms of efficiency, solution quality, and generalization. This paper presents a novel multi-objective evolutionary optimization algorithm (MOEA) that integrates a deep Q-network (DQN)-based adaptive mutation operator and a greedy-based crossover operator, designed to enhance the solution quality for the multi-objective WTA (MO-WTA). Our approach (NSGA-DRL) evolves NSGA-II by embedding these operators to strike a balance between exploration and exploitation. The DQN-based adaptive mutation operator is developed for predicting high-quality solutions, thereby improving the exploration process and maintaining diversity within the population. In parallel, the greedy-based crossover operator employs domain knowledge to minimize ineffective searches, focusing on exploitation and expediting convergence. Ablation studies revealed that our proposed operators significantly boost the algorithm performance. In particular, the DQN mutation operator shows its predictive effectiveness in identifying candidate solutions. The proposed NSGA-DRL outperforms state-and-art MOEAs in solving MO-WTA problems by generating high-quality solutions.
Clarke's subdifferential operator is associated with a type of nonlinear inclusion known as hemivariational inequalities. These inequalities have applications in structural analysis and non-convex optimization. The two main types of inequality problems are variational inequalities and hemivariational inequalities. Hemivariational inequalities handle nonsmooth, nonconvex energy functions, whereas variational inequalities primarily deal with convex energy functions. In 1981, Panagiotopoulos introduced the concept of hemivariational inequality as a method to represent mechanical obstacles. Hemivariational inequalities or subdifferential inclusions can be used to model various nonsmooth contact mechanics issues involving multivalued and nonmonotone constitutive laws with boundary conditions (see [1,2,3]). Since then, numerous researchers have made significant contributions to the field of hemivariational inequalities, as seen in [4,5,6,7,8,9]. Moreover, neutral differential systems with impulsive effects have become a prominent area of research, modeling real-world processes that undergo sudden changes at specific points. This field has far-reaching applications in areas like finance, economics, mechanics, neural networks, electronics, and telecommunications. Notably, the authors of [10] investigated the controllability of nonlocal neutral differential inclusions with impulse effects. Researchers looked at the existence of impulsive multivalued neutral functional differential inclusions [11,12].
Research on controllability in hemivariational-type systems has gained significant attention from the scientific community in recent times. Control problems have significant implications for various fields, including engineering, physics, and finance [13]. Despite the progress made, many intriguing questions and concepts remain unexplored. Notably, the authors of [14,15] established the existence of optimal control in hemivariational inequalities, while [16,17] investigated optimal control in parabolic hemivariational inequalities. Furthermore, [18,19] demonstrated the existence of optimal control in hyperbolic systems, contributing to the advancement of the field. Due to their wide application to numerous pragmatist mathematics fields, neutral systems have attracted attention recently. Neutral systems have numerous applications in various fields, including thermal expansion of materials, biological advancements, surface waves, and stretchability, which benefit from neutral systems either directly or indirectly. Additionally, researchers have extensively studied hemivariational inequalities with a neutral type in [20,21]. For further information regarding the system with hemivariational inequalities, refer to [22,23,24,25,26]. Recently, there has been a surge of interest in Clarke's subdifferential evolution inclusion problems, particularly in the context of nonsmooth analysis and optimization. Frictional contact analysis can effectively characterize the interaction between a piezoelectric body and an electrically conducting foundation, and the frictional contact between a piezoelectric cylinder and a foundation exhibits anti-plane shear deformations. Moreover, the authors of [27] have established approximate controllability results for Sobolev-type Hilfer fractional neutral evolution problems with Clarke's subdifferential-type problems. Our proposed problem presents a model that combines the key elements of hemivariational inequality and fractional impulsive differential equations into a unified framework. This study establishes approximate controllability results for a neutral differential system with impulsive effects, formulated as a hemivariational inequality. Next, we will define the specific system under consideration, which will be the focus of our investigation:
{⟨−ddφ[u′(φ)−g1(φ,u(φ))]+A(φ)u(φ)+Bv(φ),ω⟩M+H∘(φ,u(φ);ω)≥0,φi≠φ∈L=[0,a], ∀ ω∈M,u(0)=u0, u′(0)=u1,Δu(φi)=Li(u(φi)),Δu′(φi)=Ki(u(φi)), i=1,2,3,...,m, 0<φ1<φ2<...<φm<a. | (1.1) |
Here ⟨⋅,⋅⟩M stands for the inner product of the separable Hilbert space M and A:D(A)⊆M→M is a closed, linear, and densely defined operator on M. H∘(φ,⋅;⋅) denotes the generalized Clarke's directional derivative [6] of a locally Lipschitz function H(φ,⋅):M→R. The function g1:L×M→M. The control function v∈V takes values from L2(L,V) and V is the control set which is also a Hilbert space. Let B:V→M be the bounded linear operator. Let 0<φ1<φ2<...<φm<φm+1=a be pre-fixed points and the symbol Δu(φi) represents the jump in the state u at time t which is defined by Δu(φi)=u(φ+i)−u(φ−i), and u(φ−i) and u(φ+i) denote the left and right limit of u at φi. Li:M→M and Ki:M→M,i=1,2,3,...,m, are impulsive functions.
The structure of the article is presented in the following way:
● We begin by reviewing key definitions, fundamental theorems, and initial findings from a previous section.
● The core focus then shifts to exploring the existence of mild solutions for the system represented by Eq (1.1).
● Next, we investigate the approximate controllability of the system (1.1).
● Finally, we solidify our theoretical results by presenting a concrete example.
Let Z and Z∗ be a Banach space and its dual, respectively with ‖⋅‖Z and ⟨⋅,⋅⟩ is the duality pairing of Z and Z∗. The Banach space PC(L,Z) is the set of all piecewise continuous functions from L=[0,a] into Z together with ‖u‖PC=supφ∈L‖u(φ)‖Z. Also,
M(w)k(e)(Z):={℧⊆Z:℧≠∅ is (weakly) compact (convex)};Mf(e)(Z):={℧⊆Z:℧≠∅ is closed (convex)}. |
Consider the non-autonomous second-order initial value problem:
z′′(φ)= A(φ)z(φ)+f(φ),0≤z,φ≤a, | (2.1) |
z(z)= z0,z′(z)=z1, | (2.2) |
where A(φ):D(A(φ))⊆M→M, φ∈[0,a] is a closed densely defined operator and f:[0,a]→M is an appropriate function. One can refer to [15,28,29,30] and the references therein. A significant number of articles relate the existence of solutions to the (2.1)-(2.2) problem to the existence of the evolution operator Q(φ,z) for the homogeneous equation
z′′(φ)= A(φ)z(φ),0≤φ≤a. | (2.3) |
Assume that the domain of A(φ) is a subspace D that is dense in M and independent of φ, and that the function φ↦A(φ)z is continuous for each z∈D(A(φ)).
In view of Kozak's work [31], we shall apply the following evolution operator notion in this study.
Definition 2.1. A family Q of bounded linear operators Q(φ,z):[0,a]×[0,a]→L(M) is called an evolution operator for (2.3) if the following conditions are satisfied:
(Z1) For each z∈M, the mapping [0,a]×[0,a]∋(φ,z)→Q(φ,z)z∈M is of class C1 and
(i) for each φ∈[0,a], Q(φ,φ)=0,
(ii) for all φ,z∈[0,a], and for each z∈M,
∂∂φQ(φ,z)z|φ=z=z,∂∂zQ(φ,z)z|φ=z=−z. |
(Z2) For all φ,z∈[0,a], if z∈D(A), then Q(φ,z)z∈D(A), the mapping [0,a]×[0,a]∋(φ,z)→Q(φ,z)z∈M is of class C2 and
(i) ∂2∂φ2Q(φ,z)z=A(φ)Q(φ,z)z,
(ii) ∂2∂z2Q(φ,z)z=Q(φ,z)B(z)z,
(iii) ∂∂z∂∂φQ(φ,z)z|φ=z=0.
(Z3) For all φ,z∈[0,a], if z∈D(A), and then ∂∂zQ(φ,z)z∈D(A), then ∂2∂φ2∂∂zQ(φ,z)z, ∂2∂z2∂∂φQ(φ,z)z, and
(i) ∂2∂φ2∂∂zQ(φ,z)z=A(φ)∂∂zQ(φ,z)z,
(ii) ∂2∂z2∂∂φQ(φ,z)z=∂∂φQ(φ,z)A(z)z,
and the mapping [0,a]×[0,a]∋(φ,z)→A(φ)∂∂zQ(φ,z)z is continuous.
Let us take
C(φ,z)=−∂Q(φ,z)∂z. |
Also, for some positive constants N1 and N2, we set sup0≤φ,z≤a‖Q(φ,z)‖≤N2 and sup0≤φ,z≤a‖C(φ,z)‖≤N1 and
‖Q(φ+g,z)−Q(φ,z)‖≤N1|g|, | (2.4) |
for all z,φ,φ+g∈[0,a]. The mild solution z:[0,a]→M of (2.1)-(2.2) is:
z(φ)=C(φ,z)z0+Q(φ,z)z1+∫φ0Q(φ,η)f(η)dη. |
Let us start by discussing the necessary definitions and findings from the multivalued analysis. The following sources [7,32,33] are recommended for readers in addition to multivalued maps.
Definition 2.2. Given a Banach space Z and a multivalued map H:Z→2Z∖{∅}=N(Z), we say
(i) H is convex and closed valued, only when H(u) is convex and closed valued for all u∈Z.
(ii) H is said to be upper semicontinuous on Z, if for all y∈Z, H(u)≠∅ is closed in Z and if for each open set J1 of Z which contains H(u), then there is an open neighborhood E of u such that H(E)⊆J1.
(iii) H is bounded on bounded sets if H(B)=∪u∈BH(u) is bounded in Z for all B∈Mb(Z) (i.e., supu∈B{sup{‖k‖:k∈H(u)}}<∞).
(iv) H is supposed to be completely continuous provided that H(J1) is relatively compact, for all bounded subset J1⊆Z.
(v) H has a fixed point if there is a u∈Z such that u∈H(u).
For a locally Lipschitzian functional H:Z→R, we denote H0(q;p), the Clarke's generalized directional derivative of H at point q in the direction of p, that is,
H0(q;p):=limγ→0+supϑ→qH(ϑ+γp)−H(ϑ)γ. |
Also, ∂H(q):={q∗∈Z∗:H0(q;p)≥⟨q∗;p⟩,for every p∈Z} denotes the generalized Clarke's subdifferential.
The subsequent features and outcomes will facilitate our goal achievement:
Lemma 2.3. [9] If the function H:℧→R is a locally Lipschitz on an open set ℧ of Z, then
(i) For all p∈Z, it has H0(q;p)=max{⟨q∗;p⟩: for all q∗∈∂H(q)};
(ii) For all q∈℧, the gradient ∂H(q) is a nonempty, convex, weak∗-compact subset of Z∗ and ‖q∗‖Z∗≤M, for all q∗∈∂H(q);
(iii) The graph of ∂H is closed in ℧×Z∗ℓ∗. That is, if {qn}⊂℧, {q∗n}⊂Z∗ are sequences as q∗n∈∂H(qn) and qn→q∈Z, q∗n→q∗ weakly∗ in Z∗, then q∗∈∂H(q) (where the Banach space Z∗ furnished with the ℓ∗-topology is denoted by Z∗ℓ∗);
(iv) The multifunction ℧∋q→∂H(q)⊆Z∗ is upper semicontinuous which maps ℧ into Z∗ℓ∗.
Lemma 2.4. [9] Let Z be the separable reflexive Banach space, 0<a<∞ and H:(0,a)×Z→R, such that H(⋅,w) is measurable for each w∈Z and H(φ,⋅) is locally Lipschitz on Z for all φ∈(0,a). Then the multifunction (0,a)×Z∋(φ,w)↦∂H(φ,w)⊂Z∗ is measurable.
As discussed in [9], we can investigate the existence of mild solutions and approximate controllability for the following semilinear inclusions:
{ddφ[z′(φ)−g1(φ,u(φ))]∈A(φ)u(φ)+Bv(φ)+∂H(φ,z(φ)), φ∈L=[0,a],u(0)=u0, u′(0)=u1,Δu(φi)=Li(u(φi)), Δu′(φi)=Ki(u(φi)), i=1,2,3,...,m. | (2.5) |
Now, we can explore the implication that every solution to Eq (2.5) is also a solution to Eq (1.1). Hence, if u∈PC(L,M) is a solution of (2.5), there exists h(φ)∈∂H(φ,u(φ)) provided h∈L2(L,M) and
{ddφ[u′(φ)−g1(φ,u(φ))]=A(φ)u(φ)+Bv(φ)+h(φ), φ∈L=[0,a],u(0)=u0, u′(0)=u1,Δz(φi)=Li(u(φi)), Δu′(φi)=Ki(u(φi)), i=1,2,3,...,m, |
which implies
{⟨−ddφ[u′(φ)−g1(φ,u(φ))]+A(φ)u(φ)+Bv(φ),ω⟩M+⟨h(φ),ω⟩M=0, φ∈L=[0,a],for all ω∈M,u(0)=u0, u′(0)=u1,Δz(φi)=Li(u(φi)), Δu′(φi)=Ki(u(φi)), i=1,2,3,...,m. |
Since ⟨h(φ),ω⟩M≤H0(φ,u(φ);ω) and h(φ)∈∂H(φ,u(φ)),
{⟨−ddφ[u′(φ)−g1(φ,u(φ))]+A(φ)u(φ)+Bv(φ),ω⟩M+ H0(φ,u(φ);ω), φ∈L=[0,a], for all ω∈M,u(0)=u0, u′(0)=u1,Δu(φi)=Li(u(φi)), Δu′(φi)=Ki(u(φi)), i=1,2,3,...,m. |
Therefore, our initial focus will be on examining the semilinear inclusion (2.5), which proceeds our investigation of the hemivariational inequality (1.1). According to established literature [33,34], the mild solution for problem (2.5) is defined as below.
Definition 2.5. For all v∈L2(L,V), a function u∈PC(L,M) is a mild solution for (2.5) if there exists h∈L2(L,M) as h(φ)∈∂H(φ,u(φ)) almost everywhere on φ∈L,
u(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)h(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)), φ∈L. |
Let us take the following assumptions:
(A1) The function H:L×M→R satisfies:
(i) ∀ u∈M, φ↦H(φ,z) is measurable;
(ii) u↦H(φ,u) is locally Lipschitz continuous for a.e. φ∈L;
(iii) There is a function b(φ)∈L2(L,R+) and e>0 such that
‖∂H(φ,u)‖=sup{‖h‖:h(φ)∈∂H(φ,u)}≤b(φ)+e‖u‖,for a.e. φ∈L and for each u∈M. |
(A2) In the function g1:L×M→M, there exists some constants C1,C2>0, and for every u∈M, φ1,φ2∈L, we have
‖g1(φ1,u(φ1))−g1(φ2,u(φ2))‖≤C1‖u(φ1)−u(φ2)‖,‖g1(φ1,u(φ1))‖≤C2(1+‖u(φ1)‖). |
(A3) For some constants ci,li>0, the maps Li,Ki:M→M are continuous, and
‖Li(φ)‖≤ci,‖Ki(φ)‖≤li, i=1,2,3,...,m, for all u∈M. |
Let M:L2(L,M)→2L2(L,M) be defined as below:
M(u)={k∈L2(L,M):k(φ)∈∂H(φ,u(φ)) almost everywhere, φ∈L}, for all u∈L2(L,M). |
Lemma 2.6. [35] Let (A1) and M be true. If un→u in L2(L,M), wn→w weakly in L2(L,M) and un∈M(un), and then u∈M(u).
Lemma 2.7. [9] Let all hypotheses and (A1) hold. Then for every u∈L2(L,M), the set M(u) has nonempty, weakly compact and convex values.
Theorem 2.8. [9] Consider the Banach space Z which is locally convex and Υ:Z→2Z is a compact convex valued, upper semicontinuous multivalued map such that there exists a closed neighborhood J of 0 for which Υ(J) is relatively compact provided
℧={x∈Z:γx∈Υ(u), for some γ>1} |
is bounded. Then Υ has a fixed point.
Theorem 3.1. For all v∈L2(L,V), provided that (A1)–(A3) are fulfilled, then (2.5) has a mild solution on L such that a(N1C2+N2e)<1, where N1:=supφ,z∈[0,a]‖C(φ,z)‖, N2:=supφ,z∈[0,a]‖Q(φ,z)‖.
Proof. Initially, choose any u∈PC(L,M)⊂L2(L,M), by Lemma 2.7. Now, define Υ:PC(L,M)→2PC(L,M) as:
Υ(u)={f∈PC(L,M):f(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)h(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)), h∈M(u)}, u∈PC(L,M). |
It is clear that we can determine a fixed point of the multivalued map Υ that satisfies Theorem 2.8. First, note that the set-valued map Υ(u) is convex due to the properties of M(u). Now, let us proceed with the proof of the theorem as follows:
Step 1. Υ(Br)⊆(Br),r>0, is bounded in PC(L,M), where Br={u∈PC(L,M):‖u‖PC≤r}. Here, it suffices to demonstrate the existence of a positive constant ℓ such that for each σ∈Υ(u), u∈Br,‖σ‖PC≤ℓ. If σ∈Υ(u), then there is a h∈M(u) provided
σ(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)h(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)),φ∈L. |
By Hölder's inequality,
‖σ(φ)‖≤‖C(φ,0)u0‖+‖Q(φ,0)[u1−g1(0,u(0))]‖+‖∫φ0C(φ,z)g1(z,u(z))dz‖+‖∫φ0Q(φ,z)h(z)dz‖+‖∫φ0Q(φ,z)Bv(z)dz‖+∑0<φi<φ‖C(φ,φi)Li(u(φi))‖+∑0<φi<φ‖C(φ,φi)Ki(u(φi))‖≤N1‖u0‖+N2‖[u1−g1(0,u(0))]‖+N1∫φ0C2(1+r)dz+N2∫φ0[b(z)+er+‖B‖‖v(z)‖]dz+N1∑0<φi<φ‖Li(u(φi))‖+N2∑0<φi<φ‖Ki(u(i))‖≤N1‖u0‖+N2φ2‖[u1−g1(0,u(0))]‖+N1aC2(1+r)+N2[√a‖b‖L2(Q,R+)+era+√a‖B‖‖v‖L2(Q,V)]+N1m∑i=1ci+N2m∑i=1li:=ℓ. |
Thus, Υ(Br) is bounded.
Step 2. {Υ(u):u∈Br} is completely continuous.
Let us note that for any u∈Br, σ∈Υ(u), there exists h∈M(u) such that for all φ∈L,
‖σ(φ)‖≤‖C(φ,0)u0‖+‖Q(φ,0)[u1−g1(0,u(0))]‖+‖∫φ0C(φ,z)g1(z,u(z))dz‖+‖∫φ0Q(φ,z)h(z)dz‖+‖∫φ0Q(φ,z)Bv(z)dz‖+∑0<φi<φ‖C(φ,φi)Li(u(φi))‖+∑0<φi<φ‖C(φ,φi)Ki(u(φi))‖. |
For 0<ξ1<ξ2≤a and k>0 very small,
‖σ(ξ2)−σ(ξ1)‖M≤‖C(ξ2,0)−C(ξ1,0)‖‖u0‖+‖Q(ξ2,0)−Q(ξ1,0)‖‖[u1−g1(0,u(0))]‖+∫ξ1−k0‖C(ξ2,z)−C(ξ1,z)‖‖g1(z,u(z))‖dz+∫ξ1ξ1−k‖C(ξ2,z)−C(ξ1,z)‖‖g1(z,u(z))‖dz+∫ξ2ξ1‖C(ξ2,z)‖ ‖g1(z,u(z))‖dz+∫ξ1−k0‖Q(ξ2,z)−Q(ξ1,z)‖‖h(z)+Bv(z)‖dz+∫ξ1ξ1−k‖Q(ξ2,z)−Q(ξ1,z)‖ ‖h(z)+Bv(z)‖dz+∫ξ2ξ1‖Q(ξ2,z)‖ ‖h(z)+Bv(z)‖dz+∑0<φi<a‖C(ξ2,φi)−C(ξ1,φi)‖‖Li(u(φi))‖+∑0<φi<a‖Q(ξ2,φi)−Q(ξ1,φi)‖‖Ki(u(φi))‖≤‖C(ξ2,0)−C(ξ1,0)‖‖u0‖+‖Q(ξ2,0)−Q(ξ1,0)‖‖[u1−g1(0,u(0))]‖+∫ξ1−k0‖C(ξ2,z)−C(ξ1,z)‖C2(1+r)dz+∫ξ1ξ1−k‖C(ξ2,z)−C(ξ1,z)‖C2(1+r)dz+N1 C2(1+r)(ξ2−ξ1)+∫ξ1−k0‖Q(ξ2,φi)−Q(ξ1,φi)‖[b(z)+er+‖B‖‖v(z)‖]dz+∫ξ1ξ1−k‖Q(ξ2,z)−Q(ξ1,z)‖[b(z)+er+‖B‖‖v(z)‖]dz+N2∫ξ2ξ1[b(z)+er+‖B‖‖v(z)‖]dz+∑0<φi<a‖C(ξ2,φi)−C(ξ1,φi)‖‖Li(u(φi))‖+∑0<φi<a‖Q(ξ2,φi)−Q(ξ1,φi)‖‖Ki(u(φi))‖. | (3.1) |
From the uniform operator topology [33, Lemma 6.2], it is easily understood that (3.1) tends to zero of u∈Br as ξ2→ξ1 and k→0.
Equivalently, for ξ1=0 and 0<ξ2≤a, we can show that ‖σ(ξ2)−u0‖M tends to zero independently of u∈Br as ξ2→0. Hence, we can conclude that {Υ(u):u∈Br} is equicontinuous of PC(L,M).
Finally, from the assumptions (A1) and (A3) and by the definition of a relatively compact set, it is not difficult to check that {σ(t):σ∈Υ(Br)} is relatively compact in M. Thus, by the generalized Arzelˊa-Ascoli theorem, we get that Υ is a multivalued compact map.
Therefore, based on the above arguments, Υ is completely continuous.
Step 3. Assume un→u∗ in PC(L,M), σn∈Υ(un) and σn→σ∗ in PC(L,M). Let us check σ∗∈Υ(u∗). It is obvious that σn∈Υ(un) exist only when hn∈M(un) such that
σn(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,un(z))dz+∫φ0Q(φ,z)hn(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)). | (3.2) |
Here {hn}n≥1⊆L2(L,M) is bounded from the hypothesis (A2). Hence we may assume that
hn→h∗ weakly in L2(L,M). | (3.3) |
From (3.2) and (3.3), we have
σn(φ)→C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u∗(z))dz+∫φ0Q(φ,z)h∗(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)). | (3.4) |
We can see that σn→σ∗ in PC(L,M) and hn∈M(u). According to Lemma 2.6 and (3.4), h∗∈M(u∗). Then, σ∗∈Υ(u∗), and this shows that Υ has a closed graph. Hence using Proposition 3.12 of [36] implies that it is upper semicontinuous.
Step 4. A priori estimate.
Based on the results from Steps 1–3, we have established that the multivalued map Υ satisfies the following properties: upper semicontinuity, convex-valuedness, compactness, and relative compactness of Υ(Br). Therefore, Υ meets the conditions of Theorem 2.8, which implies that
℧={u∈PC(L,M):γu∈Υ(u), γ>1}, |
is bounded. To prove Υ has a fixed point, let u∈℧, and h∈M(u) such that
u(φ)=γ−1C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+γ−1∫φ0C(φ,z)g1(z,u(z))dz+γ−1∫φ0Q(φ,z)h(z)dz+γ−1∫φ0Q(φ,z)Bv(z)dz+γ−1∑0<φi<φC(φ,φi)Li(u(φi))+γ−1∑0<φi<φQ(φ,φi)Ki(u(φi)). |
From our assumptions,
‖u(φ)‖M≤‖C(φ,0)u0‖+‖Q(φ,0)[u1−g1(0,u(0))]‖+‖∫φ0C(φ,z)g1(z,u(z))dz‖+‖∫φ0Q(φ,z)h(z)dz‖+‖∫φ0Q(φ,z)Bv(z)dz‖+∑0<φi<φ‖C(φ,φi)Li(u(φi))‖+∑0<φi<φ‖Q(φ,φi)Ki(u(φi))‖≤N1‖u0‖+N2‖[u1−g1(0,u(0))]‖+N1∫φ0C2(1+‖u(z)‖)dz+N2∫φ0[a(z)+e‖u(z)‖+‖B‖‖v(z)‖]dz+N1∑0<φi<φ‖Li(u(φi))‖+N2∑0<φi<φ‖Ki(u(φi))‖≤ρ+K1‖u‖, | (3.5) |
where
ρ=N1[u0]+N2[u1−g1(0,u(0))]+N1C2b+N2(‖b‖L2(L,R+)+‖B‖‖v‖L2(L,V))√a+m∑i=1li]+N1m∑i=1ci,K1=a(N1C2+N2e). |
Hence, by the assumption K1<1 and (3.5), we can see that
‖u‖=supφ∈L‖u(φ)‖≤ρ+K1‖u‖, thus ‖u‖≤ρ1−K1=:ℓ2. |
Hence, Υ has a fixed point.
Consider that the mild solution for the Eq (2.5) is u(⋅;v), the control variable v has values in L2(L,V), and the initial value is u0,u1∈M. At the terminal time a, the accessible set of the system (2.5) is defined as R(a,u0,u1)={u(a;u0,u1):v∈L2(L,V)}.
Definition 4.1. The Eq (2.5) is approximately controllable on L, if for any initial value u0,u1∈M, then ¯R(a,u0,u1)=M.
Consider the linear differential system:
{u′′(φ)=A(φ)u(φ)+Bv(φ), φ∈L=[0,a],u(0)=u0,u′(0)=u1. | (4.1) |
Now, define the operators for the system (4.1) as:
Υa0=∫a0Q(a,z)BB∗Q∗(a,z)dzandR(β,Υa0)=(βI+Υa0)−1, β>0, |
where B∗ and Q∗(φ) are adjoint of B and Q(φ), respectively.
Lemma 4.2. [9] The system (4.1) is approximately controllable on L iff β R(β,Υa0)→0 as β→0+ in the strong operator topology.
Choose any β>0, u∈PC(L,M)⊂L2(L,M) and ua∈M, as stated in Lemma 2.7, and it is possible to define a multivalued map Υβ:PC(L,M)→2PC(L,M) given by
Υβ(u)={f∈PC(L,M):f(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)h(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)),h∈M(u)}, |
and
vβ(φ)=B∗Q∗(a,z)R(β,Υa0)(ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,z)g1(z,u(z))dz−∫a0Q(a,z)h(z)dz−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi))). |
Theorem 4.3. Let (A1)–(A3) be true. Υβ, for all β>0, has a fixed point on L=[0,a] if
a(N1C2+N2e)(1+N22‖B‖2β)<1, |
where N1:=supφ,z∈[0,a]‖C(φ,z)‖, N2:=supφ,z∈[0,a]‖Q(φ,z)‖.
Proof. For every u∈PC(L,M), by the nature of M(u), we can say Υβ is convex.
Step 1. For every p>0,Υβ(Bp) is bounded in PC(L,M),
Bp={u∈PC(L,M):‖u‖PC≤p}. |
Here, it is sufficient to prove that there exists a positive constant lβ and for all σ∈Υβ(u), u∈Bp, ‖σ‖PC≤lβ. If σ∈Υβ(u), there is h∈M(u) such that
σ(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)h(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)), φ∈L. |
Notice that
‖vβ(φ)‖=‖B∗Q∗(a,z)R(β,Υa0)(ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,z)g1(z,u(z))dz−∫a0Q(a,z)h(z)dz−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi)))‖≤N2‖B‖β[‖ua‖+N1‖u0‖+N2‖u1−g1(0,u(0))‖+aN1C2(1+p)+N2[‖b‖L2(L,R+)√a+epa]+N1m∑i=1ci+N2m∑i=1li]:=Ψ. | (4.2) |
From (4.2),
‖σ(φ)‖M≤‖C(φ,0)u0‖M+‖Q(φ,0)[u1−g1(0,u(0))]‖M+‖∫φ0C(φ,z)g1(z,u(z))dz‖+‖∫φ0Q(φ,z)h(z)dz‖+‖∫φ0Q(φ,z)Bv(z)dz‖+∑0<φi<φ‖C(φ,φi)Li(u(φi))‖+∑0<φi<φ‖C(φ,φi)Ki(u(φi))‖≤N1‖u0‖+N2‖[u1−g1(0,u(0))]‖+N1aC2(1+p)+N2[√a‖b‖L2(L,R+)+epa+‖B‖Ψa]+N1m∑i=1ci+N2m∑i=1li:=lβ. |
Thus Υβ(Bp) is bounded in PC(L,M).
Step 2. Consider any u∈Bp, σ∈Υβ(u). There exists h∈M(u), for every φ∈L,
σ(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)h(z)dz+∫φ0Q(φ,z)Bv(z)dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)). |
Using ‖vβ(t)‖ as (4.2) and also from Theorem 3.1, Step 2, one can obtain that {Υβ(u):u∈Bp} is completely continuous.
Step 3. Consider un→u∗ in PC(L,M), σn∈Υβ(un) and σn→σ∗ in PC(L,M). We investigate σ∗∈Υβ(u∗). Indeed, σn∈Υβ(un) exists only when hn∈M(un) such that
σn(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,un(z))dz+∫φ0Q(φ,z)hn(z)dz+∫φ0Q(φ,z)BB∗Q∗(a,z)R(β,Υa0)(×)(ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,η)g1(η,un(η))dη−∫a0Q(a,η)hn(η)dη−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi)))dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<ti<tQ(φ,φi)Ki(u(φi)). | (4.3) |
From (A1), we will prove {hn}n≥1⊆L2(L,M) is bounded. Hence,
hn→h∗ weakly in L2(L,M). | (4.4) |
From (4.3) and (4.4),
σn(φ)→C(φ,0)u0+Q(φ,0)[z1−g1(0,z(0))]+∫φ0C(φ,z)g1(z,u∗(z))dz+∫φ0Q(φ,z)h∗(z)dz+∫φ0Q(φ,z)BB∗Q∗(a,z)R(β,Υa0)(×)(ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,η)g1(η,u∗(η))dη−∫a0Q(a,η)h∗(η)dη−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi)))dz+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)). | (4.5) |
Clearly, σn→σ∗ in PC(L,M) and hn∈M(un). According to Lemma 2.6 and (4.5), h∗∈M(u∗). Then, σ∗∈Υ(u∗), and this shows that Υ has a closed graph. Hence, by using Proposition 3.12 of [36] implies that it is upper semicontinuous.
Step 4. A priori estimate.
By Steps 1–3, Υβ is convex valued, compact upper semicontinuous, Υβ(Bp) is a relatively compact set and meets Theorem 2.8, and
J={u∈PC(L,M):γu∈Υβ(u), γ>1}, |
is bounded.
Consider u∈J. Then there exists h∈M(u) such that
u(φ)=γ−1C(φ,0)u0+γ−1Q(φ,0)[u1−g1(0,u(0))]+γ−1∫φ0C(φ,z)g1(φ,u(φ))dz+γ−1∫φ0Q(φ,z)h(z)dz+γ−1∫φ0Q(φ,z)Bvβ(z)dz+γ−1∑0<φi<φC(φ,φi)Li(u(φi))+γ−1∑0<φi<φQ(φ,φi)Ki(u(φi)), |
and
vβ(φ)=B∗Q∗(a,z)R(β,Υa0)(ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,z)g1(z,u(z))dz−∫a0Q(a,z)h(z)dz−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi))). |
Then from our assumptions,
‖u(φ)‖M≤‖C(φ,0)u0‖+‖Q(φ,0)[u1−g1(0,u(0))]‖+‖∫φ0C(φ,z)g1(z,u(z))dz‖+‖∫φ0Q(φ,z)h(z)dz‖+‖∫φ0Q(φ,z)Bvβ(z)dz‖+∑0<φi<φ‖C(φ,φi)Li(u(φi))‖+∑0<φi<φ‖Q(φ,φi)Ki(u(φi))‖≤N1‖z0‖+N2‖[u1−g1(0,u(0))]‖+N1∫φ0C2(1+‖u(φ)‖)dz+N2∫φ0[b(z)+e‖u(z)‖+‖B‖(N2‖B‖β[‖ua‖+N1‖u0‖+N2‖u1−g1(0,z(0))‖+aN1C2(1+p)+N2[‖b‖L2(L,R+)√a+epa]+N1m∑i=1ci+N2m∑i=1li])dz+N1∑0<φi<φ‖Li(u(φi))‖+N2∑0<φi<φ‖Ki(u(φi))‖≤ρ+K2‖u‖, | (4.6) |
where
ρ=N1‖u0‖+N2‖[u1−g1(0,u(0))]‖+N1C2a+N2[‖b‖L2(L,R+)]√a+N22‖B‖2β(‖ua‖+N1‖u0‖+N2‖[u1−g1(0,u(0))]‖+N1C2a+N2[‖b‖L2(L,R+)]√a)+N1m∑i=1ci+N2m∑i=1li.K2=a(N1C2+N2e)(1+N22‖B‖2β). |
According to K2<1 and (4.6), we conclude,
‖u‖=supφ∈L‖u(φ)‖≤ρ+K2‖u‖, and thus ‖u‖≤ρ1−K2=:ℓ3. |
Therefore J is bounded which leads to the conclusion that Υβ has a fixed point.
Theorem 4.4. Suppose the conditions of the above theorem are satisfied. Then, if system (4.1) is approximately controllable on the set L, it follows that system (2.5) is also approximately controllable on L.
Proof. By Theorem 4.3, Υβ, for all β>0, has a fixed point in PC(L,M). Let uβ be a fixed point of Υβ in PC(L,M). Clearly, Υβ is a mild solution of (2.5). Then, there exists hβ∈M(uβ) such that for each φ∈L,
uβ(φ)=C(φ,0)u0+Q(φ,0)[u1−g1(0,u(0))]+∫φ0C(φ,z)g1(z,u(z))dz+∫φ0Q(φ,z)hβ(z)dz+∫φ0Q(φ,z)BB∗Q∗(a,z)R(β,Υa0)(×)(ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,η)g1(η,u(η))dη−∫a0Q(a,η)hβ(η)dη−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi)))du+∑0<φi<φC(φ,φi)Li(u(φi))+∑0<φi<φQ(φ,φi)Ki(u(φi)). |
Since I−Υa0R(β,Υa0)=βR(β,Υa0), we have uβ(a)=ua−βR(β,Υa0)E(hβ). From the above,
E(hβ)=ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,η)g1(η,u(η))dη−∫a0Q(a,η)hβ(η)dη−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi)). |
From the hypothesis (A1) and from Theorem 4.3, ‖∂H(φ,u)‖≤b(φ)+e‖u(φ)‖≤b(φ)+ep:=ν(φ). Then,
∫a0‖hβ(z)‖dz≤‖ν‖L2(L,R+)√a. |
Consequently {hβ} is a bounded sequence in L2(L,M). So, there exists a subsequence, {hβ}, which will converge weakly to h in L2(L,M). It is expressed as
g=ua−C(a,0)u0−Q(a,0)[u1−g1(0,u(0))]−∫a0C(a,η)g1(η,u(η))dη−∫a0Q(a,η)h(η)dη−∑0<φi<aC(a,φi)Li(u(φi))−∑0<φi<aQ(a,φi)Ki(u(φi)). |
Now,
‖E(hβ)−g‖=‖∫a0C(a,η)[g1(η,yβ(η))−g1(η,y(η))]dη‖+‖∫a0S(a,η)[hβ(η)−h(η)]dη‖≤M1sup0≤η≤a[g1(η,yβ(η))−g1(η,y(η))]+M2sup0≤η≤a[hβ(η)−h(η)]. | (4.7) |
From Step 2 in Theorem 4.3 and by the Arzelˊa-Ascoli theorem, we get that the compactness of the right-hand side of (4.7) tends to zero as β→0+, which gives
‖uβ(a)−u1‖=‖βR(β,Υa0)E(hβ)‖≤‖βR(β,Υa0)(g)‖+‖E(hβ)−g‖→0, as β→0+. |
Hence, (2.5) is approximately controllable on L.
We utilize our theoretical findings on a concrete partial differential equation. We need to provide the required technological resources to accomplish our goals.
Now, let us take
A(φ)=A+˜A(φ), |
where A is the infinitesimal generator of a cosine function C(φ) with associated sine function Q(t), and ˜A(φ):D(˜A(φ))→M is a closed linear operator with D⊂D(˜A(φ)), for all φ∈L. We take the space M=L2(T,C), where the group T is defined as the quotient R/2πZ, and we denote by L2(T,C) the space of 2π periodic 2-integrable functions from R to C. Also, we use the identification between functions on T and 2π periodic functions on R. Furthermore, H2(T,C) denotes the Sobolev space of 2π periodic from R to C such that u′′∈L2(T,C).
We define Au(φ)=u′′(φ) with domain D(A)=H2(T,C). Then, A can be written as
Au=∞∑n=1−n2⟨u,xn⟩xn,u∈D(A), |
where xn(φ)=1√2πeinφ(n∈Z) is an orthonormal basis of M. It is well known that A is the infinitesimal generator of a strongly continuous cosine function C(φ) on M. The cosine function C(φ) is given by
C(φ)u=∞∑n=1cosnt⟨u,xn⟩xn,u∈M,φ∈R. |
The connected sine operator (Q(φ))φ∈R is
Q(t)u=∞∑n=1sinntn⟨u,xn⟩xn,u∈M,φ∈R. |
It is clear that ‖C(φ)‖≤1 for all φ∈R, so it is uniformly bounded on R.
Assume the following second-order non-autonomous neutral differential system of the form:
∂∂φ[∂∂φu(φ,℘)−ˆg1(φ,y(φ,℘)]=∂2∂q2u(φ,℘)+B(φ)∂∂φu(φ,℘)+B˜v(φ,℘)+ϕ(φ,u(φ,℘)),0<φ<a,u(φ,0)=u(φ,π)=0, 0<φ<a,u(0,℘)=u0(℘),℘∈(0,π),∂∂φy(0,℘)=u1(℘),Δu(φk)(℘)=∫φk0bk(φk−φ)u(φ,℘)dφ,Δ∂∂φu(φk)(℘)=∫φk0bk(φk−φ)u1(φ,℘)dφ, | (5.1) |
where B:R→R is a continuous function such that supφ∈[0,a]‖B(φ)‖=c0, and u(φ,℘) represents the temperature at ℘∈(0,π) and φ∈(0,a). Let ϕ(φ,u(φ,℘))=ϕ1(ξ1,φ(φ,℘))+ϕ2(φ,u(φ,℘)) and ϕ2(φ,u(φ,℘)) is the temperature function of the form −ϕ2(φ,u(φ,℘))∈∂H(φ,℘,u(φ,℘)),(φ,℘)∈(0,a)×(0,π). Here, the nonsmooth and nonconvex function H=H(φ,℘,k) is defined as a locally Lipschitz energy function. ∂H is the generalized Clarke's gradient in the third variable k [6]. Assume that H fulfills the assumptions (A1), H(k)=min{h1(ν),h2(ν)}, and hi=R→R(i=1,2) are convex quadratic functions [16].
Now we take ˜A(φ)u(℘)=B(φ)u(℘) defined on H1(T,C). It is easy to see that A(φ)=A+˜A(φ) is a closed linear operator. Initially, we will show that A+˜A(φ) generates an evolution operator. It is well known that the solution of the scalar initial value problem
p′′(φ)=−n2p(φ)+q(φ),p(s)= 0, p′(s)= p1, |
is given by
p(t)=p1nsinn(φ−z)+1n∫φzsinn(φ−ı)q(ı)dı. |
Therefore, the solution of the scalar initial value problem
p′′(φ)=−n2p(φ)+inB(φ)p(φ), | (5.2) |
p(z)= 0, p′(z)=p1, | (5.3) |
satisfies the following equation:
p(φ)=p1nsinn(φ−z)+i∫φzsinn(φ−ı)B(ı)q(ı)dı. |
By the Gronwall-Bellman lemma, we obtain
|p(t)|≤p1nec(φ−z) | (5.4) |
for z≤φ and c is a constant. We denote by pn(φ,z) the solution of (5.2)-(5.3). We define
Q(φ,z)u=∞∑n=1pn(φ,z)⟨u,xn⟩xn,u∈M,φ∈R. |
It follows from the estimate (5.4) that Q(φ,z):M→M is well defined and satisfies the condition of Definition 2.1. We set u(t)=u(φ,⋅), that is, u(φ)(℘)=u(φ,℘), φ∈L, ℘∈[0,π]. Then, we assume the infinite dimensional Hilbert space V, and we have
V={v:v∈∞∑ȷ=1vȷxȷ with ∞∑ȷ=2v2ȷ<∞}, |
with V as
‖v‖V=(∞∑ȷ=2v2ȷ)12. |
Let us define B∈L(V,M) as below:
Bv=2v2x1+∞∑ȷ=2vȷxȷ<∞,for all v=∞∑ȷ=2vȷxȷ∈V. |
It continuous that
B∗v=(2v+v2)x2+∞∑ȷ=3vȷxȷ, for all v=∞∑ȷ=2vȷxȷ∈M. |
Assume these functions satisfy the requirements of the hypotheses. From the above choices of the functions and evolution operator A(φ) with B, system (5.1) can be formulated as system (2.5) in M. Since all hypotheses of Theorem 4.4 are satisfied, the approximate controllability of system (5.1) on L follows from Theorem 4.4.
The principles of approximate controllability of second-order differential impulsive systems with the impact of hemivariational inequalities are the main focus of this article. The generalized Clarke's subdifferential technique and multivalued maps were used to suggest and demonstrate the necessary requirements for existence and approximate controllability. In the future, we will extend the results with finite delay and stochastic systems.
Yong-Ki Ma: Conceptualization, Methodology, Validation, Visualization, Writing–original draft. N. Valliammal: Conceptualization, Formal analysis, Methodology, Validation, Visualization, Writing–original draft. K. Jothimani: Conceptualization, Formal analysis, Investigation, Resources, Supervision, Writing–original draft. V. Vijayakumar: Conceptualization, Formal analysis, Resources, Supervision, Writing–original draft, Writing–Review & Editing. All authors have read and approved the final version of the manuscript for publication.
This work was supported by the research grant of Kongju National University in 2024. The authors are immensely grateful to the anonymous referees for their careful reading of this paper and helpful comments, which have been very useful for improving the quality of this paper.
The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.
[1] | R. A. Murphey, Target-Based Weapon Target Assignment Problems, Springer US, 2000. |
[2] |
R. K. Ahuja, A. Kumar, K. C. Jha, J. B. Orlin, Exact and heuristic algorithms for the weapon-target assignment problem, Oper. Res., 55 (2007), 1136–1146. https://doi.org/10.1287/opre.1070.0440 doi: 10.1287/opre.1070.0440
![]() |
[3] |
Y. Lu, D. Z. Chen, A new exact algorithm for the weapon-target assignment problem, Omega, 98 (2021), 102138. https://doi.org/10.1016/j.omega.2019.102138 doi: 10.1016/j.omega.2019.102138
![]() |
[4] |
C. Leboucher, H. Shin, S. Le Ménec, A. Tsourdos, A. Kotenkoff, P. Siarry, et al., Novel evolutionary game based multi-objective optimisation for dynamic weapon target assignment, IFAC Proc. Vol., 47 (2014), 3936–3941. https://doi.org/10.3182/20140824-6-ZA-1003.02150 doi: 10.3182/20140824-6-ZA-1003.02150
![]() |
[5] |
B. Xin, J. Chen, Z. Peng, L. Dou, J. Zhang, An efficient rule-based constructive heuristic to solve dynamic weapon-target assignment problem, IEEE Trans. Syst. Man Cybern. Part A, 41 (2010), 598–606. https://doi.org/10.1109/TSMCA.2010.2089511 doi: 10.1109/TSMCA.2010.2089511
![]() |
[6] |
Z. J. Lee, C. Y. Lee, S. F. Su, An immunity-based ant colony optimization algorithm for solving weapon–target assignment problem, Appl. Soft Comput., 2 (2002), 39–47. https://doi.org/10.1016/S1568-4946(02)00027-3 doi: 10.1016/S1568-4946(02)00027-3
![]() |
[7] | X. Li, D. Zhou, Q. Pan, Y. Tang, J. Huang, Weapon-target assignment problem by multiobjective evolutionary algorithm based on decomposition, Complexity, 2018 (2018). https://doi.org/10.1155/2018/8623051 |
[8] |
T. Chang, D. Kong, N. Hao, K. Xu, G. Yang, Solving the dynamic weapon target assignment problem by an improved artificial bee colony algorithm with heuristic factor initialization, Appl. Soft Comput., 70 (2018), 845–863. https://doi.org/10.1016/j.asoc.2018.06.014 doi: 10.1016/j.asoc.2018.06.014
![]() |
[9] |
Y. Wang, B. Xin, J. Chen, An adaptive memetic algorithm for the joint allocation of heterogeneous stochastic resources, IEEE Trans. Cybern., 52 (2021), 11526–11538. https://doi.org/10.1109/TCYB.2021.3087363 doi: 10.1109/TCYB.2021.3087363
![]() |
[10] |
L. Zhao, Z. An, B. Wang, Y. Zhang, Y. Hu, A hybrid multi-objective bi-level interactive fuzzy programming method for solving ecm-dwta problem, Complex Intell. Syst., 8 (2022), 4811–4829. https://doi.org/10.1007/s40747-022-00730-9 doi: 10.1007/s40747-022-00730-9
![]() |
[11] |
X. Chang, J. Shi, Z. Luo, Y. Liu, Adaptive large neighborhood search algorithm for multi-stage weapon target assignment problem, Comput. Ind. Eng., 181 (2023), 109303. https://doi.org/10.1016/j.cie.2023.109303 doi: 10.1016/j.cie.2023.109303
![]() |
[12] |
Q. Zhang, H. Li, MOEA/D: A multiobjective evolutionary algorithm based on decomposition, IEEE Trans. Evol. Comput., 11 (2007), 712–731. https://doi.org/10.1109/TEVC.2007.892759 doi: 10.1109/TEVC.2007.892759
![]() |
[13] |
M. Behzadian, S. K. Otaghsara, M. Yazdani, J. Ignatius, A state-of the-art survey of TOPSIS applications, Expert Syst. Appl., 39 (2012), 13051–13069. https://doi.org/10.1016/j.eswa.2012.05.056 doi: 10.1016/j.eswa.2012.05.056
![]() |
[14] | Q. Cheng, D. Chen, J. Gong, Weapon-target assignment of ballistic missiles based on q-learning and genetic algorithm, in 2021 IEEE International Conference on Unmanned Systems (ICUS), (2021), 908–912. https://doi.org/10.1109/ICUS52573.2021.9641190 |
[15] |
H. Mouton, H. L. Roux, J. Roodt, Applying reinforcement learning to the weapon assignment problem in air defence, Sci. Militaria S. Afr. J. Military Stud., 39 (2011), 99–116. https://doi.org/10.5787/39-2-115 doi: 10.5787/39-2-115
![]() |
[16] |
F. Meng, K. Tian, C. Wu, Deep reinforcement learning-based radar network target assignment, IEEE Sens. J., 21 (2021), 16315–16327. https://doi.org/10.1109/JSEN.2021.3074826 doi: 10.1109/JSEN.2021.3074826
![]() |
[17] |
S. Li, X. He, X. Xu, T. Zhao, C. Song, J. Li, Weapon-target assignment strategy in joint combat decision-making based on multi-head deep reinforcement learning, IEEE Access, 11 (2023), 113740–113751. https://doi.org/10.1109/ACCESS.2023.3324193 doi: 10.1109/ACCESS.2023.3324193
![]() |
[18] | C. Li, B. Xin, Y. He, D. Wang, Y. Li, Dynamic weapon target assignment based on deep q network, in 2023 42nd Chinese Control Conference (CCC), (2023), 1773–1778. https://doi.org/10.23919/CCC58697.2023.10240428 |
[19] |
T. Wang, L. Fu, Z. Wei, Y. Zhou, S. Gao, Unmanned ground weapon target assignment based on deep q-learning network with an improved multi-objective artificial bee colony algorithm, Eng. Appl. Artif. Intell., 117 (2023), 105612. https://doi.org/10.1016/j.engappai.2022.105612 doi: 10.1016/j.engappai.2022.105612
![]() |
[20] |
K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput., 6 (2002), 182–197. https://doi.org/10.1109/4235.996017 doi: 10.1109/4235.996017
![]() |
[21] |
H. Cai, J. Liu, Y. Chen, H. Wang, Survey of the research on dynamic weapon-target assignment problem, J. Syst. Eng. Electron., 17 (2006), 559–565. https://doi.org/10.1016/S1004-4132(06)60097-2 doi: 10.1016/S1004-4132(06)60097-2
![]() |
[22] |
A. Kline, D. Ahner, R. Hill, The weapon-target assignment problem, Comput. Oper. Res., 105 (2019), 226–236. https://doi.org/10.1016/j.cor.2018.10.015 doi: 10.1016/j.cor.2018.10.015
![]() |
[23] | R. A. Murphey, An Approximate Algorithm For A Weapon Target Assignment Stochastic Program, Springer US, 2000. |
[24] |
O. Karasakal, Air defense missile-target allocation models for a naval task group, Comput. Oper. Res., 35 (2008), 1759–1770. https://doi.org/10.1016/j.cor.2006.09.011 doi: 10.1016/j.cor.2006.09.011
![]() |
[25] |
M. S. Hughes, B. J. Lunday, The weapon target assignment problem: Rational inference of adversary target utility valuations from observed solutions, Omega, 107 (2022), 102562. https://doi.org/10.1016/j.omega.2021.102562 doi: 10.1016/j.omega.2021.102562
![]() |
[26] |
Z. J. Lee, S. F. Su, C. Y. Lee, Efficiently solving general weapon-target assignment problem by genetic algorithms with greedy eugenics, IEEE Trans. Syst. Man Cybern. Part B, 33 (2003), 113–121. https://doi.org/10.1109/TSMCB.2003.808174 doi: 10.1109/TSMCB.2003.808174
![]() |
[27] |
A. M. Madni, M. Andrecut, Efficient heuristic approach to the weapon-target assignment problem, J. Aerosp. Comput. Inf. Commun., 6 (2009), 405–414. https://doi.org/10.2514/1.34254 doi: 10.2514/1.34254
![]() |
[28] |
Z. R. Bogdanowicz, A. Tolano, K. Patel, N. P. Coleman, Optimization of weapon–target pairings based on kill probabilities, IEEE Trans. Cybern., 43 (2012), 1835–1844. https://doi.org/10.1109/TSMCB.2012.2231673 doi: 10.1109/TSMCB.2012.2231673
![]() |
[29] |
H. Liang, F. Kang, Adaptive chaos parallel clonal selection algorithm for objective optimization in WTA application, Optik, 127 (2016), 3459–3465. https://doi.org/10.1016/j.ijleo.2015.12.122 doi: 10.1016/j.ijleo.2015.12.122
![]() |
[30] |
Z. Li, Y. Chang, Y. Kou, H. Yang, A. Xu, Y. Li, Approach to WTA in air combat using IAFSA-IHS algorithm, J. Syst. Eng. Electron., 29 (2018), 519–529. https://doi.org/10.21629/JSEE.2018.03.09 doi: 10.21629/JSEE.2018.03.09
![]() |
[31] |
M. Cao, W. Fang, Swarm intelligence algorithms for weapon-target assignment in a multilayer defense scenario: A comparative study, Symmetry, 12 (2020), 824. https://doi.org/10.3390/sym12050824 doi: 10.3390/sym12050824
![]() |
[32] | J. Li, J. Chen, B. Xin, L. Dou, Solving multi-objective multi-stage weapon target assignment problem via adaptive NSGA-II and adaptive MOEA/D: A comparison study, in 2015 IEEE Congress on Evolutionary Computation (CEC), (2015), 3132–3139. https://doi.org/10.1109/CEC.2015.7257280 |
[33] |
W. Xu, C. Chen, S. Ding, P. M. Pardalos, A bi-objective dynamic collaborative task assignment under uncertainty using modified MOEA/D with heuristic initialization, Expert Syst. Appl., 140 (2020), 112844. https://doi.org/10.1016/j.eswa.2019.112844 doi: 10.1016/j.eswa.2019.112844
![]() |
[34] |
Y. Zhao, J. Liu, J. Jiang, Z. Zhen, Shuffled frog leaping algorithm with non-dominated sorting for dynamic weapon-target assignment, J. Syst. Eng. Electron., 34 (2023), 1007–1019. https://doi.org/10.23919/JSEE.2023.000102 doi: 10.23919/JSEE.2023.000102
![]() |
[35] | R. Durgut, M. E. Aydin, I. Atli, Adaptive operator selection with reinforcement learning, Inf. Sci., 581 (2021), 773–790. https://doi.org/10.1016/j.ins.2021.10.025 https://doi.org/10.1007/978-3-030-85672-4 https://doi.org/10.1007/978-3-030-85672-4_3 |
[36] |
Y. Tian, X. Li, H. Ma, X. Zhang, K. C. Tan, Y. Jin, Deep reinforcement learning based adaptive operator selection for evolutionary multi-objective optimization, IEEE Trans. Emerging Top. Comput. Intell., 7 (2023), 1051–1064. https://doi.org/10.1109/TETCI.2022.3146882 doi: 10.1109/TETCI.2022.3146882
![]() |
[37] |
M. A. Wiering, M. V. Otterlo, Reinforcement learning, Adapt. Learn. Optim., 12 (2012), 729. https://doi.org/10.1007/978-3-642-27645-3 doi: 10.1007/978-3-642-27645-3
![]() |
[38] | V. Mnih, K. Kavukcuoglu, D. Silver, A. Graves, I. Antonoglou, D. Wierstra, et al., Playing atari with deep reinforcement learning, preprint, arXiv: 1312.5602. https://doi.org/10.48550/arXiv.1312.5602 |
[39] | D. P. Kingma, J. Ba, Adam: A method for stochastic optimization, preprint, arXiv: 1412.6980. https://doi.org/10.48550/arXiv.1412.6980 |
[40] | R. Girshick, Fast R-CNN, in Proceedings of the IEEE international conference on computer vision, (2015), 1440–1448. https://doi.org/10.1109/ICCV.2015.169 |
[41] | T. Blickle, Tournament selection, Evol. Comput., 1 (2000), 181–186. https://doi.org/10.1887/0750308958 |
[42] |
X. Zhang, Y. Tian, R. Cheng, Y. Jin, An efficient approach to nondominated sorting for evolutionary multiobjective optimization, IEEE Trans. Evol. Comput., 19 (2014), 201–213. https://doi.org/10.1109/TEVC.2014.2308305 doi: 10.1109/TEVC.2014.2308305
![]() |
[43] |
F. Ming, W. Gong, H. Zhen, S. Li, L. Wang, Z. Liao, A simple two-stage evolutionary algorithm for constrained multi-objective optimization, Knowl. Based Syst., 228 (2021), 107263. https://doi.org/10.1016/j.knosys.2021.107263 doi: 10.1016/j.knosys.2021.107263
![]() |
[44] | A. Panichella, An improved pareto front modeling algorithm for large-scale many-objective optimization, in Proceedings of the Genetic and Evolutionary Computation Conference, (2022), 565–573. https://doi.org/10.1145/3512290.3528732 |
[45] |
A. P. Guerreiro, C. M. Fonseca, L. Paquete, The hypervolume indicator: {C}omputational problems and algorithms, ACM Comput. Surv., 54 (2021), 1–42. https://doi.org/10.1145/3453474 doi: 10.1145/3453474
![]() |
[46] | A. Freddi, M. Salmon, Introduction to the Taguchi Method, Springer International Publishing, 2019. |
[47] | W. K. Mashwani, A. Salhi, M. A. Jan, R. A. Khanum, M. Sulaiman, Impact analysis of crossovers in a multi-objective evolutionary algorithm, Sci. Int., 27 (2015), 4943–4956. |
[48] |
X. Shi, S. Zou, S. Song, R. Guo, A multi-objective sparse evolutionary framework for large-scale weapon target assignment based on a reward strategy, J. Intell. Fuzzy Syst., 40 (2021), 10043–10061. https://doi.org/10.3233/JIFS-202679 doi: 10.3233/JIFS-202679
![]() |
[49] |
S. Zou, X. Shi, S. Song, A multi-objective optimization framework with rule-based initialization for multi-stage missile target allocation, Math. Biosci. Eng., 20 (2023), 7088–7112. https://doi.org/10.3934/mbe.2023306 doi: 10.3934/mbe.2023306
![]() |