Search

Power shift tractors have been widely used in agricultural tractors in recent years because of their advantages of uninterrupted power during shifting, high transmission efficiency and high stability. As one of the indispensable driving states of the power shift tractor, the starting process requires a small impact and a starting speed that meets the driver's requirements. In this paper, aiming at such contradictory requirements, the starting control strategy of a power shift tractor is formulated with the goal of starting quality and the driver's intention. Firstly, the identification characteristics of the driver under three starting intentions are obtained by a real vehicle test. An extreme learning machine with fast identification speed and short training time is used to establish the basic driver's intention identification model. For the instability of the identification results of the Extreme Learning Machine (ELM), the particle swarm optimization algorithm (PSO) is used to optimize the ELM. The optimized extreme learning machine model has an accuracy of 96.891% for driver's intention identification. The wet clutch is an important part of the power shift gearbox. In this paper, the starting control strategy knowledge base of the starting clutch is established by a combination of bench tests and simulation tests. Through the fuzzy algorithm, the driver's intention is combined with the starting control strategy. Different drivers' intentions will affect the comprehensive evaluation model of the clutch (the single evaluation index of the clutch is: the maximum sliding power, the sliding power, the speed stability time, the impact degree), thus affecting the final choice of the starting clutch control strategy considering the driver's intention. On this basis, this paper studies and establishes the MPC starting controller for the power shift gearbox. Compared with the linear control strategy, the PSO-ELM-fuzzy weight starting strategy proposed in this paper can reduce the maximum sliding friction power by 45%, the sliding friction power by 69.45%, and the speed stabilization time by 0.11 s. The effectiveness of the starting control strategy considering the driver's intention proposed in this paper to improve the starting quality of the power shift tractor is verified. [ABSTRACT FROM AUTHOR]

Path planning is one of the core issues in the autonomous navigation of an Unmanned Surface Vehicle (USV), as the accuracy of the results directly affects the safety of the USV. Hence, this paper proposes a USV path planning algorithm that integrates an improved Particle Swarm Optimisation (PSO) algorithm with a Dynamic Window Approach (DWA). Firstly, in order to advance the solution accuracy and convergence speed of the PSO algorithm, a nonlinear decreasing inertia weight and adaptive learning factors are introduced. Secondly, in order to solve the problem of long path and path non-smoothness, the fitness function of PSO is modified to consider both path length and path smoothness. Finally, the International Regulations for Preventing Collisions at Sea (COLREGS) are utilised to achieve dynamic obstacle avoidance while complying with maritime practices. Numerical cases verify that the path planned via the proposed algorithm is shorter and smoother, guaranteeing the safety of USV navigation while complying with the COLREGS. [ABSTRACT FROM AUTHOR]

In everyday life, 5G-based localization technology is commonly used, but non-line-of-sight (NLOS) environments can block the propagation of the localization signal, thus preventing localization. In order to solve this problem, this paper proposes a reconfigurable intelligent surface non-line-of-sight time difference of arrival (TDOA) localization (RNTL) algorithm. Firstly, a model of a reflective-surface-based intelligent localization (RBP) system is constructed, which utilizes multiple RISs deployed in the air to reflect signals. Secondly, in order to reduce the localization error, this paper establishes the optimization problem of minimizing the distance between each estimated coordinate and the actual coordinate and solves it via the piecewise linear chaotic map–gray wolf optimization algorithm (PWLCM-GWO). Finally, the simulation results show that the RNTL algorithm significantly outperforms the traditional gray wolf optimization and particle swarm optimization algorithms in different signal-to-noise ratios, and the localization errors are reduced by 46% and 53.5%, respectively. [ABSTRACT FROM AUTHOR]

To address the reactive power optimization control problem in offshore wind farms (OWFs), this paper proposes an adaptive reactive power optimization control strategy based on an improved Particle Swarm Optimization (PSO) algorithm. Firstly, an OWF multi-objective optimization control model is established, with the total sum of voltage deviations at wind turbine (WT) terminals, active power network losses, and reactive power margin of WTs as comprehensive optimization objectives. Innovatively, adaptive weighting coefficients are introduced for the three sub-objectives, enabling the weights of each optimization objective to be adaptively adjusted based on real-time operating conditions, thus enhancing the adaptability of the reactive power optimization model to changes in operating conditions. Secondly, a Uniform Adaptive Particle Swarm Optimization (UAPSO) algorithm is proposed. On one hand, the algorithm initializes the particle swarm using a uniform initialization method; on the other hand, it improves the particle velocity update formula, allowing the inertia coefficient to adaptively adjust based on the number of iterations and the fitness ranking of particles. Simulation results demonstrate the following: (1) Under various operating conditions, the proposed adaptive multi-objective reactive power optimization strategy can ensure the stability of node voltages in offshore wind farms, reduce active power losses, and simultaneously improve reactive power margins. (2) Compared with the traditional PSO algorithm, UAPSO exhibits an approximately 10% improvement in solution speed and enhanced solution accuracy. [ABSTRACT FROM AUTHOR]

This paper presents an improved swarming algorithm that enhances low-illumination images. The algorithm combines a hybrid Harris Eagle algorithm with double gamma (IHHO-BIGA) and incomplete beta (IHHO-NBeta) functions. This paper integrates the concept of symmetry into the improvement steps of the image adaptive enhancement algorithm. The enhanced algorithm integrates chaotic mapping for population initialization, a nonlinear formula for prey energy calculation, spiral motion from the black widow algorithm for global search enhancement, a nonlinear inertia weight factor inspired by particle swarm optimization, and a modified Levy flight strategy to prevent premature convergence to local optima. This paper compares the algorithm's performance with other swarm intelligence algorithms using commonly used test functions. The algorithm's performance is compared against several emerging swarm intelligence algorithms using commonly used test functions, with results demonstrating its superior performance. The improved Harris Eagle algorithm is then applied for image adaptive enhancement, and its effectiveness is evaluated on five low-illumination images from the LOL dataset. The proposed method is compared to three common image enhancement techniques and the IHHO-BIGA and IHHO-NBeta methods. The experimental results reveal that the proposed approach achieves optimal visual perception and enhanced image evaluation metrics, outperforming the existing techniques. Notably, the standard deviation data of the first image show that the IHHO-NBeta method enhances the image by 8.26%, 120.91%, 126.85%, and 164.02% compared with IHHO-BIGA, the single-scale Retinex enhancement method, the homomorphic filtering method, and the limited contrast adaptive histogram equalization method, respectively. The processing time of the improved method is also better than the previous heuristic algorithm. [ABSTRACT FROM AUTHOR]

The optimization and allocation of transport cost savings among stakeholders are two important issues that influence the satisfaction of information providers, drivers and passengers in ridesharing recommendation systems. For optimization issues, finding optimal solutions for nonconvex constrained discrete ridesharing optimization problems poses a challenge due to computational complexity. For the allocation of transport cost savings issues, the development of an effective method to allocate cost savings in ridesharing recommendation systems is an urgent need to improve the acceptability of ridesharing. The hybridization of different metaheuristic approaches has demonstrated its advantages in tackling the complexity of optimization problems. The principle of the hybridization of metaheuristic approaches is similar to a marriage of two people with the goal of having a happy ending. However, the effectiveness of hybrid metaheuristic algorithms is unknown a priori and depends on the problem to be solved. This is similar to a situation where no one knows whether a marriage will have a happy ending a priori. Whether the hybridization of the Firefly Algorithm (FA) with Particle Swarm Optimization (PSO) or Differential Evolution (DE) can work effectively in solving ridesharing optimization problems needs further study. Motivated by deficiencies in existing studies, this paper focuses on the effectiveness of hybrid metaheuristic algorithms for solving ridesharing problems based on the hybridization of FA with PSO or the hybridization of FA with DE. Another focus of this paper is to propose and study the effectiveness of a new method to allocate ridesharing cost savings to the stakeholders in ridesharing systems. The developed hybrid metaheuristic algorithms and the allocation method have been compared with examples of several application scenarios to illustrate their effectiveness. The results indicate that hybridizing FA with PSO creates a more efficient algorithm, whereas hybridizing FA with DE does not lead to a more efficient algorithm for the ridesharing recommendation problem. An interesting finding of this study is very similar to what happens in the real world: "Not all marriages have happy endings". [ABSTRACT FROM AUTHOR]

Numerous surrogate-assisted evolutionary algorithms have been proposed for expensive optimization problems. However, each surrogate model has its own characteristics and different applicable situations, which caused a serious challenge for model selection. To alleviate this challenge, this paper proposes an adaptive surrogate-assisted particle swarm optimization (ASAPSO) algorithm by effectively combining global and local surrogate models, which utilizes the uncertainty level of the current population state to evaluate the approximation ability of the surrogate model in its predictions. In ASAPSO, the transformation between local and global surrogate models is controlled by an adaptive Gaussian distribution parameter with a gauge of the advisability to improve the search process with better local exploration and diversity in uncertain solutions. Four expensive optimization benchmark functions and an airfoil aerodynamic real-world engineering optimization problem are utilized to validate the effectiveness and performance of ASAPSO. Experimental results demonstrate that ASAPSO has superiority in terms of solution accuracy compared with state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative approach to address the distribution network reconfiguration (DNR) challenge, aiming to reduce power loss through an advanced hyperbolic tangent particle swarm optimization (HT-PSO) method. This approach is distinguished by the adoption of a novel hyperbolic tangent function, which effectively limits the rate of change values, offering a significant improvement over traditional sigmoid function-based methods. A key feature of this new approach is the integration of a tunable parameter, δ , into the HT-PSO, enhancing the curve's adaptability. The careful optimization of δ ensures superior control over the rate of change across the entire operational range. This enhanced control mechanism substantially improves the efficiency of the search and convergence processes in DNR. Comparative simulations conducted on 33- and 94-bus systems show an improvement in convergence, demonstrating a more exhaustive exploration of the search space than existing methods documented in the literature based on PSO and variations where functions are proposed for the rate of change of values. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA's capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm's ability to explore and exploit solution spaces. Moreover, DTSA's adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm's efficiency and stability in handling complex optimization issues, and DTSA's robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations. [ABSTRACT FROM AUTHOR]

The growth optimizer (GO) is a novel metaheuristic algorithm designed to tackle complex optimization problems. Despite its advantages of simplicity and high efficiency, GO often encounters localized stagnation when dealing with discretized, high-dimensional, and multi-constraint problems. To address these issues, this paper proposes an enhanced version of GO called CODGBGO. This algorithm incorporates three strategies to enhance its performance. Firstly, the Circle-OBL initialization strategy is employed to enhance the quality of the initial population. Secondly, an exploration strategy is implemented to improve population diversity and the algorithm's ability to escape local optimum traps. Finally, the exploitation strategy is utilized to enhance the convergence speed and accuracy of the algorithm. To validate the performance of CODGBGO, it is applied to solve the CEC2017, CEC2020, 18 feature selection problems, and 4 real engineering optimization problems. The experiments demonstrate that the novel CODGBGO algorithm effectively addresses the challenges posed by complex optimization problems, offering a promising approach. [ABSTRACT FROM AUTHOR]

With the rapid development of new power systems, diverse new power services have imposed stricter requirements on network resources and performance. However, the traditional method of transmitting request data to the IoT management platform for unified processing suffers from large delays due to long transmission distances, making it difficult to meet the delay requirements of new power services. Therefore, to reduce the transmission delay, data transmission, storage and computation need to be performed locally. However, due to the limited resources of individual nodes in the local power wireless communication network, issues such as tight coupling between devices and resources and a lack of flexible allocation need to be addressed. The collaborative allocation of resources among multiple nodes in the local network is necessary to satisfy the multi-dimensional resource requirements of new power services. In response to the problems of limited node resources, inflexible resource allocation, and the high complexity of multi-dimensional resource allocation in local power wireless communication networks, this paper proposes a multi-objective joint optimization model for the collaborative allocation of communication, storage, and computing resources. This model utilizes the computational characteristics of communication resources to reduce the dimensionality of the objective function. Furthermore, a mouse swarm optimization algorithm based on multi-strategy improvements is proposed. The simulation results demonstrate that this method can effectively reduce the total system delay and improve the utilization of network resources. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative Particle Swarm Optimization (PSO) Algorithm incorporating Sobol and Halton random number samplings. It evaluates the enhanced PSO's performance against conventional PSO employing Monte Carlo random number samplings. The comparison involves assessing the algorithms across nine benchmark problems and the renowned Travelling Salesman Problem (TSP). The results reveal consistent enhancements achieved by the enhanced PSO utilizing Sobol/Halton samplings across the benchmark problems. Particularly noteworthy are the Sobol-based PSO improvements in iterations and the computational times for the benchmark problems. These findings underscore the efficacy of employing Sobol and Halton random number generation methods to enhance algorithm efficiency. [ABSTRACT FROM AUTHOR]

To address the issue of local optima encountered during the multi-objective optimization process with the Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm, this paper introduces an enhanced version of the NSGA-II. This improved NSGA-II incorporates polynomial and simulated binary crossover operators into the genetic algorithm's crossover phase to refine its performance. For evaluation purposes, the classic ZDT benchmark functions are employed. The findings reveal that the enhanced NSGA-II algorithm achieves higher convergence accuracy and surpasses the performance of the original NSGA-II algorithm. When applied to the machining of the high-hardness material 20MnCrTi, four algorithms were utilized: the improved NSGA-II, the conventional NSGA-II, NSGA-III, and MOEA/D. The experimental outcomes show that the improved NSGA-II algorithm delivers a more optimal combination of process parameters, effectively enhancing the workpiece's surface roughness and material removal rate. This leads to a significant improvement in the machining quality of the workpiece surface, demonstrating the superiority of the improved algorithm in optimizing machining processes. [ABSTRACT FROM AUTHOR]

The various applications of bearing-only sensor networks for detection and localization are becoming increasingly widespread and important. The array layout of the bearing-only sensor network seriously impacts the detection performance. This paper proposes a multi-strategy fusion improved adaptive mayfly algorithm (MIAMA) in a bearing-only sensor network to perform layout planning on the geometric configuration of the optimal detection. Firstly, the system model of a bearing-only sensor network was constructed, and the observability of the system was analyzed based on the Cramer–Rao Lower Bound and Fisher Information Matrix. Then, in view of the limitations of the traditional mayfly algorithm, which has a single initial population and no adaptability and poor global search capabilities, multi-strategy fusion improvements were carried out by introducing Tent chaos mapping, the adaptive inertia weight factor, and Random Opposition-based Learning. Finally, three simulation experiments were conducted. Through comparison with the Particle Swarm Optimization (PSO) algorithm, Mayfly Algorithm (MA), and Genetic Algorithm (GA), the effectiveness and superiority of the proposed MIAMA were validated. [ABSTRACT FROM AUTHOR]

Deepfakes are digital audio, video, or images manipulated using machine learning algorithms. These manipulated media files can convincingly depict individuals doing or saying things they never actually did. Deepfakes pose significant risks to our lives, including national security, financial markets, and personal privacy. The ability to create convincing deep fakes can also harm individuals' reputations and can be used to spread disinformation and fake news. As such, there is a growing need for reliable and accurate methods to detect deep fakes and prevent their harmful effects. In this paper, a hybrid convolutional neural network (CNN) and recurrent neural network (RNN) with a particle swarm optimization (PSO) algorithm is utilized to demonstrate a deep learning strategy for detecting deepfake videos. High accuracy, sensitivity, specificity, and F1 score were attained by the proposed approach when tested on two publicly available datasets: Celeb-DF and the Deepfake Detection Challenge Dataset (DFDC). Specifically, the proposed method achieved an average accuracy of 97.26% on Celeb-DF and an average accuracy of 94.2% on DFDC. The results were compared to other state-of-the-art methods and showed that the proposed method outperformed many. The proposed method can effectively detect deepfake videos, which is essential for identifying and preventing the spread of manipulated content online. [ABSTRACT FROM AUTHOR]

The objective of task allocation in unmanned systems is to complete tasks at minimal costs. However, the current algorithms employed for coordinating multiple unmanned systems in task allocation tasks frequently converge to local optima, thus impeding the identification of the best solutions. To address these challenges, this study builds upon the sheep flock optimization algorithm (SFOA) by preserving individuals eliminated during the iterative process within a prior knowledge set, which is continuously updated. During the reproduction phase of the algorithm, this prior knowledge is utilized to guide the generation of new individuals, preventing their rapid reconvergence to local optima. This approach aids in reducing the frequency at which the algorithm converges to local optima, continually steering the algorithm towards the global optimum and thereby enhancing the efficiency of task allocation. Finally, various task scenarios are presented to evaluate the performances of various algorithms. The results show that the algorithm proposed in this paper is more likely than other algorithms to escape from local optima and find the global optimum. [ABSTRACT FROM AUTHOR]

With the gradual emergence of customized manufacturing, intelligent manufacturing systems have experienced widespread adoption, leading to a surge in research interests in the associated problem of intelligent scheduling. In this paper, we study the flexible job shop scheduling problem (FJSP) with setup time, handling time, and processing time in a multi-equipment work center production environment oriented toward smart manufacturing and make-to-order requirements. A mathematical model with the optimization objectives of minimizing the maximum completion time, the total number of machine adjustments, the total number of workpieces handled and the total load of the machine is constructed, and an improved discrete particle swarm algorithm based on Pareto optimization and a nonlinear adaptive inertia weighting strategy is proposed to solve the model. By integrating the model characteristics and algorithm features, a hybrid initialization method is designed to generate a higher-quality initialized population. Next, three cross-variance operators are used to implement particle position updates to maintain information sharing among particles. Then, the performance effectiveness of this algorithm is verified by testing and analyzing 15 FJSP test instances. Finally, the feasibility and effectiveness of the designed algorithm for solving multi-objective FJSPs are verified by designing an FJSP test example that includes processing time, setup time and handling time. [ABSTRACT FROM AUTHOR]

Today, the IoT has become a vital part of our lives because it has entered into the precise details of human life, like smart homes, healthcare, eldercare, vehicles, augmented reality, and industrial robotics. Cloud computing and fog computing give us services to process IoT tasks, and we are seeing a growth in the number of IoT devices every day. This massive increase needs huge amounts of resources to process it, and these vast resources need a lot of power to work because the fog and cloud are based on the term pay-per-use. We make to improve the performance and cost (PC) algorithm to give priority to the high-profit cost and to reduce energy consumption and Makespan; in this paper, we propose the performance and cost–gray wolf optimization (PC-GWO) algorithm, which is the combination of the PCA and GWO algorithms. The results of the trial reveal that the PC-GWO algorithm reduces the average overall energy usage by 12.17%, 11.57%, and 7.19%, and reduces the Makespan by 16.72%, 16.38%, and 14.107%, with the best average resource utilization enhanced by 13.2%, 12.05%, and 10.9% compared with the gray wolf optimization (GWO) algorithm, performance and cost algorithm (PCA), and Particle Swarm Optimization (PSO) algorithm. [ABSTRACT FROM AUTHOR]

The prefabricated composite slab (PCS) is an essential horizontal component in a building, which is made of a precast part and a cast-in-place concrete layer. In practice, the floor should be split into many small PCSs for the convenience of manufacturing and installation. Currently, the splitting design of PCS mostly relies on sound knowledge and valuable experience of construction. While rule-based parametric design tools using building information modeling (BIM) can facilitate PCS splitting, the generated solution is suboptimal and limited. This paper presents an intelligent BIM-based framework to automatically complete the splitting design of PCSs. A collaborative optimization model is formulated to minimize the composite costs of manufacturing and installation. Individuals with similar area information are grouped into a subpopulation, and the optimization objective is to minimize the specifications and quantities of PCSs. Through the correlation information within the subpopulation and the shared information among each other, the variable correlation is eliminated to accomplish the task of collaborative optimization. The multipopulation coevolution particle swarm optimization (PSO) algorithm is implemented for the collaborative optimization model to determine the sizes and positions of all PCSs. The proposed framework is applied in the optimized splitting design of PCSs in a standard floor to demonstrate its practicability and efficiency. [ABSTRACT FROM AUTHOR]

As a structural indicator of dense subgraphs, k-core has been widely used in community search due to its concise and efficient calculation. Many community search algorithms have been expanded on the basis of k-core. However, relevant algorithms often set k values based on empirical analysis of datasets or require users to input manually. Once users are not familiar with the graph network structure, they may miss the optimal solution due to an improper k setting. Especially in attribute social networks, characterizing communities with only k-cores may lead to a lack of semantic interpretability of communities. Consequently, this article proposes a method for identifying the optimal k-core with the greatest attribute score in the attribute social network as the target community. The difficulty of the problem is that the query needs to integrate both structural and textual indicators of the community while fully considering the diversity of attribute scoring functions. To effectively reduce computational costs, we incorporate the topological characteristics of the k-core and the attribute characteristics of entities to construct a hierarchical forest. It is worth noting that we name tree nodes in a way similar to pre-order traversal and can maintain the order of all tree nodes during the forest creation process. In such an attribute forest, it is possible to quickly locate the initial solution containing all query vertices and reuse intermediate results during the process of expanding queries. We conducted effectiveness and performance experiments on multiple real datasets. As the results show, attribute scoring functions are not monotonic, and the algorithm proposed in this paper can avoid scores falling into local optima. With the help of the attribute k-core forest, the actual query time of the Advanced algorithm has improved by two orders of magnitude compared to the BaseLine algorithm. In addition, the average F1 score of our target community has increased by 2.04 times and 26.57% compared to ACQ and SFEG, respectively. [ABSTRACT FROM AUTHOR]

Temperature is one of the most important factors significantly affecting damage detection performance in civil engineering. A new method called the Adaptive Bandwidth Filter Algorithm (ABFA) is proposed in this paper to separate the temperature effect from quasi-static long-term structural health monitoring data. The Adaptive Bandwidth Filter Algorithm (ABFA) is referred to as an algorithm of automatically adjusting the frequency bandwidth filter via the particle swarm optimization (PSO) algorithm. Considering the obvious multi-scale feature of the collected data of civil structure, the acquired time series are divided into different time scales (for example, day, month, year, etc.), and these scales in the frequency domain correspond to the center frequencies of the adaptive bandwidth filter. The temperature effect on structure responses across different time scales is thereafter explored by adaptively adjusting the frequency bandwidth of the filter based on the known center frequencies of different scales. The relationship between the temperature and the structure responses is established through statistical regression facilitated by sufficient in situ monitoring data. Simulation and experiment results show the very promising performance of the proposed algorithm and decouple the temperature effect accurately from the contaminated data; thus an enhanced capability of damage detection is achieved. [ABSTRACT FROM AUTHOR]

The feature extraction problem of coupled vibration signals with multiple fault modes of planetary gears has not been solved effectively. At present, kernel principal component analysis (KPCA) is usually used to solve nonlinear feature extraction problems, but the kernel function selection and its blind parameter setting greatly affect the performance of the algorithm. For the optimization of the kernel parameters, it is very urgent to study the theoretical modeling to improve the performance of kernel principal component analysis. Aiming at the deficiency of kernel principal component analysis using the single-kernel function for the nonlinear mapping of feature extraction, a dual-kernel function based on the flexible linear combination of a radial basis kernel function and polynomial kernel function is proposed. In order to increase the scientificity of setting the kernel parameters and the flexible weight coefficient, a mathematical model for dual-kernel parameter optimization was constructed based on a Fisher criterion discriminant analysis. In addition, this paper puts forward a swarm intelligent fusion algorithm to increase this method's advantages for optimization problems, involving the shuffled frog leaping algorithm combined with particle swarm optimization (SFLA-PSO). The new fusion algorithm was applied to optimize the kernel parameters to improve the performance of KPCA nonlinear mapping. The optimized dual-kernel function KPCA (DKKPCA) was applied to the feature extraction of planetary gear wear damage, and had a good identification effect on the fuzzy damage boundary of the planetary gearbox. The conclusion is that the DKKPCA optimized by the SFLA-PSO swarm intelligent fusion algorithm not only effectively improves the performance of feature extraction, but also enables the adaptive selection of parameters for the dual-kernel function and the adjustment of weights for the basic kernel function through a certain degree of optimization; so, this method has great potential for practical use. [ABSTRACT FROM AUTHOR]

In situations where photovoltaic (PV) systems are exposed to varying light intensities, the conventional maximum power point tracking (MPPT) control algorithm may become trapped in a local optimal state. In order to address this issue, a two-step MPPT control strategy is suggested utilizing an improved tuna swarm optimization (ITSO) algorithm along with an adaptive perturbation and observation (AP&O) technique. For the sake of enhancing population diversity, the ITSO algorithm is initialized by the SPM chaos mapping population. In addition, it also uses the parameters of the spiral feeding strategy of nonlinear processing and the Levy flight strategy adjustment of the weight coefficient to enhance global search ability. In the two-stage MPPT algorithm, the ITSO is applied first to track the vicinity of the global maximum power point (MPP), and then it switches to the AP&O method. The AP&O method's exceptional local search capability enables the global MPP to be tracked with remarkable speed and precision. To confirm the effectiveness of the suggested algorithm, it is evaluated against fuzzy logic control (FLC), standard tuna swarm optimization (TSO), grey wolf optimization (GWO), particle swarm optimization (PSO), and AP&O. Finally, the proposed MPPT strategy is verified by the MATLAB R2022b and RT-LAB experimental platform. The findings indicate that the suggested method exhibits improved precision and velocity in tracking, efficiently following the global MPP under different shading conditions. [ABSTRACT FROM AUTHOR]

To address the issues with traditional genetic algorithm (GA) path planning, which often results in redundant path nodes and local optima, we propose an Improved Genetic Algorithm that incorporates an ant colony algorithm (ACO). Firstly, a new population initialization method is proposed. This method adopts a higher-quality random point generation strategy to generate random points centrally near the start and end of connecting lines. It combines the improved ACO algorithm to connect these random points quickly, thus greatly improving the quality of the initial population. Secondly, path smoothness constraints are proposed in the adaptive function. These constraints reduce the large-angle turns and non-essential turns, improving the smoothness of the generated path. The algorithm integrates the roulette and tournament methods in the selection stage to enhance the searching ability and prevent premature convergence. Additionally, the crossover stage introduces the edit distance and a two-layer crossover operation based on it to avoid ineffective crossover and improve convergence speed. In the mutation stage, we propose a new mutation method and introduce a three-stage mutation operation based on the idea of simulated annealing. This makes the mutation operation more effective and efficient. The three-stage mutation operation ensures that the mutated paths also have high weights, increases the diversity of the population, and avoids local optimality. Additionally, we added a deletion operation to eliminate redundant nodes in the paths and shorten them. The simulation software and experimental platform of ROS (Robot Operating System) demonstrate that the improved algorithm has better path search quality and faster convergence speed. This effectively prevents the algorithm from maturing prematurely and proves its effectiveness in solving the path planning problem of AGV (automated guided vehicle). [ABSTRACT FROM AUTHOR]

Currently, magnetic gradient tensor-based localization methods face challenges such as significant errors in geomagnetic field estimation, susceptibility to local optima in optimization algorithms, and inefficient performance. In addressing these issues, this article propose a two-point localization method under the constraint of overlaying geometric invariants. This method initially establishes the relationship between the target position and the magnetic gradient tensor by substituting an intermediate variable for the magnetic moment. Exploiting the property of the eigenvector corresponding to the minimum absolute eigenvalue being perpendicular to the target position vector, this constraint is superimposed to formulate a nonlinear system of equations of the target's position. In the process of determining the target position, the Nara method is employed for obtaining the initial values, followed by the utilization of the Levenberg–Marquardt algorithm to derive a precise solution. Experimental validation through both simulations and experiments confirms the effectiveness of the proposed method. The results demonstrate its capability to overcome the challenges faced by a single-point localization method in the presence of some errors in geomagnetic field estimation. In comparison to traditional two-point localization methods, the proposed method exhibits the highest precision. The localization outcomes under different noise conditions underscore the robust noise resistance and resilience of the proposed method. [ABSTRACT FROM AUTHOR]

Featured Application: Simultaneous Localization and Mapping of autonomous cleaning and inspection robots operating in the photovoltaic power station scene. Due to various typical unstructured factors in the environment of photovoltaic power stations, such as high feature similarity, weak textures, and simple structures, the motion model of the ORB-SLAM2 algorithm performs poorly, leading to a decline in tracking accuracy. To address this issue, we propose PE-SLAM, which improves the ORB-SLAM2 algorithm's motion model by incorporating the particle swarm optimization algorithm combined with epipolar constraint to eliminate mismatches. First, a new mutation strategy is proposed to introduce perturbations to the pbest (personal best value) during the late convergence stage of the PSO algorithm, thereby preventing the PSO algorithm from falling into local optima. Then, the improved PSO algorithm is used to solve the fundamental matrix between two images based on the feature matching relationships obtained from the motion model. Finally, the epipolar constraint is applied using the computed fundamental matrix to eliminate incorrect matches produced by the motion model, thereby enhancing the tracking accuracy and robustness of the ORB-SLAM2 algorithm in unstructured photovoltaic power station scenarios. In feature matching experiments, compared to the ORB algorithm and the ORB+HAMMING algorithm, the ORB+PE-match algorithm achieved an average accuracy improvement of 19.5%, 14.0%, and 6.0% in unstructured environments, respectively, with better recall rates. In the trajectory experiments of the TUM dataset, PE-SLAM reduced the average absolute trajectory error compared to ORB-SLAM2 by 29.1% and the average relative pose error by 27.0%. In the photovoltaic power station scene mapping experiment, the dense point cloud map constructed has less overlap and is complete, reflecting that PE-SLAM has basically overcome the unstructured factors of the photovoltaic power station scene and is suitable for applications in this scene. [ABSTRACT FROM AUTHOR]

In response to challenges such as voltage limit violations, excessive currents, and power imbalances caused by the integration of distributed photovoltaic (distributed PV) systems into the distribution network, this study proposes at two-level optimization configuration method. This method effectively balances the grid capacity and reduces the active power losses, thereby decreasing the operating costs. The upper-level optimization enhances the distribution network's capacity by determining the siting and sizing of distributed PV devices. The lower-level aims to reduce the active power losses, improve the voltage stability margins, and minimize the voltage deviations. The upper-level planning results, which include the siting and sizing of the distributed PV, are used as initial conditions for the lower level. Subsequently, the lower level feeds back its optimization results to further refine the configuration. The model is solved using an improved second-order oscillating chaotic map particle swarm optimization algorithm (SCMPSO) combined with a second-order relaxation method. The simulation experiments on an improved IEEE 33-bus test system show that the SCMPSO algorithm can effectively reduce the voltage deviations, decrease the voltage fluctuations, lower the active power losses in the distribution network, and significantly enhance the power quality. [ABSTRACT FROM AUTHOR]

Thrust allocation (TA) plays a critical role in the dynamic positioning system (DPS). The task of TA is to allocate the rotational speed and angle of each thruster to generate the generalized control forces. Most studies take TA as a single-objective optimization problem; however, TA is a multi-objective optimization problem (MOP), which needs to satisfy multiple conflicting allocation objectives simultaneously. This study proposes an improved multi-objective particle swarm optimization (IMOPSO) method to deal with the non-convex MOP of TA. The objective functions of reducing the allocation error, and minimizing the power consumption and the tear-and-wear of thrusters under physical constraints, are established and solved via MOPSO. To enhance the global seeking ability, the improved mutation strategy combined with the roulette wheel mechanism is adopted. It is shown through test data that IMOPSO converges better than multi-objective algorithms such as MOPSO and nondominated sorting genetic algorithm II (NSGA-II). Simulations are conducted for a DP ship with two propeller–rudder combinations. The simulation results with the single-objective PSO algorithm show that the proposed IMOPSO algorithm reduces thrust allocation errors in the three directions of surge, sway, and yaw by 48.48%, 39.64%, and 15.02%, respectively, and reduces power consumption by 44.53%, which demonstrates the feasibility and effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

A novel short-term wind power forecasting method called mRMR-PSO-LSTM was proposed to address the limitations of traditional methods in ignoring the redundancy and temporal dynamics of meteorological features. The methods employed the Minimum Redundancy Maximum Relevance (mRMR) algorithm to select relevant meteorological features while minimizing redundancy. Additionally, the Particle Swarm Optimization (PSO) algorithm was utilized to optimize the parameters of the Long Short-Term Memory (LSTM) network, thereby enhancing its forecasting accuracy. Experimental results demonstrated that the proposed mRMR-PSO-LSTM outperforms FNN, GRU, and PSO-LSTM in four key evaluation metrics. [ABSTRACT FROM AUTHOR]

The coefficients of friction (COFs) is one of the most important parameters used to evaluate the braking performance of a friction brake. Many indicators that affect the safety and comfort of automobiles are associated with brake COFs. The manufacturers of friction brakes and their components are required to spend huge amounts of time and money to carry out experimental tests to ensure the COFs of a newly developed braking system meet the required standards. In order to save time and costs for the development of new friction brake applications, the GRU (Gate Recurrent Unit) algorithm optimized by the improved PSO (particle swarm optimization) global optimization method is employed in this work to predict brake COFs based on existing experimental data obtained from friction braking dynamometer tests. Compared with the LSTM (Long Short-Term Memory) method, the GRU algorithm optimized by PSO avoids the accuracy reduction problem caused by gradient descent in the training process and hence reduces the prediction error and computational cost. The combined PSO–GRU algorithm increases the coefficient of determination (R2) of the prediction by 4.7%, reduces the MAE (mean absolute error) by 14.3%, and increases the prediction speed by 40.1% compared with the standalone GRU method. The prediction method based on machine learning proposed in this study can not only be applied to the prediction of automobile braking COFs but also for other frictional system problems, such as the prediction of braking noise and the friction of various bearing transmission components. [ABSTRACT FROM AUTHOR]

In the complex and dynamic landscape of cyber threats, organizations require sophisticated strategies for managing Cybersecurity Operations Centers and deploying Security Information and Event Management systems. Our study enhances these strategies by integrating the precision of well-known biomimetic optimization algorithms—namely Particle Swarm Optimization, the Bat Algorithm, the Gray Wolf Optimizer, and the Orca Predator Algorithm—with the adaptability of Deep Q-Learning, a reinforcement learning technique that leverages deep neural networks to teach algorithms optimal actions through trial and error in complex environments. This hybrid methodology targets the efficient allocation and deployment of network intrusion detection sensors while balancing cost-effectiveness with essential network security imperatives. Comprehensive computational tests show that versions enhanced with Deep Q-Learning significantly outperform their native counterparts, especially in complex infrastructures. These results highlight the efficacy of integrating metaheuristics with reinforcement learning to tackle complex optimization challenges, underscoring Deep Q-Learning's potential to boost cybersecurity measures in rapidly evolving threat environments. [ABSTRACT FROM AUTHOR]

A fast time synchronization method for large-scale LEO satellite networks based on a bionic algorithm is proposed. Because the inter-satellite links are continuously established and interrupted due to the relative motion of the satellites, the topology of the LEO satellite networks is time varying. Firstly, according to the ephemeris information in navigation messages, a connection table which records the connections between satellites is generated. Then, based on the connection table, the current satellite network topology is calculated and generated. Furthermore, a bionic algorithm is used to select some satellites as time source nodes and calculate the hierarchy of the clock transmission tree. By taking the minimum level of the time transmission tree as the optimization objective, the time source nodes and the clock stratums of the whole satellite networks are obtained. Finally, the onboard computational center broadcasts the time layer table to all the satellites in the LEO satellite networks and the time synchronization links can be established or recovered fast. [ABSTRACT FROM AUTHOR]

Increased performance with reduced overall cost, and precise design and optimization of launch systems are critical to affordability. In this respect, the use of hybrid motors has increased to ease handling based on motor selection. In the current study, the launch vehicle's performance is enhanced by incorporating a hybrid rocket motor into the last stage and optimized using particle swarm optimization to develop a six-degrees-of-freedom tool. This modification aims to increase payload placement flexibility, facilitate handling, and reduce costs. Thanks to the interactive subsystems within this research, this innovative study more comprehensively considers the launch vehicle trajectory design problem, allowing the simultaneous consideration of the effect of launch vehicle geometry along with other parameters in the system. In this context, the proposed method is applied to the Minotaur-I launch vehicle, and contributions of the detailed design and optimization are presented. Optimization results show that the percentage differences between these models for the original vehicle were observed to be 11.55% in velocity and 8.02% in altitude. However, there were differences of 10.06% and 48.8%, 15.8% and 23.2%, and 19.5% and 78.9% in altitudes and velocities when the center of gravity and moment of inertia changes were neglected, and constant aerodynamic coefficients were assumed, respectively. In all these cases, it was observed that the flight path angle was not close to zero. Moreover, the same mission was achieved by the launch vehicle with the optimized hybrid last stage and the propulsion performance was increased by about 7.64% based on the specific impulse and total impulse-over-weight ratio. [ABSTRACT FROM AUTHOR]

Gas concentration monitoring is an effective method for predicting gas disasters in mines. In response to the shortcomings of low efficiency and accuracy in conventional gas concentration prediction, a new method for gas concentration prediction based on Particle Swarm Optimization and Long Short-Term Memory Network (PSO-LSTM) is proposed. First, the principle of the PSO-LSTM fusion model is analyzed, and the PSO-LSTM gas concentration analysis and prediction model is constructed. Second, the gas concentration data are normalized and preprocessed. The PSO algorithm is utilized to optimize the training set of the LSTM model, facilitating the selection of the training data set for the LSTM model. Finally, the MAE, RMSE, and coefficient of determination R2 evaluation indicators are proposed to verify and analyze the prediction results. Gas concentration prediction comparison and verification research was conducted using gas concentration data measured in a mine as the sample data. The experimental results show that: (1) The maximum RMSE predicted using the PSO-LSTM model is 0.0029, and the minimum RMSE is 0.0010 when the sample size changes. This verifies the reliability of the prediction effect of the PSO-LSTM model. (2) The predictive performance of all models ranks as follows: PSO-LSTM > SVR-LSTM > LSTM > PSO-GRU. Comparative analysis with the LSTM model demonstrates that the PSO-LSTM model is more effective in predicting gas concentration, further confirming the superiority of this model in gas concentration prediction. [ABSTRACT FROM AUTHOR]

This study presents a swarm-control algorithm to overcome the limitations inherent to single-object systems. The leader–follower swarm-control method was selected for its ease of mathematical interpretation and theoretical potential for the unlimited expansion of followers. However, a known drawback of this method is the risk of swarm collapse when the leader breaks down. To address this, a fault-coping algorithm was developed and supplemented to the leader–follower swarm-control method, which enabled the detection and responsive handling of failures, thereby ensuring mission continuity. Comprehensive data, including voltage, current, thruster speed, position, and heading angle were acquired and analyzed using sensors on unmanned surface vehicles (USVs) to monitor potential failures. In the case of a failure, such as thruster malfunction, the nearest USV seamlessly takes charge of the mission under the guidance of the fault-coping algorithm. The leader–follower swarm-control and fault-coping algorithms were successfully validated through actual sea area tests, which confirmed their operational efficacy. This study affirms the well-formed nature of the USV swarm formation and demonstrates the effectiveness of the fault-coping algorithm in ensuring normal mission performance under the virtual failure scenarios applied to the leader USV. [ABSTRACT FROM AUTHOR]

Vector Quantization (VQ) is a technique with a wide range of applications. For example, it can be used for image compression. The codebook design for VQ has great significance in the quality of the quantized signals and can benefit from the use of swarm intelligence. Initialization of the Linde–Buzo–Gray (LBG) algorithm, which is the most popular VQ codebook design algorithm, is a step that directly influences VQ performance, as the convergence speed and codebook quality depend on the initial codebook. A widely used initialization alternative is random initialization, in which the initial set of codevectors is drawn randomly from the training set. Other initialization methods can lead to a better quality of the designed codebooks. The present work evaluates the impacts of initialization strategies on swarm intelligence algorithms for codebook design in terms of the quality of the designed codebooks, assessed by the quality of the reconstructed images, and in terms of the convergence speed, evaluated by the number of iterations. Initialization strategies consist of a combination of codebooks obtained by initialization algorithms from the literature with codebooks composed of vectors randomly selected from the training set. The possibility of combining different initialization techniques provides new perspectives in the search for the quality of the VQ codebooks. Nine initialization strategies are presented, which are compared with random initialization. Initialization strategies are evaluated on the following algorithms for codebook design based on swarm clustering: modified firefly algorithm—Linde–Buzo–Gray (M-FA-LBG), modified particle swarm optimization—Linde–Buzo–Gray (M-PSO-LBG), modified fish school search—Linde–Buzo–Gray (M-FSS-LBG) and their accelerated versions (M-FA-LBGa, M-PSO-LBGa and M-FSS-LBGa) which are obtained by replacing the LBG with the accelerated LBG algorithm. The simulation results point out to the benefits of the proposed initialization strategies. The results show gains up to 4.43 dB in terms of PSNR for image Clock with M-PSO-LBG codebooks of size 512 and codebook design time savings up to 67.05% for image Clock, with M-FF-LBGa codebooks with size N = 512 , by using initialization strategies in substitution to Random initialization. [ABSTRACT FROM AUTHOR]

Currently, the multi-machine collaboration of agricultural machinery is one of the international frontiers and a topic of research interest in the field of agricultural equipment. However, the multi-machine cooperative operation of agricultural machinery is mostly limited to the research on task goal planning and cooperative path optimization of a single operation. To address the mentioned shortcomings, this study addresses the problem of multi-machine cooperative operation of fertilizer applicators in fields with different fertility and fertilizer cooperative distribution of fertilizer trucks. The research uses the task allocation method of a multi-machine cooperative operation of applying fertilizer-transporting fertilizer. First, the problems of fertilizer applicator operation and fertilizer truck fertilizer distribution are defined, and the operating time and the distribution distance are used as optimization objectives to construct functions to establish task allocation mathematical models. Second, a Chaos–Cauchy Fireworks Algorithm (CCFWA), which includes a discretized decoding method, a population initialization with a chaotic map, and a Cauchy mutation operation, is developed. Finally, the proposed algorithm is verified by tests in an actual scenario of fertilizer being applied in the test area of Jimo District, Qingdao City, Shandong Province. The results show that compared to the Fireworks Algorithm, Genetic Algorithm, and Particle Swarm Optimization, the proposed CCFWA can address the problem of falling into a local optimum while guaranteeing the convergence speed. Also, the variance of the CCFWA is reduced by more than 48% compared with the other three algorithms. The proposed method can realize multi-machine cooperative operation and precise distribution of seeds and fertilizers for multiple seeding-fertilizer applicators and fertilizer trucks. [ABSTRACT FROM AUTHOR]

In recent years, the modeling and simulation of lithium-ion batteries have garnered attention due to the rising demand for reliable energy storage. Accurate charge cycle predictions are fundamental for optimizing battery performance and lifespan. This study compares particle swarm optimization (PSO) and grey wolf optimization (GWO) algorithms in modeling a commercial lithium-ion battery, emphasizing the voltage behavior and the current delivered to the battery. Bio-inspired optimization tunes parameters to reduce the root mean square error (RMSE) between simulated and experimental outputs. The model, implemented in MATLAB/Simulink, integrates electrochemical parameters and estimates battery behavior under varied conditions. The assessment of terminal voltage revealed notable enhancements in the model through both the PSO and GWO algorithms compared to the non-optimized model. The GWO-optimized model demonstrated superior performance, with a reduced RMSE of 0.1700 (25 °C; 3.6 C, 455 s) and 0.1705 (25 °C; 3.6 C, 10,654 s) compared to the PSO-optimized model, achieving a 42% average RMSE reduction. Battery current was identified as a key factor influencing the model analysis, with optimized models, particularly the GWO model, exhibiting enhanced predictive capabilities and slightly lower RMSE values than the PSO model. This offers practical implications for battery integration into energy systems. Analyzing the execution time with different population values for PSO and GWO provides insights into computational complexity. PSO exhibited greater-than-linear dynamics, suggesting a polynomial complexity of O(nk), while GWO implied a potential polynomial complexity within the range of O(nk) or O(2n) based on execution times from populations of 10 to 1000. [ABSTRACT FROM AUTHOR]

Orthogonal frequency division multiplexing (OFDM) in 5G has many advantages; however, one of the disadvantages is that the superposition of a large number of subcarriers leads to a high peak-to-average power ratio (PAPR) of the transmit signal. A high PAPR results in high-power amplifier distortion and performance degradation. The partial transmit sequence (PTS) algorithm is commonly used for PAPR reduction. It enumerates all combinations of phase factors, weighs the signal using each phase factor combination, and finds the set of phase factors that minimizes the PAPR value of the OFDM signal. The advantage of the PTS is that it determines the optimal solution through enumeration; however, its major drawback is the higher complexity caused by the use of enumeration. Some studies have introduced the discrete particle swarm optimization (DPSO) algorithm instead of enumeration to determine the optimal solution of the PTS algorithm. As an excellent optimization method, the DPSO algorithm represents each individual as a solution during the optimization. Through iterative updates of the initial population, individuals in the population continuously move closer to the optimal solution. This approach significantly reduces complexity compared with the exhaustive enumeration used in the traditional PTS algorithm. However, the disadvantage of the general DPSO algorithm is that it can result in premature and early convergence, which leads to degradation of the PAPR reduction performance. In this study, we propose an improved method based on the general DPSO-based PTS algorithm, and the improved algorithm MDPSO-PTS adopts dynamic time-varying learning factors, which can find the optimal combination of phase factors more efficiently. The MDPSO-PTS algorithm expands the search space when seeking the optimal combination of phase factors. This avoids the drawback of premature convergence commonly observed in general DPSO-PTS algorithms, preventing early consideration of local optima as global optima. A comparative simulation of the improved MDPSO-PTS algorithm with the general DPSO-PTS algorithm shows that the improved algorithm has stronger PAPR reduction, whereas the complexity remains basically unchanged. A comparative simulation with the traditional PTS algorithm shows a significant reduction in complexity, with only a slight, acceptable loss of reduction performance. [ABSTRACT FROM AUTHOR]

Signal modulation recognition is often reliant on clustering algorithms. The fuzzy c-means (FCM) algorithm, which is commonly used for such tasks, often converges to local optima. This presents a challenge, particularly in low-signal-to-noise-ratio (SNR) environments. We propose an enhanced FCM algorithm that incorporates particle swarm optimization (PSO) to improve the accuracy of recognizing M-ary quadrature amplitude modulation (MQAM) signal orders. The process is a two-step clustering process. First, the constellation diagram of the received signal is used by a subtractive clustering algorithm based on SNR to figure out the initial number of clustering centers. The PSO-FCM algorithm then refines these centers to improve precision. Accurate signal classification and identification are achieved by evaluating the relative sizes of the radii around the cluster centers within the MQAM constellation diagram and determining the modulation order. The results indicate that the SC-based PSO-FCM algorithm outperforms the conventional FCM in clustering effectiveness, notably enhancing modulation recognition rates in low-SNR conditions, when evaluated against a variety of QAM signals ranging from 4QAM to 64QAM. [ABSTRACT FROM AUTHOR]

In the optimization field, the ability to efficiently tackle complex and high-dimensional problems remains a persistent challenge. Metaheuristic algorithms, with a particular emphasis on their autonomous variants, are emerging as promising tools to overcome this challenge. The term "autonomous" refers to these variants' ability to dynamically adjust certain parameters based on their own outcomes, without external intervention. The objective is to leverage the advantages and characteristics of an unsupervised machine learning clustering technique to configure the population parameter with autonomous behavior, and emphasize how we incorporate the characteristics of search space clustering to enhance the intensification and diversification of the metaheuristic. This allows dynamic adjustments based on its own outcomes, whether by increasing or decreasing the population in response to the need for diversification or intensification of solutions. In this manner, it aims to imbue the metaheuristic with features for a broader search of solutions that can yield superior results. This study provides an in-depth examination of autonomous metaheuristic algorithms, including Autonomous Particle Swarm Optimization, Autonomous Cuckoo Search Algorithm, and Autonomous Bat Algorithm. We submit these algorithms to a thorough evaluation against their original counterparts using high-density functions from the well-known CEC LSGO benchmark suite. Quantitative results revealed performance enhancements in the autonomous versions, with Autonomous Particle Swarm Optimization consistently outperforming its peers in achieving optimal minimum values. Autonomous Cuckoo Search Algorithm and Autonomous Bat Algorithm also demonstrated noteworthy advancements over their traditional counterparts. A salient feature of these algorithms is the continuous nature of their population, which significantly bolsters their capability to navigate complex and high-dimensional search spaces. However, like all methodologies, there were challenges in ensuring consistent performance across all test scenarios. The intrinsic adaptability and autonomous decision making embedded within these algorithms herald a new era of optimization tools suited for complex real-world challenges. In sum, this research accentuates the potential of autonomous metaheuristics in the optimization arena, laying the groundwork for their expanded application across diverse challenges and domains. We recommend further explorations and adaptations of these autonomous algorithms to fully harness their potential. [ABSTRACT FROM AUTHOR]