Search results

Path planning is an important part of UAV mission planning. The main purpose of this paper is to overcome the shortcomings of the standard particle swarm optimization (PSO) such as easy to fall into the local optimum, so that the improved PSO applied to the UAV path planning can enable the UAV to plan a better quality path.

Firstly, the adaptation function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself. Secondly, the standard PSO is improved, and the improved particle swarm optimization with multi-strategy fusion (MFIPSO) is proposed. The method introduces class sigmoid inertia weight, adaptively adjusts the learning factors and at the same time incorporates K-means clustering ideas and introduces the Cauchy perturbation factor. Finally, MFIPSO is applied to UAV path planning.

Simulation experiments are conducted in simple and complex scenarios, respectively, and the quality of the path is measured by the fitness value and straight line rate, and the experimental results show that MFIPSO enables the UAV to plan a path with better quality.

Aiming at the standard PSO is prone to problems such as premature convergence, MFIPSO is proposed, which introduces class sigmoid inertia weight and adaptively adjusts the learning factor, balancing the global search ability and local convergence ability of the algorithm. The idea of K-means clustering algorithm is also incorporated to reduce the complexity of the algorithm while maintaining the diversity of particle swarm. In addition, the Cauchy perturbation is used to avoid the algorithm from falling into local optimum. Finally, the adaptability function is formulated by comprehensively considering the performance constraints of the flight target as well as the UAV itself, which improves the accuracy of the evaluation model.

Advancement in optimization of VLSI circuits involves reduction in chip size from micrometer to nanometer level as well as fabrication of a billions of transistors in a single die where global routing problem remains significant with a trade-off of power dissipation and interconnect delay. This paper aims to solve the increased complexity in VLSI chip by minimization of the wire length in VLSI circuits using a new approach based on nature-inspired meta-heuristic, invasive weed optimization (IWO). Further, this paper aims to achieve maximum circuit optimization using IWO hybridized with particle swarm optimization (PSO).

This paper projects the complexities of global routing process of VLSI circuit design in mapping it with a well-known NP-complete problem, the minimum rectilinear Steiner tree (MRST) problem. IWO meta-heuristic algorithm is proposed to meet the MRST problem more efficiently and thereby reducing the overall wire-length of interconnected nodes. Further, the proposed approach is hybridized with PSO, and a comparative analysis is performed with geosteiner 5.0.1 and existing PSO technique over minimization, consistency and convergence against available benchmark.

This paper provides high performance–enhanced IWO algorithm, which keeps in generating low MRST value, thereby successful wire length reduction of VLSI circuits is significantly achieved as evident from the experimental results as compared to PSO algorithm and also generates value nearer to geosteiner 5.0.1 benchmark. Even with big VLSI instances, hybrid IWO with PSO establishes its robustness over achieving improved optimization of overall wire length of VLSI circuits.

This paper includes implications in the areas of optimization of VLSI circuit design specifically in the arena of VLSI routing and the recent developments in routing optimization using meta-heuristic algorithms.

This paper fulfills an identified need to study optimization of VLSI circuits where minimization of overall interconnected wire length in global routing plays a significant role. Use of nature-based meta-heuristics in solving the global routing problem is projected to be an alternative approach other than conventional method.

In this study, the central objective is to foresee stock market signals with the use of a proper structure to achieve the highest accuracy possible. For this purpose, three hybrid models have been developed for the stock markets which are a combination of support vector machine (SVM) with meta-heuristic algorithms of particle swarm optimization (PSO), imperialist competition algorithm (ICA) and genetic algorithm (GA).All the analyses are technical and are based on the Japanese candlestick model.

Further as per the results achieved, the most suitable algorithm is chosen to anticipate sell and buy signals. Moreover, the authors have compared the results of the designed model validations in this study with basic models in three articles conducted in the past years. Therefore, SVM is examined by PSO. It is used as a classification agent to search the problem-solving space precisely and at a faster pace. With regards to the second model, SVM and ICA are tested to stock market timing, in a way that ICA is used as an optimization agent for the SVM parameters. At last, in the third model, SVM and GA are studied, where GA acts as an optimizer and feature selection agent.

As per the results, it is observed that all new models can predict accurately for only 6 days; however, in comparison with the confusion matrix results, it is observed that the SVM-GA and SVM-ICA models have correctly predicted more sell signals, and the SCM-PSO model has correctly predicted more buy signals. However, SVM-ICA has shown better performance than other models considering executing the implemented models.

In this study, the data for stock market of the years 2013–2021 were analyzed; the long length of timeframe makes the input data analysis challenging as they must be moderated with respect to the conditions where they have been changed.

In this study, two methods have been developed in a candlestick model; they are raw-based and signal-based approaches in which the hit rate is determined by the percentage of correct evaluations of the stock market for a 16-day period.

Because of the key role of joint torque in industrial robots (IRs) motion performance control and energy consumption calculation and efficiency optimization, the purpose of this paper is to propose a deep learning torque prediction method based on long short-term memory (LSTM) recurrent neural networks optimized by particle swarm optimization (PSO), which can accurately predict the the joint torque.

The proposed model optimized the LSTM with PSO algorithm to accurately predict the IRs joint torque. The authors design an excitation trajectory for ABB 1600–10/145 experimental robot and collect its relative dynamic data. The LSTM model was trained with the experimental data, and PSO was used to find optimal number of LSTM nodes and learning rate, then a torque prediction model is established based on PSO-LSTM deep learning method. The novel model is used to predict the robot’s six joint torque and the root mean error squares of the predicted data together with least squares (LS) method were comparably studied.

The predicted joint torque value by PSO-LSTM deep learning approach is highly overlapped with those from real experiment robot, and the error is quite small. The average square error between the predicted joint torque data and experiment data is 2.31 N.m smaller than that with the LS method. The accuracy of the novel PSO-LSTM learning method for joint torque prediction of IR is proved.

PSO and LSTM model are deeply integrated for the first time to predict the joint torque of IR and the prediction accuracy is verified.

The purpose of this paper aims to investigate the adaptive impedance control and its optimized PSO algorithm for force tracking of a dual-arm cooperative robot. Because the dual-arm robot is directly in contact with external environment, controlling the mutual force between robot and external environment is of great importance. Besides, a high compliance of the robot should be guaranteed.

An impedance control based on Particle Swarm Optimization (PSO) algorithm is designed to track the mutual force and achieve compliance control of the robot end.

The experimental results show that the impedance control coefficients can be automatically tuned converged by PSO algorithm.

The system can reach a steady state within 0.03 s with overshoot convergence, and the force fluctuation range at the steady state decreases to about ±0.08 N even under the force mutation condition.

The paper aims to provide an efficient dispatching schedule for ready-mix concrete (RMC) trucks and create a balance between batch plants and construction sites.

The paper focused on developing a new metaheuristic swarm intelligence algorithm using Java code. The paper used statistical criterion: mean, standard deviation, running time to verify the effectiveness of the proposed optimization method and compared its derivatives with other algorithms, such as genetic algorithm (GA), Tabu search (TS), bee colony optimization (BCO), ant lion optimizer (ALO), grey wolf optimizer (GWO), dragonfly algorithm (DA) and particle swarm optimization (PSO).

The paper proved that integrating GWO and DA yields better results than independent algorithms and some selected algorithms in the literature. It also suggests that multi-independent batch plants could effectively cooperate in a system to deliver RMC to various construction sites.

The paper provides a compelling new hybrid swarm intelligence algorithm and a model allowing multi-independent batch plants to work in a system to deliver RMC. It fulfills an identified need to study how batch plant managers can expand their dispatching network, increase their competitiveness and improve their supply chain operations.

With the rapid growth of the domestic lending industry, assessing whether the borrower of each loan is at risk of default is a pressing issue for financial institutions. Although there are some models that can handle such problems well, there are still some shortcomings in some aspects. The purpose of this paper is to improve the accuracy of credit assessment models.

In this paper, three different stages are used to improve the classification performance of LSTM, so that financial institutions can more accurately identify borrowers at risk of default. The first approach is to use the K-Means-SMOTE algorithm to eliminate the imbalance within the class. In the second step, ResNet is used for feature extraction, and then two-layer LSTM is used for learning to strengthen the ability of neural networks to mine and utilize deep information. Finally, the model performance is improved by using the IDWPSO algorithm for optimization when debugging the neural network.

On two unbalanced datasets (category ratios of 700:1 and 3:1 respectively), the multi-stage improved model was compared with ten other models using accuracy, precision, specificity, recall, G-measure, F-measure and the nonparametric Wilcoxon test. It was demonstrated that the multi-stage improved model showed a more significant advantage in evaluating the imbalanced credit dataset.

In this paper, the parameters of the ResNet-LSTM hybrid neural network, which can fully mine and utilize the deep information, are tuned by an innovative intelligent optimization algorithm to strengthen the classification performance of the model.

Given the regional heterogeneity of economic development, electricity consumption in various regions exhibits a discrepant growth pattern. The purpose of this study is to construct a grey system forecasting model with intelligent parameters for predicting provincial electricity consumption in China.

First, parameter optimization and structural expansion are simultaneously integrated into a unified grey system prediction framework, enhancing its adaptive capabilities. Second, by setting the minimum simulation percentage error as the optimization goal, the authors apply the particle swarm optimization (PSO) algorithm to search for the optimal grey generation order and background value coefficient. Third, to assess the performance across diverse power consumption systems, the authors use two electricity consumption cases and select eight other benchmark models to analyze the simulation and prediction errors. Further, the authors conduct simulations and trend predictions using data from all 31 provinces in China, analyzing and predicting the development trends in electricity consumption for each province from 2021 to 2026.

The study identifies significant heterogeneity in the development trends of electricity consumption systems among diverse provinces in China. The grey prediction model, optimized with multiple intelligent parameters, demonstrates superior adaptability and dynamic adjustment capabilities compared to traditional fixed-parameter models. Outperforming benchmark models across various evaluation indicators such as root mean square error (RMSE), average percentage error and Theil’s index, the new model establishes its robustness in predicting electricity system behavior.

Acknowledging the limitations of traditional grey prediction models in capturing diverse growth patterns under fixed-generation orders, single structures and unadjustable background values, this study proposes a fractional grey intelligent prediction model with multiple parameter optimization. By incorporating multiple parameter optimizations and structure expansion, it substantiates the model’s superiority in forecasting provincial electricity consumption.

The purpose of this paper is to extract electrochemical reaction kinetics parameters, such as Tafel slope, exchange current density and equilibrium potential, which cannot be directly measured, this study aims to propose an improved particle swarm optimization (PSO) algorithm.

In traditional PSO algorithms, each particle’s historical optimal solution is compared with the global optimal solution in each iteration step, and the optimal solution is replaced with a certain probability to achieve the goal of jumping out of the local optimum. However, this will to some extent undermine the (true) optimal solution. In view of this, this study has improved the traditional algorithm: at each iteration of each particle, the historical optimal solution is not compared with the global optimal solution. Instead, after all particles have iterated, the optimal solution is selected and compared with the global optimal solution and then the optimal solution is replaced with a certain probability. This to some extent protects the global optimal solution.

The polarization curve plotted by this equation is in good agreement with the experimental values, which demonstrates the reliability of this algorithm and provides a new method for measuring electrochemical parameters.

This study has improved the traditional method, which has high accuracy and can provide great support for corrosion research.

Cracks are prevalent signs of pavement distress found on highways globally. The use of artificial intelligence (AI) and deep learning (DL) for crack detection is increasingly considered as an optimal solution. Consequently, this paper introduces a novel, fully connected, optimised convolutional neural network (CNN) model using feature selection algorithms for the purpose of detecting cracks in highway pavements.

To enhance the accuracy of the CNN model for crack detection, the authors employed a fully connected deep learning layers CNN model along with several optimisation techniques. Specifically, three optimisation algorithms, namely adaptive moment estimation (ADAM), stochastic gradient descent with momentum (SGDM), and RMSProp, were utilised to fine-tune the CNN model and enhance its overall performance. Subsequently, the authors implemented eight feature selection algorithms to further improve the accuracy of the optimised CNN model. These feature selection techniques were thoughtfully selected and systematically applied to identify the most relevant features contributing to crack detection in the given dataset. Finally, the authors subjected the proposed model to testing against seven pre-trained models.

The study's results show that the accuracy of the three optimisers (ADAM, SGDM, and RMSProp) with the five deep learning layers model is 97.4%, 98.2%, and 96.09%, respectively. Following this, eight feature selection algorithms were applied to the five deep learning layers to enhance accuracy, with particle swarm optimisation (PSO) achieving the highest F-score at 98.72. The model was then compared with other pre-trained models and exhibited the highest performance.

With an achieved precision of 98.19% and F-score of 98.72% using PSO, the developed model is highly accurate and effective in detecting and evaluating the condition of cracks in pavements. As a result, the model has the potential to significantly reduce the effort required for crack detection and evaluation.

The proposed method for enhancing CNN model accuracy in crack detection stands out for its unique combination of optimisation algorithms (ADAM, SGDM, and RMSProp) with systematic application of multiple feature selection techniques to identify relevant crack detection features and comparing results with existing pre-trained models.