When the maneuverability of a pursuer is not significantly higher than that of an evader,it will be difficult to intercept the evader with only one pursuer.Therefore,this article adopts a two-to-one differential game ...When the maneuverability of a pursuer is not significantly higher than that of an evader,it will be difficult to intercept the evader with only one pursuer.Therefore,this article adopts a two-to-one differential game strategy,the game of kind is generally considered to be angle-optimized,which allows unlimited turns,but these practices do not take into account the effect of acceleration,which does not correspond to the actual situation,thus,based on the angle-optimized,the acceleration optimization and the acceleration upper bound constraint are added into the game for consideration.A two-to-one differential game problem is proposed in the three-dimensional space,and an improved multi-objective grey wolf optimization(IMOGWO)algorithm is proposed to solve the optimal game point of this problem.With the equations that describe the relative motions between the pursuers and the evader in the three-dimensional space,a multi-objective function with constraints is given as the performance index to design an optimal strategy for the differential game.Then the optimal game point is solved by using the IMOGWO algorithm.It is proved based on Markov chains that with the IMOGWO,the Pareto solution set is the solution of the differential game.Finally,it is verified through simulations that the pursuers can capture the escapee,and via comparative experiments,it is shown that the IMOGWO algorithm performs well in terms of running time and memory usage.展开更多
Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the b...Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm （mO_PSO） is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.展开更多
Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services sele...Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.展开更多
Target maneuver trajectory prediction plays an important role in air combat situation awareness and threat assessment.To solve the problem of low prediction accuracy of the traditional prediction method and model,a ta...Target maneuver trajectory prediction plays an important role in air combat situation awareness and threat assessment.To solve the problem of low prediction accuracy of the traditional prediction method and model,a target maneuver trajectory prediction model based on phase space reconstruction-radial basis function(PSR-RBF)neural network is established by combining the characteristics of trajectory with time continuity.In order to further improve the prediction performance of the model,the rival penalized competitive learning(RPCL)algorithm is introduced to determine the structure of RBF,the Levenberg-Marquardt(LM)and the hybrid algorithm of the improved particle swarm optimization(IPSO)algorithm and the k-means are introduced to optimize the parameter of RBF,and a PSR-RBF neural network is constructed.An independent method of 3D coordinates of the target maneuver trajectory is proposed,and the target manuver trajectory sample data is constructed by using the training data selected in the air combat maneuver instrument(ACMI),and the maneuver trajectory prediction model based on the PSR-RBF neural network is established.In order to verify the precision and real-time performance of the trajectory prediction model,the simulation experiment of target maneuver trajectory is performed.The results show that the prediction performance of the independent method is better,and the accuracy of the PSR-RBF prediction model proposed is better.The prediction confirms the effectiveness and applicability of the proposed method and model.展开更多
A novel strategy of probability density function （PDF） shape control is proposed in stochastic systems. The control er is designed whose parameters are optimal y obtained through the improved particle swarm optimiza...A novel strategy of probability density function （PDF） shape control is proposed in stochastic systems. The control er is designed whose parameters are optimal y obtained through the improved particle swarm optimization algorithm. The parameters of the control er are viewed as the space position of a particle in particle swarm optimization algorithm and updated continual y until the control er makes the PDF of the state variable as close as possible to the expected PDF. The proposed PDF shape control technique is compared with the equivalent linearization technique through simulation experiments. The results show the superiority and the effectiveness of the proposed method. The control er is excellent in making the state PDF fol ow the expected PDF and has the very smal error between the state PDF and the expected PDF, solving the control problem of the PDF shape in stochastic systems effectively.展开更多
In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In ord...In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.展开更多
In a commercialized, fully artificial plant factory, artificial luminaire is arranged in a unified way using a general illumination theory, an actual measurement, or an empirical methodology. However, with these metho...In a commercialized, fully artificial plant factory, artificial luminaire is arranged in a unified way using a general illumination theory, an actual measurement, or an empirical methodology. However, with these methods, lightings are implemented without considering specific optical characteristics of lighting or material characteristics of each component that constructs a cultivation system, resulting in an amount of light that becomes irregular. The amount of lighting is closely related with the growth and quality of crops, and the deviation between points where cultivated crops are located causes quality difference in the produced crops, thus impairing the economic feasibility of a plant factory. In this regard, a simulation to figure out an optimum lighting layout was performed. Arrangements based on the spectrum distribution of light source and reflector materials were implemented to ascertain the distance between lighting and height of lighting and gather information in the pre-treatment process to improve the uniformity of light in the plant cultivation system. Improvement of around 15% in light uniformity is achieved compared with the existing system after the simulation is carried out. This result would reduce the deviation in crop growth to make uniform quality crop production possible.展开更多
基金National Natural Science Foundation of China(NSFC61773142,NSFC62303136)。
文摘When the maneuverability of a pursuer is not significantly higher than that of an evader,it will be difficult to intercept the evader with only one pursuer.Therefore,this article adopts a two-to-one differential game strategy,the game of kind is generally considered to be angle-optimized,which allows unlimited turns,but these practices do not take into account the effect of acceleration,which does not correspond to the actual situation,thus,based on the angle-optimized,the acceleration optimization and the acceleration upper bound constraint are added into the game for consideration.A two-to-one differential game problem is proposed in the three-dimensional space,and an improved multi-objective grey wolf optimization(IMOGWO)algorithm is proposed to solve the optimal game point of this problem.With the equations that describe the relative motions between the pursuers and the evader in the three-dimensional space,a multi-objective function with constraints is given as the performance index to design an optimal strategy for the differential game.Then the optimal game point is solved by using the IMOGWO algorithm.It is proved based on Markov chains that with the IMOGWO,the Pareto solution set is the solution of the differential game.Finally,it is verified through simulations that the pursuers can capture the escapee,and via comparative experiments,it is shown that the IMOGWO algorithm performs well in terms of running time and memory usage.
基金the National Natural Science Foundation of China (60573159)
文摘Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm （mO_PSO） is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.
基金Project(70631004)supported by the Key Project of the National Natural Science Foundation of ChinaProject(20080440988)supported by the Postdoctoral Science Foundation of China+1 种基金Project(09JJ4030)supported by the Natural Science Foundation of Hunan Province,ChinaProject supported by the Postdoctoral Science Foundation of Central South University,China
文摘Based on the deficiency of time convergence and variability of Web services selection for services composition supporting cross-enterprises collaboration,an algorithm QCDSS(QoS constraints of dynamic Web services selection)to resolve dynamic Web services selection with QoS global optimal path,was proposed.The essence of the algorithm was that the problem of dynamic Web services selection with QoS global optimal path was transformed into a multi-objective services composition optimization problem with QoS constraints.The operations of the cross and mutation in genetic algorithm were brought into PSOA(particle swarm optimization algorithm),forming an improved algorithm(IPSOA)to solve the QoS global optimal problem.Theoretical analysis and experimental results indicate that the algorithm can better satisfy the time convergence requirement for Web services composition supporting cross-enterprises collaboration than the traditional algorithms.
文摘Target maneuver trajectory prediction plays an important role in air combat situation awareness and threat assessment.To solve the problem of low prediction accuracy of the traditional prediction method and model,a target maneuver trajectory prediction model based on phase space reconstruction-radial basis function(PSR-RBF)neural network is established by combining the characteristics of trajectory with time continuity.In order to further improve the prediction performance of the model,the rival penalized competitive learning(RPCL)algorithm is introduced to determine the structure of RBF,the Levenberg-Marquardt(LM)and the hybrid algorithm of the improved particle swarm optimization(IPSO)algorithm and the k-means are introduced to optimize the parameter of RBF,and a PSR-RBF neural network is constructed.An independent method of 3D coordinates of the target maneuver trajectory is proposed,and the target manuver trajectory sample data is constructed by using the training data selected in the air combat maneuver instrument(ACMI),and the maneuver trajectory prediction model based on the PSR-RBF neural network is established.In order to verify the precision and real-time performance of the trajectory prediction model,the simulation experiment of target maneuver trajectory is performed.The results show that the prediction performance of the independent method is better,and the accuracy of the PSR-RBF prediction model proposed is better.The prediction confirms the effectiveness and applicability of the proposed method and model.
基金supported by the National Natural Science Fundation of China(61273127)the Specialized Research Fund of the Doctoral Program in Higher Education(20106118110009+2 种基金20116118110008)the Scientific Research Plan Projects of Shaanxi Education Department(12JK0524)the Young Teachers Scientific Research Fund of Xi’an University of Posts and Telecommunications(1100434)
文摘A novel strategy of probability density function （PDF） shape control is proposed in stochastic systems. The control er is designed whose parameters are optimal y obtained through the improved particle swarm optimization algorithm. The parameters of the control er are viewed as the space position of a particle in particle swarm optimization algorithm and updated continual y until the control er makes the PDF of the state variable as close as possible to the expected PDF. The proposed PDF shape control technique is compared with the equivalent linearization technique through simulation experiments. The results show the superiority and the effectiveness of the proposed method. The control er is excellent in making the state PDF fol ow the expected PDF and has the very smal error between the state PDF and the expected PDF, solving the control problem of the PDF shape in stochastic systems effectively.
基金supported by the National Natural Science Foundation of China(71871203,52005447,L1924063)Zhejiang Provincial Natural Science Foundation of China(LY18G010017,LQ21E050014).
文摘In a typical discrete manufacturing process,a new type of reconfigurable production line is introduced,which aims to help small-and mid-size enterprises to improve machine utilization and reduce production cost.In order to effectively handle the production scheduling problem for the manufacturing system,an improved multi-objective particle swarm optimization algorithm based on Brownian motion(MOPSO-BM)is proposed.Since the existing MOPSO algorithms are easily stuck in the local optimum,the global search ability of the proposed method is enhanced based on the random motion mechanism of the BM.To further strengthen the global search capacity,a strategy of fitting the inertia weight with the piecewise Gaussian cumulative distribution function(GCDF)is included,which helps to maintain an excellent convergence rate of the algorithm.Based on the commonly used indicators generational distance(GD)and hypervolume(HV),we compare the MOPSO-BM with several other latest algorithms on the benchmark functions,and it shows a better overall performance.Furthermore,for a real reconfigurable production line of smart home appliances,three algorithms,namely non-dominated sorting genetic algorithm-II(NSGA-II),decomposition-based MOPSO(dMOPSO)and MOPSO-BM,are applied to tackle the scheduling problem.It is demonstrated that MOPSO-BM outperforms the others in terms of convergence rate and quality of solutions.
基金financially supported by the Ministry of Education, Science, and Technology (MEST)the National Research Foundation of Korea (NRF) through the Human Resource Training Project for Regional Innovationsupported by the Human Resources Development of the Korea Institute of Energy Technology Evaluation and Planning (No.20114010203040) grant funded by the Korean government’s Ministry of Knowledge Economy
文摘In a commercialized, fully artificial plant factory, artificial luminaire is arranged in a unified way using a general illumination theory, an actual measurement, or an empirical methodology. However, with these methods, lightings are implemented without considering specific optical characteristics of lighting or material characteristics of each component that constructs a cultivation system, resulting in an amount of light that becomes irregular. The amount of lighting is closely related with the growth and quality of crops, and the deviation between points where cultivated crops are located causes quality difference in the produced crops, thus impairing the economic feasibility of a plant factory. In this regard, a simulation to figure out an optimum lighting layout was performed. Arrangements based on the spectrum distribution of light source and reflector materials were implemented to ascertain the distance between lighting and height of lighting and gather information in the pre-treatment process to improve the uniformity of light in the plant cultivation system. Improvement of around 15% in light uniformity is achieved compared with the existing system after the simulation is carried out. This result would reduce the deviation in crop growth to make uniform quality crop production possible.
