Cooperative Particle Swarm Optimization Algorithm Research Articles

Research on Dynamic Target Search for Multi-UAV Based on Cooperative Coevolution Motion-Encoded Particle Swarm Optimization

Effectively strategizing the trajectories of multiple Unmanned Aerial Vehicles (UAVs) within a dynamic environment to optimize the search for and tracking of mobile targets presents a formidable challenge. In this study, a cooperative coevolution motion-encoded particle swarm optimization algorithm called the CC-MPSO search algorithm is designed to tackle the moving target search issue effectively. Firstly, a Markov process-based target motion model considering the uncertainty of target motion is investigated. Secondly, Bayesian theory is used to formulate the moving target search as an optimization problem where the objective function is defined as maximizing the cumulative probability of detection of the target in finite time. Finally, the problem is solved based on the CC-MPSO algorithm to obtain the optimal search path nodes. The motion encoding mechanism converts the search path nodes into a set of motion paths, which enables more flexible handling of UAV trajectories and improves the efficiency of dynamic path planning. Meanwhile, the cooperative coevolution optimization framework enables collaboration between different UAVs to improve global search performance through multiple swarm information sharing, which helps avoid falling into local optimal solutions. The simulation results show that the CC-MPSO algorithm demonstrates efficacy, reliability, and superior overall performance when compared to the five commonly used swarm intelligence algorithms.

MOCPSO: A multi-objective cooperative particle swarm optimization algorithm with dual search strategies

Particle swarm optimization (PSO) is a widely embraced meta-heuristic approach to tackling the complexities of multi-objective optimization problems (MOPs), renowned for its simplicity and swift convergence. However, when faced with large-scale multi-objective optimization problems (LSMOPs), most PSOs suffer from limited local search capabilities and insufficient randomness. This can result in suboptimal results, particularly in high-dimensional spaces. To address these issues, this paper introduces MOCPSO, a Multi-Objective Cooperative Particle Swarm Optimization Algorithm with Dual Search Strategies. MOCPSO incorporates a diversity search strategy (DSS) to augment perturbation and enhance the local search scope of particles, alongside a more convergent search strategy (CSS) to expedite particle convergence. Moreover, MOCPSO utilizes a three-category framework to effectively leverage the benefits of both DSS and CSS. Experimental results on benchmark LSMOPs with 500, 1000, and 2000 decision variables demonstrate that MOCPSO outperforms existing state-of-the-art large-scale multi-objective evolutionary algorithms on most test instances.

Hybrid multi-group stochastic cooperative particle swarm optimization algorithm and its application to the photovoltaic parameter identification problem

The accurate estimation of model parameters is significant for the simulation, evaluation, control, and optimization of photovoltaic systems. Recently, meta-heuristic algorithms(MHAs) have been proposed to solve the photovoltaic parameter identification problem. However, extracting the accurate and reliable parameters of PV models is still a great challenge, and many HMAs may present unsatisfactory performance due to their premature or slow convergence. Therefore, how to develop algorithms efficiently balancing the exploration and exploitation to improve the accuracy and reliability of the algorithm is extremely important. This paper proposes a Hybrid multi-group stochastic cooperative optimization algorithm (HMSCPSO). In the proposed algorithm, we designed a multi-group cooperation search mechanism to enhance the global search capability: Each group utilized different strategies. The first group used classic velocity and position updates, the second group employed the chaos strategy, and the third group utilized the lévy flight strategy. Through cooperation search between groups to increase the diversity of the population and reduce the possibility of falling into local optimum, but also concentrate some individuals to explore the current global optimum to improve the accuracy of the solution. HMSCPSO and its variants were tested on 27 benchmark functions to verify the proposed algorithm’s effectiveness. Then, the HMSCPSO is applied to solve four PV parameter identification problems of different photovoltaic models. Statistical experiment results demonstrate that the proposed algorithm has excellent advantages compared with other meta-heuristic algorithms in terms of accuracy, reliability, and convergence speed. Therefore, HMSCPSO is expected to be an effective parameter identification method for solar cells and photovoltaic modules.

A Novel Feedforward Model of Piezoelectric Actuator for Precision Rapid Cutting.

The piezoelectric actuator has been widely used in modern precision cutting technology due to its fast response speed and high positioning accuracy. In recent years, with the development of precision technology, modern cutting requires higher and higher cutting accuracy and efficiency. Therefore, this paper proposes a feedforward control method based on the modified Bouc-Wen (MBW) model. Firstly, a novel asymmetrical modified Bouc-Wen model with an innovative form of shape control function is developed to model the hysteresis nonlinearity property of piezoelectric actuators. Then, a self-adaptive cooperative particle swarm optimization (PSO) algorithm is developed to identify the parameters of MBW model. The comparative evaluation reveals that the MBW model outperforms the classical Bouc-Wen (CBW) model by 66.4% in modeling accuracy. Compared with traditional PSO algorithm, the self-adaptive cooperative PSO algorithm can obtain minimum fitness in parameter identification. Furthermore, the feedforward control strategy is realized to improve the position tracking accuracy. A position tracking experiment verifies that the feedforward control strategy improves the tracking accuracy of piezoelectric actuators significantly compared with the open-loop control strategy.

Online Weapon-target Assignment based on Distributed Auction Mechanism

To solve the problem of online weapon-target assignment (OWTA) in the integration of large-scale search and attack in unknown environment, an OWTA algorithm based on distributed auction mechanism is presented. Aiming at the problem that the traditional combinatorial optimization algorithm needs to set up the global battlefield situation in advance, considering the consumability of resources in the attack process, the integrated search and attack task flow is established. Considering the communication restricted environment, the unmanned aerial vehicles (uavs) are grouped, with centralized architecture within the group and distributed structure between the groups, and the corresponding distributed auction mechanism is constructed to achieve OWTA within the communication range limited. In order to solve the problem that it is difficult to ensure the time consistency of the coordinated attack target, a dubins cooperative path planning based on cooperative particle swarm optimization (CPSO) algorithm is proposed. Particle swarm optimization algorithm is used to adjust the radius of the dubins path of each bomb, so that the uav in the same group can hit the target simultaneously without collision and have the shortest flight range. The simulation results show that the designed distributed auction algorithm takes into account the consumption of attack resources, and quickly redistributes the firepower to the new targets in the dynamic uncertain environment, which ensures the maximization of the execution efficiency of the multi-machine cluster fire allocation task.

Cooperative Particle Swarm Optimization With a Bilevel Resource Allocation Mechanism for Large-Scale Dynamic Optimization.

Although cooperative coevolutionary algorithms are developed for large-scale dynamic optimization via subspace decomposition, they still face difficulties in reacting to environmental changes, in the presence of multiple peaks in the fitness functions and unevenness of subproblems. The resource allocation mechanisms among subproblems in the existing algorithms rely mainly on the fitness improvements already made but not potential ones. On the one hand, there is a lack of sufficient computing resources to achieve potential fitness improvements for some hard subproblems. On the other hand, the existing algorithms waste computing resources aiming to find most of the local optima of problems. In this article, we propose a cooperative particle swarm optimization algorithm to address these issues by introducing a bilevel balanceable resource allocation mechanism. A search strategy in the lower level is introduced to select some promising solutions from an archive based on solution diversity and quality to identify new peaks in every subproblem. A resource allocation strategy in the upper level is introduced to balance the coevolution of multiple subproblems by referring to their historical improvements and more computing resources are allocated for solving the subproblems that perform poorly but are expected to make great fitness improvements. Experimental results demonstrate that the proposed algorithm is competitive with the state-of-the-art algorithms in terms of objective function values and response efficiency with respect to environmental changes.

Coordinated Control of Intelligent Fuzzy Traffic Signal Based on Edge Computing Distribution.

With the development of Internet of Things infrastructures and intelligent traffic systems, the traffic congestion that results from the continuous complexity of urban road networks and traffic saturation has a new solution. In this research, we propose a traffic signal control scenario based on edge computing. We also propose a chemical reaction–cooperative particle swarm optimization (CRO-CPSO) algorithm so that flexible traffic control is sunk to the edge. To implement short-term real-time vehicle waiting time prediction as a collaborative judgment of CRO-CPSO, we suggest a traffic flow prediction system based on fuzzy logic. In addition, we introduce a co-factor (collaborative factor) set based on offline learning to take into account the experiential characteristics of intersections in urban road networks for the generation of strategies by the algorithm. Furthermore, the real case of Changsha County is simulated on the SUMO simulation platform. The issue of traffic flow saturation is improved by our method. Compared with other methods, our algorithm enhances the proportions of vehicles that reach their destinations on time by 13.03%, which maximizes the driving experience for drivers. Meanwhile, our algorithm reduces the driving times of vehicles by 25.34%, thus alleviating traffic jams.

Thruster Fault Diagnostics and Fault Tolerant Control for Autonomous Underwater Vehicle with Ocean Currents

Autonomous underwater vehicle (AUV) is one of the most important exploration tools in the ocean underwater environment, whose movement is realized by the underwater thrusters, however, the thruster fault happens frequently in engineering practice. Ocean currents perturbations could produce noise for thruster fault diagnosis, in order to solve the thruster fault diagnostics, a possibilistic fuzzy C-means (PFCM) algorithm is proposed to realize the fault classification in this paper. On the basis of the results of fault diagnostics, a fuzzy control strategy is proposed to solve the fault tolerant control for AUV. Considering the uncertainty of ocean currents, it proposes a min-max robust optimization problem to optimize the fuzzy controller, which is solved by a cooperative particle swarm optimization (CPSO) algorithm. Simulation and underwater experiments are used to verify the accuracy and feasibility of the proposed method of thruster fault diagnostics and fault tolerant control.

Multi-scale cooperative search simplified particle swarm optimization algorithm and performance analysis

A multi-scale cooperative searching simplified PSO (MSPSO) was put forward to avoid the standard PSO (SPSO) premature, which was put forward by simulating ants working cooperatively in nature. Its particles trajectories were analyzed and its convergence was proved. The numerical experiment indicates that the MSPSO has better searching performance, especially in solving the higher dimensional optimization problems.

Research on Energy Management of a Virtual Power Plant Based on the Improved Cooperative Particle Swarm Optimization Algorithm

Energy management of virtual power plants (VPPs) directly affects operators’ operating profits and is also related to users’ comfort and economy. In order to provide a reasonable scheme for scheduling each unit of the VPP and to improve the operating profits of the VPP, this study focuses on the optimization of VPP energy management under the premise of ensuring the comfort of flexible load users. First, flexible loads are divided into time-shiftable load (TL), power-variable load (PL), and interruptible load (IL), and their accurate power consumption models are established, respectively. Then, aiming at maximizing the operation profits of a VPP operator, an optimization model of VPP energy management considering user comfort is proposed. Finally, the improved cooperative particle swarm optimization (ICPSO) algorithm is applied to solve the proposed VPP energy management optimization model, and the optimal scheduling scheme of VPP energy management is obtained. Taking a VPP in the coastal area of China as an example, results show that the optimization model proposed in this article has the advantages of good economy and higher user comfort. Meanwhile, the ICPSO algorithm has the characteristics of faster optimization speed and higher accuracy when solving the problem with multiple variables.

A Measuring Method of DOM Components Based on Fiber SPR Sensor and ICPSO-BP Neural Network

As the single sensor is not competent for the variation of the total amount and components of DOM in a large range, according to the cross-sensitivity between fiber SPR sensors with different structures, a measuring method of DOM components is proposed by combining the deep learning algorithm with the fiber SPR sensors based on the regulation of metal film thickness. We exploit an improved cooperative particle swarm optimization algorithm (ICPSO) aiming at the problem of particle diversity loss caused by premature convergence of particles which not only considers the optimization information of single particles, the global particles and particles in the groups, but also considers the proportion of shared information. Then, the ICPSO is used to optimize the weights and thresholds of back propagation neural network (BPNN) to establish ICPSO-BP network, so as to construct three classifiers consists of ICPSO-BP (wave length), ICPSO-BP (spectral width), ICPSO-BP (light intensity). By comprehensive training of the resonance wavelength, spectrum width and light intensity of SPR effect for the measured water, five DOM components (tyrosine protein, tryptophan protein, fulvic acid, dissolved microbial metabolites and humic acid) and their concentrations in four water samples, namely, Inner canal (A), Hongze lake (B), Park lake (C) and Campus lake (D), have been effectively predicted. The prediction accuracy is more than 80%, among them, the highest prediction rate of tryptophan protein and its concentration in Hongze lake (B) which can reach 86%. Therefore, the dynamic range of SPR measurement is effectively expanded and better measurement accuracy and sensitivity are maintained, which verifies the feasibility of the proposed method in DOM measuring and provide a new idea for DOM component testing.

A noise‐immune model identification method for lithium‐ion battery using two‐swarm cooperative particle swarm optimization algorithm based on adaptive dynamic sliding window

Accurate and reliable model parameters are not only a prerequisite for model-based estimation but also a significant part of battery operating characteristics. However, the measurement signal inevitably contains noise, which brings great challenges to model identification. This paper focuses on the noise immunity performance of model identification based on two-swarm cooperative particle swarm optimization. An adaptive dynamic sliding window based on the current rate criterion and the identification results feedback is designed to avoid data redundancy and improve the robustness of model identification. The model parameters are obtained using two-swarm cooperative particle swarm optimization based on the adaptive dynamic sliding window. The proposed method effectively improves the accuracy and speed of parameter identification through optimization of data fragments and particle update rules. Compared with two existing parameter identification methods, simulation studies illustrate that the average mean square deviation of the proposed method is reduced by at least 35 dB. The proposed method is superior to existing parameter identification methods in noise immunity performance, parameter identification reliability, and state-of-charge estimation accuracy. By employing the proposed method, the maximum errors of state-of-charge estimation are limited within 1% under experimental verification. The experiment results verify that the proposed method has the potential to extract reliable model features online.

Label entropy‐based cooperative particle swarm optimization algorithm for dynamic overlapping community detection in complex networks

The real-world complex networks, such as biological, transportation, biomedical, web, and social networks, are usually dynamic and change over time. The communities which reflect the substructures hidden in the networks usually overlap each other, and detecting overlapping communities in the dynamic complex networks is a challenging task. Prior researchers have applied multiobjective optimization method to the detection of dynamic overlapping communities and achieved some excellent results. However, in terms of multiobjective processing, the prior studies all adopt the decomposition method based on weight parameters, and different weight parameters or different parameter values can easily affect the community detection results which further results in the uneven distribution of the detected results in the target space. To solve the above problems, a hybrid algorithm, that is, Collaborative Particle Swarm multiobjective Optimization-based Dynamic Overlapping Community Detection (CPSO-DOCD) algorithm is proposed in this paper. First, to improve the diversity of particles, the encoding/decoding of the particle and the cross inheritance and the variation of particle are redefined first based on label propagation. In each network snapshot, multiple particle swarms are initialized based on Community Overlap Propagation Algorithm (COPRA) to generate particles with uniform distribution. Multiple different objective functions are optimized using multiple particle swarms respectively to avoid the incorrect selection of weight parameters. In addition, a reference-point-based is adopted in the particle selecting stage to solve the uneven distribution of detected results in the target space. Second, a node label entropy-based particle swarm algorithm is proposed to improve the accuracy of community detection of current network snapshots. Finally, when one snapshot switches to another over time, a migration strategy based on COPRA local-search and clique generation is utilized to adjust the prior community detection results, which enables the former results can be adapted to the new network snapshots. The experiments are implemented based on four dynamic networks which are Cit-HepPh, Cit-HepTh, Emailed-EU-core-temporal, and CollegeMsg. The hypervolume value of the overlapping community detection result obtained by CPSO-DOCD is 0.5%–2% higher than MDOA, MCMOEA, SLPAD, and iLCD. Furthermore, CPSO-DOCD also performed better than MDOA, MCMOEA, SLPAD, and iLCD on C-metric values, and CPSO-DOCD can approach approximately to the Pareto frontier.

Tool wear prediction using a hybrid of tool chip image and evolutionary fuzzy neural network

This paper proposes an evolutionary fuzzy neural network (EFNN) for tool wear prediction. Material chips are affected by the cutting conditions during the cutting process. Different tool wear statuses cause material chips to have different colors; thus, the color of a material chip can be a crucial factor in tool wear prediction. In this study, the cutting time and International Commission on Illumination (CIE) xy value were used as the input of the proposed EFNN, and the output was the predicted degree of tool wear. The experimental results indicate that the proposed EFNN with the dynamic group cooperative particle swarm optimization (PSO) algorithm resulted in a smaller mean absolute percentage error (2.83%) than did the backpropagation neural network (9.72%), PSO (7.42%), quantum-based PSO (8.59%), and cooperative PSO (4.09%) algorithms.

Learning-Based Resource Allocation Strategy for Industrial IoT in UAV-Enabled MEC Systems

Forest fire monitoring plays an important role in forest resource protection. Although satellite remote sensing is an effective way for forest fire monitoring, satellite-based methods can only monitor large-scale forest areas, and they are weak in predicting the specific areas of forest fires. In this article, we first propose an unmanned aerial vehicle (UAV)-enabled system architecture consisting of multiple industrial Internet of Things (IIoTs), in which the data collected by sensors in IIoTs can be delivered to UAVs for processing directly. As the sensors of IIoTs are deployed to monitor different indexes of forest fires, fully considering the priority constraints among sensors can guarantee a quick response of forest fire monitoring. Thus, the priority constraints among the sensors are taken into consideration in this system architecture, and the objective is to minimize the maximum response time of forest fire monitoring. To search for the optimal UAV resource allocation strategy, a learning-based cooperative particle swarm optimization (LCPSO) algorithm with a Markov random field (MRF)-based decomposition strategy is proposed. The solution space of UAV resource allocation is decomposed into subsolution spaces according to the decomposed decision variables by the MRF network structure, and the optimal resource allocation strategy is searched by LCPSO in multiple subsolution spaces cooperatively. Three simulation experiments on two datasets are designed, and the simulation results compared with the state-of-the-art methods verify the validity of LCPSO, which are reflected by the quickest response time of forest fire monitoring.

Dual-Surrogate-Assisted Cooperative Particle Swarm Optimization for Expensive Multimodal Problems

Various real-world applications can be classified as expensive multimodal optimization problems. When surrogate-assisted evolutionary algorithms (SAEAs) are employed to tackle these problems, they not only face a contradiction between the precision of surrogate models and the cost of individual evaluations but also have the difficulty that surrogate models and problem modalities are hard to match. To address this issue, this article studies a dual-surrogate-assisted cooperative particle swarm optimization algorithm to seek multiple optimal solutions. A dual-population cooperative particle swarm optimizer is first developed to simultaneously explore/exploit multiple modalities. Following that, a modal-guided dual-layer cooperative surrogate model, which contains one upper global surrogate model and a group of lower local surrogate models, is constructed with the purpose of reducing the individual evaluation cost. Moreover, a hybrid strategy based on clustering and peak-valley is proposed to detect new modalities. Compared with five existing SAEAs and seven multimodal evolutionary algorithms, the proposed algorithm can simultaneously obtain multiple highly competitive optimal solutions at a low computational cost according to the experimental results of testing both 11 benchmark instances and the building energy conservation problem.

Mechanically Assisted Neurorehabilitation: A Novel Six-Bar Linkage Mechanism for Gait Rehabilitation.

Repeated and intensive gait training can improve muscle strength and movement coordination of patients with neurological or orthopedic impairments. However, conventional physical therapy by a physiotherapist is laborious and expensive. Therefore, this therapy is not accessible for the majority of patients. This paper presents a six-bar linkage mechanism for human gait rehabilitation with a natural ankle trajectory. Firstly, a six-bar linkage mechanism is selected as the original mechanism to construct a gait rehabilitation device. Then the ankle trajectory is formulated as a function of the crank angle. And the rotation angle of the crank is set as a linear function of time. Therefore, constant speed motor is sufficient to control the mechanism. For the dimensional synthesis, the precise point distances of the gait trajectory and the coupler curve are set as objective functions, with the kinematic constraints including in the optimization procedure. To obtain the optimal structure design parameters, a cooperative dual particle swarm optimization algorithm is developed. The results show that the coupler curve matches well with the gait trajectory. The average distance between the 60 precision points is 3.5 mm.

Information Sharing Based on Local PSO for UAVs Cooperative Search of Moved Targets

This paper proposes an optimization strategy for searching moving targets’ locations using cooperative unmanned aerial vehicles (UAVs) in an unknown environment. Such a strategy aims at reducing the overall search time and impact of uncertainties caused by the motion of targets, as well as improving the detection efficiency of UAVs. Specifically, we report, based on the UAV’s scan of a location and taking into account (i) the detection and communication coverage limitations, and (ii) either a false alarm or inaccurate detection of the target, either the existence or the absence of the target. Moreover, leveraging a cooperative and competitive particle swarm optimization (PSO) algorithm, a decentralized target search model, relying on a real-time dynamic construction of cooperative UAV local sub-swarms (LoPSO), is proposed. Each sub-swarm strives to validate quickly the target location, updated based on the Bayesian theory. In such a strategy, each UAV operates in two flight modes, namely, either in swarm mode or in Greedy mode, and takes into consideration the received data from other UAVs to improve the overall environmental information. The simulation results revealed that the LoPSO outperforms other well-known searching methods of target methods for target search in unknown environments in terms of both performance and computational complexity.

Lumped Kinetic Modeling Method for Fluid Catalytic Cracking

AbstractA new fluid catalytic cracking (FCC) lumped kinetic modeling method was put forward to improve the prediction accuracy of the FCC kinetic model. This model divided the feedstock into three lumps and the products into six lumps. The parameters of the kinetic model were obtained by combining the fourth‐order Runge‐Kutta integral method and the two‐swarm cooperative particle swarm optimization algorithm. Compared with dividing the feedstock according to the group composition and the distillation range, the average relative error between the experimental data and the calculated values proves the higher fitting accuracy of the new lumped method. The kinetic model established by the method exhibits better adaptability to different feedstock and fewer requirements for feedstock analysis data.

Optimization of diesel fuel injection strategies through applications of cooperative particle swarm optimization and artificial bee colony algorithms

New engine hardware and injection strategies allow modern engines to meet stringent emissions regulations but can require extensive engine testing to identify optimum operating points. Swarm intelligence algorithms, which do not require knowledge of the search space gradient, can provide a short cut in finding optimum operating parameters in reduced experimental time than a traditional design of experiments study. In this paper, a modified artificial bee colony (ABC) algorithm and a cooperative particle swarm optimization (CPSO) algorithm are applied to triple and quadruple injection routines. The optimization was applied directly to the operation of a four-cylinder turbocharged production diesel engine operating at a high exhaust gas recirculation rate and medium load. Six and eight variable optimizations were carried out for triple and quadruple injection schedules, respectively. In experimental testing, the cooperative particle swarm optimizer significantly reduced soot and carbon monoxide emissions in only 84 engine tests when using a pilot-pilot-main-post schedule. The modified artificial bee colony algorithm took 176 engine tests to optimize a pilot-main-post triple-injection schedule and was not applied to the four-injection routine.