• No results found

Largest Possible Variable Delay In Control Problem

N/A
N/A
Protected

Academic year: 2020

Share "Largest Possible Variable Delay In Control Problem"

Copied!
5
0
0

Loading.... (view fulltext now)

Full text

(1)

Largest Possible Variable Delay In

Control Problem

Amit Ghosh

1

, Tanmoy Hazra

2

, and Towhid E Aman

3

1

Department of Mathematics, Raiganj University, West Bengal, India

2

Department of Mathematics,Gangarampur College, West Bengal India

3

Department of Mathematics,Gangarampur College, West Bengal India

Abstract

In this paper we consider optimal control problem involbing largest possible delay. It considers variable delay in connection with optimal control problem.Here the necessary conditions of optimality are obtained and it is shown that the conditions agree, in particular case with the corresponding known conditions when there is no delay, or small delay where second degree terms are not considered.

Key words and phrases: Pontryagin’s maximum principle, Optimal control problem, Delay dif-ferential equation, Dynamical system

1

INTRODUCTION

So far as real world continuous phenomena are concerned, delay differential equation is more be fitting than ordinary differential equations. Now control problems associated with ordinary differential equations representing dynamical systems are well studied in the literature. Also control problems modeled by differential equation involving small time delay[1] and compara-tively large delay [2], ignoring higher degree terms are well studied. Also the problems without ignoring any higher degree terms are discussed for constant time delay[5]. But similar problems without ignoring higher terms for variable delay are not well studied. Hence it is essential to consider control problems with large variable time delay, without ignoring any higher degree terms. With this in view, the present paper suitably generalizes the well known Pontryagin’s maximum principle, which is an essential tool for solving an optimal control problem, without ignoring any higher degree terms for largest possible variable delay.

1. GENERAL FORM OF THE CONTROL PROBLEM INVOLVING VARIABLE DELAY

Problem I

Let the dynamical system be given by ˙

x=f(t, x(t), xτ(t)(t), u(t), uτ1(t)(t))... (1)

wheret∈[0,1]⊂R ,x(t)∈Rn,u(t)Rm,x

(2)

Rm and f: R×Rn×Rn ×Rm×Rm −→ Rn is a continuously differentiable mapping and

τ:[0, t1]−→(−δ, δ) ⊂R and τ1:[0, t1]−→(−δ1, δ1) ⊂R are also differentiable . Here the delay

are not small, hence higher orderτ andτ0 are not negligible.

Let the objective criteria be given by

MaximizeJ(u) =φ(t1, x(t1)) +

Rt1

0 F(t, x(t), xτ(t)(t), u(t), uτ1(t))dt... (2)

whereφ:R×Rn−→R, F: R×Rn×Rn×Rm×Rm−→R are also differentiable mappings.

Here we would like to develop Pontryagin’s Maximum principle without ignoring any higher order terms ofτ(t) andτ1(t) . Before going to prove the actual Theorem let us prove the

follow-ing lemma.

1.1

Lemma 1

The series of the form

τ(t)¨x(t)−τ22!(t)x¨˙(t) +...+ (−1)n τn(t)

n! x

n+1(t) +....

is uniformly concergent if|τn(t)xn+1(t)| <1 and x(t) is continuously differentiable .

Proof of the lemma:

The given series is a series of real valued functions.By the given condition|τn(t)xn+1(t)|<1 and

∀n.If we take Mn = n1! then every term un(x) of the series satisfies|un| ≤ Mn ∀n. And since the series Σ|Mn| is convergent. Then by the Weierstrass’s M-test the given series is uniformly convergent . this proves the lemma

By the above lemma we can denote

ψ1(¨x(t),x¨˙(t), ...) =τ(t)¨x(t)−

τ2(t)

2! x¨˙(t) +...+ (−1)

n τn(t)

n! x

n+1(t) +....

if|τn(t)xn+1(t)|<1 and x(t) is continuously differentiable functionn.

similarly we can write

ψ2(¨u(t),u¨˙(t), ...) =τ1(t)¨u(t)−

τ2 1(t)

2! u¨˙(t) +...+ (−1)

n τ1n(t)

n! u

n+1(t) +....

for|τ1n(t)un+1(t)|<1 , and continuously differentiable function u(t). ∀n.

1.2

Theorem 1

A necessary condition that (x∗, u∗) is a solution of the control problem I with|τn(t)xn+1(t)|<1, |τn

1(t)un+1(t)| < 1 , there exist a co-state vector p(t) ∈ Rn such that PT(t1) = (∂φ∂x)t=t1,

˙

PT+∂H∂x +∂x∂H

τ(t) = 0 and

(∂H∂u+∂u∂H τ1 (t)) ˙u=

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}+

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)}atu=u∗. where

H(t, x, xτ(t), u, uτ1(t), p) =F(t, x, xτ(t), u, uτ1(t)) +p

Tf(t, x, x

τ(t), u, uτ1(t));

(3)

as given by

Ja(u) =φ(t1, x(t1)) +R

t1

0 [F(t, x, xτ(t), u, uτ1(t)) +p

T(f(t, x, x

τ(t), u, uτ1(t)))−x˙]dt

Applying the rule of integration by parts we get

Ja(u) =φ(t1, x(t1))−[pTx]t01+

Rt1

0 [H(t, x, xτ(t), u, uτ1(t), p) + ˙p

Tx]dt

Where the Hamiltonian function H(t, x, xτ(t), u, uτ1(t), p) is defined by

H(t, x, xτ(t), u, uτ1(t), p) =F(t, x, xτ(t), u, uτ1(t))+p

Tf(t, x, x

τ(t), u, uτ1(t))

Now the variationδJa of Ja(u) is given by

δJa = (∂φ∂x −pT)δx|t=t1+

Rt1

0 [

∂H ∂xδx+

∂H

∂xτ(t)δxτ(t)+

∂H ∂uδu+

∂H

∂uτ1 (t)δuτ1(t)+ ˙p

Tδx]dt

Now applying Taylor’s theorem for a fixedt∈[0, t1] we get

xτ(t)(t) =x(t−τ(t)) =x(t)−τ(t) ˙x(t) +

τ2(t) 2! x¨(t)−

τ3(t)

3! x¨˙(t) +...+ (−1)

n−1τn(t)

n! x

n(t) +...

Thus

xτ(t)(t) = x(t−τ(t)) = x(t)−τ(t) ˙x(t) +

τ2(t) 2! x¨(t)−

τ3(t)

3! x¨˙(t) +...+ (−1)

n−1τn(t)

n! x

n(t) +... for everyt∈[0, t1]

This implies

δxτ(t)=δx−τ(t)¨x(t)δt−x˙(t) ˙τ(t)δt+

τ2(t)

2! x¨˙δt+τ(t)¨x(t) ˙τ(t)δt−

τ3(t)

3! x

iv(t)δtτ2(t)

2! ¨x˙(t) ˙τ(t)δt+

...+ (−1)n−1τnn(!t)xn+1(t)δt+ (−1)n τ(nn1)!1 xn(t)δt+...

=δx - (τ(t)¨x(t)−τ22!(t)x¨˙(t) +...+ (−1)n τn(t)

n! x

n+1(t) +....)δt- (t)(t)δt+ (τ(tx(t)τ2(t)

2! x¨˙(t) +

...+ (−1)n τn(t)

n! x

n+1(t) +....) ˙τ(t)δt

Now by lemma 1 and by the given condition of the theorem the series

τ(t)¨x−τ22!(t)x¨˙+...(−1)n−1τn(t)

n! x

n+1(t) +...is convergent.

And thus

δxτ(t)=δx-ψ1(¨x(t),x¨˙(t), ...)δt- ˙x(t) ˙τ(t)δt+ψ1(¨x(t),x¨˙(t), ...) ˙τ(t)δt

=δx- (1−τ˙(t))ψ1δt- ˙x(t) ˙τ(t)δt

Whereψ1(¨x(t),x¨˙(t), ...) =τ(t)¨x(t)−

τ2(t)

2! x¨˙(t) +....+ (−1)

n τn(t)

n! x

n+1(t) +...

Similarly we can write

δuτ1(t) =δu- (1−

˙

(4)

Whereψ2(¨u(t),u¨˙(t), ...) =τ1(t)¨u(t)−τ

2 1(t)

2! u¨˙(t) +...+ (−1)

n τ1n(t)

n! u

n+1(t) +....

Therefore finally we get

δJa = (∂φ∂x−pT)δx|t=t1+

Rt1

0 [

∂H ∂xδx+

∂H

∂xτ(t){δx−(1−τ˙(t))ψ1δt−x˙(t) ˙τ(t)δt}+

∂H ∂uδu+

∂H ∂uτ1 (t){δu−

(1−τ˙1(t))ψ2δt−u˙(t) ˙τ1(t)δ(t)}+ ˙pTδx]dt

= (∂φ∂x−pT)δx| t=t1+

Rt1

0 [(

∂H ∂x+

∂H ∂xτ(t)+ ˙p

T)δx+(∂H ∂u+

∂H ∂uτ

1 (t))δu−

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}δt−

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)}δt]dt

We now choosep(t) so that

pT = ∂φ∂x at t=t1i.e. pT(t1) =∂φ∂x|t=t1 and

∂H ∂x +

∂H ∂xτ + ˙p

T = 0

Then under this choice ofp(t), δJa becomes

δJa =

Rt1

0 [(

∂H ∂u +

∂H ∂uτ1 (t))δu−

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}δt−

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)}δt]dt

Assuming thatJa is maximum corresponding tou=u∗,we haveδJa = 0 atu=u∗this gives

(∂H∂u + ∂u∂H τ1 (t))δu−

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}δt−

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)}δt = 0 at

u=u∗

i.e(∂H∂u +∂u∂H τ1 (t))δu=

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}δt+

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)}δtat u=u∗

or,(∂H∂u +∂u∂H τ1 (t))

δu δt =

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}+

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)} at u=u∗

Taking the limit asδt→0 we get

(∂H∂u +∂u∂H τ1 (t)) ˙u=

∂H

∂xτ(t){(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)}+

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)} atu=u∗

This proves the theorem.

1.3

OBSERVATION:

If|τ(t)|<1 and |x(n+1)(t)| <1 , then|τn(t)x(n+1)(t)|< 1 and in this case the necessary

con-ditions remain unchange. In this paper we try to find the largest possible delay. If |τ(t)| > 1 then from the condition |τn(t)x(n+1)(t)| <1 we can say that the delay τ(t) is largest possible

depending on|x(n+1)(t)|< 1

τn(t).

similarly the delayτ1(t) is largest possible depending on|u(n+1)(t)| < τn1

1(t)

(5)

1.4

SOME SPECIAL CASES:

(1) If the delay occurs only in the state vector x(t), then the above necessary conditions of opti-mality becomes;

pT(t1) = (∂φ∂x)t=t1, ˙p

T +∂H ∂x +

∂H

∂xτ(t) = 0, and

∂H

∂uu˙ ={(1−τ˙(t))ψ1+ ˙x(t) ˙τ(t)} ∂H ∂xτ(t)

(2) If the delay occurs only in the control vector u(t), then the above conditions becoms:

pT(t

1) = (∂φ∂x)t=t1, ˙p

T +∂H

∂x = 0, and ( ∂H

∂u + ∂H ∂uτ0) ˙u=

∂H ∂uτ1 (t){(1−

˙

τ1(t)ψ2+ ˙uτ1˙(t)}

(3) If there is no delay, then the above results agrees with the condition given by Pontrya-gin’s maximum principle.

(4) If both the delays are very small then as like as [1] then the result agrees with the cor-responding result in [1].

(5) If both the delays are comparatively large such as [2], then the result agrees with the corre-sponding result in [2].

1.5

REFERENCES:

[1]. T.E.Aman and D.K.Bhattacharya: Control theoretic Optimization in general delay-differential equations with small delay. Rev. Acad. Canar. Ciens., XIX (nums1-2), 37-47 (2007).

[2]. T.E.Aman, A.Ghosh, S.K.Sur and D.K.Bhattacharya: Optimal Control Problem With Com-paratively Large Delay.Rev. Acad. Canar. Ciens., XXII (nums1-2), 23-29 (2010).

[3]. Lee, E.B. and L.Markus: Foundations of optimal control theory. John Willey and sons, Inc. New York (1968).

[4]. Pontryagin, L.S., V.S.Boltyanski, R. V. Gamkrelidze, and E.F. Ischenko: The mathematical theory of optimal process. Wiley Interscience, New York (1962).

References

Related documents

This latter point illustrates that dispersal predictions using an Eulerian approach can be substantially improved by considering the phenotypes of the dispersers and the causes

Sharar (2012) conducted a study about introducing and improving reflective practices of teachers in a school at Chitral, it was found that reflective practice is a big challenge

These behaviours include physical activity (PA), healthy nutrition, tobacco smoking, substance abuse, and sun overexposure. The specific aims of the intervention were:

Thus, it appears possible to reduce the energy in- puts for the reclamation of plantation fields after cul- tivation of willow through the use of machines with a smaller working

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

Within VBA, the Direct Services Program staff, under the Office of Policy and Program Management, provides quality assurance over call centers and IRIS by

Draw a block diagram of this cache showing its organization and how different address fields are used to determine a cache hit/miss.. Design the cache structure with

regionally specific monophyletic clades within both hot and cold clades, the times of common ancestry for Chroococcidiopsis variants pre-dated estimates for contemporary aridity