This paper presents a new parametric optimization approach based on a modified particle swarm optimization (PSO) to design a class of impulsive-correction projectiles with discrete, flexible-time interval, and finite-energy control. In terms of optimal control theory, the task is described as the formulation of minimum working number of impulses and minimum control error, which involves reference model linearization, boundary conditions, and discontinuous objective function. These result in difficulties in finding the global optimum solution by directly utilizing any other optimization approaches, for example, Hp-adaptive pseudospectral method. Consequently, PSO mechanism is employed for optimal setting of impulsive control by considering the time intervals between two neighboring lateral impulses as design variables, which makes the briefness of the optimization process. A modification on basic PSO algorithm is developed to improve the convergence speed of this optimization through linearly decreasing the inertial weight. In addition, a suboptimal control and guidance law based on PSO technique are put forward for the real-time consideration of the online design in practice. Finally, a simulation case coupled with a nonlinear flight dynamic model is applied to validate the modified PSO control algorithm. The results of comparative study illustrate that the proposed optimal control algorithm has a good performance in obtaining the optimal control efficiently and accurately and provides a reference approach to handling such impulsive-correction problem.
National Natural Science Foundation of China11176012Research Innovation Project for Graduate Student of Jiangsu-Provincial Ordinary UniversityKLYX15-03941. Introduction
Impulsive-correction projectile, as a type of precision-guided munitions, produces directive force for trajectory control, which results in quick-maneuvering and precise-correcting via small impulsive rockets equipped around the cross section of the airframe. This has also attracted significant interests of research due to its short-time response, high ratio of effectiveness-consumption, and simpleness of guidance [1–5]. Considerable work on the design of magnitude of impulse thrust and its position arrangement [4], real-time computational algorithm [6], flight stability of impulsive-correction trajectory [7], and so on has been developed. For instance, Liu and Willms [8] provided a novel approach to obtain necessary and sufficient conditions for impulsive controllability of continuous linear dynamics exercising discrete-time actions for applying into maneuvers of spacecraft. Rempala and Zabczyk [9] developed a simple and direct proof of a version of Blaquiere’s maximum principle for deterministic fixed-time impulsive control problems. Prado [10] considered the problem of optimal maneuvers to insert a satellite in a constellation in the application of two impulses to the satellite and the objective to perform this maneuver with minimum fuel consumption. Nevertheless, due to its nondifferentiable and discontinuous characteristics of impulsive control and its limit of finite working number of impulses, that is, discrete and finite-times correction, it is impossible to implement continuous control like conventional aerodynamic-fin control for the airframe.
Nowadays, numerical optimization controls are categorized into two different classes with their own advantages and characteristics, that is, direct method based on mathematical programming and parameterization of state and control histories and indirect method grounded on solution of two-point boundary value problem (TPBVP) using optimal control principle [11–13]. They are of probability to be applied for achieving an optimal performance of such problem. In general, direct method is more popular in application than indirect method due to the difficulty to obtain analytical solutions of indirect approach for nonlinear complex system. Hp-adaptive pseudospectral method, as one kind of the most popular and efficient direct methods, is combining Legendre pseudospectral method [14, 15] and Hp-adaptive method [16], which discretizes state variables and control variables on a series of Legendre-Gauss-Lobatto (LGL) points. What limits its application in impulsive system is that impulsive control variable is nondifferentiable with flexible-time intervals, which does not satisfy the Karush-Kuhn-Tucker (KKT) conditions.
To tackle such problems effectively, swarm intelligence- (SI-) based methods among those evolutionary algorithms [17–20] such as genetic algorithms (GAs), simulated annealing (SA), and ant-colony optimization are becoming more popular due to their speed and accuracy qualities. They are inspired by natural phenomena, for example, the behavior of groups of birds, ant colonies, herds of animals, and even social connections between human beings [19]. As a type of SI-based methods, the particle swarm optimization (PSO), primarily introduced in 1995 by Eberhart and Kennedy [21] and then extended by other researchers [22, 23], has been showing brilliant effect in optimizing discontinuous problems for its briefness in concept, easiness to implement, and high computational efficiency. Some mathematical approaches also make contributions to the PSO. For example, Couceiro and Sivasundaram provided a modified PSO algorithm to overcome traditional PSO algorithm’s drawbacks by considering a fraction calculus approach [24]. Pires et al. proposed a novel method for controlling the convergence rate of the PSO algorithm using fractional calculus concepts and observed the relationship between the fractional order velocity and the convergence of the algorithm [25]. Reference [26] interpreted PSO as a finite difference scheme for solving a system of stochastic ordinary differential equations (SODE) and proposed a class of modified PSO iteration methods based on local attractors of the SODE which behaved differently for different problems. Unlike the traditional optimization techniques, the PSO does not rely on the rigid mathematical characteristics (continuity, derivability) of the optimization problem itself and constraints in the optimization process. Reference [27] developed a PSO approach with a punish function to design the static parameters such as the working number of impulses, the magnitude and axial eccentricity of each single impulse thrust, and the fin oblique angle for impulsive-correction projectile. Yang et al. [28] presented a new approach to a fuel-optimal impulsive control problem of the guided projectile by using an improved PSO technique; this method did not consider the optimal working modes and flexible-time intervals in detail. Reference [29] proposed a new method for solving an optimal control problem applied to spacecraft reentry trajectory by using a PSO method and avoiding the calculations needed in the common analytical approaches.
Therefore, the aim of this paper is to present a new method for solving an optimal impulsive control problem with discrete, flexible-time interval, and finite-times correction using a modified PSO method, where the Hp-adaptive pseudospectral method has not been fully solved. The remaining of this paper is organized as follows. Section 2 deduces the mathematic model of impulsive-correction projectile system and states the optimal impulsive control problem. In Section 3, a modification based on the basic PSO is presented in detail for the impulsive optimization control design and the structure and parameter design of the controller, which solve the optimal setting of impulsive control for impulsive-correction projectile. Moreover, a suboptimal control and guidance law based on PSO technique are developed for the real-time consideration of the online design in practice. In Section 4, a simulation case is shown to demonstrate impulsive-correction projectile by implementing the modified PSO algorithm. In order to validate the performance of the impulsive control design, a specific nonlinear flight dynamic model coupled with different conditions such as optimal and suboptimal algorithm is also carried out. Finally, some conclusions are presented in Section 5.
2. Problem Statement
For the convenience of discussion, the motion of impulsive-correction projectile in longitude plane is chosen in this paper under assumption that the Earth is flat and motionless. The flight dynamic equations of impulsive-correction projectile are(1)v˙=-Psinα-X-mgsinθm,θ˙=Pcosα+Y-mgcosθmv,ω˙z=Pl+MzJz,ϑ˙=ω˙z,x˙=vcosθ,y˙=vsinθ,m˙=-mc,α=ϑ-θ,where the state variables include true airspeed of the projectile v, trajectory inclination angle θ, pitch angle ϑ, pitch angular ratio ωz, horizontal position x, height position y, and mass of the projectile m. P and l are the magnitude and axial eccentricity of the impulsive thrust, respectively; Mz means the pitching moment; Jz is the moment of inertia about z-axis; mc denotes the mass flow rate; α represents the attack of angle; and the drag force X and lift force Y are both the functions of dynamic pressure q, reference area S, and the drag and lift coefficients Cx, Cy as shown in (2).
Considering the wind disturbance during the flying period of the projectile, additional equations can be governed as(2)vr=x˙-wx2+y˙2,θr=atany˙x˙-wx,αr=ϑ-θr,Ma=vrC,X=qSCxαr,Ma,Y=qSCyαr,Ma,where the subscript r means the relative movement between the projectile and the air stream. wx (+ for downwind and − for upwind) is the horizontal velocity of wind during the flight, and Mach number Ma is the function of vr and sonic speed C.
Compared with the time-of-flight of the entire trajectory, the working time of the impulse is so transient that it can be treated as instantaneous mutation. Meanwhile, in consideration of low-cost design, impulsive rocket is of open loop, which cannot change the magnitude of its thrust force; that is, impulsive control Pi only stands two statuses:(3)Pi=FA,δi>00,δi<0,where FA denotes the constant magnitude of the impulsive force (see Figure 1) and δi>0 represents the flag of the impulse actuated with order number i=0,…,N, to the contrary δi<0. Here N is the total number of the impulses equipped.
Schematic of impulsive control variables.
Figure 2 gives the control and guidance process of the impulsive-correction projectile. The task of this paper can be described as follows: (1) In terms of the reference model, find an optimal solution of the impulsive design variables (P(t)) for minimum consumption of impulsive control and minimum control error under the condition of the flight dynamic equations described by (1)-(2), the relative terminal states and control constraints. (2) Based on the optimal numeric solution, find an online control structure and algorithm which will be illustrated in Section 3, to obtain the suboptimal control for the practical realization.
Control and guidance structure of impulsive-correction projectile.
3. Optimal Control Design3.1. Reference Model
For the optimal flight control problem under consideration of (1) and Figure 2, a mathematical model based on the linear disturbance motion can be taken as reference model controlled(4)x˙=Ax+Bu,where(5)x=x1x2x3=θθ˙θ¨,A=0100010-1TM2-2ξMTM,B=00KM.Here, KM, ξM, and TM represent transfer coefficient, damping, and time constant of the projectile, respectively.
3.2. Objective Function
Considering the impulsive-correction projectile belongs to a kind of low-cost munitions, the purpose of optimizing impulsive control is to satisfy the requirements of the cost as well as the precision of the impulsive projectile system, that is, the minimum amount of the working number of impulses and the control error. Thus the performance index used for minimization of control energy and control error is(6)J=λnN+∫t0tfet2dt,where n denotes the working number of actuated impulses; λ is the coefficient of weight; and the control error e(t)=x1-xc=θ-θc. Here t0 and tf represent the initial and end time, respectively.
3.3. Flight Constraints
For the given control model, the constraints corresponding to the flight optimization are as follows. The constraint on the state control is(7)θ∈θlower,θupper,where the subscripts lower and upper represent lower and upper limit, respectively.
In terms of the limit of total number of impulses, the inequality constraint is given as(8)n≤N.
Similarly, due to the discontinuity of impulsive control, the time interval Tui (see Figure 1) should be subject to(9)Tui>tf-t0N.
In accordance with the above formulation for the impulsive-correction projectile, the optimization issue in question is to achieve an effective algorithm to set the schematic of the impulses of application for a minimum impulsive control number and minimum control error. Due to the discrete characteristics of impulsive control exhibited in (3) and Figure 1, which is different with that of conventional continuous control, it is well to select Tui, time intervals between the two neighboring impulse forces Pi-1 and Pi as design variables.
3.4. Optimization Design Based on Modified PSO
From the control and guidance schematic of the impulsive-correction projectile system outlined in Figure 2, the control structure can be described in detail as in Figure 3, where f(e(t)) is the impulsive controller to be designed in terms of the reference model. In order to complete the design, two steps can be implemented as follows. (1) Obtain the numeric solution of the optimal impulsive control, which will be deducted in this section by using a numeric optimization approach. (2) Determine the suboptimal online controller via establishing the relationship between the error e(t) and the control u, as expressed in Section 3.6.
Structure of impulse control system.
PSO belonging to a category of SI methods mimics the unpredictable motion of a group of birds while searching for food, trying to take advantage of the information sharing mechanism that affects the overall behavior of the swarm. The main strength of PSO is its fast convergence due to cooperation of all individuals in finding the best solution. The initial population that composes the swarm is generated randomly at the first iteration of the process. Considering an n-dimensional search space, the swarm maintains a population of m particles. Each particle in the swarm is associated with a position vector as Xi=xi1,xi2,…,xin representing a possible solution to the problem and corresponding to a specific value of the objective or fitness function, a memory of its previous best position vector as Pi=pi1,pi2,…,pin remembering its best value so far (pbest) and the corresponding position in the search space, and velocity vector as Vi=vi1,vi2,…,vin denoting the varying speed of the current solution in the search space.
Moreover, each particle knows where the best value for the fitness function has occurred so far in the group (gbest). At the end of the process the best particle in the swarm (corresponding to the best solution with reference to the fitness function) is selected. The velocity and position update equations are given in the form of a single iteration as follows [13]: (10)vidk+1=w·vidk+c1r1pbestidk-xidk+c2r2gbestidk-xidk,(11)xidk+1=xidk+vidk+1,where d=1,2,…,n; k is the iteration counter; and r1, r2 are random numbers, generated uniformly in the range [0,1] responsible for imparting randomness to the flight of the swarm. The inertial weight w and the acceleration coefficients c1 and c2 are all nonnegative constant real parameters. Meanwhile, for improving the local ability of convergence of the particles during the range of the error, the inertial weight w is proposed to be reduced linearly from the start value to the end.
3.5. Modified PSO Algorithm Process
From the above modifications, Figure 4 describes the whole computational process of the algorithm in the following steps.
Initialize the population of n particles in the solution space of PSO such as swarm size, neighborhood size, iteration number, inertia weight, acceleration coefficient, random swarm locations, and velocities.
Calculate the fitness value for each particle in terms of the fitness function for updating individual optimal fitness pbest and the swarm optimal fitness gbest.
Evaluate whether the current fitness is individual optimal via comparing the fitness value of its current location to that of the local best pbest. If the current location has a higher fitness value, pbest should be replaced with its current location. Otherwise, we keep the previous pbest.
Similarly, compare the fitness value of its current location to that of the global best gbest at each particle along its path. If the current location has a higher fitness value, gbest should be replaced with its current location.
Update the velocity of the variables in particles in terms of (10) and the position by using (11).
Evaluate whether the target or maximum epochs are reached; that is, judge whether the new particle generated by iteration arrives at the minimum fitness value or whether the time of iteration approaches the predefined maximum value. If any of the two conditions is satisfied, it is indicated that the optimum solution of the problem is corresponding to the global best of the particle, and the criteria should be stopped. Otherwise go to step (2) for next iterations.
Process of proposed PSO algorithm.
3.6. Suboptimal Online Controller Design
Regarding the above optimization process of the impulsive control, the computational time is long so that it cannot be applied to the real-time control. Consequently, for seeking an online control, the controller f(e(t)) is considered as the form of inertial element with gains K1 and K2; that is,(12)fs=K1K2s+1subject to the constraints as follows.
Due to the finite amount of number of the impulses, the time interval Tui is substituted to (9).
In accordance with the discrete characteristic of the impulsive control, some treatments are governed as(13)Pc=-F0Pc<-F00-F0<Pc<F0F0Pc>F0,
where F0 represents the threshold value deciding whether a single impulse works.
It is easy to understand the goal of selecting controller parameters F0, K1, and K2 is to make the control effect approach to that of the PSO method as far as possible. Similarly, let the error between the control outputs of the two methods as the objective function, and controller parameters can be optimized via utilizing the previously described PSO method.
3.7. Guidance Law Design
In order to make the projectile hit the target precisely, it is also necessary to design an appropriate guidance law; that is, formulate the control command with the relative motion between the projectile and the target. Traditionally, the guidance law is determined to approach the convergence of the distance and the rate of the line of sight (LOS) between the projectile and the target. For instance, in terms of classic proportional navigation (PN) law it is concluded that the projectile guidance command is in proportion to the rate of LOS.
In consideration of the limit of finite energy of impulsive projectile, it is predicted that guidance trajectory should be as similar to the nature trajectory as possible under the standard condition. Thus it is helpful to save the amount of number of the impulses which are not imperative. Here, a compensation of the influence of the gravity is considered based on classic PN method for the guidance law which is given by(14)θ˙c=KNq˙+Kggvcosθ,where θ˙c denotes guidance command of trajectory inclination angle; q˙ is the rate of LOS; and KN, Kg are PN and gravity compensation gains, respectively. Usually KN is chosen between 2 and 6.
According to (14), the guidance law can be written in the form of integration as follows:(15)θct-θ0t0=Kqt-qt0+Kg∫t0tgvcosθdt.
4. Simulation Example and Analysis4.1. Performance of the PSO Online Controller
In this section, a simulation example using the above method is demonstrated for the impulsive control of a certain impulsive-correction projectile system. Here, in order to validate the performance of the optimal controller, the initial conditions for the design of control optimization are set as follows. The values of KM, ξM, and TM are set to be 0.00048, 0.156, and 0.0455. The initial and end time are t0=0 and tf=10s, respectively. The coefficient of weight λ=0.2, and the total numbers N=32. Additionally, θc is chosen as unit step response with the constraints of θlower=-20deg, θupper=+20deg.
The parameters of the adopted PSO control are m=30, n=3, c1=c2=1.8. The inertial weight w is set to be reduced linearly, from 1.0 to 0.4, and the search will be terminated if the fitness value is less than 0.4, or the number of iterations reaches 150. Controller gains are K1=3500, K2=0.68, and the threshold value is F0 = 10000 N.
Figures 5–7 give the optimization results and dynamic response qualities of the reference impulsive system. From Figures 5 and 6, it is shown that the dynamic response of the suboptimal controller is similar to that of PSO approach. Meanwhile, the J criterion in Figure 7 that represents the fitness value’s trend over iterations remains at the same value for a long iteration period. This indicates that the particles have reached the global optimum point in the feasible area. Although the speed of computations of PSO is rather slow, the suboptimal controller design is well rounded to make up its weakness and make it feasible in the online design and application.
History between θ and t.
History between impulsive thruster P and t.
PSO results for minimum J criterion.
4.2. Trajectory Simulation for Validation
A trajectory simulation case is also presented to validate the nonlinear impulsive control system in detail, in which the numerical integration of the trajectory model uses the fourth-order Runge-Kuta method. The simulation parameters are listed as the impulsive force FA = 4000 N and the working time of each impulse per time equals 0.015 s. The initial state values of the projectile system are t0 = 0 s, m0 = 40 kg, v0 = 650 m/s, x0 = 0 m, y0 = 0 m, ωz0 = 0 rad/s, ϑ0 = θ0 = 45 deg, α0 = 0 deg, l = 0.015 m, and wx = −5 m/s, and the impulsive control starts at the altitude h = 3000 m during the declining period of the trajectory.
According to the above PSO method for the impulsive-correction projectile, the simulation results are illustrated in Figures 8–12. In the figures, the standard trajectory means natural trajectory of free-flying without considering disturbance and impulsive control; the disturbed trajectory happens under the consideration of wind disturbance, but without any impulsive control. Simultaneously, the optimal trajectory under the PSO algorithm and the suboptimal trajectory with the online algorithm are exhibited for comparative study.
(a) Curve of trajectory under different conditions. (b) Enlarged curve of terminal trajectory.
History between v and t.
History between α and t.
History between θ and t.
History between P and t.
In terms of the results shown in Figures 8–12, the following can be concluded:
From the disturbed trajectory compared with the standard trajectory depicted in Figures 8(a) and 8(b), the distance Δx of displacement resulting from the disturbance of the wind is 218.9 m, and the miss distances corrected by the impulses are both less than 0.5 m under the optimal and suboptimal approaches, which illustrates impulsive control effectively corrects the error of range resulting from the wind disturbance.
Figures 9–11 suggest that the results of suboptimal method are similarly close to those of the modified PSO algorithm, which demonstrate the online design has a good performance.
As shown in Figure 12, only the amount of working number of impulses is 11, which is far less than the limit of 32 for satisfying the requirements of correction distance and miss distance. Simultaneously, it is found that there counts more number of impulses with short-time intervals working in the high altitude than that in the lower altitude with long-time intervals because the impulses working in the high altitude get more sensitive to the correction of the error, which is helpful to sufficiently utilize the maneuver ability of the projectile (i.e., save the consumption of the impulses for the same requirement of the maneuver). Also the impulses working in the lower altitude are benefit to improve the precision for the insensitivity of the maneuver.
5. Conclusions
In this paper, a novel modified PSO method is proposed to implement optimal control for a class of impulsive-correction projectile systems based on the minimum impulsive energy consumption as the optimization objective. In consideration of such a nonlinear global optimization problem including the discontinuous cost function, the modified PSO is applied to search for the optimal settings of the impulse control via selecting time intervals between the two neighboring impulse forces Pi-1 and Pi as control variables. Synchronously, rounding operation is applied to solve the discrete variable of the particle for the integral requirement. At the same time, linear-varying inertial weight is adopted to improve the local ability of convergence of the particles during the range of the error. To show effectiveness of the presented PSO control method, the PSO controller is coupled in the flight dynamic model, and comparative simulations, in which wind disturbance has been taken into consideration, are conducted. Simulation results demonstrate that the proposed algorithm can obtain the optimization solution of the impulsive control of the guided projectile and make the close-loop system have a good performance with satisfying working number of impulses and miss distances.
Meanwhile, the proposed PSO control method can be extended to an impulsive and aerodynamic compound control missile, but the decoupling between the impulse force and the aerodynamic force needs further research. The real-time online programming of the PSO for impulsive control problem is also attracting more attentions, while the convergence rate of the PSO algorithm needs to be improved. These issues will be taken into consideration in our future work of developing new mathematical approaches.
Competing Interests
The authors declare that they have no competing interests.
Acknowledgments
This work was supported by the National Natural Science Foundation of China (NSFC) under Grant no. 11176012 and the Research Innovation Project for Graduate Student of Jiangsu-Provincial Ordinary University under Grant no. KLYX15-0394.
CorriveauD.BernerC.FleckV.Trajectory correction using impulse thrusters for conventional artillery projectilesProceedings of the IBC 23rd International Symposium on Ballistics2007Tarragona, Spain639646CaliseA. J.El-ShirbinyH. A.An analysis of aerodynamic control for direct fire spinning projectilesProceedings of the AIAA Guidance, Navigation and Control ConferenceAugust 2001Montreal, CanadaAIAA 2001-421710.2514/6.2001-4217DoraiswamyS.CandlerG. V.Detached eddy simulations and Reynolds-averaged Navier-Stokes calculations of a spinning projectile200845593594510.2514/1.319352-s2.0-54249117286LinD.XuJ.SongJ.Design of pulse control parameter for projectile with ballistic correction20052434043LiC.-W.GaoM.SongW.-D.GuoQ.-W.Optimization of trajectory correction method of rocket projectile based on pulse jet control201426424292-s2.0-84921496701TianX.ChenG.XinC.External ballistic real-time algorithm of trajectory correction projectile20001414447WangZ.DingS.WangL.Flight stability condition for a projectile of corrected trajectory with impulse moments2000244322325LiuX.WillmsA. R.Impulsive controllability of linear dynamical systems with applications to maneuvers of spacecraft19962427729910.1155/s1024123x9600035xRempalaR.ZabczykJ.On the maximum principle for deterministic impulse control problems198859228128810.1007/bf00938313MR9740342-s2.0-0024113443PradoA. F. B. A.Bi-impulsive control to build a satellite constellation200552169175MR2140558MenonP. K. A.ChengV. H. L.LinC. A.BriggsM. M.High performance missile synthesis with trajectory and propulsion system optimization198724655255710.2514/3.259522-s2.0-0023454699SunR.-S.MingC.Velocity control for coning motion missile system using direct discretization method201520151071654710.1155/2015/716547MR34360772-s2.0-84953331260BettsJ. T.20011stSIAMFahrooF.RossI. M.Costate estimation by a Legendre pseudospectral method200124227027710.2514/2.47092-s2.0-0035279859KhaderM. M.SweilamN. H.KotaW. Y.Cardinal functions for Legendre pseudo-spectral method for solving the integro-differential equations201422351151610.1016/j.joems.2013.10.004MR3260801DarbyC. L.HagerW. W.RaoA. V.Direct trajectory optimization using a variable low-order adaptive pseudospectral method201148343344510.2514/1.521362-s2.0-79958038566GraichenK.PetitN.Constructive methods for initialization and handling mixed state-input constraints in optimal control20083151334134310.2514/1.338702-s2.0-53349108312YokoyamaN.SuzukiS.Modified genetic algorithm for constrained trajectory optimization200528113914410.2514/1.30422-s2.0-12744274837PremalathaK.NatarajanA. M.Hybrid PSO and GA for global maximization200924597608MR2570009PontaniM.ConwayB. A.Particle swarm optimization applied to space trajectories20103351429144110.2514/1.484752-s2.0-78149346503EberhartR.KennedyJ.New optimizer using particle swarm theoryProceedings of the 6th International Symposium on Micro Machine and Human ScienceOctober 199539432-s2.0-0029517385ShiY.EberhartR. C.A modified particle swarm optimizerProceedings of the IEEE International Conference on Evolutionary Computation, IEEE World Congress on Computational IntelligenceMay 1998Anchorage, Ala, USA697310.1109/ICEC.1998.699146LaskariE. C.ParsopoulosK. E.VrahatisM. N.Particle swarm optimization for integer programmingProceedings of the Congress on Evolutionary Computation (CEC '02)May 2002Honolulu, Hawaii, USA1582158710.1109/cec.2002.10044782-s2.0-84901442423CouceiroM.SivasundaramS.Novel fractional order particle swarm optimization2016283365410.1016/j.amc.2016.02.007PiresE. J. S.MachadoJ. A. T.de Moura OliveiraP. B.CunhaJ. B.MendesL.Particle swarm optimization with fractional-order velocity201061129530110.1007/s11071-009-9649-yYangW.WuW.FanY.LiZ.Particle swarm optimization based on local attractors of ordinary differential equation system201420141062835710.1155/2014/628357MR32562942-s2.0-84934949129ChangS.CaoX.WangZ.YuwenC.Approach of optimal design of parameters for impulse-correction projectile20132513654YangH.DouL.GanM.A particle swarm optimization for fuel-optimal impulsive control problems of guided projectileProceedings of the 25th Chinese Control and Decision Conference (CCDC '10)May 2010Xuzhou, ChinaIEEE3034303810.1109/ccdc.2010.54986602-s2.0-77955381794RahimiA.KumarK. D.AlighanbariH.Particle swarm optimization applied to spacecraft reentry trajectory2013361307310