Target maneuver trajectory prediction based on RBF neural network optimized by hybrid algorithm

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.

Predicting Reliability and Remaining Useful Life of Rolling Bearings Based on Optimized Neural Networks

In this study,an optimized long short-term memory(LSTM)network is proposed to predict the reliability and remaining useful life(RUL)of rolling bearings based on an improved whale-optimized algorithm(IWOA).The multi-domain features are extracted to construct the feature dataset because the single-domain features are difficult to characterize the performance degeneration of the rolling bearing.To provide covariates for reliability assessment,a kernel principal component analysis is used to reduce the dimensionality of the features.A Weibull distribution proportional hazard model(WPHM)is used for the reliability assessment of rolling bearing,and a beluga whale optimization(BWO)algorithm is combined with maximum likelihood estimation(MLE)to improve the estimation accuracy of the model parameters of the WPHM,which provides the data basis for predicting reliability.Considering the possible gradient explosion by training the rolling bearing lifetime data and the difficulties in selecting the key network parameters,an optimized LSTM network called the improved whale optimization algorithm-based long short-term memory(IWOA-LSTM)network is proposed.As IWOA better jumps out of the local optimization,the fitting and prediction accuracies of the network are correspondingly improved.The experimental results show that compared with the whale optimization algorithm-based long short-term memory(WOA-LSTM)network,the reliability prediction and RUL prediction accuracies of the rolling bearing are improved by the proposed IWOA-LSTM network.

Improvement of Cardiac Function by Dry Weight Optimization Based on Interdialysis Inferior Vena Caval Diameter (1)

In hemodialysis (HD) patients, the diameter of the inferior vena cava (IVC) serves for evaluation of the amount of body fluid.

Improvement of light uniformity by lighting arrangement for standardized crop production

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.

Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm

Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential.

Secrecy Outage Probability Minimization in Wireless-Powered Communications Using an Improved Biogeography-Based Optimization-Inspired Recurrent Neural Network

This paper focuses on wireless-powered communication systems,which are increasingly relevant in the Internet of Things(IoT)due to their ability to extend the operational lifetime of devices with limited energy.The main contribution of the paper is a novel approach to minimize the secrecy outage probability(SOP)in these systems.Minimizing SOP is crucial for maintaining the confidentiality and integrity of data,especially in situations where the transmission of sensitive data is critical.Our proposed method harnesses the power of an improved biogeography-based optimization(IBBO)to effectively train a recurrent neural network(RNN).The proposed IBBO introduces an innovative migration model.The core advantage of IBBO lies in its adeptness at maintaining equilibrium between exploration and exploitation.This is accomplished by integrating tactics such as advancing towards a random habitat,adopting the crossover operator from genetic algorithms(GA),and utilizing the global best(Gbest)operator from particle swarm optimization(PSO)into the IBBO framework.The IBBO demonstrates its efficacy by enabling the RNN to optimize the system parameters,resulting in significant outage probability reduction.Through comprehensive simulations,we showcase the superiority of the IBBO-RNN over existing approaches,highlighting its capability to achieve remarkable gains in SOP minimization.This paper compares nine methods for predicting outage probability in wireless-powered communications.The IBBO-RNN achieved the highest accuracy rate of 98.92%,showing a significant performance improvement.In contrast,the standard RNN recorded lower accuracy rates of 91.27%.The IBBO-RNN maintains lower SOP values across the entire signal-to-noise ratio(SNR)spectrum tested,suggesting that the method is highly effective at optimizing system parameters for improved secrecy even at lower SNRs.

Hybrid Gene Selection Methods for High-Dimensional Lung Cancer Data Using Improved Arithmetic Optimization Algorithm

Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression microarrays have made it possible to find genetic biomarkers for cancer diagnosis and prediction in a high-throughput manner.Machine Learning(ML)has been widely used to diagnose and classify lung cancer where the performance of ML methods is evaluated to identify the appropriate technique.Identifying and selecting the gene expression patterns can help in lung cancer diagnoses and classification.Normally,microarrays include several genes and may cause confusion or false prediction.Therefore,the Arithmetic Optimization Algorithm(AOA)is used to identify the optimal gene subset to reduce the number of selected genes.Which can allow the classifiers to yield the best performance for lung cancer classification.In addition,we proposed a modified version of AOA which can work effectively on the high dimensional dataset.In the modified AOA,the features are ranked by their weights and are used to initialize the AOA population.The exploitation process of AOA is then enhanced by developing a local search algorithm based on two neighborhood strategies.Finally,the efficiency of the proposed methods was evaluated on gene expression datasets related to Lung cancer using stratified 4-fold cross-validation.The method’s efficacy in selecting the optimal gene subset is underscored by its ability to maintain feature proportions between 10%to 25%.Moreover,the approach significantly enhances lung cancer prediction accuracy.For instance,Lung_Harvard1 achieved an accuracy of 97.5%,Lung_Harvard2 and Lung_Michigan datasets both achieved 100%,Lung_Adenocarcinoma obtained an accuracy of 88.2%,and Lung_Ontario achieved an accuracy of 87.5%.In conclusion,the results indicate the potential promise of the proposed modified AOA approach in classifying microarray cancer data.

An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

A Novel Bi-Level VSC-DC Transmission Expansion PlanningMethod of VSC-DC for Power System Flexibility and Stability Enhancement

Investigating flexibility and stability boosting transmission expansion planning(TEP)methods can increase the renewable energy(RE)consumption of the power systems.In this study,we propose a bi-level TEP method for voltage-source-converter-based direct current(VSC-DC),focusing on flexibility and stability enhancement.First,we established the TEP framework of VSC-DC,by introducing the evaluation indices to quantify the power system flexibility and stability.Subsequently,we propose a bi-level VSC-DC TEP model:the upper-level model acquires the optimal VSC-DC planning scheme by using the improved moth flame optimization(IMFO)algorithm,and the lower-level model evaluates the flexibility through time-series production simulation.Finally,we applied the proposedVSC-DC TEPmethod to the modified IEEE-24 and IEEE-39 test systems,and obtained the optimalVSCDC planning schemes.The results verified that the proposed method can achieve excellent RE curtailment with high flexibility and stability.Furthermore,the well-designed IMFO algorithm outperformed the traditional particle swarm optimization(PSO)and moth flame optimization(MFO)algorithms,confirming the effectiveness of the proposed approach.

A Double-Interactively Recurrent Fuzzy Cerebellar Model Articulation Controller Model Combined with an Improved Particle Swarm Optimization Method for Fall Detection

In many Eastern and Western countries,falling birth rates have led to the gradual aging of society.Older adults are often left alone at home or live in a long-term care center,which results in them being susceptible to unsafe events(such as falls)that can have disastrous consequences.However,automatically detecting falls fromvideo data is challenging,and automatic fall detection methods usually require large volumes of training data,which can be difficult to acquire.To address this problem,video kinematic data can be used as training data,thereby avoiding the requirement of creating a large fall data set.This study integrated an improved particle swarm optimization method into a double interactively recurrent fuzzy cerebellar model articulation controller model to develop a costeffective and accurate fall detection system.First,it obtained an optical flow(OF)trajectory diagram from image sequences by using the OF method,and it solved problems related to focal length and object offset by employing the discrete Fourier transform(DFT)algorithm.Second,this study developed the D-IRFCMAC model,which combines spatial and temporal(recurrent)information.Third,it designed an IPSO(Improved Particle Swarm Optimization)algorithm that effectively strengthens the exploratory capabilities of the proposed D-IRFCMAC(Double-Interactively Recurrent Fuzzy Cerebellar Model Articulation Controller)model in the global search space.The proposed approach outperforms existing state-of-the-art methods in terms of action recognition accuracy on the UR-Fall,UP-Fall,and PRECIS HAR data sets.The UCF11 dataset had an average accuracy of 93.13%,whereas the UCF101 dataset had an average accuracy of 92.19%.The UR-Fall dataset had an accuracy of 100%,the UP-Fall dataset had an accuracy of 99.25%,and the PRECIS HAR dataset had an accuracy of 99.07%.

Study on site selection planning of urban electric vehicle charging station

The large-scale development of electric vehicles(EVs)requires numerous charging stations to serve them,and the charging stations should be reasonably laid out and planned according to the charging demand of electric vehicles.Considering the costs of both operators and users,a site selection model for optimal layout planning of charging stations is constructed,and a queuing theory approach is used to determine the charging pile configuration to meet the charging demand in the planning area.To solve the difficulties of particle swarm global optimization search,the improved random drift particle swarm optimization(IRDPSO)and Voronoi diagram are used to jointly solve for the optimal layout of electric vehicles.The final arithmetic analysis verifies the feasibility and practicality of the model and algorithm,and the results show that the total social cost is minimized when the charging station is 9,the location of the charging station is close to the center of gravity and the layout is reasonable.

Research on Grid-Connected Control Strategy of Distributed Generator Based on Improved Linear Active Disturbance Rejection Control

The virtual synchronous generator(VSG)technology has been proposed to address the problem of system frequency and active power oscillation caused by grid-connected new energy power sources.However,the traditional voltage-current double-closed-loop control used in VSG has the disadvantages of poor disturbance immunity and insufficient dynamic response.In light of the issues above,a virtual synchronous generator voltage outer-loop control strategy based on improved linear autonomous disturbance rejection control(ILADRC)is put forth for consideration.Firstly,an improved first-order linear self-immunity control structure is established for the characteristics of the voltage outer loop;then,the effects of two key control parameters-observer bandwidthω_(0)and controller bandwidthω_(c)on the control system are analyzed,and the key parameters of ILADRC are optimally tuned online using improved gray wolf optimizer-radial basis function(IGWO-RBF)neural network.A simulationmodel is developed using MATLAB to simulate,analyze,and compare the method introduced in this paper.Simulations are performed with the traditional control strategy for comparison,and the results demonstrate that the proposed control method offers superior anti-interference performance.It effectively addresses power and frequency oscillation issues and enhances the stability of the VSG during grid-connected operation.

Improved ant colony optimization for multi-depot heterogeneous vehicle routing problem with soft time windows

Considering that the vehicle routing problem （VRP） with many extended features is widely used in actual life, such as multi-depot, heterogeneous types of vehicles, customer service priority and time windows etc., a mathematical model for multi-depot heterogeneous vehicle routing problem with soft time windows （MDHVRPSTW） is established. An improved ant colony optimization （IACO） is proposed for solving this model. First, MDHVRPSTW is transferred into different groups according to the nearest principle, and then the initial route is constructed by the scanning algorithm （SA）. Secondly, genetic operators are introduced, and crossover probability and mutation probability are adaptively adjusted in order to improve the global search ability of the algorithm. Moreover, the smooth mechanism is used to improve the performance of the ant colony optimization （ACO）. Finally, the 3-opt strategy is used to improve the local search ability. The proposed IACO was tested on three new instances that were generated randomly. The experimental results show that IACO is superior to the other three existing algorithms in terms of convergence speed and solution quality. Thus, the proposed method is effective and feasible, and the proposed model is meaningful.

Dynamic services selection algorithm in Web services composition supporting cross-enterprises collaboration

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.

Study of a New Improved PSO-BP Neural Network Algorithm

In order to overcome shortcomings of traditional BP neural network,such as low study efficiency, slow convergence speed,easily trapped into local optimal solution,we proposed an improved BP neural network model based on adaptive particle swarm optimization( PSO) algorithm. This algorithm adjusted the inertia weight coefficients and learning factors adaptively and therefore could be used to optimize the weights in the BP network. After establishing the improved PSO-BP( IPSO-BP) model,it was applied to solve fault diagnosis of rolling bearing. Wavelet denoising was selected to reduce the noise of the original vibration signals,and based on these vibration signals a wide set of features were used as the inputs in the neural network models. We demonstrate the effectiveness of the proposed approach by comparing with the traditional BP,PSO-BP and linear PSO-BP( LPSO-BP) algorithms. The experimental results show that IPSO-BP network outperforms other algorithms with faster convergence speed,lower errors,higher diagnostic accuracy and learning ability.

Coordinated Path Planning for UAVs Based on Sheep Optimization

Using the traditional swarm intelligence algorithm to solve the cooperative path planning problem for multi-UAVs is easy to incur the problems of local optimization and a slow convergence rate.A cooperative path planning method for multi-UAVs based on the improved sheep optimization is proposed to tackle these.Firstly,based on the three-dimensional planning space,a multi-UAV cooperative cost function model is established according to the path planning requirements,and an initial track set is constructed by combining multiple-population ideas.Then an improved sheep optimization is proposed and used to solve the path planning problem and obtain multiple cooperative paths.The simulation results show that the sheep optimization can meet the requirements of path planning and realize the cooperative path planning of multi-UAVs.Compared with grey wolf optimizer(GWO),improved gray wolf optimizer(IGWO),chaotic gray wolf optimizer(CGWO),differential evolution(DE)algorithm,and particle swam optimization(PSO),the convergence speed and search accuracy of the improved sheep optimization are significantly improved.

Multi-target Collaborative Combat Decision-Making by Improved Particle Swarm Optimizer

A decision-making problem of missile-target assignment with a novel particle swarm optimization algorithm is proposed when it comes to a multiple target collaborative combat situation.The threat function is established to describe air combat situation.Optimization function is used to find an optimal missile-target assignment.An improved particle swarm optimization algorithm is utilized to figure out the optimization function with less parameters,which is based on the adaptive random learning approach.According to the coordinated attack tactics,there are some adjustments to the assignment.Simulation example results show that it is an effective algorithm to handle with the decision-making problem of the missile-target assignment(MTA)in air combat.

Hybrid particle swarm optimization for multiobjective resource allocation

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.

Multi-objective Trajectory Planning Method based on the Improved Elitist Non-dominated Sorting Genetic Algorithm

Robot manipulators perform a point-point task under kinematic and dynamic constraints.Due to multi-degreeof-freedom coupling characteristics,it is difficult to find a better desired trajectory.In this paper,a multi-objective trajectory planning approach based on an improved elitist non-dominated sorting genetic algorithm(INSGA-II)is proposed.Trajectory function is planned with a new composite polynomial that by combining of quintic polynomials with cubic Bezier curves.Then,an INSGA-II,by introducing three genetic operators:ranking group selection(RGS),direction-based crossover(DBX)and adaptive precision-controllable mutation(APCM),is developed to optimize travelling time and torque fluctuation.Inverted generational distance,hypervolume and optimizer overhead are selected to evaluate the convergence,diversity and computational effort of algorithms.The optimal solution is determined via fuzzy comprehensive evaluation to obtain the optimal trajectory.Taking a serial-parallel hybrid manipulator as instance,the velocity and acceleration profiles obtained using this composite polynomial are compared with those obtained using a quintic B-spline method.The effectiveness and practicability of the proposed method are verified by simulation results.This research proposes a trajectory optimization method which can offer a better solution with efficiency and stability for a point-to-point task of robot manipulators.