44 2033180199
All submissions of the EM system will be redirected to Online Manuscript Submission System. Authors are requested to submit articles directly to Online Manuscript Submission System of respective journal.
Journal of Pure and Applied Mathematics

Sign up for email alert when new content gets added: Sign up

Maryam Arablouye Moghaddam1, Yousef Edrisi Tabriz1* and Mehrdad Lakestani2
 
1 Department of Mathematics, Payame Noor University, Tehran, Iran
2 Department of Applied Mathematics, University of Tabriz, Tabriz, Iraq
 
*Correspondence: Yousef Edrisi Tabriz, Department of Mathematics, Payame Noor University, Tehran, Iran, Email: Yousef_Edrisi@pnu.ac.ir

Received: 17-Apr-2024, Manuscript No. PULJPAM-24-7027; Editor assigned: 19-Apr-2024, Pre QC No. PULJPAM-24-7027 (PQ); Reviewed: 04-May-2024 QC No. PULJPAM-24-7027; Revised: 17-Mar-2025, Manuscript No. PULJPAM-24-7027 (R); Published: 25-Mar-2025

Citation: Moghaddam MA, Tabriz YE, Lakestani M. A numerical approach for solving a class of fractional optimal control problems using Genocchi polynomials. J Pure Appl Math. 2025;9(2):1-6.

This open-access article is distributed under the terms of the Creative Commons Attribution Non-Commercial License (CC BY-NC) (http://creativecommons.org/licenses/by-nc/4.0/), which permits reuse, distribution and reproduction of the article, provided that the original work is properly cited and the reuse is restricted to noncommercial purposes. For commercial reuse, contact reprints@pulsus.com

Abstract

In this paper, an efficient and accurate computational method based on the Genocchi polynomials is proposed for solving a class of fractional optimal control problems. In the proposed method, the Caputo fractional derivative operator for the Genocchi polynomials is given. The proposed technique is applied to transform the state and control variables into non-linear programing parameters at collocation points. The most important advantages of our method are easy implementation, simple operations. Some illustrative examples are presented to show the efficiency and accuracy of the method.

Keywords

Fractional optimal; Control problems; Caputo derivative; Genocchi polynomials; Operational matrix; Non-linear programming

Introduction

In the present paper, we consider a class of optimal control problems the objective function and the dynamic system with the Caputo fractional derivative as follows:

Image

where h is a scalar function, x(t) is state vector and u(t) is control vector of dimension n × 1 and m × 1, respectively [1-3]. In the real word, many physical phenomena are controlled by the differential equations. Therefore, in recent years, Optimal Control Problems (OCPs) have been the interest of many scientists. A lot of research has been done in the context of OCPs, but the research on the Fractional Optimal Control Problems (FOCPs) is not so high. Ashpazzadeh, et al., in have used Hermite spline multiwavelest to solve the FOCPs. In, the ractional Remann-Liuovel is used to numerically solve the problem. Also, is a used numerical simulation for FOCPs with the Caputo fractional derivative in. In, Legandar functions are used as basis for solving FOCPs. Keshavarze used Bernoulli,s polynomials to solve FOCPs. Mashayekhi, et al., used hebrid functions basis to numerically solve FOCPs. The main aim of this paper is to solve fractional optimal control problems in the sense of Caputo derivative by using Genocchi polynomials. With the help of the Genocchi polynomials, the objective function, state and control vectors are expanded. To calculate coefficients, we used the collocation method with the nodes in the Chebyshev roots as collocation points. In finally, the FOCPs transformed into a problem with algebraic equations that can be solved by suitable algorithm. The paper is organized as follows: In the next section, we introduce the preliminary integration and fractional derivative. In section 3, we describe the basic formulating of the Genocchi polynomials required for our subsequent development. I section 4, we apply the Genocchi polynomials on [0, 1] to solve equations (1)-(4). In section 5, we will solve two numerical examples with the proposed method [4-6].

Materials and Methods

Some preliminaries in fractional calculus:

Here, we give two definitions related to Rieman-Liouvill fractional integral and Caputo fractional derivative.

Definition 1: The Riemann-Liouvill fractional integral of order β>0 of a function f is de- fined as follows:

Image

which Iβ is called the Riemann-Liouville fractional integration operator. Caputo,s derivative operator Dβ of a function f (t) is defined as follow:

Image

Definition 2: The Caputo fractional derivative of order β with the lower limit zero for a function

f ∈ Cn(0, ∞) is defined as follows. Some properties of Caputo, s fractional derivatives as:

Image

Where ⌈.⌉ is the ceiling function. Also the Caputo fractional-order derivative operator is a linear operator. That is, for all real scalers λ and μ and for all functions f (t) and g(t), we have:

Image

Results and Discussion

Properties of Genocchi polynomials

The genocchi polynomials: Suppose Gi(t) is the Genocchi polynomials that obtained from the formula below:

Image

where Gi−r, r = 0, 1, . . . , i in Eq. (6) are the Genocchi numbers, that can be found as:

Image

where Bi is the Euler, s numbers, which is defined as:

Image

And

Image

Thus, using Eq (6) and Genocchi numbers, we can write:

Image

The set G(t) = G0(t), G1(t), . . . , Gn(t) is a complete orthogonal set in the Hilbert space L2[0, 1]. Thus, we can expand any functions in this space in terms of G(t) polynomials [7,8]. The Genocchi polynomials satisfies in the following relations:

Image

The function approximation

Suppose G(t) is a N -vector as:

Image

Function f (t) ∈ L2[0, 1] may be represented by the Genocchi polynomials as

Image

Where;

Image

And, using Eq.(8) we obtain

Image

Where;

Image

Thus,

Image

Operational matrices of fractional derivative

The kth derivative of G(x) is defined as:

Image

Therefore, we can approximate derivative of arbitrary function f(t) using the Genocchi polynomials.

Image

Where wi in Eq (13) is

Image

(i − 1) denotes the (i-1)th order derivative of f (t). In, for non-integer β > 0, the Caputo derivative of the vector G of order β can be defined as:

Image

Where Dβ is a N × N matrix. It can be show:

Image

where ηi,k,j is given by:

Image

Where Gi−r denotes the Genocchi numbers.

Sloving the fractional optimal control problems by the proposed method

In this section, we consider the FOCPs given in Eq (1)-(4). The factional state rate

Image

state t vector x(t) and control vector u(t), can be approximated by Genocchi polynomials as:

Image

Where Dβ operational matrix given in Eq (16). We suppose:

Image

Im and In are m × m and n × n dimensional identity matrices, G(t) is N vector, ’⊗’ denotes Kronecker product and G1(t) and G2(t) are matrices of order mN × m and nN × n.

Then using Eqs (21, 22), we can write:

Image

Image

we assume two models for h in Eq (26):

h(x(t); u(t); t) is quadratic function. Thus Eq (26) is to form:

Image

Where T denotes transposition, Q is positive semi-definite matrix and R is the positive

definite matrix. Using Eqs (23, 24) we get:

Image

Therefore;

Image

Using by Eq (10) we get:

Image

h(x(t); u(t); t) is non-quadratic function. We evaluate objective function J by a suitable

Newton-Cots numerical integration as:

Image

ρi, i = 0; 1; : : : ; k are the Newton-cots integration weight functions By collocating Eq (27) at the points:
Image

We get

Image

Now the problem changed to find the minimum solution of (33) or (34) with the conditions (29) and (36). Using lagrange multiplier method we have:

Image

Where λ=(λ1, λ2, . . . , λN) and μ = (μ1, μ2, . . . , μN) are the lagrange multipliers. To find the optimal solution of Eq (37) we put

Image

Eqs(38) given an algebraic system of equations which can be solved to find the values E, U, λ and μ [9-14].

Illustrative examples

Example 1 consider the following free final state FOCPs:

Image

With ptimal value J∗=0.171118. By applying present method, we obtain the numerical results (Table 1).

Methods J
Classical chebyshev
m=8, k=26 0.17358
m=16, k=28 0.17185
Hybrid function
w=15, m=3, n=4 0.170136
w=15, m=4, n=4 0.170136
Haar wavelet collocation
K=8 0.172548
k=16 0.171262
k=32 0.170112
 Present method
N=8 0.179078
N=10 0.170291
N=12 0.170049

TABLE 1 Comparison of the value of J for β=1, for example 1

values of N. Figure 1 shows the control function curves and plots of state vectors for β = 0.9, 0.99, 1 with N=10. Also, Table 1, shows the values of J for β=1 and gives a comparison between our results [15,16].

Image

Figure 1) Curves of x1(t), x2(t) and u(t) with N=10 for=0:9; 0:99

Example: This example has been chosen from. The problem is:

Image

The state and control functions that minimize the preformance index J are given by x(t)=2t-1 and u(t)=1, respectively. This problem for β is adapted from e and has been studied by several authors. This problem has the minimum value objective function J=−0.30682 for β=1. Table 2, gives the results reported and the presented method. Also, Figure 2, (a) shows the plot of x(t) for exact value of state vector and approximate state vector where β approach to 1 and (b) shows plot of control vector for the different values of β, that approaches to 1 [17-20]. Also, for this problem, we define error of x(t), En(x), in the following from:

Image

Methods J En(x)
Method
n=2 -0.3064 8.07e-4
n=4 -0.30682 4.99e-5
n=8 -0.30685 3.09e-6
n=16 -0.30669 1.92e-7
n=32 -0.30685 1.20e-8
Method
M=3, N=1 -0.30683 -
Method
M=3, N=1 -0.30684 -
Method
M=3 -0.30685 -
Present method
N=5 -0.30685 9.61e-6
N=6 -0.30685 2.98e â?? 6
N=8 -0.30685 3.21e â?? 9

TABLE 2 Comparison of the value of J for β=1, for example 2

Image

Figure 2) Curves of x(t) and u(t) with N=5

Conclusion

We demonstrated how to apply the Genocchi polynomials in the approximation of FOCPs. The developed technique proved to give accurate and consistent results for both the state and control variables. Computed errors between our approximate solutions and the analytical solutions of specific problems were negligible, proving the accuracy of our suggested scheme.

References

 
Google Scholar citation report
Citations : 83

Journal of Pure and Applied Mathematics received 83 citations as per Google Scholar report

Journal of Pure and Applied Mathematics peer review process verified at publons
pulsus-health-tech
Top