On Fractional Fourier Transform Moments Based On Ambiguity FunctionCSCJournals
The fractional Fourier transform can be considered as a rotated standard Fourier transform in general and its benefit in signal processing is growing to be known more. Noise removing is one application that fractional Fourier transform can do well if the signal dilation is perfectly known. In this paper, we have computed the first and second order of moments of fractional Fourier transform according to the ambiguity function exactly. In addition we have derived some relations between time and spectral moments with those obtained in fractional domain. We will prove that the first moment in fractional Fourier transform can also be considered as a rotated the time and frequency gravity in general. For more satisfaction, we choose five different types signals and obtain analytically their fractional Fourier transform and the first and second-order moments in time and frequency and fractional domains as well.
On Fractional Fourier Transform Moments Based On Ambiguity FunctionCSCJournals
The fractional Fourier transform can be considered as a rotated standard Fourier transform in general and its benefit in signal processing is growing to be known more. Noise removing is one application that fractional Fourier transform can do well if the signal dilation is perfectly known. In this paper, we have computed the first and second order of moments of fractional Fourier transform according to the ambiguity function exactly. In addition we have derived some relations between time and spectral moments with those obtained in fractional domain. We will prove that the first moment in fractional Fourier transform can also be considered as a rotated the time and frequency gravity in general. For more satisfaction, we choose five different types signals and obtain analytically their fractional Fourier transform and the first and second-order moments in time and frequency and fractional domains as well.
Similarity Measures for Traditional Turkish Art MusicCSCJournals
Pitch histograms are frequently used for a wide range of applications in music information retrieval (MIR) which mainly focus on western music. However there are significant differences between pitch spaces of traditional Turkish art music (TTAM) and western music which prevent to apply current methods. In this sense comparison of pitch histograms for TTAM corresponds to the research domain in pattern recognition: finding an appropriate similarity measure in relation with the metric axioms and characteristics of the data. Therefore we have evaluated various similarity measures frequently used in histogram comparison such as L1-norm, L2-norm, histogram intersection, correlation coefficient measures and earth mover’s distance (EMD) for TTAM. Consequently we have discussed one of the problems of the domain, about measures regarding overlap or/and non-overlap between ordinal type histograms and presented an improved version of EMD for TTAM.
ON M(M,m)/M/C/N: Interdependent Queueing ModelIOSR Journals
Abstract: This paper deals with a multiple server Queueing system in which arrivals and services are
intredependent and follow a bivariate Poisson process and having startup delay. Using the Supplementary
Varible Techniue these models are analyzed. The expected length of the Dorment period, the busy period,
expected number of units in the queue are derived and analyzed in the light of the dependence paramater
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREEijscmc
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In
this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected
weighted graph with n vertices and m edges. This algorithm uses the cluster techniques to reduce the
number of processors by fraction 1/f (n) and the parallel work by the fraction O ( 1 lo g ( f ( n )) ),where f (n) is an
arbitrary function. In the case f (n) =1, the algorithm runs in logarithmic-time and use super linear work on
EREWPRAM model. In general, the proposed algorithm is the simplest one.
Seminar at IEEE Computational Intelligence Society, Singapore Chapter at School of Electrical and Electronic Engineering, NTU, Singapore, 20 February 2019
string searching algorithms. Given two strings P and T over the same alphabet E, determine whether P occurs as a substring in T (or find in which position(s) P occurs as a substring in T). The strings P and T are called pattern and target respectively.
Divide and Conquer Algorithms - D&C forms a distinct algorithm design technique in computer science, wherein a problem is solved by repeatedly invoking the algorithm on smaller occurrences of the same problem. Binary search, merge sort, Euclid's algorithm can all be formulated as examples of divide and conquer algorithms. Strassen's algorithm and Nearest Neighbor algorithm are two other examples.
Similarity Measures for Traditional Turkish Art MusicCSCJournals
Pitch histograms are frequently used for a wide range of applications in music information retrieval (MIR) which mainly focus on western music. However there are significant differences between pitch spaces of traditional Turkish art music (TTAM) and western music which prevent to apply current methods. In this sense comparison of pitch histograms for TTAM corresponds to the research domain in pattern recognition: finding an appropriate similarity measure in relation with the metric axioms and characteristics of the data. Therefore we have evaluated various similarity measures frequently used in histogram comparison such as L1-norm, L2-norm, histogram intersection, correlation coefficient measures and earth mover’s distance (EMD) for TTAM. Consequently we have discussed one of the problems of the domain, about measures regarding overlap or/and non-overlap between ordinal type histograms and presented an improved version of EMD for TTAM.
ON M(M,m)/M/C/N: Interdependent Queueing ModelIOSR Journals
Abstract: This paper deals with a multiple server Queueing system in which arrivals and services are
intredependent and follow a bivariate Poisson process and having startup delay. Using the Supplementary
Varible Techniue these models are analyzed. The expected length of the Dorment period, the busy period,
expected number of units in the queue are derived and analyzed in the light of the dependence paramater
A NEW PARALLEL ALGORITHM FOR COMPUTING MINIMUM SPANNING TREEijscmc
Computing the minimum spanning tree of the graph is one of the fundamental computational problems. In
this paper, we present a new parallel algorithm for computing the minimum spanning tree of an undirected
weighted graph with n vertices and m edges. This algorithm uses the cluster techniques to reduce the
number of processors by fraction 1/f (n) and the parallel work by the fraction O ( 1 lo g ( f ( n )) ),where f (n) is an
arbitrary function. In the case f (n) =1, the algorithm runs in logarithmic-time and use super linear work on
EREWPRAM model. In general, the proposed algorithm is the simplest one.
Seminar at IEEE Computational Intelligence Society, Singapore Chapter at School of Electrical and Electronic Engineering, NTU, Singapore, 20 February 2019
string searching algorithms. Given two strings P and T over the same alphabet E, determine whether P occurs as a substring in T (or find in which position(s) P occurs as a substring in T). The strings P and T are called pattern and target respectively.
Divide and Conquer Algorithms - D&C forms a distinct algorithm design technique in computer science, wherein a problem is solved by repeatedly invoking the algorithm on smaller occurrences of the same problem. Binary search, merge sort, Euclid's algorithm can all be formulated as examples of divide and conquer algorithms. Strassen's algorithm and Nearest Neighbor algorithm are two other examples.
On the Fractional Optimal Control Problems With Singular and Non–Singular ...Scientific Review SR
The aim of this paper is to design an efficient numerical method to solve a class of time fractional optimal control
problems. In this problem formulation, the fractional derivative operator is consid- ered in three cases with both
singular and non–singular kernels. The necessary conditions are derived for the optimality of these problems and the
proposed method is evaluated for different choices of derivative operators. Simulation results indicate that the
suggested technique works well and pro- vides satisfactory results with considerably less computational time than
the other existing methods. Comparative results also verify that the fractional operator with Mittag –Leffler kernel in
the Caputo sense improves the performance of the controlled system in terms of the transient response compared to
the other fractional and integer derivative operators.
Haar wavelet method for solving coupled system of fractional order partial d...nooriasukmaningtyas
This paper deal with the numerical method, based on the operational matrices of the Haar wavelet orthonormal functions approach to approximate solutions to a class of coupled systems of time-fractional order partial differential equations (FPDEs.). By introducing the fractional derivative of the Caputo sense, to avoid the tedious calculations and to promote the study of wavelets to beginners, we use the integration property of this method with the aid of the aforesaid orthogonal matrices which convert the coupled system under some consideration into an easily algebraic system of Lyapunov or Sylvester equation type. The advantage of the present method, including the simple computation, computer-oriented, which requires less space to store, timeefficient, and it can be applied for solving integer (fractional) order partial differential equations. Some specific and illustrating examples have been given; figures are used to show the efficiency, as well as the accuracy of the, achieved approximated results. All numerical calculations in this paper have been carried out with MATLAB.
Discretizing of linear systems with time-delay Using method of Euler’s and Tu...IJERA Editor
Delays deteriorate the control performance and could destabilize the overall system in the theory of discretetime
signals and dynamic systems. Whenever a computer is used in measurement, signal processing or control
applications, the data as seen from the computer and systems involved are naturally discrete-time because a
computer executes program code at discrete points of time. Theory of discrete-time dynamic signals and systems
is useful in design and analysis of control systems, signal filters, state estimators and model estimation from
time-series of process data system identification. In this paper, a new approximated discretization method and
digital design for control systems with delays is proposed. System is transformed to a discrete-time model with
time delays. To implement the digital modeling, we used the z-transfer functions matrix which is a useful model
type of discrete-time systems, being analogous to the Laplace-transform for continuous-time systems. The most
important use of the z-transform is for defining z-transfer functions matrix is employed to obtain an extended
discrete-time. The proposed method can closely approximate the step response of the original continuous timedelayed
control system by choosing various of energy loss level. Illustrative example is simulated to demonstrate
the effectiveness of the developed method.\
Time domain analysis and synthesis using Pth norm filter designCSCJournals
In this paper, a new approach for the design and implementation of FIR filter banks for multirate analysis and synthesis is explored. The method is based on the least algorithm and takes into consideration the characteristics of the individual filters. Features of the proposed approach include; it does not need to adapt the weighting function involved and no constraints are imposed during the course of optimization. Mostly, the FIR filter design is concentrated around linear phase characteristics but with the help of minimax solution for FIR filters using the least- algorithm, this optimal filter design approach helps us to enhance the properties of LTI systems with better stability filter coefficient convergence. Hence norm algorithm will be used in multirate to explore the stability and other properties. We have proposed the band analysis system for analysis and synthesis purpose to explore multirate filter banks. The Matlab toolbox has been used for implementing the filters and its properties will be verified with various plots and tables. The results of this paper enable us to achieve good signal to noise ratio with analysis and synthesis level operations.
Numerical Optimization of Fractional Order PID Controller inventionjournals
: The fractional order PID controller is the generalization of classical PID controller, many Researchers interest in tuning FOPID controller here we use the Pareto Optimum technique to estimate the controller parameter and compare our result with the classical model and with other Researchers result .we used both mathematica package and matlab for tuning and simulation
Oscillatory motion control of hinged body using controllereSAT Journals
Abstract Due to technological revolution , there is change in daily life usuage of instrument & equipment.These usuage may be either for leisure or necessary and compulsory for life to live. In past there is necessity of a person to help other person but today`s fast life has restricted this helpful nature of human. This my project will helpful eliminate such necessity in certain cases. Oscillatory motion is very common everywhere. But its control is not upto now deviced tactfully. So it is tried to automate it keeping mind constraints such as cost, power consumption, safety,portability and ease of operating. Proper amalgamation of hardware and software make project flexible and stuff. The repetitive , monotonous and continuous operation is made simple by use of PIC microcontroller. There does not existing prototype or research paper on this subject. It probable first in it type.
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
An Improved Adaptive Multi-Objective Particle Swarm Optimization for Disassem...IJRESJOURNAL
With the development of productivity and the fast growth of the economy, environmental pollution, resource utilization and low product recovery rate have emerged subsequently, so more and more attention has been paid to the recycling and reuse of products. However, since the complexity of disassembly line balancing problem (DLBP) increases with the number of parts in the product, finding the optimal balance is computationally intensive. In order to improve the computational ability of particle swarm optimization (PSO) algorithm in solving DLBP, this paper proposed an improved adaptive multi-objective particle swarm optimization (IAMOPSO) algorithm. Firstly, the evolution factor parameter is introduced to judge the state of evolution using the idea of fuzzy classification and then the feedback information from evolutionary environment is served in adjusting inertia weight, acceleration coefficients dynamically. Finally, a dimensional learning strategy based on information entropy is used in which each learning object is uncertain. The results from testing in using series of instances with different size verify the effect of proposed algorithm.
Control theorists have extensively studied stability
as well as relative stability of LTI systems. In this research
paper we attempt to answer the question. How unstable is an
unstable system? In that effort we define instability exponents
dealing with the impulse response. Using these instability
exponents, we characterize unstable systems.
Regeneration of simple and complicated curves using Fourier seriesIJAEMSJORNAL
This paper intended to demonstrate how to regenerate the simple forms and the complicated patterns composed of sine curves using Fourier series. The result shows that the Fourier series is a preferred method over other methods described in this paper. The experimental result of the regenerated patterns proves the efficiency and the reliability of the proposed method.
Adaptive Projective Lag Synchronization of T and Lu Chaotic Systems IJECEIAES
In this paper, the synchronization problem of T chaotic system and Lu chaotic system is studied. The parameter of the drive T chaotic system is considered unknown. An adaptive projective lag control method and also parameter estimation law are designed to achieve chaos synchronization problem between two chaotic systems. Then Lyapunov stability theorem is utilized to prove the validity of the proposed control method. After that, some numerical simulations are performed to assess the performance of the proposed method. The results show high accuracy of the proposed method in control and synchronization of chaotic systems.
The present work focuses on two directions. First, a new fuzzy method using triangular / trapezoidal fuzzy numbers as tools is developed for evaluating a group’s mean performance, when qualitative grades instead of numerical scores are used for assessing its members’ individual performance. Second, a new technique is applied for solving Linear Programming problems with fuzzy coefficients. Examples are presented on student and basket-ball player assessment and on real life problems involving Linear Programming under fuzzy conditions to illustrate the applicability of our results in practice. A discussion follows on the perspectives of future research on the subject and the article closes with the general conclusions.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Similar to Optimal control of multi delay systems via orthogonal functions (20)
Tech transfer making it as a risk free approach in pharmaceutical and biotech iniaemedu
Tech transfer is a common methodology for transferring new products or an existing
commercial product to R&D or to another manufacturing site. Transferring product knowledge to the
manufacturing floor is crucial and it is an ongoing approach in the pharmaceutical and biotech
industry. Without adopting this process, no company can manufacture its niche products, let alone
market them. Technology transfer is a complicated, process because it is highly cross functional. Due
to its cross functional dependence, these projects face numerous risks and failure. If anidea cannot be
successfully brought out in the form of a product, there is no customer benefit, or satisfaction.
Moreover, high emphasis is in sustaining manufacturing with highest quality each and every time. It
is vital that tech transfer projects need to be executed flawlessly. To accomplish this goal, risk
management is crucial and project team needs to use the risk management approach seamlessly.
A self recovery approach using halftone images for medical imagery
Optimal control of multi delay systems via orthogonal functions
1. Optimal Control of Multi-Delay
International Journal of Advanced Research in Engineering & Technology
I JARET
Systems via Orthogonal Functions
B.M.Mohan∗
and Sanjeeb Kumar Kar
Department of Electrical Engineering
Indian Institute of Technology
Kharagpur-721302, India
e-mail: mohan@ee.iitkgp.ernet.in.
e-mail: skkar@ee.iitkgp.ernet.in.
Abstract: Based on using block-pulse functions (BPFs)/shifted Legen-
dre polynomials (SLPs) a unified approach for computing optimal control
law of linear time-invariant/time-varying time-delay free/time-delay dynamic
systems with quadratic performance index is discussed in this paper. The
governing delay-differential equations of dynamic systems are converted into
linear algebraic equations by using the operational matrices of differentiation,
integration, delay and product of orthogonal functions (BPFs and SLPs).
Thus, the problem of finding optimal control law is reduced to the problem
of solving algebraic equations obtained via the operational matrices. Nu-
merical examples are included to demonstrate the applicability of the unified
approach.
Keywords: Optimal control, linear systems, time-invariant systems,
time-varying systems, time-delay systems, orthogonal functions, block-pulse
functions, Legendre polynomials.
1 Introduction
Time-delay systems are those systems in which time delays exist between
the application of input or control to the system and their resulting effect on
it. They arise either as a result of inherent delays in the components of the
system or as a deliberate introduction of time delay into the system for con-
trol purposes. Examples of such systems are electronic systems, mechanical
∗
Corresponding author
1
(c) I A E M E
Volume 1 • Issue 1 • May 2010 • pp. 1 – 24
http://iaeme.com/ijaret.html
2. systems, biological systems, environmental systems, metallurgical systems
and chemical systems. Few practical examples [8] are, controlling the speed
of a steam engine running an electric power generator under varying load
conditions, control of room temperature, cold rolling mill, spaceship control,
hydraulic system etc.
As it appears from the literature, extensive work was done on the problem
of optimal control of linear continuous-time dynamical systems containing
time delays. Palanisamy and Rao [2] appear to be the first to study the
optimal control problem via a class of piecewise constant basis functions -
Walsh functions. They considered time-invariant systems with one delay in
state and one delay in control. Hwang and Shih [4] considered time-varying
systems containing one delay in state and one delay in control, and studied
optimal control problem of such systems via BPFs. Solutions obtained in
[2, 4] are piecewise constant. In order to obtain smooth solution, Horng and
Chou [5] used Chebyshev polynomials of first kind and studied time-invariant
systems with one delay in state only.
Hwang and Chen [6] dealt with time-varying systems with multiple delays
in state and control by using SLPs. Perng [7] investigated the same problem
in [2] by applying SLPs. Tsay et al [9] considered the same problem in [4],
approximated the time-delay terms using Pade approximation, and obtained
the optimal control law using general orthogonal polynomials. Razzaghi et al
[10] replaced Chebyshev polynomials by SLPs and studied the same problem
in [5].
In the recent years, people came up with a new idea of defining hybrid
functions (with BPFs & SLPs) and utilizing the same for studying problems
in Systems and Control. The so called hybrid functions approach was first
introduced by Marzban and Razzaghi [12] to study the optimal control prob-
lem of time-varying systems with time-delay in state only. Subsequently,
this approach was extended to time-invariant systems in [5] by Wang [13].
Khellat [14] used linear Legendre multiwavelets to solve the timevarying sys-
tems having single delay in state only. Hybrid functions (BPFs and Taylor
polynomials) were employed [15] to study the same problem considered in
[12]. Wang [16] used general Legendre wavelets to solve the optimal control
problem of timevarying singular systems having one delay in state only.
Now, the following observations can be made from the above discussions
on the historical developments on the optimal control of time-delay systems
via orthogonal functions :
F The BPF approach reported in [4] is restricted to only time-varying
systems containing one delay in state and one delay in control. It is
not yet available for multi-delay systems.
2
International Journal of Advanced Research in Engineering & Technology
3. F The systems considered in [6] are time-varying with multi delays in both
state and control. Such systems are studied only via SLPs. BPF ap-
proach is not yet reported.
Therefore, in this paper, an attempt is made to introduce a unified ap-
proach for computing optimal control of linear time-varying systems with
multiple delays in both state and control via orthogonal functions (BPFs
and SLPs). The proposed approach is different from the one in [4, 6] in the
following two ways :
In [4, 6], ẋ(t) was expressed in terms of orthogonal functions first, the
spectrum of x(t) was expressed in terms of ẋ(t) spectrum, and then u(t) was
finally calculated. In the proposed approach the unknown x(t) is directly
expressed in terms of orthogonal functions, so that the state feedback control
law u(t) can be expressed in terms of the spectrum of x(t). Thus the proposed
approach is straightforward.
Moreover, the manner in which the final cost term in performance index is
handled in terms of orthogonal functions in the proposed approach is different
from that in [4, 6].
The paper is organized as follows: The next section deals with orthogonal
functions (BPFs and SLPs) and their properties. Optimal control of time-
delay, delay free, time-invariant and time-varying systems via BPFs and SLPs
is considered in Section 3. Section 4 contains some numerical examples. The
last section concludes the paper.
2 Orthogonal functions and their properties
We consider two classes of orthogonal functions, namely BPFs and SLPs,
and discuss their properties.
2.1 BPFs and their properties [3]
A set of m BPFs, orthogonal over t ∈ [t0, tf ), is defined as
Bi(t) =
½
1, t0 + iT ≤ t < t0 + (i + 1)T
0, otherwise
(1)
for i = 0, 1, 2, . . . , m − 1 where
T =
tf − t0
m
, the block-pulse width (2)
3
International Journal of Advanced Research in Engineering & Technology
4. A square integrable function f (t) on t0 ≤ t ≤ tf can be approximately
represented in terms of BPFs as
f(t) ≈
m−1
X
i = 0
fiBi(t) = fT
B(t) (3)
where
f =
£
f0, f1, . . . , fm−1
¤T
(4)
is an m - dimensional block-pulse spectrum of f (t), and
B(t) =
£
B0(t), B1(t), . . . , Bm−1(t)
¤T
(5)
an m - dimensional BPF vector. fi in Eq. (3) is given by
fi =
1
T
Z t0+(i+1)T
t0+iT
f(t)dt (6)
which is the average value of f (t) over t0 + iT ≤ t ≤ t0 + (i + 1)T.
2.1.1 Integration of B(t) [3]
Integrating B(t) once with respect to t and expressing the result in m - set
of BPFs, we have Z t
t0
B(τ)dτ ≈ HB(t) (7)
where
H = T
1
2
1 1 . . . 1
0 1
2
1 . . . 1
0 0 1
2
. . . 1
.
.
.
.
.
.
.
.
.
.
.
.
0 0 0 . . . 1
2
(8)
is called the integration operational matrix of BPFs and it is an m×m upper
triangular matrix.
2.1.2 Representation of a time-delay vector function in BPFs [4]
Assume that f(t) is n - dimensional, and
f(t) = ζ(t) for t ≤ t0 (9)
4
International Journal of Advanced Research in Engineering & Technology
5. The delayed vector function f(t − τ) over t ∈ [t0, tf ] may be approximated
in terms of BPFs as
f(t − τ) '
m−1
X
i = 0
f?
i (τ)Bi(t) = F?
(τ)B(t) (10)
where
f?
i (τ) =
1
T
Z t0+(i+1)T
t0+iT
f(t − τ)dt =
½
ζi(τ) for i < µ
fi−µ for i ≥ µ
(11)
ζi(τ) =
1
T
Z t0+(i+1)T
t0+iT
ζ(t − τ)dt for i < µ , (12)
µ is the number of BPFs considered over t0 ≤ t ≤ t0 + τ, and
F?
(τ) =
£
f?
0 (τ), f?
1 (τ), . . . , f?
m−1(τ)
¤
(13)
Let
f(t) '
m−1
X
i = 0
fiBi(t) = FB(t) (14)
with
F =
£
f0, f1, . . . , fm−1
¤
(15)
Then by letting
f̂?
(τ) =
f?
0 (τ)
f?
1 (τ)
.
.
.
f?
m−1(τ)
; f̂ =
f0
f1
.
.
.
fm−1
; and ζ̂(τ) =
ζ0(τ)
ζ1(τ)
.
.
.
ζµ−1(τ)
(16)
f̂?
(τ) can be expressed in terms of f̂ and ζ̂(τ) as follows :
f̂?
(τ) = E(n, µ)ζ̂(τ) + D(n, µ)f̂ (17)
where E and D are called shift operational matrices, given by
E(n, µ) =
Inµ×nµ
· · · · · · · · ·
°nd×nµ
; D(n, µ) =
°nµ×nd
.
.
. °nµ×nµ
· · · · · ·
.
.
. · · · · · ·
Ind×nd
.
.
. °nd×nµ
(18)
with d = m − µ.
5
International Journal of Advanced Research in Engineering & Technology
6. 2.1.3 Representation of C(t)f(t) in terms of BPFs [3]
Let C(t) be an n × n matrix and f(t) be an n × 1 vector. Assume that the
elements of C(t) and f(t) are square integrable over t0 ≤ t ≤ tf . Then
C(t)f(t) '
m−1
X
i=0
CiBi(t)
m−1
X
j = 0
fjBj(t) =
m−1
X
i = 0
CifiBi(t) (19)
Let
C(t)f(t) = g(t) '
m−1
X
i = 0
giBi(t) = GB(t) (20)
where
G =
£
g0, g1, . . . , gm−1
¤
(21)
Upon comparing Eqs. (19) and (20), we have
gi = Cifi (22)
2.2 SLPs and their properties [11]
SLPs satisfy the recurrence relation
Li+1(t) =
(2i + 1)
(i + 1)
ϕ(t) Li(t) −
i
(i + 1)
Li−1(t) (23)
for i = 1, 2, 3, . . . . . . with
ϕ(t) =
2(t − t0)
(tf − t0)
− 1 (24)
L0(t) = 1, and L1(t) = ϕ(t) (25)
A function f (t) that is square integrable on t ∈ [t0, tf ] can be represented in
terms of SLPs as
f(t) ≈
m−1
X
i = 0
fiLi(t) = fT
L(t) (26)
Here f is called Legendre spectrum of f (t), and L(t) is called SLP vector. fi
in Eq. (26) is given by
fi =
(2i + 1)
(tf − t0)
Z tf
t0
f(t)Li(t)dt (27)
6
International Journal of Advanced Research in Engineering & Technology
7. 2.2.1 Integration of L(t) [11]
Integrating L0(t) once with respect to t, and expressing the result in terms
of SLPs, we have
Z t
t0
L0(τ)dτ =
(tf − t0)
2
[L0(t) + L1(t)] (28)
Moreover, for i = 1, 2, 3, . . . . . .
Z t
t0
Li(τ)dτ =
(tf − t0)
2 (2i + 1)
[−Li−1(t) + Li+1(t)] (29)
Eqs. (28) and (29) can be written in the form of Eq. (7) with B(t) replaced
by L(t) and
H =
(tf − t0)
2
1 1 0 0 . . . 0 0
−1
3
0 1
3
0 . . . 0 0
0 −1
5
0 1
5
. . . 0 0
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
0 0 0 0 . . . 0 1
2m−3
0 0 0 0 . . . −1
2m−1
0
(30)
which is called integration operational matrix of SLPs.
2.2.2 Representation of a time-delay vector function in SLPs [6]
The SLP representation of f(t − τ) is given by
f(t − τ) '
m−1
X
i = 0
f?
i (τ)Li(t) = F?
(τ)L(t) (31)
where
f?
i (τ) =
(2i + 1)
(tf − t0)
Z tf
t0
f(t − τ)Li(t)dt
= ζi(τ) +
(2i + 1)
(tf − t0)
Z tf −τ
t0
f(t)Li(t + τ)dt (32)
with
ζi(τ) =
(2i + 1)
(tf − t0)
Z t0+τ
t0
ζ(t − τ)Li(t)dt (33)
7
International Journal of Advanced Research in Engineering & Technology
8. Now we express Li(t + τ) in terms of SLPs as
Li(t + τ) =
i
X
j = 0
λij(τ)Lj(t) = λT
i (τ)L(t) (34)
with
λij(τ) = 0 for j > i. (35)
Since
f(t) ≈
m−1
X
i = 0
fiLi(t) = FL(t) =
¡
LT
(t) ⊗ In
¢
f̂ (36)
where ⊗ is the Kronecker product [1], substituting Eqs. (34) and (36) into
Eq. (32), we have
f?
i (τ) = ζi(τ) +
(2i + 1)
(tf − t0)
λT
i (τ)
Z tf −τ
t0
L(t)
¡
LT
(t) ⊗ In
¢
dt f̂
= ζi(τ) +
(2i + 1)
(tf − t0)
λT
i (τ)
Z tf −τ
t0
¡
L(t)LT
(t) ⊗ In
¢
dt f̂ (37)
Let ∆ = diag
£
1, 3, . . . , (2m − 1)
¤
/(tf − t0) (38)
Λ(τ) =
λ00(τ) 0 0 . . . 0
λ10(τ) λ11(τ) 0 . . . 0
λ20(τ) λ21(τ) λ22(τ) . . . 0
.
.
.
.
.
.
.
.
.
.
.
.
λm−1,0(τ) λm−1,1(τ) λm−1,2(τ) . . . λm−1,m−1(τ)
(39)
is the time-advanced matrix of order m × m, and
P(τ) =
Z tf −τ
t0
L(t)LT
(t)dt (40)
Then Eq. (37) can be written in vector-matrix form as
f̂?
i (τ) = ζ̂(τ) + ∆ Λ(τ) (P(τ) ⊗ In) f̂
= ζ̂(τ) + (D(τ) ⊗ In) f̂ (41)
where
D(τ) = ∆ Λ(τ)P(τ) (42)
8
International Journal of Advanced Research in Engineering & Technology
9. is called the delay operational matrix of SLPs, and
ζ̂(τ) =
ζ0(τ)
ζ1(τ)
.
.
.
ζm−1(τ)
(43)
To evaluate D(τ) we need to know Λ(τ) and P(τ).
2.2.3 Time-advanced operational matrix of SLPs [6]
Let L(t + τ) = Λ(τ)L(t) (44)
Here we present a recursive algorithm to generate the elements of matrix
Λ(τ).
λ00(τ) = 1 (45)
λ10(τ) =
2τ
(tf − t0)
; λ11(τ) = 1 (46)
λi+1,j(τ) =
−i
(i + 1)
λi−1,j(τ) +
(2i + 1)j
(i + 1)(2j − 1)
λi,j−1(τ)
+
2(2i + 1)τ
(tf − t0)(i + 1)
λi,j(τ) +
(2i + 1)(j + 1)
(i + 1)(2j + 3)
λi,j+1(τ) (47)
for i = 1, 2, 3, . . . . . . and j = 0, 1, 2, . . . . . .
2.2.4 An algorithm for evaluating the integral in Eq. (40) [6]
Let pij(τ) =
Z tf −τ
t0
Li(t)Lj(t)dt (48)
qij(τ) =
Z tf −τ
t0
Li
•
(t)Lj(t)dt (49)
and
sij(τ) = Li(tf − τ)Lj(tf − τ) − (−1)i+j
(50)
Then
2(2i + 1)
(tf − t0)
pij(τ) = −qi−1,j(τ) + qi+1,j(τ) (51)
9
International Journal of Advanced Research in Engineering & Technology
10. qi+1,j(τ) = qi−1,j(τ) +
2(2i + 1)
(tf − t0)
pi,j(τ) (52)
qij(τ) = sij(τ) − qji(τ) (53)
p0j(τ) = pj 0(τ) =
(tf −t0)
2
[L0(tf − τ) + L1(tf − τ)] , for j = 0
(tf −t0)
2(2j+1)
[−Lj−1(tf − τ) + Lj+1(tf − τ)] ,
for j = 1, 2, 3 . . . . . .
(54)
q0j(τ) = 0, for j = 0, 1, 2 . . . . . . (55)
and q1j(τ) =
2
(tf − t0)
p0j(τ) (56)
The algorithm for evaluating the elements of matrix P(τ) is as follows :
step 1: Compute p0j(τ) and pj0(τ) for j = 0, 1, . . . , 2(m−1) using Eq. (54)
step 2: Set q0j(τ) = 0 for j = 0, 1, . . . , 2(m − 1)
step 3: Compute q1j(τ) for j = 0, 1, . . . , 2(m − 1) using Eq. (56)
step 4: Compute qi0(τ) and qi1(τ) for i = 0, 1, . . . , 2(m − 1) using Eq. (53)
step 5: Set i = 1.
step 6: Compute pj i(τ) and then pij(τ) = pji(τ) for j = i, i + 1, . . . . . . ,
2(m − 1) − i using Eq. (51)
step 7: If i = m − 1 then stop, else proceed.
step 8: Compute qi+1,j(τ) for j = i + 1, i + 2, . . . , 2(m − 1) − i using
Eq. (52)
step 9: Compute qj, i+1(τ) for j = i + 2, i + 3, . . . , 2(m − 1) − i using
Eq. (53)
step 10: Set i = i + 1 and go to step 6.
10
International Journal of Advanced Research in Engineering & Technology
11. 2.2.5 Representation of C(t)f(t) in terms of SLPs [6]
The product of two SLPs Li(t) and Lj(t) can be expressed as
Li(t)Lj(t) '
m−1
X
k = 0
ψijkLk(t) (57)
where
ψijk =
(2k + 1)
(tf − t0)
Z tf
t0
Li(t)Lj(t)Lk(t)dt (58)
Let
πijk =
Z tf
t0
Li(t)Lj(t)Lk(t)dt (59)
then
ψijk =
(2k + 1)
(tf − t0)
πijk (60)
Notice that
πijk = πikj = πjik = πjki = πkji = πkij (61)
Also,
Li(t)Lj(t) =
j
X
l = 0
alaj−lai−j+l
ai+l
2(i − j + 2l) + 1
2(i + l) + 1
Li−j+2l(t) (62)
where i ≥ j, and
a0 = 1, al+1 =
(2l + 1)
(l + 1)
al, for l = 0, 1, 2, . . . . . . (63)
Moreover, for i ≥ j
πijk =
(
alaj−lai−j+l
ai+l
(tf −t0)
2(i+l)+1
if k = i − j + 2l
0 if k 6= i − j + 2l
)
(64)
Assuming that C(t) is square-integrable over t ∈ [t0, tf ], it can be expressed
in terms of SLPs as
C(t) '
m−1
X
i = 0
CiLi(t) (65)
11
International Journal of Advanced Research in Engineering & Technology
12. Then
C(t)f(t) = g(t) '
m−1
X
i = 0
giLi(t) = GL(t) (66)
Also
C(t)f(t) '
m−1
X
j = 0
CjLj(t)
m−1
X
k = 0
fkLk(t) (67)
Therefore
gi =
(2i + 1)
(tf − t0)
Z tf
t0
m−1
X
j = 0
m−1
X
k = 0
CjfkLi(t)Lj(t)Lk(t)dt
=
(2i + 1)
(tf − t0)
m−1
X
j = 0
m−1
X
k = 0
πijkCjfk (68)
3 Optimal control of time-delay systems
Consider an nth
order linear time-varying system with multiple delays
ẋ(t) =
α
X
l = 0
Al(t)x(t − τl) +
β
X
l = 0
Bl(t)u(t − θl) (69)
x(t) = ζ(t) for t ≤ t0 (70)
u(t) = ν(t) for t ≤ t0 (71)
where x(t) is an n dimensional state vector, u(t) is an r dimensional control
vector, Al(t) and Bl(t) are n×n and n×r time-varying matrices, and τl, θl ≥ 0
are constant time-delays in state and control respectively.
The objective is to find the control vector u(t) that minimizes the quadratic
cost function
J =
1
2
xT
(tf )Sx(tf ) +
1
2
Z tf
t0
£
xT
(t)Q(t)x(t) + uT
(t)R(t)u(t)
¤
dt (72)
where S and Q(t) are n × n symmetric positive semidefinite matrices, and
R(t) is an r × r symmetric positive definite matrix.
Integrating Eq. (69) once with respect to t, we obtain
x(t) − x(t0) =
Z t
t0
" α
X
l = 0
Al(σ)x(σ − τl) +
β
X
l = 0
Bl(σ)u(σ − θl)
#
dσ (73)
12
International Journal of Advanced Research in Engineering & Technology
13. We express x(t), u(t), x(t0), x(t − τl), u(t − θl), Al(t) and Bl(t) in terms of
orthogonal functions {φi(t)} (BPFs or SLPs) as follows :
x(t) ≈
m−1
X
i = 0
xiφi(t) = Xφ(t) (74)
u(t) ≈
m−1
X
i = 0
uiφi(t) = Uφ(t) (75)
x(t0) = V φ(t) (76)
x(t − τl) ≈ X?
(τl)φ(t) (77)
u(t − θl) ≈ U?
(θl)φ(t) (78)
Al(t) ≈
m−1
X
i = 0
Aliφi(t) (79)
Bl(t) ≈
m−1
X
i = 0
Bliφi(t) (80)
Al(t)x(t − τl) ≈
m−1
X
i = 0
y?
i (τl)φi(t) = Y ?
(τl)φ(t) (81)
Bl(t)u(t − θl) ≈
m−1
X
i = 0
z?
i (θl)φi(t) = Z?
(θl)φ(t) (82)
where
φ(t) =
£
φ0(t), φ1(t), . . . , φm−1(t)
¤T
an m dimensional orthogonal functions vector, i.e. φ(t) is B(t) or L(t). Sub-
stituting Eqs. (74), (76), (81) and (82) into Eq. (73), and using integration
operational property in Eq. (7) of orthogonal functions yield
X − V =
" α
X
l = 0
Y ?
(τl) +
β
X
l = 0
Z?
(θl)
#
H
⇒ x̂ = v̂ +
¡
HT
⊗ In
¢
" α
X
l = 0
ŷ?
(τl) +
β
X
l = 0
ẑ?
(θl)
#
(83)
13
International Journal of Advanced Research in Engineering & Technology
14. where ⊗ is the Kronecker product [1] of matrices, say A and B, given by
A ⊗ B =
a11B a12B . . . a1qB
a21B a22B . . . a2qB
.
.
.
.
.
.
.
.
.
ap1B ap2B . . . apqB
(84)
x̂ =
x0
x1
.
.
.
xm−1
; v̂ =
v0
v1
.
.
.
vm−1
; ŷ?
(τl) =
y?
0(τl)
y?
1(τl)
.
.
.
y?
m−1(τl)
; ẑ?
(θl) =
z?
0(θl)
z?
1(θl)
.
.
.
z?
m−1(θl)
(85)
It is possible to write ŷ?
(τl) and ẑ?
(θl) as
ŷ?
(τl) = Âlx̂?
(τl) and ẑ?
(θl) = B̂lû?
(θl) (86)
where
x̂?
(τl) =
x?
0(τl)
x?
1(τl)
.
.
.
x?
m−1(τl)
; û?
(θl) =
u?
0(θl)
u?
1(θl)
.
.
.
u?
m−1(θl)
(87)
and Âl and B̂l are defined in the following subsections. Eq. (83) can be
rewritten in the form
x̂ = Mû + ŵ (88)
where û is similar to x̂ in Eq. (85), and M and ŵ are defined in the following
subsections.
Now the final cost term in Eq. (72) can be written as
xT
(tf )Sx(tf ) = [x(t0) + Ω x̂]T
S [x(t0) + Ω x̂]
where
Ω = 2
¡
bT
⊗ In
¢
(89)
and b is defined in the following subsections. Expressing Q(t) and R(t) in
terms of orthogonal functions, we have
Q(t) ≈
m−1
X
i = 0
Qiφi(t) (90)
R(t) ≈
m−1
X
i = 0
Riφi(t) (91)
14
International Journal of Advanced Research in Engineering & Technology
15. and
Z tf
t0
£
xT
(t)Q(t)x(t) + uT
(t)R(t)u(t)
¤
dt ' x̂T
Q̂x̂ + ûT
R̂û
where Q̂ and R̂ are defined in the following subsections. So Eq. (72) becomes
J =
1
2
[x(t0) + Ω x̂]T
S [x(t0) + Ω x̂] +
1
2
³
x̂T
Q̂x̂ + ûT
R̂û
´
(92)
Substituting Eq. (88) into Eq. (92) and setting the optimization condition
∂J
∂û
= 0T
yield the optimal control law
û = −
h
MT
³
ΩT
SΩ + Q̂
´
M + R̂
i−1h
MT
ΩT
Sx(t0) + MT
³
ΩT
SΩ + Q̂
´
ŵ
i
(93)
3.1 Using BPFs
In Eq. (85)
v̂ =
£
xT
(t0), xT
(t0), . . . , xT
(t0)
¤T
(94)
In Eq. (86)
Âl = diag
£
Al0, Al1, . . . , Al,m−1
¤
(95)
B̂l = diag
£
Bl0, Bl1, . . . , Bl,m−1
¤
(96)
x̂?
(τl) = E (n, µl) ζ̂(τl) + D (n, µl) x̂ (97)
û?
(θl) = E (r, δl) ν̂(θl) + D (r, δl) û (98)
where
τl = µlT and θl = δlT (99)
µl and δl represent number of BPFs on t0 ≤ t ≤ t0 + τl and t0 ≤ t ≤ t0 + θl
respectively,
ζ̂(τl) =
ζ0(τl)
ζ1(τl)
.
.
.
ζµl−1(τl)
; ν̂(θl) =
ν0(θl)
ν1(θl)
.
.
.
νδl−1(θl)
(100)
ζi(τl) =
1
T
Z t0+(i+1)T
t0+iT
ζ(t − τl)dt for i = 0, 1, 2, . . . , µl − 1 (101)
and νi(θl) =
1
T
Z t0+(i+1)T
t0+iT
ν(t − θl)dt for i = 0, 1, 2, . . . , δl − 1 (102)
15
International Journal of Advanced Research in Engineering & Technology
16. In Eq. (88)
M = N−1
¡
HT
⊗ In
¢ β
X
l = 0
B̂lD (r, δl) (103)
ŵ = N−1
(
v̂ +
¡
HT
⊗ In
¢
" α
X
l = 0
ÂlE (n, µl) ζ̂(τl) +
β
X
l = 0
B̂lE (r, δl) ν̂(θl)
#
)
(104)
where
N = Imn −
¡
HT
⊗ In
¢ α
X
l = 0
ÂlD (n, µl) (105)
In Eq. (89)
b =
£
−1, 1, −1, 1, . . . , −1, 1
¤T
(106)
an m dimensional vector. In Eq. (92)
Q̂ = T × diag
£
Q0, Q1, . . . , Qm−1
¤
(107)
and R̂ = T × diag
£
R0, R1, . . . , Rm−1
¤
(108)
3.2 Using SLPs
In Eq. (85)
v̂ =
£
xT
(t0), 0T
, . . . , 0T
¤T
(109)
ŷ?
i (τl) =
(2i + 1)
(tf − t0)
m−1
X
j = 0
m−1
X
k = 0
πijkAlj x̂?
k(τl) (110)
ẑ?
i (θl) =
(2i + 1)
(tf − t0)
m−1
X
j = 0
m−1
X
k = 0
πijkBlj û?
k(θl) (111)
In Eq. (86)
Âl =
1
(tf − t0)
m−1
P
j = 0
π0j0Alj . . .
m−1
P
j = 0
π0j,m−1Alj
3
m−1
P
j = 0
π1j 0Alj . . . 3
m−1
P
j = 0
π1j,m−1Alj
.
.
.
.
.
.
(2m − 1)
m−1
P
j = 0
πm−1,j 0Alj . . . (2m − 1)
m−1
P
j = 0
πm−1,j,m−1Alj
(112)
16
International Journal of Advanced Research in Engineering & Technology
17. B̂l =
1
(tf − t0)
m−1
P
j = 0
π0j0Blj . . .
m−1
P
j = 0
π0j,m−1Blj
3
m−1
P
j = 0
π1j 0Blj . . . 3
m−1
P
j = 0
π1j,m−1Blj
.
.
.
.
.
.
(2m − 1)
m−1
P
j = 0
πm−1,j 0Blj . . . (2m − 1)
m−1
P
j = 0
πm−1,j,m−1Blj
(113)
x̂?
(τl) = ζ̂(τl) + (D(τl) ⊗ In) x̂ (114)
û?
(θl) = ν̂(θl) + (D(θl) ⊗ Ir) û (115)
where
ζ̂(τl) =
ζ0(τl)
ζ1(τl)
.
.
.
ζm−1(τl)
; ν̂(θl) =
ν0(θl)
ν1(θl)
.
.
.
νm−1(θl)
(116)
ζi(τl) =
(2i + 1)
(tf − t0)
Z t0+τl
t0
ζ(t − τl)Li(t)dt (117)
νi(θl) =
(2i + 1)
(tf − t0)
Z t0+θl
t0
ν(t − θl)Li(t)dt (118)
for i = 0, 1, 2, . . . , m − 1. In Eq. (88)
M = N−1
¡
HT
⊗ In
¢ β
X
l = 0
B̂l (D(θl) ⊗ Ir) (119)
ŵ = N−1
(
v̂ +
¡
HT
⊗ In
¢
" α
X
l = 0
Âlζ̂(τl) +
β
X
l = 0
B̂lν̂(θl)
#)
(120)
where
N = Imn −
¡
HT
⊗ In
¢ α
X
l = 0
Âl (D(τl) ⊗ In) (121)
In Eq. (89)
b =
£
0, 1, 0, 1, . . . , 0, 1
¤T
(122)
17
International Journal of Advanced Research in Engineering & Technology
18. an m dimensional vector. In Eq. (92)
Q̂ =
m−1
P
j = 0
π0j 0Qj
m−1
P
j = 0
π0j1Qj . . .
m−1
P
j = 0
π0j,m−1Qj
m−1
P
j = 0
π1j 0Qj
m−1
P
j = 0
π1j1Qj . . .
m−1
P
j = 0
π1j,m−1Qj
.
.
.
.
.
.
.
.
.
m−1
P
j = 0
πm−1,j 0Qj
m−1
P
j = 0
πm−1,j 1Qj . . .
m−1
P
j = 0
πm−1,j,m−1Qj
(123)
R̂ =
m−1
P
j = 0
π0j 0Rj
m−1
P
j = 0
π0j1Rj . . .
m−1
P
j = 0
π0j,m−1Rj
m−1
P
j = 0
π1j 0Rj
m−1
P
j = 0
π1j1Rj . . .
m−1
P
j = 0
π1j,m−1Rj
.
.
.
.
.
.
.
.
.
m−1
P
j = 0
πm−1,j 0Rj
m−1
P
j = 0
πm−1,j 1Rj . . .
m−1
P
j = 0
πm−1,j,m−1Rj
(124)
3.3 Time-invariant systems
The algorithms discussed above are applicable to time-varying systems. With
the following changes, they are also applicable to time-invariant systems as
the time-varying matrices Al(t), Bl(t), Q(t) and R(t) are constant for such
systems. Therefore,
Âl = Im ⊗ Al, B̂l = Im ⊗ Bl (125)
3.3.1 Via BPFs
Q̂ = T (Im ⊗ Q) , R̂ = T (Im ⊗ R) (126)
3.3.2 Via SLPs
Q̂ = ∇ ⊗ Q, R̂ = ∇ ⊗ R (127)
where
∇ = (tf − t0) diag
£
1, 1
3
, . . . , 1
2m−1
¤
(128)
18
International Journal of Advanced Research in Engineering & Technology
19. 3.4 Delay free systems
In this case α = β = 0, τl = θl = 0, and x(t) = x(t0) at t = t0. Therefore
ζ̂(τl) = ν̂(θl) = 0 (129)
3.4.1 Via BPFs
D (n, µl) = Imn and D (r, δl) = Imr (130)
3.4.2 Via SLPs
D (τl) = D (θl) = Im (131)
4 Illustrative Examples
Example 1 :
Consider the system [6]
ẋ(t) = x(t − 1) + u(t)
x(t) = 1 for − 1 ≤ t ≤ 0
with the cost function
J =
1
2
·
105
x2
(2) +
Z 2
0
u2
(t)dt
¸
The exact solution is given by
u(t) =
½
−2.1 + 1.05t for 0 ≤ t ≤ 1
−1.05 for 1 ≤ t ≤ 2
x(t) =
½
1 − 1.1t + 0.525t2
for 0 ≤ t ≤ 1
−0.25 + 1.575t − 1.075t2
+ 0.175t3
for 1 ≤ t ≤ 2
Figure 1 shows u(t) and x(t) obtained via the proposed BPF and SLP
approaches with m = 8, and the analytical method. The value of J is shown
in Table 1. The results match well with the exact results in each case.
19
International Journal of Advanced Research in Engineering & Technology
20. Example 2 :
Consider the following delay system [12]
ẋ(t) = −x(t) + x
µ
t −
1
3
¶
+ u(t) −
1
2
u
µ
t −
2
3
¶
x(t) = 1 for −
1
3
≤ t ≤ 0
u(t) = 0 for −
2
3
≤ t ≤ 0
with the performance index
J =
1
2
Z 1
0
·
x2
(t) +
1
2
u2
(t)
¸
dt
We solve this problem using BPFs and SLPs with m = 12. The values of
u(t) and x(t) are calculated and shown in Fig. 2. The J value obtained by
the proposed BPF and SLP approaches, and the hybrid functions method
(# of BPFs = 3 and # of SLPs = 4) is presented in Table 2.
Example 3 :
Consider the time-varying and multi-delay system [6]
·
ẋ1(t)
ẋ2(t)
¸
=
·
0 1
t 0
¸ ·
x1(t)
x2(t)
¸
+
·
0 0
0 1
¸ ·
x1(t − 0.8)
x2(t − 0.8)
¸
+
·
1 0
2 0
¸ ·
x1(t − 1)
x2(t − 1)
¸
+
·
0
1
¸
u(t) +
·
0
−1
¸
u(t − 0.5)
·
x1(t)
x2(t)
¸
=
·
1
1
¸
for − 1 ≤ t ≤ 0
u(t) = 5(t + 1) for − 0.5 ≤ t ≤ 0
with the cost function
J =
1
2
£
x1(3) x2(3)
¤
·
1 0
0 2
¸ ·
x1(3)
x2(3)
¸
+
1
2
Z 3
0
½
£
x1(t) x2(t)
¤
·
2 1
1 1
¸ ·
x1(t)
x2(t)
¸
+
1
2 + t
u2
(t)
¾
dt
The optimal control law u(t) and the state variables x1(t) and x2(t) are
computed with m = 30 in the BPF approach and m = 12 in the SLP
approach, and the results are shown in Fig. 3. The value of J in each case
is given in Table 3.
20
International Journal of Advanced Research in Engineering & Technology
21. 5 Conclusion
A unified approach for computing optimal control law of linear time-invariant/
time-varying systems with/without time delays in control and state has been
proposed. The proposed method is based on using two classes of orthogonal
functions, namely BPFs and SLPs. The nature of orthogonal functions used
is reflected in the final solution, i.e. the solution is always piecewise constant
if BPFs (piecewise constant functions) are used while it is smooth with SLPs
(polynomial functions). As the orthogonal functions approach, in general,
helps us reduce differential/integral calculus to algebra (in the sense of least
squares), the proposed approach is computationally attractive.
References
[1] J. W. Brewer, “Kronecker products and matrix calculus in system the-
ory,” IEEE Trans. on Circuits and Systems, Vol. CAS-25, No. 9, 772-781,
1978.
[2] K. R. Palanisamy and G. P. Rao, “Optimal control of linear systems with
delays in state and control via Walsh functions,” IEE Proc., pt. D, Vol.
130, No. 6, 300-312, 1983.
[3] G. P. Rao, “Piecewise Constant Orthogonal Functions and Their Appli-
cation to Systems and Control, ”Springer-Verlag, Berlin, 1983.
[4] C. Hwang and Y. P. Shih, “Optimal control of delay systems via block-
pulse functions,” J. of Optimization Theory and Application, Vol. 45, No.
1, 101-112, Jan. 1985.
[5] I. R. Horng and J. H. Chou, “Analysis, parameter estimation and optimal
control of time-delay systems via Chebyshev series,” Int. J. Control, Vol.
41, No. 5, 1221-1234, 1985.
[6] C. Hwang and M. Y. Chen, “Suboptimal control of linear time-varying
multi-delay systems via shifted Legendre polynomials,” Int. J. Systems
Science, Vol. 16, No. 12, 1517-1537, 1985.
[7] M. H. Perng, “Direct approach for the optimal control of linear time-delay
systems via shifted Legendre polynomials,” Int. J. Control, Vol. 43, No.
6, 1897-1904, 1986.
21
International Journal of Advanced Research in Engineering & Technology
22. [8] M. M. Zavarei and M. Jamshidi, “Time-Delay Systems Analysis, Opti-
mization and Applications,” North-Holland Systems and Control Series,
Vol. 9, Amsterdam, 1987.
[9] S. C. Tsay, I. L. Wu and T. T. Lee, “Optimal control of linear time-delay
systems via general orthogonal polynomials,” Int. J. Systems Science,
Vol. 19, No. 2, 365-376, 1988.
[10] M. Razzaghi, M. F. Habibi and R. Fayzebakhsh, “Subptimal control of
linear delay systems via Legendre series,” Kybernetica, Vol. 31, No. 5,
509-518, 1995.
[11] K. B. Datta and B. M. Mohan, “Orthogonal Functions in Systems and
Control,” World Scientific, Singapore, 1995.
[12] H. R. Marzban and M. Razzaghi, “Optimal control of linear delay sys-
tems via hybrid of block-pulse and Legendre polynomials,” J. of the
Franklin Inst., Vol. 341, 279-293, 2004.
[13] X. T. Wang, “Numerical solution of optimal control for time-delay sys-
tems by hybrid of block-pulse functions and Legendre polynomials,” Ap-
plied Mathematics and Computation, Vol. 184, 849-856, 2007.
[14] F. Khellat, “Optimal control of linear time-delayed systems by linear
Legendre multiwavelets, J. Optimization Theory Application,” Vol. 143,
No. 1, 107-121, 2009.
[15] M. Razzaghi, “Optimization of time delay systems by hybrid functions,”
Optimization and Engineering, Vol. 10, No. 3, pp: 363-376, 2009.
[16] X. T. Wang, “A numerical approach of optimal control for generalized
delay systems by general Legendre wavelets,” Int. J. Computer Mathe-
matics, Vol. 86, No. 4, 743-752, 2009.
Table 1: Cost function (Example 1)
Method J
Exact 1.8375
BPF 1.8404
SLP 1.8379
22
International Journal of Advanced Research in Engineering & Technology
23. Table 2: Cost function (Example 2)
Method J
BPF 0.3731831
SLP 0.3731102
Hybrid [12] 0.3731129
Table 3: Cost function (Example 3)
Method m J
BPF 30 19.6414
SLP 12 19.7079
−1 −0.5 0 0.5 1 1.5 2
−2.5
−2
−1.5
−1
−0.5
0
0.5
1
time
control
&
state
Actual
BPFs
SLPs
x(t)
u(t)
Figure 1: Actual, BPF and SLP solutions of u(t) and x(t) variables in Ex-
ample 1
23
International Journal of Advanced Research in Engineering & Technology
24. −1 −0.5 0 0.5 1
−1
−0.8
−0.6
−0.4
−0.2
0
0.2
0.4
0.6
0.8
1
time
control
&
state
x
u
Figure 2: BPF and SLP solutions of u(t) and x(t) variables in Example 2
−1 −0.5 0 0.5 1 1.5 2 2.5 3
−14
−12
−10
−8
−6
−4
−2
0
2
4
6
time
control
&
state
u
x1
x2
Figure 3: BPF and SLP solutions of u(t) and x(t) variables in Example 3
24
International Journal of Advanced Research in Engineering & Technology