Search Results (10)

Intelligent control algorithms have been extensively utilized for adaptive controller parameter adjustment. While the Particle Swarm Optimization (PSO) algorithm has several issues: slow convergence speed requiring a large number of iterations, a tendency to get trapped in local optima, and difficulty escaping from them. It is also sensitive to the distribution of the solution space, where uneven distribution can lead to inefficient contraction. On the other hand, the Beetle Antennae Search (BAS) algorithm is robust, precise, and has strong global search capabilities. However, its limitation lies in focusing on a single individual. As the number of iterations increases, the step size decays, causing it to get stuck in local extrema and preventing escape. Although setting a fixed or larger initial step size can avoid this, it results in poor stability. The PSO algorithm, which targets a population, can help the BAS algorithm increase diversity and address its deficiencies. Conversely, the characteristics of the BAS algorithm can aid the PSO algorithm in finding the optimal solution early in the optimization process, accelerating convergence. Therefore, considering the combination of BAS and PSO algorithms can leverage their respective advantages and enhance overall algorithm performance. This paper proposes an improved algorithm, W-K-BSO, which integrates the Beetle Antennae Search strategy into the local search phase of PSO. By leveraging chaotic mapping, the algorithm enhances population diversity and accelerates convergence speed. Additionally, the adoption of linearly decreasing inertia weight enhances algorithm performance, while the coordinated control of the contraction factor and inertia weight regulates global and local optimization performance. Furthermore, the influence of beetle antennae position increments on particles is incorporated, along with the establishment of new velocity update rules. Simulation experiments conducted on nine benchmark functions demonstrate that the W-K-BSO algorithm consistently exhibits strong optimization capabilities. It significantly improves the ability to escape local optima, convergence precision, and algorithm stability across various dimensions, with enhancements ranging from 7 to 9 orders of magnitude compared to the BAS algorithm. Application of the W-K-BSO algorithm to PID optimization for the Pointing and Tracking System (PTS) reduced system stabilization time by 28.5%, confirming the algorithm’s superiority and competitiveness. Full article

In the realm of existing intelligent drip irrigation control systems, traditional PID control encounters challenges in delivering satisfactory control outcomes, primarily owing to issues related to non-linearity, time-varying behavior, and hysteresis. In order to solve the problem of the unstable operation of the drip irrigation system in an intelligent irrigation system, this paper proposes chaotic beetle swarm optimization (CBSO) based on the BAS (beetle antennae search) longicorn search algorithm, with inertial weights, variable learning factors, and logistic chaos initialization improving global search capabilities. This was accomplished by formulating the optimization objective, which involved integrating the control input’s time integral term, the square term, and the absolute value of the error. Subsequently, PID parameter tuning was performed. In order to verify the actual effect of the CBSO algorithm on the PID drip irrigation control system, MATLAB was used to simulate and compare PID control optimized by the GA algorithm, PSO algorithm, and BSO (beetle search optimization) algorithm. The results show that PID control based on CBSO optimization has a short response time, small overshoot, and no oscillation in the steady state process. The performance of the controller is improved, which provides a basis for PID parameter setting for a drip irrigation control system. Full article

This paper presents a path-planning strategy for unmanned aerial vehicles (UAVs) in urban environments with a ground risk map. The aim is to generate a UAV path that minimizes the ground risk as well as the flying cost, enforcing safety and efficiency over inhabited areas. A quantitative model is proposed to evaluate the ground risk, which is then used as a risk constraint for UAV path optimization. Subsequently, beetle swarm optimization (BSO) is proposed based on a beetle antennae search (BAS) that considers turning angles and path length. In this proposed BSO, an adaptive step size for every beetle and a random proportionality coefficient mechanism are designed to improve the deficiencies of the local optimum and slow convergence. Furthermore, a global optimum attraction operator is established to share the social information in a swarm to lead to the global best position in the search space. Experiments were performed and compared with particle swarm optimization (PSO), genetic algorithm (GA), firefly algorithm (FA), and BAS. This case study shows that the proposed BSO works well with different swarm sizes, beetle dimensions, and iterations. It outperforms the aforementioned methods not only in terms of efficiency but also in terms of accuracy. The simulation results confirm the suitability of the proposed BSO approach. Full article

With the aim of increasing the model accuracy of lithium-ion batteries (LIBs), this paper presents a complex-order beetle swarm optimization (CBSO) method, which employs complex-order (CO) operator concepts and mutation into the traditional beetle swarm optimization (BSO). Firstly, a fractional-order equivalent circuit model of LIBs is established based on electrochemical impedance spectroscopy (EIS). Secondly, the CBSO is used for model parameters’ identification, and the model accuracy is verified by simulation experiments. The root-mean-square error (RMSE) and maximum absolute error (MAE) optimization metrics show that the model accuracy with CBSO is superior when compared with the fractional-order BSO. Full article

The Beetle Swarm Optimization (BSO) algorithm is a high-performance swarm intelligent algorithm based on beetle behaviors. However, it suffers from poor search speeds and is prone to local optimization due to the size of the step length. To address this further, a novel improved opposition-based learning mechanism is utilized, and an adaptive beetle swarm optimization algorithm with novel opposition-based learning (NOBBSO) is proposed. In the proposed NOBBSO algorithm, the novel opposition-based learning is designed as follows. Firstly, according to the characteristics of the swarm intelligence algorithms, a new opposite solution is obtained to generate the current optimal solution by iterations in the current population. The novel opposition-based learning strategy is easy to converge quickly. Secondly, an adaptive strategy is used to make NOBBSO parameters self-adaptive, which makes the results tend to converge more easily. Finally, 27 CEC2017 benchmark functions are tested to verify its effectiveness. Comprehensive numerical experiment outcomes demonstrate that the NOBBSO algorithm has obtained faster convergent speed and higher convergent accuracy in comparison with other outstanding competitors. Full article

In this paper, a new meta-heuristic path planning algorithm, the cuckoo–beetle swarm search (CBSS) algorithm, is introduced to solve the path planning problems of heterogeneous mobile robots. Traditional meta-heuristic algorithms, e.g., genetic algorithms (GA), particle swarm search (PSO), beetle swarm optimization (BSO), and cuckoo search (CS), have problems such as the tenancy to become trapped in local minima because of premature convergence and a weakness in global search capability in path planning. Note that the CBSS algorithm imitates the biological habits of cuckoo and beetle herds and thus has good robustness and global optimization ability. In addition, computer simulations verify the accuracy, search speed, energy efficiency and stability of the CBSS algorithm. The results of the real-world experiment prove that the proposed CBSS algorithm is much better than its counterparts. Finally, the CBSS algorithm is applied to 2D path planning and 3D path planning in heterogeneous mobile robots. In contrast to its counterparts, the CBSS algorithm is guaranteed to find the shortest global optimal path in different sizes and types of maps. Full article

Aiming at the shortcomings of the beetle swarm algorithm, namely its low accuracy, easy fall into local optima, and slow convergence speed, a rebellious growth personality–beetle swarm optimization (RGP–BSO) model based on rebellious growth personality is proposed. Firstly, the growth and rebellious characters were added to the beetle swarm optimization algorithm to dynamically adjust the beetle’s judgment of the optimal position. Secondly, the adaptive iterative selection strategy is introduced to balance the beetles’ global search and local search capabilities, preventing the algorithm from falling into a locally optimal solution. Finally, two dynamic factors are introduced to promote the maturity of the character and further improve the algorithm’s optimization ability and convergence accuracy. The twelve standard test function simulation experiments show that RGP–BSO has a faster convergence speed and higher accuracy than other optimization algorithms. In the practical problem of PM_2.5 concentration prediction, the ELM model optimized by RGP–BSO has more prominent accuracy and stability and has obvious advantages. Full article

This paper proposes a fractional order (FO) impedance model for lithium-ion batteries and a method for model parameter identification. The model is established based on electrochemical impedance spectroscopy (EIS). A new hybrid genetic–fractional beetle swarm optimization (HGA-FBSO) scheme is derived for parameter identification, which combines the advantages of genetic algorithms (GA) and beetle swarm optimization (BSO). The approach leads to an equivalent circuit model being able to describe accurately the dynamic behavior of the lithium-ion battery. Experimental results illustrate the effectiveness of the proposed method, yielding voltage estimation root-mean-squared error (RMSE) of 10.5 mV and mean absolute error (MAE) of 0.6058%. This corresponds to accuracy improvements of 32.26% and 7.89% for the RMSE, and 43.83% and 13.67% for the MAE, when comparing the results of the new approach to those obtained with the GA and the FBSO methods, respectively. Full article

Operation optimization for large-scale offshore wind farms can cause the fatigue loads of single wind turbines to exceed their limits. This study aims to improve the economic profit of offshore wind farms by conducting multi-objective optimization via decoupled group operations of turbines. To do this, a large-scale wind farm is firstly divided into several decoupled subsets through the parallel depth-first search (PDFS) and hyperlink-induced topic search (HITS) algorithms based on the wake-based direction graph. Next, three optimization objectives are considered, including total output power, total fatigue load, and fatigue load dispatch on a single wind turbine (WT) in a wind farm. And then, the combined Monte Carlo and beetle swarm optimization (CMC-BSO) algorithms are applied to solve the multi-objective non-convex optimization problem based on the decentralized communication network topology. Finally, the simulation results demonstrate that the proposed method balances the total power output, fatigue load, and single fatigue loads with fast convergence. Full article

Weigh-in-motion (WIM) systems are used to measure the weight of moving vehicles. Aiming at the problem of low accuracy of the WIM system, this paper proposes a WIM model based on the beetle swarm optimization (BSO) algorithm and the error back propagation (BP) neural network. Firstly, the structure and principle of the WIM system used in this paper are analyzed. Secondly, the WIM signal is denoised and reconstructed by wavelet transform. Then, a BP neural network model optimized by BSO algorithm is established to process the WIM signal. Finally, the predictive ability of BP neural network models optimized by different algorithms are compared and conclusions are drawn. The experimental results show that the BSO-BP WIM model has fast convergence speed, high accuracy, the relative error of the maximum gross weight is 1.41%, and the relative error of the maximum axle weight is 6.69%. Full article