scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A class of optimal state-delay control problems

01 Jun 2013-Nonlinear Analysis-real World Applications (Pergamon)-Vol. 14, Iss: 3, pp 1536-1550
TL;DR: It is shown that this optimal state-delay control problem can be formulated as a nonlinear programming problem in which the cost function is an implicit function of the decision variables and an efficient numerical method for determining thecost function’s gradient is developed.
Abstract: We consider a general nonlinear time-delay system with state-delays as control variables. The problem of determining optimal values for the state-delays to minimize overall system cost is a non-standard optimal control problem–called an optimal state-delay control problem–that cannot be solved using existing optimal control techniques. We show that this optimal control problem can be formulated as a nonlinear programming problem in which the cost function is an implicit function of the decision variables. We then develop an efficient numerical method for determining the cost function’s gradient. This method, which involves integrating an auxiliary impulsive system backwards in time, can be combined with any standard gradient-based optimization method to solve the optimal state-delay control problem effectively. We conclude the paper by discussing applications of our approach to parameter identification and delayed feedback control.

Summary (1 min read)

2. Problem formulation

  • Let T denote the set of all such admissible state-delay vectors.
  • Let Z denote the set of all such admissible parameter vectors.

Any vector

  • The authors assume that the following conditions are satisfied.
  • These time points are called characteristic times in the optimal control literature [2, 17, 18] .
  • As the authors will see, cost functions with characteristic times arise in parameter identification problems, where the aim is to minimize the discrepancy between predicted and observed system output at a set of sample times.
  • The authors optimal state-delay control problem is defined formally below.

3. Gradient computation

  • Problem (P) can be viewed as a nonlinear optimization problem in which the decision vectors τ and ζ influence the cost function J implicitly through the governing dynamic system (1)-( 2).
  • Thus, if the gradient of J can be computed for each admissible control pair, then Problem (P) can be solved using existing gradient-based optimization methods, such as sequential quadratic programming (see [20, 21] ).

3.3. Solving Problem (P)

  • Evolves forward in time (starting from an initial condition), while the auxiliary system (6)-( 8) evolves backwards in time (starting from a terminal condition).
  • Thus, since the state and auxiliary systems evolve in opposite directions, and the auxiliary system depends on the solution of the state system, these two systems cannot be solved simultaneously.
  • Instead, the state system is solved first in Step 1, and then the solution of the state system is used to solve the auxiliary system in Step 2.
  • In practice, numerical integration methods are used to solve the state and auxiliary systems.
  • The integrals in the gradient formulae ( 9) and ( 19) can be evaluated using standard numerical quadrature rules.

4.1. Problem formulation

  • Using the algorithm in Section 3.3, only 2n differential equations need to be solved.
  • Thus, their new method is ideal for online applications in which efficiency is paramount.

6. Conclusion

  • The authors new method is applicable to systems with nonlinear terms containing more than one state-delay.
  • The authors have restricted their attention in this paper to systems with time-invariant time-delays.
  • Such problems arise in the control of crushing processes [19] and mixing tanks with recycle loops [27] .

Did you find this useful? Give us your feedback

Content maybe subject to copyright    Report

NOTICE: This is the author’s version of a work that was accepted for publication in
Nonlinear Analysis: Real World Applications. Changes resulting from the publishing
process, such as peer review, editing, corrections, structural formatting, and other
quality control mechanisms may not be reflected in this document. Changes may
have been made to this work since it was submitted for publication. A definitive
version was subsequently published in Nonlinear Analysis: Real World Applications,
Vol. 14 (2013). doi: 10.1016/j.nonrwa.2012.10.017

A class of optimal state-delay control problems
Qinqin Chai
a,b,
, Ryan Loxton
b
, Kok Lay Teo
b
, Chunhua Yang
a
a
School of Information Science & Engineering, Central South University,
Changsha, P. R. China
b
Department of Mathematics & Statistics, Curtin University, Perth, Australia
Abstract
We consider a g eneral nonlinear time-delay system with state-delays as con-
trol variables. The problem of determining optimal values for the state-delays
to minimize overall system cost is a non- standard optimal control problem—
called an optimal state-delay cont r ol problem—that cannot be solved using
existing techniques. We show that this optimal control problem can be for-
mulated as a nonlinear programming problem in which the cost function is
an implicit function o f the decision var iables. We then develop an efficient
numerical method for determining the cost function’s gradient. This method,
which involves integrating an impulsive dynamic system backwards in time,
can be combined with any standard gradient -based optimization method to
solve the optimal state-delay control problem effectively. We conclude the
paper by discussing a pplications of our approach to parameter identification
and delayed feedback control.
Keywords: time-delay, optimal control, nonlinear optimization, parameter
identification, delayed feedback contr ol
Corresponding author
Email addresses: kppqing@163.com (Qinqin Chai), r.loxton@curtin.edu.au (Ryan
Loxton), k.l.teo@curtin.edu.au (Kok Lay Teo), ychh@csu.edu.cn (Chunhua Yang)
Preprint submitted to Nonlinear Analysis Series B July 27, 2014

1. Introduction1
Time-delay systems arise in many real-world applications—e.g. evapo-2
ration and purification processes [1 , 2], aerospace models [3], and human3
immune response [4]. Over the past two decades, various optimal control4
methods have been developed fo r time-delay systems. Well-known tools in-5
clude the necessary conditions for o ptima lity [5, 6] and numerical methods6
based on the control parameterization technique [7, 8]. These existing opti-7
mal control methods are restricted to time-delay systems in which the delays8
are fixed and known. In this paper, we consider a new class of optimal control9
problems in which the delays are not fixed, but are instead control variables10
to be chosen optimally. Such problems ar e called optimal state-delay control11
problems.12
As an example of an optimal state-delay control problem, consider a13
system of delay-differential equations with unknown delays. This delay-14
differential system is a dynamic model for some phenomenon under con-15
sideration. The problem is to choose values for the unknown delays (and16
possibly other model parameters) so that the system output predicted by17
the model is consistent with exp erimental data. This so-called parameter18
identification problem can be for mulated as an optimal state-delay control19
problem in which the delays and model parameters are decision variables,20
and the cost function measures the least-squares error between predicted21
and observed system output.22
Parameter ident ification for time-delay systems has been an active area23
of research over the past decade. Existing techniques fo r parameter identi-24
fication include interpolation methods [9], genetic algorithms [10], and the25
delay operator transform method [11]. These techniques are mainly designed26
for single-delay linear systems. In contrast, the computational approach27
to be developed in this paper, which is based on formulating and solving28
the parameter identification pro blem as an optimal state-delay control prob-29
lem, can handle systems with nonlinear dynamics and multiple time-delays.30
This computational approach is motiva t ed by our earlier work in [12 ], which31
2

presents a parameter identification algor it hm based on nonlinear program-32
ming techniques. This algorithm has two limitations: (i) it is only applicable33
to systems in which each nonlinear term contains a single delay and no un-34
known parameters; and (ii) it involves integrating a large number of auxiliary35
delay-differential systems (o ne auxiliary system for each unknown delay a nd36
model parameter). The new approach to be developed in t his paper does not37
suffer fr om these limitations. In particular, our new approach only requires38
the integration of one auxiliary system, regardless o f the number of delays39
and par ameters in the underlying dynamic model.40
Another important application of optimal state-delay control problems41
is in delayed feedback control. In delayed feedback control, the system’s42
input function is chosen to be a linear function of the delayed state, as op-43
posed to traditional feedback control in which the input is a function of the44
current (undelayed) state. Voluntarily introducing delays via delayed feed-45
back control can be beneficial for certain types of systems; see, for example,46
[13, 14, 1 5]. The problem of choo sing optimal values for the delays in a de-47
layed feedback controller can be f ormulated as an optimal state-delay control48
problem.49
Our goal in this paper is to develop a unified computational approach50
for solving optimal state-delay control problems. A key aspect of our work51
is t he derivation of an auxiliary impulsive system, which turns out to be52
the analogue of the costate system in classical optimal control. We derive53
formulae fo r the cost function’s gradient in terms of the solution of this im-54
pulsive system. On this basis, the opt ima l state-delay control problem can55
be solved by combining numerical integration and nonlinear programming56
techniques. This a pproach has proven very effective for the two specific ap-57
plications mentioned above—parameter identification and delayed feedback58
control.59
The remainder of the paper is organized as follows. We first formulate the60
optimal state-delay control problem in Section 2, befor e introducing the aux-61
iliary impulsive system and deriving gradient formular in Section 3. Section 462
3

is devoted to parameter identification problems, and Section 5 is devoted to63
delayed feedback control. We make some concluding remarks in Section 6.64
2. Problem formulation65
Consider the following nonlinear time-delay system:
˙
x(t) = f (x(t), x(t τ
1
), . . . , x(t τ
m
), ζ), t [0, T], (1)
x(t) = φ(t, ζ), t 0, (2)
where T > 0 is a given terminal time; x(t) = [x
1
(t), . . . , x
n
(t)]
R
n
is66
the state vector; τ
i
, i = 1, . . . , m are state-delays; ζ = [ζ
1
, . . . , ζ
r
]
R
r
is a67
vector of system parameters; and f : R
(m+1)n
×R
r
R
n
and φ : R×R
r
R
n
68
are given f unctions.69
System (1)-(2) is controlled via the state-delays and system parameters—
these must be chosen optimally so that the system behaves in the best pos-
sible manner. We impose the following bound constraints:
a
i
τ
i
b
i
, i = 1, . . . , m, (3)
and
c
j
ζ
j
d
j
, j = 1, . . . , r, (4)
where a
i
and b
i
are given constants such that 0 a
i
< b
i
, and c
j
and d
j
are70
given constants such that c
j
< d
j
.71
Any vector τ = [τ
1
, . . . , τ
m
]
R
m
satisfying ( 3) is called an admissible72
state-delay vector. Let T denote t he set of all such admissible state-delay73
vectors.74
Any vector ζ = [ζ
1
, . . . , ζ
r
]
R
r
satisfying (4) is called an admissible75
parameter vector. Let Z denote the set of all such admissible parameter76
vectors.77
Any combined pair (τ , ζ) T × Z is called an admissi b l e control pair for78
system ( 1)-(2).79
We assume that the following conditions are satisfied.80
4

Citations
More filters
Journal ArticleDOI
TL;DR: An algorithm of Multi-objective Programming Approximation based on SQP (MPA-SQP) is described, and a set of Pareto solutions are obtained, which provides some references for practical fermentation experiments.
Abstract: For an uncoupled microbial fed-batch fermentation process of glycerol bioconversion to 1,3-propanediol (1,3-PD), we establish a nonlinear switched system model with free terminal time and unknown time-delays, in which the reaction mechanism of extracellular and intracellular environment and the regulation of dha regulator are considered. In order to evaluate the time-delays, a robustness index is given by a weighted sum of the expectation and variance of the relative deviation between system outputs before and after time-delays are perturbed. A multi-objective optimization model is proposed for the sake of maximization of 1,3-PD and minimization of consumption of glycerol coupling with minimization of the robustness index, where the continuous state inequality constraints are involved, and the time-delays, the feeding rates of glycerol and alkali, switching instants between batch and feeding modes, and terminal time of fermentation are regarded as the decision variables. For solving this multi-objective optimization problem, we convert it into a sequence of single-objective optimization problems by using the Normal Constraint method (NC). The gradient formulas involving multiple time-delays are discussed. An algorithm of Multi-objective Programming Approximation based on SQP (MPA-SQP) is described. By large calculations, a set of Pareto solutions are obtained, which provides some references for practical fermentation experiments.

3 citations

Journal ArticleDOI
TL;DR: A virus replication model with Beddington–DeAngelis incidence rate and the pharmacological and intracellular delays is presented to describe the treatment to cure the virus infection and the optimal combined drug treatment is the most efficient.
Abstract: A short delay in the pharmacological effect on account of the time required for drug absorption, distribution, and penetration into target cells after application of any anti-viral drug, is defined by the pharmacological delay (Herz et al 1996 Proc. Natl Acad. Sci. USA 93 7247–51). In this paper, a virus replication model with Beddington–DeAngelis incidence rate and the pharmacological and intracellular delays is presented to describe the treatment to cure the virus infection. The optimal controls represent the efficiency of reverse transcriptase inhibitors and protease inhibitors in suppressing viral production and prohibiting new infections. Due to the fact that both the control and state variables contain delays, we derive a necessary conditions for our optimal problem. Based on these results, numerical simulations are implemented not only to show the optimal therapeutic schedules for different infection and release rates, but also to compare the effective of three treatment programs. Furthermore, comparison of therapeutic effects under different maximum tolerable dosages is shown. Our research indicates that (1) the proper and specific treatment program should be determined according to the infection rates of different virus particles; (2) the optimal combined drug treatment is the most efficient; (3) the appropriate proportion of medicament must be formulated during the therapy due to the non-monotonic relationship between maximum tolerable dosages and therapeutic effects; (4) the therapeutic effect is advantageous when the pharmacological delay is considered.

3 citations

Journal ArticleDOI
TL;DR: In this paper, a neural network model is employed to approximate the MTDC system and a linear differential inclusion (LDI) state-space representation is established for the dynamics of the NN model.
Abstract: This study presents an effective approach to realize the optimal exponential synchronization of multiple time-delay chaotic (MTDC) systems. First, a neural network (NN) model is employed to approximate the MTDC system. Then, a linear differential inclusion (LDI) state-space representation is established for the dynamics of the NN model. Based on this LDI state-space representation, this study proposes a delay-dependent exponential stability criterion of the error system derived in terms of Lyapunov’s direct method to ensure that the trajectories of the slave system can approach those of the master system. Subsequently, the stability condition of this criterion is reformulated into a linear matrix inequality (LMI). Based on the LMI, a fuzzy controller is synthesized not only to realize the exponential synchronization but also to achieve the optimal performance by minimizing the disturbance attenuation level. Finally, a numerical example with simulations is provided to illustrate the concepts discussed throughout this work.

3 citations


Cites background from "A class of optimal state-delay cont..."

  • ...Based on these properties, chaos has received a great deal of interest among scientists from various research fields [8– 12]....

    [...]

Journal ArticleDOI
TL;DR: This paper first applies the control parameterization method to optimize lens focusing strengths, and then combines this with the time-scaling transformation technique to further optimize the drift and lens length in the beam matching channel.
Abstract: Particle accelerators are devices used for research in scientific problems such as high energy and nuclear physics. In a particle accelerator, the shape of particle beam envelope is changed dynamically along the forward direction. Thus, this reference direction can be considered as an auxiliary “ time ” beam axis. In this paper, the optimal beam matching control problem for a low energy transport system in a charged particle accelerator is considered. The beam matching procedure is formulated as a finite “ time ” dynamic optimization problem, in which the Kapchinsky-Vladimirsky ( K-V ) coupled envelope equations model beam dynamics. The aim is to drive any arbitrary initial beam state to a prescribed target state, as well as to track reference trajectory as closely as possible, through the control of the lens focusing strengths in the beam matching channel. We first apply the control parameterization method to optimize lens focusing strengths, and then combine this with the time-scaling transformation technique to further optimize the drift and lens length in the beam matching channel. The exact gradients of the cost function with respect to the decision parameters are computed explicitly through the state sensitivity-based analysis method. Finally, numerical simulations are illustrated to verify the effectiveness of the proposed approach.

3 citations


Cites background from "A class of optimal state-delay cont..."

  • ...Solving Problem P1 Problem P1 is now an optimal parameter selection problem in the so-called canonical form [30]−[33]....

    [...]

Journal ArticleDOI
TL;DR: This paper derives the co-state system for TDOCP to compute the gradients of the cost and constraints and shows that the computational efficiency is much higher when compared with the traditional variational approach.
Abstract: In this paper, we consider a class of time-delay optimal control problem (TDOCP) with canonical equality and inequality constraints. By applying control parameterization method together with time-scaling transformation, a TDOCP can be readily solved by gradient-based optimization methods. The partial derivative of the cost as well as the constraint functions with respect to the decision variables are obtained by variational approach, which is inefficient when the discretization for the control function is relatively dense. For general optimal control problem without time-delay, co-state approach is an effective way to compute the gradients, however, when time-delay is involved in the dynamic system, the co-state system is not known. In this paper, we derive the co-state system for TDOCP to compute the gradients of the cost and constraints. Numerical results show that the computational efficiency is much higher when compared with the traditional variational approach.

2 citations

References
More filters
Book
01 Nov 2008
TL;DR: Numerical Optimization presents a comprehensive and up-to-date description of the most effective methods in continuous optimization, responding to the growing interest in optimization in engineering, science, and business by focusing on the methods that are best suited to practical problems.
Abstract: Numerical Optimization presents a comprehensive and up-to-date description of the most effective methods in continuous optimization. It responds to the growing interest in optimization in engineering, science, and business by focusing on the methods that are best suited to practical problems. For this new edition the book has been thoroughly updated throughout. There are new chapters on nonlinear interior methods and derivative-free methods for optimization, both of which are used widely in practice and the focus of much current research. Because of the emphasis on practical methods, as well as the extensive illustrations and exercises, the book is accessible to a wide audience. It can be used as a graduate text in engineering, operations research, mathematics, computer science, and business. It also serves as a handbook for researchers and practitioners in the field. The authors have strived to produce a text that is pleasant to read, informative, and rigorous - one that reveals both the beautiful nature of the discipline and its practical side.

17,420 citations

Book
01 Jan 1984
TL;DR: Strodiot and Zentralblatt as discussed by the authors introduced the concept of unconstrained optimization, which is a generalization of linear programming, and showed that it is possible to obtain convergence properties for both standard and accelerated steepest descent methods.
Abstract: This new edition covers the central concepts of practical optimization techniques, with an emphasis on methods that are both state-of-the-art and popular. One major insight is the connection between the purely analytical character of an optimization problem and the behavior of algorithms used to solve a problem. This was a major theme of the first edition of this book and the fourth edition expands and further illustrates this relationship. As in the earlier editions, the material in this fourth edition is organized into three separate parts. Part I is a self-contained introduction to linear programming. The presentation in this part is fairly conventional, covering the main elements of the underlying theory of linear programming, many of the most effective numerical algorithms, and many of its important special applications. Part II, which is independent of Part I, covers the theory of unconstrained optimization, including both derivations of the appropriate optimality conditions and an introduction to basic algorithms. This part of the book explores the general properties of algorithms and defines various notions of convergence. Part III extends the concepts developed in the second part to constrained optimization problems. Except for a few isolated sections, this part is also independent of Part I. It is possible to go directly into Parts II and III omitting Part I, and, in fact, the book has been used in this way in many universities.New to this edition is a chapter devoted to Conic Linear Programming, a powerful generalization of Linear Programming. Indeed, many conic structures are possible and useful in a variety of applications. It must be recognized, however, that conic linear programming is an advanced topic, requiring special study. Another important topic is an accelerated steepest descent method that exhibits superior convergence properties, and for this reason, has become quite popular. The proof of the convergence property for both standard and accelerated steepest descent methods are presented in Chapter 8. As in previous editions, end-of-chapter exercises appear for all chapters.From the reviews of the Third Edition: this very well-written book is a classic textbook in Optimization. It should be present in the bookcase of each student, researcher, and specialist from the host of disciplines from which practical optimization applications are drawn. (Jean-Jacques Strodiot, Zentralblatt MATH, Vol. 1207, 2011)

4,908 citations

Journal ArticleDOI
TL;DR: Some open problems are discussed: the constructive use of the delayed inputs, the digital implementation of distributed delays, the control via the delay, and the handling of information related to the delay value.

3,206 citations


"A class of optimal state-delay cont..." refers background in this paper

  • ...Such problems arise in the control of crushing processes 257 [19] and mixing tanks with recycle loops [27]....

    [...]

  • ...Although the optimal control of time-delay systems has been the subject 97 of numerous theoretical and practical investigations [2, 8, 19, 5], most re98 search has focussed on the simple case when the delays are fixed and known....

    [...]

Journal ArticleDOI
01 Feb 2011
TL;DR: This paper investigates the problems of stability analysis and stabilization for a class of discrete-time Takagi-Sugeno fuzzy systems with time-varying state delay with a novel fuzzy Lyapunov-Krasovskii functional and proposes a delay partitioning method.
Abstract: This paper investigates the problems of stability analysis and stabilization for a class of discrete-time Takagi-Sugeno fuzzy systems with time-varying state delay. Based on a novel fuzzy Lyapunov-Krasovskii functional, a delay partitioning method has been developed for the delay-dependent stability analysis of fuzzy time-varying state delay systems. As a result of the novel idea of delay partitioning, the proposed stability condition is much less conservative than most of the existing results. A delay-dependent stabilization approach based on a nonparallel distributed compensation scheme is given for the closed-loop fuzzy systems. The proposed stability and stabilization conditions are formulated in the form of linear matrix inequalities (LMIs), which can be solved readily by using existing LMI optimization techniques. Finally, two illustrative examples are provided to demonstrate the effectiveness of the techniques proposed in this paper.

414 citations

Frequently Asked Questions (1)
Q1. What have the authors contributed in "A class of optimal state-delay control problems" ?

The authors consider a general nonlinear time-delay system with state-delays as control variables. The authors show that this optimal control problem can be formulated as a nonlinear programming problem in which the cost function is an implicit function of the decision variables. The authors conclude the paper by discussing applications of their approach to parameter identification and delayed feedback control.