- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Recently Accepted Articles ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Applied Mathematics

Volume 2013 (2013), Article ID 326161, 8 pages

http://dx.doi.org/10.1155/2013/326161

## The Control Data Method: A New Method of Modeling in Population Dynamics

College of Mathematics and Systems Science, Xinjiang University, Urumqi 830046, China

Received 7 February 2013; Accepted 31 August 2013

Academic Editor: Zhijun Liu

Copyright © 2013 Lin-Fei Nie and Zhi-Dong Teng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

A novel modeling method for population dynamics is developed. Based on the classical Lotka-Volterra model, we construct a new predator-prey model with unknown parameters to simulate the behaviors of predator and prey. Using a the approximation property and the machine learning approach of artificial neural networks, a tuning algorithm of unknown parameters is obtained and the factual data of predator-prey can be asymptotically stabilized using a neural network controller. Numerical examples and analysis of the results are presented.

#### 1. Introduction

A mathematical model of population is an abstract model that uses mathematical language to describe the behavior between population and the relationships of populations. Mathematical models are extremely powerful because they usually enable explanation and prediction to be made about population. Soon after Lotka and Volterra’s pioneering works [1, 2], many scholars established a large number of mathematical models to simulate the evolution of population. The theories and applications of mathematical ecology are attended by the most momentous results. Particularly, in the seventies of the last century, the new theories and methods of differential equations and dynamical systems have been widely used in study of population genetics, neurobiology, epidemiology, immunology, physiology, and environmental pollution, and so forth. See the monographs of Murray [3], Chen [4], Freedman [5], and Murray [6] for a detailed description of a population and for various mathematical methods for analyzing population models.

One of the most basic and important models is the Lotka-Volterra type model. In the last decades, considerable work on the permanence, the extinction, and the global asymptotic stability of autonomous or nonautonomous Lotka-Volterra type models have been studied extensively, for example, [7–11] and the references therein. In addition to these, the books of Takeuchi [9], Gopalsamy [12], and Kuang [13] are good sources for the dynamical behavior of Lotka-Volterra models.

Unfortunately, we can never make a completely precise model of a population system, and there are always phenomena which we will not be able to model. Thus, there will always be model errors or model uncertainties. For example, in the establishment of the mathematical model, we ignored a number of secondary factors in order to make an analysis of mathematical reasoning. However, with the rapid progress of science and technology, especially the fast development of computer and network, more information on biological population can be obtained. A large amount of information shows that the existing models are not able to precisely simulate the developmental process of the population. In other words, those secondary factors have been ignored in the modeling process but they played an important role in the development process of populations. Therefore, the traditional models cannot simulate the real dynamic of population and the traditional modeling technique is not perfect.

On the other hand, we note that an artificial neural network (ANN), usually called neural network (NN), is a mathematical model or computational model that is inspired by the structual and/or functional aspects of biological neural networks. In most cases, ANN is an adaptive system that changes its structure based on external or internal information that flows through the network during the learning phase. For this very reason, ANN is found in almost every domain of applied science, such as pattern recognition, data classification, medicine, sales forecasting, industrial process control, customer research, data validation, risk management, and target marketing.

ANN based on biological neural systems has been studied for years, and their properties of learning and adaptation, classification, function approximation, feature extraction, and more have made them of extreme use in signal processing and system identification applications. These are open-loop applications, and the theory of ANN has been very well-developed in this area. The applications of ANN in closed-loop feedback control systems have only recently been rigorously studied, and a foundation for neural networks in control has been provided in seminal results by Narendra et al. [14–17] and others. Several researchers have studied ANN control and managed to prove stability [18–20]. In particularly, Jiang [21] presented a neural network control scheme for tracking a nonlinear system using trajectory tracking, and an iterative training law described by a positive definite discrete kernel is also presented. Hayakawa [22] considered a neural network hybrid adaptive control framework for nonlinear uncertain hybrid dynamical systems.

Motivated by these considerations, in this paper, we will propose a new modeling method, using machine learning of the ANN theory to amend Lotka-Volterra predator-prey model such that the revised model can better simulate or control the development of populations.

This paper is organized as follows. Using machine learning of the ANN theory, a new predator-prey model is introduced in Section 2. In Section 3, we give some functional-link neural network (FLNN) weight tuning algorithms for this model. In Section 4, some specific examples are given to illustrate our results. Finally, Section 5 presents the conclusions.

#### 2. Model Description and Preliminaries

It is well known that Lotka-Volterra models are fundamental population models. For example, the following classical autonomous model is used to model the interaction of the prey and predator: where and represent the population densities of prey and predator at time , respectively; and () are nonnegative constants. The dynamic behaviors of model (1) are clear. It has no periodic solution in region and has a saddle and a stable nod under the condition , whereas it has two saddles and and one stable focus under the condition as shown in Figure 1.

Along with the development of technology, more information on biological population can be obtained. We find that the model (1) could not simulate the real dynamic behavior of predator and prey. Therefore, according to the traditional Lotka-Volterra predator-prey model, we construct a new predator-prey model to simulate the states of predator and prey. The model takes the following form: where is an unknown function.

Next, we will use the machine learning of the ANN theory to approximate the unknown function , such that model (2) can better simulate the behaviors of predator and prey.

Let be a solution of model (2). Suppose that the factual data of predator-prey is . Then, we define the error function by Since is the factual data, so satisfies the following assumption.

() The factual data is bounded, that is, where is a known positive constant and

By differentiating (3) and invoking (2), it is seen that the model is expressed in the terms of a tracking error as where , is diagonal matrix, andLet be a compact, simply connected set of and . Define as a space of continuous functions . The universal approximation theorem claims that, for real valued function , there exists an ideal approximating weight such that with the estimation tracking error bounded by and is a basis set which can choose or . One must notice as well that the ideal weight is unknown and not even unique. Assume that ideal weight is a constant and bounded so that with the bounded known, where is the Frobenius norm of and is the matrix trace, that is, sum of diagonal elements. For more details, we refer to [23, 24].

Then, an estimate of function is given by with as the current actual values of the one-layer functional-link neural network (FLNN) controller weights as provided by the tuning algorithm to be specified. It is necessary to show how to tune the ANN weight on-line so as to guarantee stable tracking. The tuning algorithm found will presumably modify the actual weight so that they become close to the ideal weight , which is unknown. We choose a general sort of approximation-based function, which is derived by setting where is an outer proportional-plus-derivative tracking loop. Using this controller, system (6) is rewritten by the following form: where is the function approximation error.

#### 3. FLNN Weight Tuning Algorithms for Model (2)

In this section, we give some FLNN weight tuning algorithms that guarantee the tracking stability of model (15). It is required to demonstrate that the tracking error is suitably small and that the FLNN weights remain bounded, for that, the unknown function is bounded.

##### 3.1. Ideal Case

In this subsection, we detail the behavior in the idealized case, where net functional reconstruction error is zero. The following theorem derives the ANN control that asymptotically stabilized the predator-prey model about its desired trajectory .

Theorem 1. *Suppose that assumption holds and in (10) is equal to zero. Suppose that the unknown function be given by (9) and ANN weight tuning provided by
**
where is a constant design parameter matrix. Then the tracking error goes to zero with and the weight estimates are bounded.*

*Proof. *Under the ideal case, the error system is
Select the Liapunov function candidate
Calculating the derivative of along the error system (17), it follows that
Since and is constant, from (16), it yields that
From this and (19), it follows that
Since and , this shows stability in the sense of Liapunov so that and (and hence ) are bounded. Thus
Now
and the right-hand side of (16) verifies the boundedness of and hence of and therefore the uniform continuity of . This allows us to invoke Barbalat’s Lemma in connection with (23) to conclude that goes to zero with and hence that vanishes as . The proof is complete.

On model (2), we have Theorem 2 that is a direct consequence of Theorem 1.

Theorem 2. *Suppose that assumption holds and in (10) is equal to zero. Further, let , where satisfy condition (16). Then, the error , with .*

*Remark 3. *From Theorem 2, we note that the solution of model (2) goes to the factual data . So, model (2) can better simulate the dynamical behaviors of predator and prey.

##### 3.2. The Nonideal Case

It has just been seen that there is no ANN functional approximation error under the ideal case. In this subsection, it will be seen that if the ANN approximation errors are not zero but bounded, then the tracking errors do not vanish but are bounded by small enough values to guarantee good tracking performance.

Theorem 4. *Suppose that assumption holds and in (10) is constant. Let the unknown function be given by (9) and let NN weight tuning be provided by
**
where is a constant design parameter matrix. Then the tracking error is uniform ultimate boundedness and the weight estimates are bounded. Moreover, may be kept as small as desired by increasing the gain .*

*Proof. *Let the NN approximation property (9) hold for the function given in (8) with a given accuracy for all in the compact set with .

Select the Liapunov function candidate
Calculating the derivative of along the error system (15), it follows that
Since and is constant, from (24) it yields that
From this and (26), it follows that
where is the minimum singular value of matrix . Since is constant, as long as

Let , where is the maximum positive constant such that ; , where is the maximum positive constant such that . It is obviouse that .

Suppose that initial tracking error . If , by the definitions of and . Therefore, will gradually become smaller until the access to . At this time, will become bigger from the definition . So, it follows that is the asymptotic convergence to the border of . Similarly, if , we can obtain the same results.

Now, let . Then we choose appropriate and such that for all , where is the diameter of set . From this, we have and . Otherwise, there is a point in set such that . Hence, we have . This is a conflict with the definition of set .

From the above discussion, we get that if , then is the asymptotic convergence to the border of . On the other hand, since , it follows that as . Therefore, tracking error is uniform ultimate boundedness and the boundedness may be kept as small as desired by increasing the gain . This completes the proof.

From Theorem 4, on the model (2), we have the following Theorem 5.

Theorem 5. *Suppose that assumption holds and in (10) is constant. Further, let , where satisfies condition (24). Then, the tracking error is uniform ultimate boundedness and the wight estimates are bounded. Moreover, may be kept as small as desired by increasing the gain .*

*Remark 6. *From Theorem 5, we can get that the solution of model (2) goes to the factual data . So, if the conditions of Theorem 5 hold, then model (2) can better simulate the behaviors of predator and prey.

#### 4. Example and Numerical Simulation

In this paper, we proposed a new modeling method, using machine learning of the ANN theory to amend the traditional Lotka-Volterra model such that the revised model can better simulate or control the behaviors of population.

In order to testify the validity of our results, we consider the following model: where is an unknown function.

If we choose and in model (30), it is clear that model (30) has a saddle and a stable nod which are shown in Figures 2(a) and 3(a).

However, if a factual data of predator-prey is , then model (30) with cannot simulate the real dynamic of populations. So, in this way, according to the Theorems 1 and 4, we can choose and . Then, we note that the factual data of predator-prey is asymptotically stable that is, the tracking error goes to zero as . That is, if we choose , then model (30) can better simulate (or control) the real behaviors of population which are shown in Figures 2(b) and 3(b).

Further, if we choose and in model (30), it is easy to demonstrate that model (30) has two saddles and and one stable focus which are shown in Figures 4(a) and 5(a).

If a factual data of predator-prey is then model (30) with cannot simulate the real dynamic of populations. So, in this way, according to Theorems 1 and 4, we choose and . Then, we note that the factual data of predator prey, , is asymptotically stable and has asymptotic phase property. That is, if we choose , then model (30) can better simulate (or control) the real behaviors of predator and prey, which are shown in Figures 4(b) and 5(b). Moreover, the tracking error may be kept as small as desired by increasing the gain which is shown in Figures 6(a) and 6(b).

#### 5. Conclusion

According to more information on biological population that can be obtained, we find that the traditional models cannot simulate the real dynamic of populations. Therefore, the traditional modeling technique is not perfect. So, in this paper, based on the traditional and most important Lotka-Volterra model, we developed a new modeling method, using machine learning of the ANN theory to construct a new predator-prey model to simulate the states of predator and prey. From the neural networks function approximation property and a factual data of predator-prey, we proposed a neural network trajectory tracking strategy, and the tuning algorithm of the new model is obtained. That is, under general assumptions, we proved that the tracking error is ultimately uniformly bounded and that the corresponding ultimate bound can be sufficiently decreased by modifying the feedback gain matrix. So, the new model can better simulate or control the real behaviors of populations. Finally, numerical examples were presented to show that the proposed method is feasible and efficient.

#### Acknowledgments

This research has been partially supported by the Natural Science Foundation of Xinjiang (Grant no. 2011211B08), the Scientific Research Programs of Colleges in Xinjiang (Grant no. XJEDU2011S08), the National Natural Science Foundation of China (Grants nos. 11001235, 11271312, and 11261056), the China Postdoctoral Science Foundation (Grants nos. 20110491750 and 2012T50836).

#### References

- A. Lotka,
*Elements of Physical Biology*, Williams and Wilkins, Baltimore, Md, USA, 1925. - V. Volterra, “Variazioni e uttuazioni del numero di individui in specie animali conviventi,”
*Memorie Accademia Lincei*, vol. 2, pp. 31–113, 1926 (Italian). - B. G. Murray,
*Population Dynamics: Alternative Models*, Academic Press, New York, NY, USA, 1979. - L. S. Chen,
*Mathematical Models and Methods in Ecology*, Science Press, Beijing, China, 1988. - H. I. Freedman,
*Deterministic Mathematical Models in Population Ecology*, vol. 57 of*Monographs and Textbooks in Pure and Applied Mathematics*, Marcel Dekker, New York, NY, USA, 1980. View at MathSciNet - J. D. Murray,
*Mathematical Biology. I. An Introduction*, vol. 17 of*Interdisciplinary Applied Mathematics*, Springer, New York, NY, USA, 3rd edition, 2002. View at MathSciNet - R. Redheffer, “Lotka-Volterra systems with constant interaction coefficients,”
*Nonlinear Analysis: Theory, Methods & Applications*, vol. 46, no. 8, pp. 1151–1164, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - Y. Saito, “Permanence and global stability for general Lotka-Volterra predator-prey systems with distributed delays,”
*Nonlinear Analysis: Theory, Methods & Applications*, vol. 47, no. 9, pp. 6157–6168, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - Y. Takeuchi,
*Global Dynamical Properties of Lotka-Volterra Systems*, World Scientific Publishing, River Edge, NJ, USA, 1996. View at Publisher · View at Google Scholar · View at MathSciNet - Z. Teng, Z. Li, and H. Jiang, “Permanence criteria in non-autonomous predator-prey Kolmogorov systems and its applications,”
*Dynamical Systems*, vol. 19, no. 2, pp. 171–194, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - J. Waldrogel, “The period in the Volterra-Lotka predator-prey model,”
*SIAM Journal on Numerical Analysis*, vol. 20, no. 6, pp. 1264–1272, 1983. View at Publisher · View at Google Scholar · View at MathSciNet - K. Gopalsamy,
*Stability and Oscillations in Delay Differential Equations of Population Dynamics*, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1992. - Y. Kuang,
*Delay Differential Equations with Applications in Population Dynamics*, vol. 191 of*Mathematics in Science and Engineering*, Academic Press, Boston, Mass, USA, 1993. View at MathSciNet - K. S. Narendra, “Adaptive control using neural networks,” in
*Neural Networks for Control*, W. T. Miller, R. S. Sutton, and P. J. Werbos, Eds., pp. 115–142, MIT Press, Cambridge, Mass, USA, 1991. - K. S. Narendra and A. M. Annaswamy, “A new adaptive law for robust adaptation without persistent excitation,”
*IEEE Transactions on Automatic Control*, vol. 32, no. 2, pp. 134–145, 1987. View at Scopus - K. S. Narendra and K. Parthasarathy, “Identification and control of dynamical systems using neural networks,”
*IEEE Transactions on Neural Networks*, vol. 1, no. 1, pp. 4–27, 1990. View at Publisher · View at Google Scholar · View at Scopus - K. S. Narendra and K. Parthasarathy, “Gradient methods for the optimization of dynamical systems containing neural networks,”
*IEEE Transactions on Neural Networks*, vol. 2, no. 2, pp. 252–262, 1991. View at Publisher · View at Google Scholar · View at Scopus - S. Jagannathan, “Discrete-time CMAC NN control of feedback linearizable nonlinear systems under a persistence of excitation,”
*IEEE Transactions on Neural Networks*, vol. 10, no. 1, pp. 128–137, 1999. View at Publisher · View at Google Scholar · View at Scopus - Y.-G. Leu, W.-Y. Wang, and T.-T. Lee, “Robust adaptive fuzzy-neural controllers for uncertain nonlinear systems,”
*IEEE Transactions on Robotics and Automation*, vol. 15, no. 5, pp. 805–817, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - J.-X. Xu and Z. Qu, “Robust iterative learning control for a class of nonlinear systems,”
*Automatica*, vol. 34, no. 8, pp. 983–988, 1998. View at Zentralblatt MATH · View at MathSciNet · View at Scopus - P. Jiang and R. Unbehauen, “Iterative learning neural network control for nonlinear system trajectory tracking,”
*Neurocomputing*, vol. 48, pp. 141–153, 2002. View at Publisher · View at Google Scholar · View at Scopus - T. Hayakawa, W. M. Haddad, and K. Y. Volyanskyy, “Neural network hybrid adaptive control for nonlinear uncertain impulsive dynamical systems,”
*Nonlinear Analysis: Hybrid Systems*, vol. 2, no. 3, pp. 862–874, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus - K. Hornik, “Approximation capabilities of multilayer feedforward networks,”
*Neural Networks*, vol. 4, no. 2, pp. 251–257, 1991. View at Scopus - F. L. Lewis, A. Yesildirak, and S. Jagannathan,
*Neural Network Control of Robot Manipulators and Nonlinear Systems*, Taylor, New York, NY, USA, 1999.