A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are...A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.展开更多
Ship motions induced by waves have a significant impact on the efficiency and safety of offshore operations.Real-time prediction of ship motions in the next few seconds plays a crucial role in performing sensitive act...Ship motions induced by waves have a significant impact on the efficiency and safety of offshore operations.Real-time prediction of ship motions in the next few seconds plays a crucial role in performing sensitive activities.However,the obvious memory effect of ship motion time series brings certain difficulty to rapid and accurate prediction.Therefore,a real-time framework based on the Long-Short Term Memory(LSTM)neural network model is proposed to predict ship motions in regular and irregular head waves.A 15000 TEU container ship model is employed to illustrate the proposed framework.The numerical implementation and the real-time ship motion prediction in irregular head waves corresponding to the different time scales are carried out based on the container ship model.The related experimental data were employed to verify the numerical simulation results.The results show that the proposed method is more robust than the classical extreme short-term prediction method based on potential flow theory in the prediction of nonlinear ship motions.展开更多
In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these met...In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.展开更多
Controlled laboratory experiments are proved to be a valuable tool for investigating changes in underground physical properties and the related response of surface geophysical signals.The self-potential(SP)method is w...Controlled laboratory experiments are proved to be a valuable tool for investigating changes in underground physical properties and the related response of surface geophysical signals.The self-potential(SP)method is widely used in mineral resource exploration due to its direct correlation with underground electrochemical gradients.This paper presented the design and construction of an experimental platform based on a multi-channel SP monitoring system.The proposed platform was used to monitor the anodizing corrosion process of different metal blocks from a laboratory perspective,record the real-time SP signal generated by the redox reaction,as well as investigate the geobattery mechanism associated with the natural polarization process of metal mineral resources.The experimental results demonstrate that the constructed SP monitoring platform effectively captures time-series SP signals and provides direct laboratory evidence for the geobattery model.The measured SP data were quantitatively interpreted using the simulated annealing algorithm,and the inversion results closely match the real model.This finding highlights the potential of the SP method as a promising tool for determining the location and spatial distribution of underground polarizers.The study holds reference value for the exploration and exploitation of mineral resources in both terrestrial and marine environments.展开更多
In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation...In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.展开更多
A new scheduling algorithm called deferrable scheduling with time slice exchange (DS-EXC) was proposed to maintain the temporal validity of real-time data. In DS-EXC, the time slice exchange method was designed to fur...A new scheduling algorithm called deferrable scheduling with time slice exchange (DS-EXC) was proposed to maintain the temporal validity of real-time data. In DS-EXC, the time slice exchange method was designed to further defer the release time of transaction instances derived by the deferrable scheduling algorithm (DS-FP). In this way, more CPU time would be left for lower priority transactions and other transactions. In order to minimize the scheduling overhead, an off-line scheme was designed. In particular, the schedule for a transaction set is generated off-line until a repeating pattern is found, and then the pattern is used to construct the schedule on-line. The performance of DS-EXC was evaluated by sets of experiments. The results show that DS-EXC outperforms DS-FP in terms of increasing schedulable ratio. It also provides better performance under mixed workloads.展开更多
[Objective]Real-time monitoring of cow ruminant behavior is of paramount importance for promptly obtaining relevant information about cow health and predicting cow diseases.Currently,various strategies have been propo...[Objective]Real-time monitoring of cow ruminant behavior is of paramount importance for promptly obtaining relevant information about cow health and predicting cow diseases.Currently,various strategies have been proposed for monitoring cow ruminant behavior,including video surveillance,sound recognition,and sensor monitoring methods.How‐ever,the application of edge device gives rise to the issue of inadequate real-time performance.To reduce the volume of data transmission and cloud computing workload while achieving real-time monitoring of dairy cow rumination behavior,a real-time monitoring method was proposed for cow ruminant behavior based on edge computing.[Methods]Autono‐mously designed edge devices were utilized to collect and process six-axis acceleration signals from cows in real-time.Based on these six-axis data,two distinct strategies,federated edge intelligence and split edge intelligence,were investigat‐ed for the real-time recognition of cow ruminant behavior.Focused on the real-time recognition method for cow ruminant behavior leveraging federated edge intelligence,the CA-MobileNet v3 network was proposed by enhancing the MobileNet v3 network with a collaborative attention mechanism.Additionally,a federated edge intelligence model was designed uti‐lizing the CA-MobileNet v3 network and the FedAvg federated aggregation algorithm.In the study on split edge intelli‐gence,a split edge intelligence model named MobileNet-LSTM was designed by integrating the MobileNet v3 network with a fusion collaborative attention mechanism and the Bi-LSTM network.[Results and Discussions]Through compara‐tive experiments with MobileNet v3 and MobileNet-LSTM,the federated edge intelligence model based on CA-Mo‐bileNet v3 achieved an average Precision rate,Recall rate,F1-Score,Specificity,and Accuracy of 97.1%,97.9%,97.5%,98.3%,and 98.2%,respectively,yielding the best recognition performance.[Conclusions]It is provided a real-time and effective method for monitoring cow ruminant behavior,and the proposed federated edge intelligence model can be ap‐plied in practical settings.展开更多
In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and t...In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.展开更多
In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-base...In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.展开更多
The traditional oriented FAST and rotated BRIEF（ORB） algorithm has problems of instability and repetition of keypoints and it does not possess scale invariance. In order to deal with these drawbacks, a modified ORB...The traditional oriented FAST and rotated BRIEF（ORB） algorithm has problems of instability and repetition of keypoints and it does not possess scale invariance. In order to deal with these drawbacks, a modified ORB（MORB） algorithm is proposed. In order to improve the precision of matching and tracking, this paper puts forward an MOK algorithm that fuses MORB and Kanade-Lucas-Tomasi（KLT）. By using Kalman, the object＇s state in the next frame is predicted in order to reduce the size of search window and improve the real-time performance of object tracking. The experimental results show that the MOK algorithm can accurately track objects with deformation or with background clutters, exhibiting higher robustness and accuracy on diverse datasets. Also, the MOK algorithm has a good real-time performance with the average frame rate reaching 90.8 fps.展开更多
An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and sa...An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.展开更多
The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to...The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.展开更多
To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO al...To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.展开更多
文摘A class of hybrid algorithms of real-time simulation based on evaluation of non-integerstep right-hand side function are presented in this paper. And some results of the convergence and stability of the algorithms are given. Using the class of algorithms, evaluation for the right-hand side function is needed once in every integration-step. Moreover, comparing with the other methods with the same amount of work, their numerical stability regions are larger and the method errors are smaller, and the numerical experiments show that the algorithms are very effective.
文摘Ship motions induced by waves have a significant impact on the efficiency and safety of offshore operations.Real-time prediction of ship motions in the next few seconds plays a crucial role in performing sensitive activities.However,the obvious memory effect of ship motion time series brings certain difficulty to rapid and accurate prediction.Therefore,a real-time framework based on the Long-Short Term Memory(LSTM)neural network model is proposed to predict ship motions in regular and irregular head waves.A 15000 TEU container ship model is employed to illustrate the proposed framework.The numerical implementation and the real-time ship motion prediction in irregular head waves corresponding to the different time scales are carried out based on the container ship model.The related experimental data were employed to verify the numerical simulation results.The results show that the proposed method is more robust than the classical extreme short-term prediction method based on potential flow theory in the prediction of nonlinear ship motions.
基金This project was supported by the National Natural Science Foundation of China (No. 19871080).
文摘In this paper a class of real-time parallel modified Rosenbrock methods of numerical simulation is constructed for stiff dynamic systems on a multiprocessor system, and convergence and numerical stability of these methods are discussed. A-stable real-time parallel formula of two-stage third-order and A(α)-stable real-time parallel formula with o ≈ 89.96° of three-stage fourth-order are particularly given. The numerical simulation experiments in parallel environment show that the class of algorithms is efficient and applicable, with greater speedup.
基金Project(42174170)supported by the National Natural Science Foundation of China。
文摘Controlled laboratory experiments are proved to be a valuable tool for investigating changes in underground physical properties and the related response of surface geophysical signals.The self-potential(SP)method is widely used in mineral resource exploration due to its direct correlation with underground electrochemical gradients.This paper presented the design and construction of an experimental platform based on a multi-channel SP monitoring system.The proposed platform was used to monitor the anodizing corrosion process of different metal blocks from a laboratory perspective,record the real-time SP signal generated by the redox reaction,as well as investigate the geobattery mechanism associated with the natural polarization process of metal mineral resources.The experimental results demonstrate that the constructed SP monitoring platform effectively captures time-series SP signals and provides direct laboratory evidence for the geobattery model.The measured SP data were quantitatively interpreted using the simulated annealing algorithm,and the inversion results closely match the real model.This finding highlights the potential of the SP method as a promising tool for determining the location and spatial distribution of underground polarizers.The study holds reference value for the exploration and exploitation of mineral resources in both terrestrial and marine environments.
文摘In this paper, a mathematical model of real-time simulation is given, and the problem of convergence on real-time Runge-Kutta algorithms is analysed. At last a theorem on the relation between the order of compensation and the convergent order of real-time algorithm is proved.
基金Project(60873030) supported by the National Natural Science Foundation of China
文摘A new scheduling algorithm called deferrable scheduling with time slice exchange (DS-EXC) was proposed to maintain the temporal validity of real-time data. In DS-EXC, the time slice exchange method was designed to further defer the release time of transaction instances derived by the deferrable scheduling algorithm (DS-FP). In this way, more CPU time would be left for lower priority transactions and other transactions. In order to minimize the scheduling overhead, an off-line scheme was designed. In particular, the schedule for a transaction set is generated off-line until a repeating pattern is found, and then the pattern is used to construct the schedule on-line. The performance of DS-EXC was evaluated by sets of experiments. The results show that DS-EXC outperforms DS-FP in terms of increasing schedulable ratio. It also provides better performance under mixed workloads.
文摘[Objective]Real-time monitoring of cow ruminant behavior is of paramount importance for promptly obtaining relevant information about cow health and predicting cow diseases.Currently,various strategies have been proposed for monitoring cow ruminant behavior,including video surveillance,sound recognition,and sensor monitoring methods.How‐ever,the application of edge device gives rise to the issue of inadequate real-time performance.To reduce the volume of data transmission and cloud computing workload while achieving real-time monitoring of dairy cow rumination behavior,a real-time monitoring method was proposed for cow ruminant behavior based on edge computing.[Methods]Autono‐mously designed edge devices were utilized to collect and process six-axis acceleration signals from cows in real-time.Based on these six-axis data,two distinct strategies,federated edge intelligence and split edge intelligence,were investigat‐ed for the real-time recognition of cow ruminant behavior.Focused on the real-time recognition method for cow ruminant behavior leveraging federated edge intelligence,the CA-MobileNet v3 network was proposed by enhancing the MobileNet v3 network with a collaborative attention mechanism.Additionally,a federated edge intelligence model was designed uti‐lizing the CA-MobileNet v3 network and the FedAvg federated aggregation algorithm.In the study on split edge intelli‐gence,a split edge intelligence model named MobileNet-LSTM was designed by integrating the MobileNet v3 network with a fusion collaborative attention mechanism and the Bi-LSTM network.[Results and Discussions]Through compara‐tive experiments with MobileNet v3 and MobileNet-LSTM,the federated edge intelligence model based on CA-Mo‐bileNet v3 achieved an average Precision rate,Recall rate,F1-Score,Specificity,and Accuracy of 97.1%,97.9%,97.5%,98.3%,and 98.2%,respectively,yielding the best recognition performance.[Conclusions]It is provided a real-time and effective method for monitoring cow ruminant behavior,and the proposed federated edge intelligence model can be ap‐plied in practical settings.
基金Supported by the Natural Science Foundation of Chongqing(General Program,NO.CSTB2022NSCQ-MSX0884)Discipline Teaching Special Project of Yangtze Normal University(csxkjx14)。
文摘In this paper,we prove that Euclid's algorithm,Bezout's equation and Divi-sion algorithm are equivalent to each other.Our result shows that Euclid has preliminarily established the theory of divisibility and the greatest common divisor.We further provided several suggestions for teaching.
基金Supported by National Natural Science Foundation of P.R.China(50275150)National Research Foundation for the Doctoral Program of Higher Education of P.R.China(20040533035)
基金Shanxi Province Higher Education Science and Technology Innovation Fund Project(2022-676)Shanxi Soft Science Program Research Fund Project(2016041008-6)。
文摘In order to improve the efficiency of cloud-based web services,an improved plant growth simulation algorithm scheduling model.This model first used mathematical methods to describe the relationships between cloud-based web services and the constraints of system resources.Then,a light-induced plant growth simulation algorithm was established.The performance of the algorithm was compared through several plant types,and the best plant model was selected as the setting for the system.Experimental results show that when the number of test cloud-based web services reaches 2048,the model being 2.14 times faster than PSO,2.8 times faster than the ant colony algorithm,2.9 times faster than the bee colony algorithm,and a remarkable 8.38 times faster than the genetic algorithm.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
文摘In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10^(-4)s,thus meeting the requirements of real-time combat scenarios.
基金supported by the National Natural Science Foundation of China(61471194)the Fundamental Research Funds for the Central Universities+2 种基金the Science and Technology on Avionics Integration Laboratory and Aeronautical Science Foundation of China(20155552050)the CASC(China Aerospace Science and Technology Corporation) Aerospace Science and Technology Innovation Foundation Projectthe Nanjing University of Aeronautics And Astronautics Graduate School Innovation Base(Laboratory)Open Foundation Program(kfjj20151505)
文摘The traditional oriented FAST and rotated BRIEF（ORB） algorithm has problems of instability and repetition of keypoints and it does not possess scale invariance. In order to deal with these drawbacks, a modified ORB（MORB） algorithm is proposed. In order to improve the precision of matching and tracking, this paper puts forward an MOK algorithm that fuses MORB and Kanade-Lucas-Tomasi（KLT）. By using Kalman, the object＇s state in the next frame is predicted in order to reduce the size of search window and improve the real-time performance of object tracking. The experimental results show that the MOK algorithm can accurately track objects with deformation or with background clutters, exhibiting higher robustness and accuracy on diverse datasets. Also, the MOK algorithm has a good real-time performance with the average frame rate reaching 90.8 fps.
基金supported by the National Key Research and Development Program(2021YFB3502500).
文摘An improved estimation of distribution algorithm(IEDA)is proposed in this paper for efficient design of metamaterial absorbers.This algorithm establishes a probability model through the selected dominant groups and samples from the model to obtain the next generation,avoiding the problem of building-blocks destruction caused by crossover and mutation.Neighboring search from artificial bee colony algorithm(ABCA)is introduced to enhance the local optimization ability and improved to raise the speed of convergence.The probability model is modified by boundary correction and loss correction to enhance the robustness of the algorithm.The proposed IEDA is compared with other intelligent algorithms in relevant references.The results show that the proposed IEDA has faster convergence speed and stronger optimization ability,proving the feasibility and effectiveness of the algorithm.
基金supported by the National Social Science Fund of China(2022-SKJJ-B-084).
文摘The learning algorithms of causal discovery mainly include score-based methods and genetic algorithms(GA).The score-based algorithms are prone to searching space explosion.Classical GA is slow to converge,and prone to falling into local optima.To address these issues,an improved GA with domain knowledge(IGADK)is proposed.Firstly,domain knowledge is incorporated into the learning process of causality to construct a new fitness function.Secondly,a dynamical mutation operator is introduced in the algorithm to accelerate the convergence rate.Finally,an experiment is conducted on simulation data,which compares the classical GA with IGADK with domain knowledge of varying accuracy.The IGADK can greatly reduce the number of iterations,populations,and samples required for learning,which illustrates the efficiency and effectiveness of the proposed algorithm.
基金supported by Hunan Provincial Natural Science Foundation(2024JJ5173,2023JJ50047)Hunan Provincial Department of Education Scientific Research Project(23A0494)Hunan Provincial Innovation Foundation for Postgraduate(CX20231221).
文摘To solve the problem of multi-platform collaborative use in anti-ship missile (ASM) path planning, this paper pro-posed multi-operator real-time constraints particle swarm opti-mization (MRC-PSO) algorithm. MRC-PSO algorithm utilizes a semi-rasterization environment modeling technique and inte-grates the geometric gradient law of ASMs which distinguishes itself from other collaborative path planning algorithms by fully considering the coupling between collaborative paths. Then, MRC-PSO algorithm conducts chunked stepwise recursive evo-lution of particles while incorporating circumvent, coordination, and smoothing operators which facilitates local selection opti-mization of paths, gradually reducing algorithmic space, accele-rating convergence, and enhances path cooperativity. Simula-tion experiments comparing the MRC-PSO algorithm with the PSO algorithm, genetic algorithm and operational area cluster real-time restriction (OACRR)-PSO algorithm, which demon-strate that the MRC-PSO algorithm has a faster convergence speed, and the average number of iterations is reduced by approximately 75%. It also proves that it is equally effective in resolving complex scenarios involving multiple obstacles. More-over it effectively addresses the problem of path crossing and can better satisfy the requirements of multi-platform collabora-tive path planning. The experiments are conducted in three col-laborative operation modes, namely, three-to-two, three-to-three, and four-to-two, and the outcomes demonstrate that the algorithm possesses strong universality.
