Basic Particle Swarm Optimization Algorithm Research Articles

Research on Quadrotor Control Based on Genetic Algorithm and Particle Swarm Optimization for PID Tuning and Fuzzy Control-Based Linear Active Disturbance Rejection Control

The control system of a quadrotor aircraft is characterized by nonlinearity, strong coupling, and underactuation, making it susceptible to external disturbances that can affect flight performance. To address this issue, this paper proposes a novel control system based on inner–outer loop architecture. In this system, the outer loop position control adopts a PID controller optimized by Genetic Algorithm-based Particle Swarm Optimization (GA-PSO), while the inner loop attitude control employs a Linear Active Disturbance Rejection Controller (LADRC) with fuzzy algorithm-based adaptive tuning, forming a dual-loop control structure. Comparisons with traditional dual-loop cascaded PID controllers, conventional PID in the outer loop with LADRC in the inner loop, and conventional PID in the outer loop with fuzzy algorithm-based adaptive tuning in the inner loop demonstrate that the proposed control system can stably track the desired position and attitude angles under certain external disturbances, exhibiting excellent anti-disturbance capability and stability.

A Deep Federated Learning-Based User Credit Evaluation Model Under Financial Internet of Things Scenarios

With the rapid development of Internet of Things (IoT) technology and the digital transformation of the financial industry, the financial IoT is becoming an important trend in the future financial field. In the era of financial IoT, a large amount of data information is recorded by sensors and devices, which poses new challenges and opportunities for user credit evaluation. In this context, conventional deep learning-based user credit evaluation methods often cannot meet privacy needs. The paper combines the privacy security ability of federated learning with deep learning, and proposes a deep federated learning-based user credit evaluation model under financial IoT scenarios. First, a particle swarm optimization-based backpropagation neural network algorithm is formulated to extract user credit evaluation features, in order to obtain user behavior patterns and credit features. Then, the XGBoost algorithm is employed to output credit evaluation results. As for the training process, the thought of federated learning is integrated to distribute the model to individual participants. In such mode, the model can be updated and trained without exposing user data to the central cloud. The experiments are conducted on real-world data to assess the proposal’s performance. The results show that the proposed credit evaluation framework can achieve better accuracy, under the guarantee of user privacy.

A CeO2 (100) surface reconstruction unveiled by in situ STEM and particle swarm optimization techniques.

The reconstruction of the polar CeO2 (100) surface has been a subject of long-standing debates due to its complexity and the limited availability of experimental data. Herein, we successfully reveal a CeO2 (100)-(4 × 6) surface reconstruction by combining in situ spherical aberration-corrected scanning transmission electron microscopy, density functional theory calculations, and a particle swarm optimization-based algorithm for structure searching. We have further elucidated the stabilizing mechanism of the reconstructed structure, which involves the splitting of the filled Ce(4f) states and the mixing of the lower-lying ones with the O(2p) orbitals, as evidenced by the projected density of states. We also reveal that the surface chemisorption properties toward water molecules, an important step in numerous heterogeneous catalytic reactions, are enhanced. These insights into the distinct properties of ceria surface pave the way for performance improvements of ceria in a wide range of applications.

ICG signal denoising based on ICEEMDAN and PSO-VMD methods.

Impedance cardiography (ICG) plays a crucial role in clinically evaluating cardiac systolic and diastolic functions, along with various other cardiac parameters. However, its accuracy heavily depends on precisely identifying feature points reflecting cardiac function. Moreover, traditional signal processing techniques used to mitigate random noise and breathing artifacts may inadvertently distort the amplitude and temporal characteristics of ICG signals. To address this issue, this study investigates a noise and artifact elimination method based on Improved Complete Ensemble Empirical Mode Decomposition with Adaptive Noise (ICEEMDAN) and Particle Swarm Optimization-based Variational Mode Decomposition Algorithm (PSO-VMD). The goal is to preserve the amplitude and temporal features of ICG signals to ensure accurate feature point extraction and computation of associated cardiac parameters. Comparative analysis with signal processing methods employing various wavelet families and Ensemble Empirical Mode Decomposition (EEMD) in ICG signal processing applications reveals that the proposed method achieves superior signal-to-noise ratio (SNR) and lower root-mean-square error (RMSE), while demonstrating enhanced correlation and waveform consistency with the original signal.

Optimization of magnetic circuit in electro-controlled permanent magnet blank holder process with magnetorheological elastomers and analysis of its impact on deep drawing

Addressing the issue of blank holder force (BHF) attenuation caused by the blank-holder gap in the EPMBH process, this study proposes a solution: employing magnetorheological elastomer (MRE) as a magnetic medium to fill these gaps, thus constructing an optimized edging magnetic circuit aimed at reducing magnetic loss and enhancing BHF. Initially, the study utilizes finite element analysis to build a dataset, followed by the application of a particle swarm to optimization BP neural network for magnetic force prediction and modeling. This process reveals the coupling relationship between the working gap thickness, MRE's relative permeability, and magnetic force, where the training and testing results of the model show an average error is around 5 %. Further, by applying a genetic algorithm (GA) to optimize the magnetic permeability of MRE, the theoretical optimal relative permeability curve of MRE is determined. To facilitate production, the goal is set to achieve 98 % of the maximum magnetic force, based on which further optimization is conducted to establish the engineering design range for MRE's relative permeability. Subsequently, MRE samples were designed and manufactured, and combined with a 36-pole EPM magnetic loading mechanism for experimental validation. The results show that the error between the predicted and experimental outcomes is 5.2 %, and the deep drawing experiments further confirm that the introduction of MRE helps the electronically controlled permanent magnet edging process to accommodate the deep drawing needs of slabs with varying thicknesses. This discovery provides valuable guidance for the improvement of the EPMBH process.

A particle swarm optimization-based deep clustering algorithm for power load curve analysis

To address the inflexibility of the convolutional autoencoder (CAE) in adjusting the network structure and the difficulty of accurately delineating complex class boundaries in power load data, a particle swarm optimization deep clustering method (DC-PSO) is proposed. First, a particle swarm optimization algorithm for automatically searching the optimal network architecture and hyperparameters of CAE (AHPSO) is proposed to obtain better reconstruction performance. Then, an end-to-end deep clustering model based on a reliable sample selection strategy is designed for the deep clustering algorithm to accurately delineate the category boundaries and further improve the clustering effect. The experimental results show that the DC-PSO algorithm exhibits high clustering accuracy and higher performance for the power load profile clustering.

Output Reachable Set-Based Leader-Following Consensus of Positive Agents Over Switching Networks.

This work addresses the output reachable set-based leader-following consensus problem, focusing on a group of positive agents over directed dwell-time switching networks. Two types of non-negative disturbances, namely, 1) L1 -norm bounded disturbances and 2) L∞,1 -norm bounded disturbances are studied. Meanwhile, a class of directed dwell-time switching networks for modeling the communication protocol of positive agents is investigated. To deal with the presence of disturbances, an output-feedback control protocol is developed to achieve a robust consensus with positivity preserved based on the output reachable set. By exploiting the positive characteristics, switched linear copositive Lyapunov functions are adopted to establish output reachable set-based consensus conditions. These conditions can facilitate the control protocol design by solving a bilinear programming problem, and also generate hyperpyramidal regions to confine the output consensus error. A particle swarm optimization-based (PSO-based) algorithm is applied to compute the controller gains and optimize the volume of the hyperpyramids. The proposed methods are verified by the presented numerical case studies.

Cooperative task allocation method for air-sea heterogeneous unmanned system with an application to ocean environment information monitoring

Ocean environment information monitoring is crucial to maritime battlefield situation awareness, marine disaster prevention, and marine resources utilization. However, current monitoring means, including remote sensing satellites, scientific investigation ships, and ocean observation stations, have limitations in terms of spatial coverage, spatiotemporal resolution, and manpower resources. Therefore, this study proposed the Air-Sea heterogeneous unmanned system composed of UAVs and USVs to carry out ocean environment information monitoring tasks.) Firstly, an algorithm named FASO (Firefly Algorithm Based Particle Swarm Optimization) is proposed to obtain the deployment of monitoring nodes in the sea-surface and airspace. Secondly, a multi-objective optimization cooperative task allocation model is established, which contains complex constraints and takes the energy consumption cost of UAVs and USVs as optimization goals. Finally, a cooperative task allocation method based on the improved NSGA-II algorithm is presented to enhance the convergence speed and quality of the cooperative task allocation for air-sea heterogeneous unmanned system. Simulation results demonstrate that the proposed algorithm have higher generality and superiority compared to other algorithms. This study provides a specific approach for the application of heterogeneous unmanned systems in the field of ocean monitoring.

A novel particle swarm optimization-based intelligence link prediction algorithm in real world networks

Link prediction in social network is an important topic due to its applications like finding collaborations and recommending friends. Among existing link prediction methods, similarity-based approaches are found to be most effective since they examine the number of common neighbours (CN). Current work presents a novel link prediction algorithm based on particle swarm optimization (PSO) and implemented on four real world datasets namely, Zachary’s karate club (ZKC), bottlenose dolphin network (BDN), college football network (CFN) and Krebs’ books on American politics (KBAP). It consists of three experiments: i) to find the measures on existing methods and compare them with our proposed algorithm; ii) to find the measured values of the existing methods along with our proposed one to determine future links among nodes that have no CN; and iii) to find the measures of the methods to determine future links among nodes having same number of CN. In experiment 1, our proposed approach achieved 75.88%, 78.34%, 82.63% and 78.36% accuracy for ZKC, BDN, CFN, and KBAP respectively. These results beat the performances of traditional algorithms. In experiment 2, the accuracies are found as 75.53%, 74.25%, 81.63% and 78.34% respectively. In experiment 3, accuracies are detected as 72.75%, 81.53%, 78.35% and 75.13% respectively.

MSCO: Mobility-aware Secure Computation Offloading in blockchain-enabled Fog computing environments

Fog computing has evolved as a promising computing paradigm to support the execution of latency-sensitive Internet of Things (IoT) applications. The mobile devices connected to the fog environment are resource constrained and non-stationary. In such environments, offloading mobile user’s computational task to nearby fog servers is necessary to satisfy the QoS requirements of time-critical IoT applications. Moreover, the fog servers are also susceptible to numerous attacks which induce security and privacy issues.Offloading computation task to a malicious fog node affects the integrity of users’ data. Despite the fact that there are many integrity-preserving strategies for fog environments, the majority of them rely on a reliable central entity that might have a single point of failure. Blockchain is a promising strategy that maintains data integrity in a decentralized manner. The state-of-art blockchain offloading mechnanisms have not considered the mobility during secure offloading process. Besides, it is necessary to ensure QoS constraints of the IoT applications while considering mobility of user devices. Hence, in this paper, Blockchain assisted Mobility-aware Secure Computation Offloading (MSCO) mechanism is proposed to choose the best authorized fog servers for offloading task with minimal computational and energy cost. To address the optimization issue, a hybrid Genetic Algorithm based Particle Swarm Optimization technique is employed. Experimental results demonstrated the significant improvement of MSCO when compared to the existing approaches in terms of on average 11 % improvement of total cost which includes the parameters of latency and energy consumption.

PSO-ECM: particle swarm optimization-based evidential C-means algorithm

PSO-ECM: particle swarm optimization-based evidential C-means algorithm

Design of intelligent control for flexible linear double inverted pendulum based on particle swarm optimization algorithm

For the problem of control of flexible linear double inverted pendulum (FLDIP), considering that the method of obtaining LQR parameters through traditional manual trial-and-error is too cumbersome, and the basic particle swarm optimization algorithm has a slower convergence speed and is prone to a local optimal solution, in this paper, a control method is proposed that it can achieve autonomous optimization based on improved the particle swarm optimization (PSO) algorithm. Firstly, the mathematical model of the FLDIPs is given to analyse the stability of the system. Then, the PSO algorithm is improved from the perspective of dynamically adjusting inertia weights to optimize linear quadratic regulator (LQR) parameters. Finally, through simulation comparison with the LQR control effect obtained by the manual trial and error method, the feasibility of the improved PSO algorithm is verified. This method can not only improve the control performance of the system but also effectively overcome the problem of blindness in selecting Q for traditional LQR optimal control.

Group Intelligent City Mobile Communication Network's Control Strategy based on Cellular Internet of Things

Mobile communication network optimization heavily depends on power control technology, which impacts the effectiveness of the network. This paper aims to enhance control over nonlinear mobile communication networks and achieve superior performance by applying the particle swarm optimization (PSO) algorithm in the control domain. Addressing limitations in the basic PSO algorithm, improvements are made and applied to urban mobile communication networks. The methodology involves modifying the PSO algorithm to address identified issues and applying the enhanced algorithm to communication network scenarios. Simulation results indicate that with an initial particle count of 10 and 100 iterations, the optimized values for and are 0.691 and 0.486, respectively, resulting in an objective function value of 55.514. This achievement validates the successful implementation of the optimization process for mobile communication network control. The findings reveal that the proposed grad particle swarm optimization (Grad-PSO) algorithm exhibits mobile network optimization by robust search capability and rapid convergence.

A Novel Ensemble Framework for Multi-Classification of Brain Tumors Using Magnetic Resonance Imaging.

Brain tumors can have fatal consequences, affecting many body functions. For this reason, it is essential to detect brain tumor types accurately and at an early stage to start the appropriate treatment process. Although convolutional neural networks (CNNs) are widely used in disease detection from medical images, they face the problem of overfitting in the training phase on limited labeled and insufficiently diverse datasets. The existing studies use transfer learning and ensemble models to overcome these problems. When the existing studies are examined, it is evident that there is a lack of models and weight ratios that will be used with the ensemble technique. With the framework proposed in this study, several CNN models with different architectures are trained with transfer learning and fine-tuning on three brain tumor datasets. A particle swarm optimization-based algorithm determined the optimum weights for combining the five most successful CNN models with the ensemble technique. The results across three datasets are as follows: Dataset 1, 99.35% accuracy and 99.20 F1-score; Dataset 2, 98.77% accuracy and 98.92 F1-score; and Dataset 3, 99.92% accuracy and 99.92 F1-score. We achieved successful performances on three brain tumor datasets, showing that the proposed framework is reliable in classification. As a result, the proposed framework outperforms existing studies, offering clinicians enhanced decision-making support through its high-accuracy classification performance.

Deep-Towed Array Geometry Inversion Based on an Improved Particle Swarm Optimization Algorithm

When marine deep-towed multichannel seismic data are processed, the description of the receiving array geometry significantly impacts the quality of the imaging profile. Therefore, achieving a highly precise description of the receiving array geometry is very important for the fine imaging of such data. While basic particle swarm optimization (PSO) is known for its ease of implementation and efficiency, it often exhibits a low convergence accuracy. Consequently, the PSO algorithm is improved by modifying the inertia weight and incorporating Gaussian mutation. In combination with the actual motion of the towing streamer during surveys, a strategy for inheriting particle positions is introduced. When each seismic shot is solved sequentially, the results from the previous shot can serve as the initial particle positions for the next shot. The results indicate that this strategy achieves superior fitness values and outperforms the basic PSO algorithm. This method exhibits simplicity, rapid optimization, and a favorable solution quality, thereby offering a valuable approach to deep-towed array geometry inversion. It enhances the efficiency of deep-towed seismic data processing and serves as a reference for similar applications.

Parameter estimation of multivariable Wiener nonlinear systems by the improved particle swarm optimization and coupling identification

This paper investigates the parameter estimation of multivariable Wiener nonlinear systems. To solve the inconsistency problem of the parameter vector and the parameter matrix, the coupling identification concept is applied. Combined with particle swarm optimization (PSO) and an auxiliary model, the partially coupled improved particle swarm optimization (PC-IPSO) method is proposed. In this algorithm, the adaptive feedback inertia weight is improved to accelerate the convergence speed, and the retirement update mechanism is introduced to improve the optimization ability of the basic PSO algorithm. To verify the performance of PC-IPSO, we also derive a multivariable improved PSO (M-IPSO) method for comparison. The computational complexity analysis shows that the PC-IPSO algorithm requires less computational resources than the M-IPSO algorithm. Then, the convergence of the improved PSO method is analyzed. The simulation results indicate that the PC-IPSO method has a faster convergence speed and higher identification accuracy than the M-IPSO and several existing state-of-the-art methods for multivariable Wiener system identification.

A multi-hierarchy particle swarm optimization-based algorithm for cloud workflow scheduling

In this paper, we consider the market-driven workflow scheduling problem on heterogeneous cloud resources with deadline constraints. The transmission delay between dependent tasks on different virtual machines (VMs) is considered. The objective is to minimize the total monetary cost, which is computed based on the on-demand price structure. Inspired by the heuristic and meta-heuristic algorithms, a multi-hierarchy particle swarm optimization (MHPSO) algorithm is proposed, which mainly consists of three components: (1) the workflow aggregation method to pretreat the workflow structure considering the transmission cost and the VM utilization; (2) the initial population generating method to create a set of initial particles with the given encoding method and the solution generation method; and (3) the hierarchical evolving process where particles are divided into multiple groups and evolved iteratively. We calibrate the parameters and components of the proposal statistically over five well-known workflows with different deadline settings. A comparison of the proposed algorithm to existing methods for the considered problem is carried out. Experimental results demonstrate the proposal is effective for the problem under study.

A sequential quadratic programming based strategy for particle swarm optimization on single-objective numerical optimization

Over the last decade, particle swarm optimization has become increasingly sophisticated because well-balanced exploration and exploitation mechanisms have been proposed. The sequential quadratic programming method, which is widely used for real-parameter optimization problems, demonstrates its outstanding local search capability. In this study, two mechanisms are proposed and integrated into particle swarm optimization for single-objective numerical optimization. A novel ratio adaptation scheme is utilized for calculating the proportion of subpopulations and intermittently invoking the sequential quadratic programming for local search start from the best particle to seek a better solution. The novel particle swarm optimization variant was validated on CEC2013, CEC2014, and CEC2017 benchmark functions. The experimental results demonstrate impressive performance compared with the state-of-the-art particle swarm optimization-based algorithms. Furthermore, the results also illustrate the effectiveness of the two mechanisms when cooperating to achieve significant improvement.

Improved multi objective particle swarm optimization based reactive power optimization for ensuring voltage security of power systems

In this study an improved multi objective particle swarm optimization (IMOPSO) algorithm is proposed for power system reactive power optimization with the objective of ensuring voltage security. The multi objective particle swarm optimization (MOPSO) is improved by introducing an adapted binary crossover (ABX) to the new positions obtained by the basic particle swarm optimization (PSO) algorithm. Additionally, diversity maintenance strategy is added to the algorithm by employing crowding distance (CD) calculation. The developed algorithm is tested and compared with standard MOPSO and non dominated sorting genetic algorithm (NASGA II). The comparison is made based on the degree of closeness to the true pareto front, as measured by the inverted generational distance (IGD), and based on diversity, as measured by the CDs . The test is made using ZDT1, ZDT2, and ZDT3 test functions. The IMOPSO showed improved performance over MOPSO and NASGA II algorithms in terms of convergence to the true pareto front (PF) and in terms of the speed of convergence as well as in maintaining diversity. The algorithm is then implemented to reactive power optimization of IEEE 14 bus test system. For the implementation purpose, the voltage stability and voltage deviation components of voltage security are formulated as a multi objective functions. The implementation has resulted diverse options of optimal settings of reactive power controlling parameters. The optimal settings proved to produce an improved voltage security as measured in terms of voltage deviation and voltage stability.

A modified particle swarm optimization algorithm for a vehicle scheduling problem with soft time windows

This article constructed a vehicle scheduling problem (VSP) with soft time windows for a certain ore company. VSP is a typical NP-hard problem whose optimal solution can not be obtained in polynomial time, and the basic particle swarm optimization(PSO) algorithm has the obvious shortcoming of premature convergence and stagnation by falling into local optima. Thus, a modified particle swarm optimization (MPSO) was proposed in this paper for the numerical calculation to overcome the characteristics of the optimization problem such as: multiple constraints and NP-hard. The algorithm introduced the “elite reverse” strategy into population initialization, proposed an improved adaptive strategy by combining the subtraction function and “ladder strategy” to adjust inertia weight, and added a “jump out” mechanism to escape local optimal. Thus, the proposed algorithm can realize an accurate and rapid solution of the algorithm’s global optimization. Finally, this article made typical benchmark functions experiment and vehicle scheduling simulation to verify the algorithm performance. The experimental results of typical benchmark functions proved that the search accuracy and performance of the MPSO algorithm are superior to other algorithms: the basic PSO, the improved particle swarm optimization (IPSO), and the chaotic PSO (CPSO). Besides, the MPSO algorithm can improve an ore company’s profit by 48.5–71.8% compared with the basic PSO in the vehicle scheduling simulation.