• No results found

Indirect Method for Optimal Control Problem Using Boubaker Polynomial Eman Hassan Ouda | Samaa Fuad Ibraheem | Imad Noah Ahmed Fahmi

N/A
N/A
Protected

Academic year: 2020

Share "Indirect Method for Optimal Control Problem Using Boubaker Polynomial Eman Hassan Ouda | Samaa Fuad Ibraheem | Imad Noah Ahmed Fahmi"

Copied!
7
0
0

Loading.... (view fulltext now)

Full text

(1)

Baghdad Science Journal

Vol.13(1)2016

DOI: http://dx.doi.org/10.21123/bsj.2016.13.1.0183

Indirect Method for Optimal Control Problem Using

Boubaker Polynomial

Eman Hassan Ouda*

Samaa Fuad Ibraheem*

Imad Noah Ahmed Fahmi**

*Department of Applied Science, University of Technology-Baghdad.

**Department of Control and Systems Engineering, University of Technology-Baghdad

Received 29, October, 2014 Accepted 16, March, 2015

This work is licensed under a Creative Commons

Attribution-NonCommercial-NoDerivatives 4.0 International Licens

Abstract:

In this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier.

A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solving

optimal control problems have been deduced and studied for any future work.

Keywords: Optimal control problem, Boubaker polynomial, indirect spectral method.

Introduction:

Control theory is a branch of optimization theory concerned with minimizing or maximizing a given performance index which satisfying the system state equations and constraints [1]. The main goal is to find an optimal

open loop control u*(t) or an optimal

feedback control u*(t, x) that satisfies the dynamical system and optimizes in

some sense performance index.

Analytical solutions of optimal control problems are not always available, so a numerical solution for solving optimal control problems is the most logical way to treat them. [2]

The linear quadratic control (LQP) is a special case of the general nonlinear

optimal control problem (OCP), the (LQP) is stated as follows;

Minimize the quadratic continuous time

subject to the linear system state equations;

̇ A particular form of the (LQP) that

arises in many control system

problems, where A represents an

B is

(2)

, and u(t) is [3]

The solution is known to be λ(t)x(t) .

Where x(t) satisfies the following equation

( ̇

̇) (

) ( )

With boundary conditions

0 0

x ( t )

( f ) 0 .

x

t

 

Indirect methods are generally based on a reduction of the control problem to a problem involving a differential equation such as the HJB(Hamilton-Jacobi-Bellman) or TPBV(Two Point Boundary Value )problem that is based on the principle of optimality which in most casesare very difficult to solve, So the idea is using the solution of the first order necessary conditions for optimality that are obtained from Pontryagin’s minimum principle for

problems without inequality

constraints, then the optimality

conditions can be formulated as a set of differential algebraic equations[4], and to reduce them to an algebraic equations in terms of the orthogonal functions and the operational matrix of differentiation ( or integration) matrix associated with this function. In[3,5-9] the same method has been used with

different kinds of polynomials

(e.g.,Chebyshev, Laguerre, Bernstein). The spectral method was used in this paper to find the solution for these equations by the aid of Boubaker polynomials as the basis function, presenting it as an efficient tool with

spectral method technique for solving a linear quadratic problem.

1-Boubaker Polynomials

The Boubaker polynomials were

established for the first by Boubaker et al. as a guide for solving heat equation inside physical model and then for other physical applications [10,11,12].

During resolution process an

intermediate sequence raised an

interesting recursive formula leading to a class of polynomial functions that performs difference with common

class. Boubaker polynomial is

introduced by the following equation; [2]

…(3)

2-Operational Matrix of

Differentiation:

(3)

1

w h e r e

1 0 0 0 0 0 0 0 . . . 0 0 1 0 0 0 0 0 0 . . . 0 2 0 1 0 0 0 0 0 . . . 0 0 1 0 1 0 0 0 0 . . . 0 2 0 0 0 1 0 0 0 . . . 0 0 2 0 1 0 1 0 0 . . . 0 4 0 3 0 2 0 1 0 . . . 0 0 1 0 5 0 3 0 1 . . . 0 . . . . . . . . . . . . . . . 1

nn n K k                                    

,1 1 , 2

, 1 , 1 1 , 1

1 2

A r e c u r s i v e r e l a t i o n i s g i v e n b y ;

( ) ( ) ( ) , f o r 2 .

1 i f 0 i f ( ) 2 3 i j i i

i j i j i j

m m m

B t t B t B t m

i j i j K k

k k

k k k i

                                

Using the recursive relation for

then we have ̇ ̇

1

3 2 0

4 3 1

2( ) 2 ( )

( ) 3 ( ) 5 ( )

( ) 4 ( ) 4 ( )

B t B t

B t B t B t

B t B t B t

 

 

1

5 4 2 0

1 2

( ) 5 ( ) 3 ( ) 1 3 ( )

t h e r e c u r s i v e r e l a t i o n i s ,

( ) m ( ) ( ) ( ) .

m m m

B t B t B t B t

B t t Bt B t B t

  

  

The differentiation operational matrix for Boubaker polynomials, which is orthogonal polynomials, was deduced as follows;

( ) ( )

B tb B t

0 1 2 3 4 5 6 7 8 9 1 0

0 0 0 0 0 0 0 0 0 0 0 . . . 0

( )

1 0 0 0 0 0 0 0 0 0 0 . . . 0

( )

0 2 0 0 0 0 0 0 0 0 0 . . . 0

( )

5 0 3 0 0 0 0 0 0 0 0 . . . 0

( )

0 4 0 4 0 0 0 0 0 0 0 . .

( ) ( ) ( ) ( ) ( ) ( ) ( ) . . . ( ) m B t B t B t B t B t B t B t B t B t B t B t B t                                                

  ,1 ,

. 0

1 3 0 3 0 5 0 0 0 0 0 0 . . . 0

0 1 4 0 2 0 6 0 0 0 0 0 . . . 0

4 1 0 1 5 0 1 0 7 0 0 0 0 . . . 0

0 4 0 0 1 6 0 0 0 8 0 0 0 . . . 0

1 2 1 0 3 9 0 1 7 0 1 0 9 0 0 . . . 0

0 1 2 2 0 3 8 0 1 8 0 2 0 1 0 0 . . . 0

. . . .

. . . .

. . . .

. . . .

m m n

b b                         0 1 2 3 4 5 6 7 8 9 1 0 ( ) ( ) ( ) ( ) ( ) ( ) ( )

(4)

2 ,1

, ,

'

,1 ( 2 ) ,1

2 , 1 2 , 1 w h e

1

(1) 0 i f , w h e r e 1, 2 , 3 , . . . , 1, 2 , 3 , . . .

( 2 ) 0 i f , s . t ; i s e v e n .

( 3 ) [ 3 2 ] , w h e r e 2 a n d s i s e v e n .

( 4 )

i j

i j

i i

n k k n

b

b i j i j

b i j i j

b b i i

b b k

 

   

  

    

 

( 5 )

r e = 1, 2 1 . a n d a r e i n t e g e r s . . . .

k jnijk n

      

3- Operational Matrix of Integration

 

0

T h e i n t e g r a t i o n o f t h e v e c t o r B t f o r B o u b a k e r p o ly n o m i a ls c a n b e o b t a i n e d a s f o ll o w s ,

w h e r e G i s o p e r a t i o n a l m a t r i x f o r i n t e g r a t i o n .

0 1 0 0 0 0 0 0 0 0 0 0

1

1 0 0 0 0 0 0 0 0 0 0

2

5 1

0 0 0 0 0 0 0 0 0 0

3 3

4 4 2

0 0 0 0 0

8 8 8

( ) ( )

G = t

BdG B t

 

0 0 0 0

2 4 3 3

0 0 0 0 0 0 0 0 0

1 5 1 5 1 5

4 4 2 4 2 4

0 0 0 0 0 0 0 0

2 4 2 4 2 4 2 4

7 2 2 4 1 5

0 0 0 0 0 0 0 0

3 5 3 5 3 5 3 5

1 8 0 7 2 2 4 6

0 0 0 0 0 0 0 0

4 8 4 8 4 8 4 8

2 1 6 7 2 2 4 1 7

0 0 0 0 0 0 0

6 3 6 3 6 3 6 3 6 3

6 0 4 2 1 6 7 2 2 4 2 8

0 0 0 0 0 0

8 0 8 0 8 0 8 0 8 0 8 0

6 4 8 2 1 6 7 2 2 4 3 9

0 0 0 0 0 0

9 9 9 9 9 9 9 9 9 9 9 9

       

 

  

  

  

       

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 



such that;

1 , 2 2 ,1 2 , 3 3 , 2

, ,

D e n o m i n a t o r o f a l l t e r m s o f m a t r i x i s ( - 2 ) f o r a l l > 2 T h e f o l l o w i n g g 's r e p r e s e n t o n l y t h e n u m e r a t o r .

1; 1; 1 / 2 ; 5 ,

(1) 0 , i f & - i s e v e n .

( 2 ) 2 i f 1

i j

i j

i i i

g g g g

g i j i j

g i j i

    

 

   

2 1 , 2

3

( )

3 2

, 2

,1

, 2 , 2

2 , 1 2 1 , 2

4 ( 1 ) ( 1 )

1 w h e r e 1 a n d 2 1,

& a s p o s

.

( 3 ) ( 1) ( 3 ) * 8 , i f i s o d d & 5 .

( 4 ) .

( 5 ) , i f > 4 & i s a p o s i t i v e i n t e g e r .

( 6 )

i

i

i i

i

i

i k k i

n k k n

g i

g k k j n i j

k n

g i i

g

g g i k

g

  

 

 

 

  

  

       

  

 

(5)

4-Spectral method Technique

Spectral method is used to solve finite

Linear quadratic optimal control

problems with the aid of classical polynomials usually like, Hermite, Laguerre polynomials… etc, as the basis functions [4]. In this work, Boubaker polynomials have been used with the following procedure,

-Writing the necessary conditions to

determine the optimal solution of the problem equations (1) and (2), which are the followings,

̇

̇

with the initial conditions x(0)=x0, and

the final conditions λ(tf)=0.

- Choosing a set of state and adjoint

variables and approximating them using a basis function to approximate jN ( )t and substituting in

(7-9), we get

0

0

( ) ( ) ( ) ... (9 )

( ) ( ) ( ) ... (1 0 )

w h e re ; 1, 2 , ..., , 1, 2 , ..., .

a n d a re B o u b a k e r p o ly n o m ia ls

N N

j j ij i

i N N

j j ij i

i

ij ij

i

x t x t a B t

t t b B t

a an d b i N j q

B

 

 

 

 

.

The remaining 2(n-q) state and adjoint variables are obtained from the system state and adjoint equations.

- Form the 2q (NN) system of

algebraic equations as follows;

Differentiate the basis functions Bi(t),

i=1,2,…,N then introducing Boubaker polynomials differentiation operational matrix DB to yield

̇

where the matrix DB is given by

equation (5).

N o te th a t ( ) a n d ( ), 1, 2 , ..., c a n b e w ritte n a s

( )

( )

D iffe re n tia tin g w ith re s p e c t to y ie ld

( )

N N

j j

x t t j n

x B t B t

t

x D B t B

   

 

 

D B t( )

B

 

- Solve the above resulting square of

equations using Gauss elimination procedure with pivoting, to find the

entries of  and .

-Find the approximate value of the performance index J in equation (1). To illustrate the procedure, the following numerical example is given.

5- Numerical ExampleConsider the problem

̇

̇ The exact solution is J=12.

Exact trajectories are

2

2

1 2 2

2

S u f f i c i e n t c o n d i t i o n

0 2 0

.

2

H

u u

H u x u

u

 

 

   

  

 

̇

̇

̇

̇

̇

With boundary conditions

(6)

The state variable and adjoint

variable are approximated by

third order Boubaker polynomials, then

can be found from equation (13)

while is from equation (16).

3

1 0

1 0 0 1 1 2 2 3 3

3

2 0

2 0 0 1 1 2 2 3 3

( ) ,

( ) ( ) ( ) ( ) ( ),

( ) ,

( ) ( ) ( ) ( ) ( ),

i i i

i i i

x t a B

x t a B t a B t a B t a B t

t b B

t b B t b B t b B t b B t

 

   

 

   

Substituting in equations (13-14), using equation (11) we get

from equation(16)

[

]

Substituting in equation (15)

fromequations(17) and (18) with

boundary conditions the following algebraic equations are obtained,

2 0

3 1

2

3

...(1 9 )

...(2 0 )

...(2 1 ) 4 0

1 2 0

2 0

6 0

a b

a b

b

b

 

 

1 0 2

2 1 3

1 0 1 2 3

2 0 1 2 3

...(2 2 )

...(2 3 )

...(2 4 )

...(2 5 )

...(2 6 )

( 0 ) 1 2 1

( 0 ) 1 1

(1) 0 3 2 0

(1) 0 3 2 0

x a a

x a a

x a a a a

b b b b

   

   

     

     

The following state and control approximations are:

1 0 1 2 3

2 0 1 2

0 1

( ) 7 ( ) ( 0 ) ( ) 3 ( ) (1) ( ),

( ) 5 ( ) 6 ( ) 3 ( ),

( ) 6 ( ) 6 ( )

x t B t B t B t B t

x t B t B t B t

u t B t B t

   

   

  

with the approximate value of J*=12,

which is a good approximation to the exact value.

Conclusions:

Boubaker polynomials can be used for

transforming an optimal control

problem to algebraic equation by the aid of indirect method (spectral method technique). The operational matrix of differentiation was derived and applied for solving the optimal conrol problem by reducing it into algebraic problem,

also the operational matrix of

integration was derived to be used in a future work, and then an example has been presented which showed the applicability of this method.

References:

[1] Al-Aisawi H. S., 2006.

Computational Methods for Solving Optimal Control Problems, Thesis, university of Technology, Iraq. [2] Kafash B.;Delavarkhalafi S. M. and

Boubaker K.,2013.A Numerical

Approach for Solving Optimal

Control Problems Using the

Boubaker Polynomials Expansion Scheme.Journal of Interpolation and

Approximation in Scientific

Computing,.33(2013):1-18.

[3] Endow Y., 1989.Optimal Control via Fourier Series of Operational Matrix of Integration. IEEE Log Number 8927782.

[4] Al-Rawi S. N. 2004. On the Numerical Solution for Solving Some Continuous Optimal Control

Problems.Thesis, Al-Mustansiriya

(7)

[5] Al-Rawi S.N. and Eleiwy J. A. 2009. Chebyshev Polynomials and

Spectral Method for Optimal

Control Problem.Eng. & Tech. Journal, 27 (14).

[6] Gradimir V. M. and Dusan J. 2012.

Some Properties of Boubaker

Polynomials and Applications. AIP

conference proceedings, 1479

(1):1050-1053.

[7] Hala R. G. 2007.An Approximate Solution of Some Continuous Time Linear-Quadratic Optimal Control Problem via Generalized Laguerre Polynomials. Thesis, University of Technology.

[8] Jabbar A. E. 2008. Spectral Method for Continuous Optimal Control

Problems with

ChebyshevPolynomials.Thesis, University of Technology.

[9] Singh A. K. and Singh V., 2009. The Bernstein Operational Matrix

of Integration. Appl. Math.

Scie,13(49): 2427-2436.

[10] Boubaker K., 2007.On modified

Boubaker polynomials: Some

Differential and Analytical

Properties of the New Polynomials Issued from an Attempt for Solving Bi-varied Heat Equation. Trends in

Applied Sciences Research, 2

(6):540-544.

[11] Tinggang Zhao, B. K. Ben

Mahmoud, 2009. Some New

Properties of the Applied-Physics

Related Boubaker Polynomials.

Differential equations and control processes, 30(1): 8-19.

[12] Vazquez-Leal H.;Boubaker K., Hernandez L. and Huerta-Chua

J.2013. Approximation for

Transient of Nonlinear Circuits

Using RHPM and BPES

Methods.Hindawi, Jour. Elect. Comp. Eng. 2013(973813):1-6.

ةرشابه ريغ تقيرط

ركبىب دوذح ةدذعته ماذختساب ىلثه ةرطيس تلأسول

ةدىع يسح ىاويا

*

نيهاربا داؤف ءاوس

*

**يوهف ذوحا حىً داوع

* حيجىنىنكتنا حعياجنا،حيقيثطتنا وىهعنا ىسق

-داذغت

** حسذنه ىسق حيجىنىنكتنا حعياجنا، ىظنناو جرطيسنا

-داذغت

تصلاخلا

:

)فيطنا حقيرط حينقت(جرشاثًنا ريغ حقيرطنا واذختسات ىهثي جرطيس حنأسي باسح ىت ،ثحثنا اذه يف

واذختسات حقفارًنا خاريغتًناو حناحنا خاريغتي ةيرقت ىت حقيرطنا هذه حطساىت.ركتىثت حفورعًنا دوذحنا جدذعتًتو ذح جدذعتي نكًي حيرثج خلاداعي ىنا ىهثًنا جرطيسنا حنأسي ميىحت ىت ثيح حنىهجًنا خلاياعًنا عي ركتىت دو

خلاياكتنا حفىفصي ىث خاقتشًنا حفىفصي جاتنتسا ىنا حفاضلاات ، ىهثًنا حفهكهن حيدذعنا حًيقنا داجياو حنىهست اههح كو حيناكيا حيضىتن يقيثطت لاثي عي حيذختسًنادوذحنا جدذعتي سفنن .حقيرطنا هذه جءاف

:تيحاتفولا ثاولكلا دذعتي ،ىهثي جرطيس حنأسي

References

Related documents

The revenue for renewable energy division increased significantly by 68.8% to RM16.7 million in current financial period from RM9.9 million in preceding

1) The newly designed depth-control planting unit, consisted of single-side gauge wheel, double-disc opener and parallel four-bar linkage, could maintain the uniformity

KYIV – Central Election Commission Chairman Mykhailo Riabets said on Ukrainian Television on April 3 that the results of the March 31 proportional vote, in which 225 parliamentary

This ―word-spreading‖ is one of AR‘s goals (Interview with AR‘s Process Leader, 2009) and as the analysis of the website show, the interest is there (see 6.1

Please consult a medical professional for assistance in planning for or treating

The development of this cross-disciplinary problem-solving ability has increasingly become part of clinical legal education.' The pediatric medical-legal partnership, a

This on-line exhibition (http://goo.gl/7FlWU) presents a small selection of works by Latin American artists who incorporate in their creations technologies

The present study reveals that rodent diversity in KSNP is a reflection of the habitat quality and their composition and abundance in different habitat types and