On the Identification of Coupled Pitch and Heave Motions Using Opposition-Based Particle Swarm Optimization

Dai, Yuntao; Liu, Liqiang; Feng, Shanshan

doi:https://doi.org/10.1155/2014/784049

Mathematical Problems in Engineering

On this page

Abstract Introduction Conclusions Acknowledgments References Copyright Related Articles

Special Issue

Mathematical Modeling, Analysis, and Advanced Control of Complex Dynamical Systems

View this Special Issue

Research Article | Open Access

Volume 2014 | Article ID 784049 | https://doi.org/10.1155/2014/784049

On the Identification of Coupled Pitch and Heave Motions Using Opposition-Based Particle Swarm Optimization

Yuntao Dai,¹Liqiang Liu,²and Shanshan Feng¹

Academic Editor: Rongni Yang

Received12 Dec 2013

Accepted07 Feb 2014

Published09 Apr 2014

Abstract

A mathematical model must be established to study the motions of ships in order to control them effectively. An assessment of the model depends on the accuracy of hydrodynamic parameters. An algorithm for the parameter identification of the coupled pitch and heave motions in ships is, thus, put forward in this paper. The algorithm proposed is based on particle swarm optimization (PSO) and the opposition-based learning theory known as opposition-based particle swarm optimization (OPSO). A definition of the opposition-based learning algorithm is given first of all, with ideas on how to improve this algorithm and its process being presented next. Secondly, the design of the parameter identification algorithm is put forward, modeling the disturbing force and disturbing moment of the identification system and the output parameters of the identification system. Then, the problem involving the hydrodynamic parameters of motions is identified and the coupled pitch and heave motions of a ship described as an optimization problem with constraints. Finally, the numerical simulations of different sea conditions with unknown parameters are carried out using the PSO and OPSO algorithms. The simulation results show that the OPSO algorithm is relatively stable in terms of the hydrodynamic parameters identification of the coupled pitch and heave motions.

1. Introduction

The model concerned with the motions of ships describes the process of movement of the response characteristics of the control input, and this is the precondition to understanding the motions of ships. Widely used system identification techniques for hydrodynamic parameters and the hydrodynamic parameters themselves can be identified by observing the data relating to the motions of ships. This directly establishes the mathematical model of the ship’s hydrodynamic parameters and motions between the state models. Classic identification algorithms, such as the maximum likelihood identification method and the prediction error used for parameter estimation are too low in terms of sensitivity and are thus inadequate as methods used in order to solve true values. Abkowitz [1] extended the Kalman Filter method to estimate the hydrodynamic parameters of a ship’s motions. Clarke et al. [2] identified the nonlinear parameters of the motions of ships by using an artificial neural network. Haddara used free attenuation from the free response-signal method to identify the roll [3, 4] and extended it to the parameter identification of sway and yaw coupled equations [5] and pitch and heave coupled equations [6]. Haddara and Xu [7] additionally put forward a ship’s longitudinal motions state as a Markov chain process and, in order to simplify the longitudinal motions equation, they used a neural network for the identification of a ship’s longitudinal motions parameters. Mahfouz and Haddara [8] mixed the classic recognition algorithm and neural network methods, putting forward a hydrodynamic parameter identification method using RDLRNNT technology, a method that appears to be fairly sound.

Bhattacharyya and Haddara [9] used artificial neural networks (ANN) and spectral analysis methods to identify the hydrodynamic derivatives in the mathematical model involving ship and marine vehicle motions. ANN has also some defects, however, such as bad generalization performance, easily falling into a local minimum. Luo and Zou [10] applied support vector machines (SVM) to identify the hydrodynamic derivatives of Abkowitz’s model from the simulated free-running model test results and then used the regressive Abkowitz model to predict zigzag tests. Zhang and Zou [11] proposed a novel method of artificial intelligence technology in the shape of support vector machines in order to estimate the hydrodynamic coefficients in the mathematical models of ship maneuvering motions. A comparison between the predicted hydrodynamic forces and the test results shows that the identified hydrodynamic mathematical model has a good generalization performance.

In recent years, with the rapid development of intelligent algorithms, a number of scholars have used the swarm intelligent algorithm, applying it to hydrodynamic parameters in order to identify problems related to the motions of ships. Through the state equation of underwater bodies and observation equation, Chen et al. [12] has used intelligent recognition technology for simulation recognition of an underwater navigation body and has obtained ten hydrodynamic parameters. In 2008, Chen et al. [13] proposed a new recognition algorithm based on intelligence technology. The least-square criterion together with the Differential Swarm Intelligent (DS) algorithm is employed to identify hydrodynamic parameters. In 2011, Dai et al. [14, 15] used an improved PSO algorithm and continuous domain ant colony optimization algorithm to identify the hydrodynamic parameters of heave and pitch with satisfactory results. In order to determine a water diving device parameter test and for the theoretical calculation of difficult problems, Gao and Li [16] put forward a method based on the basic artificial bee colony algorithm and the improved artificial bee colony method used to identify a potential coefficient method. Experiments show that the use of artificial colony algorithm identification device parameters is indeed feasible.

The PSO algorithm was proposed by Kennedy and Eberhart in 1995 [17, 18]. In order to overcome the existing problems in the practical use of the PSO algorithm and improve the performance of the algorithm, an improved algorithm has been put forward by number of scholars [19–26]. Generally speaking, the improved PSO algorithm strategy currently includes two aspects, namely, the improvement of the strategy of the PSO algorithm and its fusion with other algorithms. The improved PSO algorithm mainly concerns the variation of the particles, the multipopulation cooperation, and the design of parameters. These methods can potentially prevent particle aggregation and conflict, and avoid premature convergence to local optima. PSO algorithms are integrated with other algorithms, improving the strategy of the PSO. Some scholars are currently advocating the opposition-based learning particle swarm optimization algorithm. Wang et al. [21] have introduced opposition-based learning into the PSO algorithm, then they proposed opposition-based learning and the Cauchy mutation PSO algorithm (OPSO), using opposition-based learning to initialize the group. Omran and Al-Sharhan [24] have used dynamic shrinkage factors to generate opposition-based solutions. Shahzad [25] have presented three kinds of opposition-based PSO algorithm: the first version of the OPSO algorithm using only opposition-based learning in order to initialize groups and the second version (IOPSO) in addition to opposition-based learning produced the opposition-based particles as a replacement for the worst particle in the group during each iteration. In the third version of the algorithm the initialization of opposition-based learning is removed from IOPSO. Shi and Eberhart [26] have controlled the velocity of PSO by using opposition-based learning and proposed the speed clamping PSO algorithm (OVCPSO) based on opposition-based learning, which achieved good results.

Owing to the limitations of conventional identification methods in coupled pitch and heave motions parameter identification, in this paper, we are proposing to identify ship coupled heave and pitch motions using opposition-based PSO. In order to achieve this, we have designed a model involving wave disturbance force and torque disturbance, using the design methods for an output parameter identification system, with an opposition-based PSO algorithm for parameter identification.

2. Pitch and Heave Motions Model

The coupled pitch and heave motions of a ship in a realistic sea can be described by two linear second order ordinary coupled differential equations as follows [7]: where is heave; is pitch; is the pitching moment of inertia; is the ship’s mass; is the force of the rudder; is advanced from the rudder lifting center to the ship’s center of gravity; is the disturbance force of heave; is the disturbance moment of pitch, is the added mass, and are mass moment; is the moment of inertia; , are the damping coefficients; , are the resilience coefficient; , are the damping moment coefficient; , are the righting moment coefficients; and , , , , , , , , , , , and are the hydrodynamic parameters.

Set , as the state variables

The system state equation is then obtained as follows:

Among , , , where para as the parameters to be identified, is the wave disturbing force and moment.

3. Opposition-Based Particle Swarm Optimization

3.1. Particle Swarm Optimization Algorithm

PSO learns from the natural phenomenon of birds looking for food made by a class of population-based stochastic global optimization techniques. With respect to birds in flight, in its initial state every bird is in a random position and flies randomly in all directions, but as time goes on, these initial random state birds form a small community, through mutual learning, mutual tracking, and self-organization, fly at the same speed in the same direction, and ultimately the entire group gathers in one place, namely, the food source.

In the PSO algorithm, each individual is called a “particle,” and each particle represents a potential solution. In continuous spatial coordinates, the PSO algorithm is described as follows.

Suppose that the size of the swarm is and the search space is -dimensional, then the position of the th particle is presented as , the velocity of this particle is presented as , the fitness value of each particle in its current position is , its corresponding optimal value is and the population current optimal experience value is recorded as . Each particle adjusts its speed dynamically according to the comprehensive analysis of both individual and population flying experience and flies to the best position that it and other particles have experienced. Each particle updates its speed and position according to the formula equations: where is iterative times, . are random numbers between 0 and 1 and , are nonnegative constants. This is called the learning factor and each iteration step is justified accordingly.

3.2. Opposition-Based Learning

Opposition-based learning was put forward by Professor Tizhoosh [19] in 2005. He argues that intelligent algorithms are based on a random guess value concerning the initial population, with each generation coming close to the solution with the optimal solution or a close approximation of the optimal solution eventually being found. Thus, the initial guess value greatly influences the algorithm and, if the random guess value is very close to the optimal solution, the algorithm may converge quickly, but if the value is far away from the solution or is even the reverse, the algorithm will take much more time. If the current solution and its opposite are sought simultaneously, a better solution will be chosen and the efficiency of the algorithm will be greatly enhanced. According to the theory of probability, there is a 50% probability that the current solution is more remote from the optimal solution than its opposite [20].

Definition 1 (definition of the opposite number). Let be a real number within a defined interval, where . The opposite number can be defined as

Definition 2 (definition of the opposite point). In the high dimensional space, if is a set of points in the -dimensional search space where , , then the points in the opposition set can be defined as

Definition 3 (opposition-based optimization). For a point in the -dimensional space , suppose that is the function used to measure the performance of a candidate solution, according to the opposition theorem, will be the opposition set for , If , then the set of points can be replaced by , or else is maintained.

3.3. Opposition-Based Particle Swarm Optimization

In PSO, each particle adjusts its search direction on the basis of the optimum location of all particles. In the initial stage, the algorithm converges quickly but slows down later on or even stops. These particles lose the ability to evolve when the speed of all the particles approaches zero and the algorithm is thought to represent convergence. Sometimes the algorithm does not converge to global extreme values, however, not even local extreme values. This is because the high aggregate and deficiency diversity of the particles takes a long time or an infinite time to skip from the focusing point.

In order to solve this problem, the opposition-based learning mechanism is introduced into the basic PSO, and a new random optimization algorithm is constructed, the opposition-based particle swarm optimization (OPSO) algorithm. In the OPSO algorithm, a variable is set and referred to as conNum. If the global best fitness is not updated during a single iteration, then the conNum = conNum + 1, and when conNum reaches a constant set number setNum, it shows that there is a high concentration of particles, and the algorithm cannot find a better solution in the current position and speed. At this point, opposition-based learning is brought into play. According to (8) the position-based position of the particle’s current position is produced, the smaller values are selected from and which have locations and a new swarm is then formed. If the conNum is less than setNum, then according to (5) and (6) the particle velocity and position are updated. The process of OPSO is shown in Algorithm 1.

%% Initialization
(1) Initialize swarm size N and constant number and ; space dimension ; maximum
(2) Initialize the iteration number for opposition calculation , ;
(3) for :
(4) initialize randomly with the search range ()
(5) initialize randomly with the velocity range ()
(6) End for
(7) Evaluate each particle’s fitness , and the best fitness
(8) Identify the best particle’s position and its fitness ); %%Loop
(9) While ( )
(10) If then
(11) for to
(12) Calculate the opposite particle using (8);
(13) Evaluate fitness in opposite vector;
(14) end for
(15) Select fittest particles from and to
(16) create a population of size ;
(17) Else
(18) for to
(19) Calculate particle velocity using (5)
(20) update particle position using (6)
(21) Evaluate
(22) End for
(23) End if
(24) update
(25) for to
(26) if ()
(27) update
(28) ;
(29) end if
(30) end for
(31) ;
(32) end while

4. Design of Pitch and Heave Parameter Identification

The value of pitch and heave can be measured, so select state and in (2) as the measurement state, with the observation equation as where is an observation vector and is the two-dimensional measurement of noise, and this is generally considered to be white noise.

Before computer simulation, it was necessary to disperse the state equation and observation equation. This paper does not consider the steering input but only the wave disturbance on the ship, with the state equation being formulated as follows: where, ,

In this paper, the single-parameter ITTC spectrum is chosen for wave disturbance simulation, with the expression being formulated as follows: where is the acceleration of gravity, is the natural angular frequency, and is a third significant wave height, for a level 4 and 5 sea condition, and the ITTC recommended value is 2.5 m and 3.75 m, respectively.

By (10), the observed quantity is the function of , para, namely: where dataNum is the times of observation, is the model output vector, and is the observation vector. The minimum mean square errors between the observed data and identical value are setting as follows:

The hydrodynamic parameters of our requirements should mean that the two components in (13) obtain their minimum value simultaneously under constrained conditions (10). We must set different weight coefficients to ensure that each parameter has the same effect on the objective function, taking into consideration the different order of magnitude of pitch and heave. The fitness function is shown as follows: where is the weight coefficient.

5. Experiment Testing and Comparisons

Here the experimental ship’s parameters are as follows: the hull quality is 442000 kg, the beam is 7.2 m, and the draft is 2.25 m. The waterline is 60 m. , (kg·m²), m, and m. The number of rudder is 2 and the hydrostatic resilience factor is 3370000. For the ship, , , , and are constants and can be obtained by calculating the structural parameters of the ship. is Gaussian white noise is Gaussian white noise and its covariance matrix can be taken as so that the accuracy of the sensor can be taken as .

A comparative algorithm is the OPSO algorithm proposed in this paper and the PSO-w (PSO with inertia weight [26]), with the parameters being set as shown in Table 1.

The identification results by PSO and OPSO are shown in Tables 2, 3, and 4, for level 4 sea condition, speed 18 kn and course angle 90°, 135°, and 180°, respectively.

As we can see from Table 2 to Table 4, the parameters of pitch and heave are correctly identified by using the PSO algorithm, with the OPSO algorithm clearly obtaining better results than the PSO, especially for level 4 sea condition, speed 18 kn, and course angle 135°, and the relative error of the OPSO is smaller than for the PSO algorithm.

From the identification of the parameters of pitch and heave motions carried out by using the OPSO algorithm, we can obtain the mathematical model for pitch and heave which is constructed according to the identification of the hydrodynamic parameters. The model in which the pitch and heave for sea condition 4, speed 18 kn, and course angle 90°, 135°, and 180° is shown in Figures 1, 2, and 3, respectively. There are three curves in each diagram; the first curve “—□—” represents the observed values of the coupled pitch and heave motions, the second curve “—▼—” represents the model constructed by PSO-w, and the last curve “—●—” represents the model output values constructed by OPSO.

(a) Pitch

(b) Heave

(a) Pitch

(b) Heave

(a) Pitch

(b) Heave

It is obvious in these figures that there was an agreement between the pitch and heave model estimated by the PSO-w model and observed values for a level 4 sea condition, ship speed 18 kn, and course angle 90° and 180°, but when the course angle was 90°, the results were not accurate. However, the model estimated by the OPSO algorithm tallies completely with the observed values.

Tables 5, 6, and 7 and Figures 4, 5, and 6 show similar results for a level 5 sea condition. It is clear in Tables 5–7 that the parameters identified by the OPSO algorithm are close to the real ones while those identified by PSO-w are not, especially the results for level 5 sea condition, ship speed 18 kn, and course angle 90 degrees, as the parameters have greater relative errors. Because of this, the corresponding pitch and heave models do not tally with the observed values. However, for other course angles, both the PSO-w and OPSO algorithms agree with observed values.

(a) Pitch

(b) Heave

(a) Pitch

(b) Heave

(a) Pitch

(b) Heave

6. Conclusions

The identification of the hydrodynamic parameters of ships is an important way of obtaining these parameters. In this paper, we have used OPSO to design the method of identifying the hydrodynamic parameters of the coupled pitch and heave motions of ships. This paper introduces in detail the opposition-basedlearning algorithm and puts forward an improved idea and process for the opposition-based algorithm. In addition, this paper introduces the process involving the hydrodynamic parameter identification algorithm. Here, we have established wave disturbance as the model input, with the algorithm’s fitness function being the output model. The hydrodynamic parameter identification problem was then converted into a constrained optimization problem and the OPSO algorithm was used to find the optimal solution. Finally, we made use of computer simulation, with the simulation results showing that the OPSO algorithm is relatively stable in terms of identifying the hydrodynamic parameters connected with the problem of the coupled pitch and heave motions of ships. In addition, the identified coupled pitch and heave model values and the observed values are consistent. This method may provide a new solution for the identification of coupled pitch and heave motions. This paper has not taken the disturbance of the rudder angle into consideration, something which the author intends to research in due course.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

Acknowledgments

This work has been financially supported by the National Natural Science Foundation of China under the Grant 51109041 and the fundamental research funds for the central universities.

References

M. A. Abkowitz, “Measurement of hydrodynamic characteristics from ship manoeuvring trials by system identification,” Transactions of the Society of Naval Architects and Marine Engineers, vol. 88, pp. 283–318, 1980.
View at: Google Scholar
D. P. Clarke, P. Gedling, and G. Hine, “The application of manoeuvring criteria in hull design using linear theory,” Transactions of the Royal Institution of Naval Architects, vol. 125, pp. 45–68, 1982.
View at: Google Scholar
M. R. Haddara, “On the use of neural network techniques for the identification of ship stability parameters at sea,” in Proceedings of the 14th International Conference on Offshore Mechanics and Arctic Engineering, vol. 2, pp. 127–135, 1995.
View at: Google Scholar
M. R. Haddara, “On the random decrement for nonlinear rolling motion,” in Proceedings of the 12th International Conference on Offshore Mechanics and Arctic Engineering, vol. 2, pp. 283–288, 1992.
View at: Google Scholar
M. R. Haddara and Y. Wang, “Parametric identification of coupled sway and yaw motions,” in Proceedings of the 15th International Conferece on Offshore Mechanics and Arctic Engineering, vol. 1, pp. 267–273, 1996.
View at: Google Scholar
M. R. Haddara and J. S. Xu, “On the use of random decrement in the identification of two degrees of freedom systems,” in Proceedings of the Canadian Society for Mechanical Engineering Forum (CSME '98), vol. 4, pp. 499–507, Ryerson Polytechnic University, 1998.
View at: Google Scholar
M. R. Haddara and J. Xu, “On the identification of ship coupled heave-pitch motions using neural networks,” Ocean Engineering, vol. 26, no. 5, pp. 381–400, 1998.
View at: Publisher Site | Google Scholar
A. B. Mahfouz and M. R. Haddara, “Effect of the damping and excitation on the identification of the hydrodynamic parameters for an underwater robotic vehicle,” Ocean Engineering, vol. 30, no. 8, pp. 1005–1025, 2003.
View at: Publisher Site | Google Scholar
S. K. Bhattacharyya and M. R. Haddara, “Parametric identification for nonlinear ship maneuvering,” Journal of Ship Research, vol. 50, no. 3, pp. 197–207, 2006.
View at: Google Scholar
W. L. Luo and Z. J. Zou, “Parametric identification of ship maneuvering models by using support vector machines,” Journal of Ship Research, vol. 53, no. 1, pp. 19–30, 2009.
View at: Google Scholar
X. G. Zhang and Z. J. Zou, “Estimation of the hydrodynamic coefficients from captive model test results by using support vector machines,” Ocean Engineering, vol. 73, pp. 25–31, 2013.
View at: Publisher Site | Google Scholar
W. Q. Chen, K. Yan, G. J. Shi, S. T. Wang, and Z. Y. Liu, “Research of hydrodynamic parameter identification for underwater vehicle using swarm intelligence algorithm,” Journal of Ship Mechanics, vol. 11, no. 1, pp. 40–46, 2007.
View at: Google Scholar
W. Q. Chen, K. Yan, and B. S. Wang, “Intelligent identification of hydrodynamic parameters of navigating body,” Journal of Ship Mechanics, vol. 12, no. 2, pp. 204–210, 2008.
View at: Google Scholar
Y. T. Dai, X. R. Zhao, and L. Q. Liu, “Parameter identification of ship longitudinal motions using continuous domains ant colony algorithm,” Computer Engineering, vol. 26, no. 16, pp. 23–24, 2010.
View at: Google Scholar
Y. T. Dai, X. R. Zhao, and L. Q. Liu, “Parameter identification of ship vertical motions using improved particle swarm optimization,” Journal of Ship Mechanics, vol. 14, no. 1-2, pp. 44–50, 2010.
View at: Google Scholar
M. S. Gao and S. M. Li, “Identification on hydrodynamic coefficients of underwater vehicle with the ABC algorithm,” Journal of Harbin Engineering University, vol. 34, no. 8, pp. 1–5, 2013.
View at: Google Scholar
J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, pp. 1942–1948, 1995.
View at: Google Scholar
R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science, pp. 39–43, 1995.
View at: Google Scholar
H. R. Tizhoosh, “Opposition-based learning: a new scheme for machine intelligence,” in Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation (CIMCA '05), vol. 1, pp. 695–701, Vienna, Austria, 2005.
View at: Publisher Site | Google Scholar
S. Rahnamayan, H.R. Tizhoosh, and M. M. Salama, “Opposition-based differential evolution,” IEEE Transactions on Evolutionary Computation, vol. 12, no. 1, pp. 64–79, 2008.
View at: Publisher Site | Google Scholar
H. Wang, H. Li, Y. Liu, C. Li, and S. Zeng, “Opposition-based particle swarm algorithm with cauchy mutation,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 4750–4756, Singapore, 2007.
View at: Publisher Site | Google Scholar
J. Kennedy, “Particle swarm: social adaptation of knowledge,” in Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 303–308, 1997.
View at: Google Scholar
H. Lin and H. Xingshi, “A novel opposition-based particle swarm optimization for noisy problems,” in Proceedings of the 3rd International Conference on Natural Computation (ICNC '07), pp. 624–629, Haikou, China, 2007.
View at: Publisher Site | Google Scholar
M. G. H. Omran and S. Al-Sharhan, “Using opposition-based learning to improve the performance of particle swarm optimization,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '08), pp. 1–6, Saint Louis, Mo, USA, 2008.
View at: Publisher Site | Google Scholar
F. Shahzad, A. R. Baig, S. Masood, M. Karman, and N. Naveed, “Opposition-based particle swarm optimization with velocity clamping (OVCPSO),” in Advances in Computational Intelligence, vol. 116 of Advances in Intelligent and Soft Computing, pp. 339–348, 2009.
View at: Publisher Site | Google Scholar
Y. Shi and R. C. Eberhart, “A modified particle swarm optimizer,” in Proceedings of the IEEE International Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, pp. 69–73, Anchorage, Alaska, USA, 1998.
View at: Publisher Site | Google Scholar | Zentralblatt MATH

Copyright

Copyright © 2014 Yuntao Dai et al. 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.

PDF Download Citation

Download other formats

Order printed copies

Views

1283

Downloads

1075

Citations