Parameter Self-Tuning of Servo Control Systems Based on Nonlinear Adaptive Whale Optimization Algorithm

Soil element monitoring wireless sensor networks (SEMWSNs) are widely used in soil element monitoring agricultural activities. SEMWSNs monitor changes in soil elemental content during agriculture products growing through nodes. Based on the feedback from the nodes, farmers adjust irrigation and fertilization strategies on time, thus promoting the economic growth of crops. The critical issue in SEMWSNs coverage studies is to achieve maximum coverage of the entire monitoring field by adopting a smaller number of sensor nodes. In this study, a unique adaptive chaotic Gaussian variant snake optimization algorithm (ACGSOA) is proposed for solving the above problem, which also has the advantages of solid robustness, low algorithmic complexity, and fast convergence. A new chaotic operator is proposed in this paper to optimize the position parameters of individuals, enhancing the convergence speed of the algorithm. Moreover, an adaptive Gaussian variant operator is also designed in this paper to effectively avoid SEMWSNs from falling into local optima during the deployment process. Simulation experiments are designed to compare ACGSOA with other widely used metaheuristics, namely snake optimizer (SO), whale optimization algorithm (WOA), artificial bee colony algorithm (ABC), and fruit fly optimization algorithm (FOA). The simulation results show that the performance of ACGSOA has been dramatically improved. On the one hand, ACGSOA outperforms other methods in terms of convergence speed, and on the other hand, the coverage rate is improved by 7.20%, 7.32%, 7.96%, and 11.03% compared with SO, WOA, ABC, and FOA, respectively.

To address the shortcomings of the whale optimization algorithm (WOA) in terms of insufficient global search ability and slow convergence speed, a differential evolution chaotic whale optimization algorithm (DECWOA) is proposed in this paper. Firstly, the initial population is generated by introducing the Sine chaos theory at the beginning of the algorithm to increase the population diversity. Secondly, new adaptive inertia weights are introduced into the individual whale position update formula to lay the foundation for the global search and improve the optimization performance of the algorithm. Finally, the differential variance algorithm is fused to improve the global search speed and accuracy of the whale optimization algorithm. The impact of various improvement strategies on the performance of the algorithm is analyzed using different kinds of test functions that are randomly selected. The particle swarm optimization algorithm (PSO), butterfly optimization algorithm (BOA), WOA, chaotic feedback adaptive whale optimization algorithm (CFAWOA), and DECWOA algorithm are compared for the optimal search performance. Experimental simulations are performed using MATLAB software, and the results show that the improved whale optimization algorithm has a better global optimization-seeking capability. The improved whale optimization algorithm is applied to the distribution network fault location of IEEE-33 nodes, and the effectiveness and accuracy of the distribution network fault zone location based on the multistrategy improved whale optimization algorithm is verified.

Cogging effect minimization in PMSM position servo system using dual high-order periodic adaptive learning compensation

Real-world optimization problems in engineering, logistics, and resource allocation are often constrained and multi-modal, posing a challenge for traditional optimization algorithms. Metaheuristic algorithms inspired by natural and artificial phenomena have shown promise, but many fail to balance exploration and exploitation effectively, especially under stringent constraints. Existing algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), and Differential Evolution (DE) face issues in convergence speed and constraint handling, particularly in high-dimensional spaces or when constraints are dynamic or complex. We propose an Adaptive Pattern-Driven Optimization (APDO) algorithm, a novel tailor-inspired metaheuristic that mimics the adaptive decision-making process of a tailor designing garments. APDO integrates three primary operators—Pattern Selection, Fabric Adjustment, and Stitch Reinforcement—to handle constraints adaptively. The algorithm combines pattern memory (historical bests), probabilistic pattern mutation, and a constraint-domination principle to ensure feasibility and diversity. The core idea is to iteratively “cut and stitch” solutions to adapt the search process, enabling dynamic constraint satisfaction and global optimization. We benchmarked APDO against five popular methods (GA, PSO, DE, Firefly Algorithm, and Whale Optimization Algorithm) on a suite of 10 real-world constrained problems, including mechanical component design and energy scheduling tasks. APDO outperformed all baselines in terms of convergence speed, constraint satisfaction rate, and solution quality. In particular, APDO achieved an average feasibility rate of 97.6% and an improvement of 4.2–11.8% in best fitness across problems.

Three-dimensional path planning for autonomous underwater vehicles based on a whale optimization algorithm

We have compared the performances of six recently developed global optimization algorithms: imperialist competitive algorithm, firefly algorithm (FA), water cycle algorithm (WCA), whale optimization algorithm (WOA), fireworks algorithm (FWA), and quantum particle swarm optimization (QPSO). These methods have been introduced in the past few years and have found very limited or no applications to geophysical exploration problems thus far. We benchmark the algorithms’ results against the particle swarm optimization (PSO), which is a popular and well-established global search method. In particular, we are interested in assessing the exploration and exploitation capabilities of each method as the dimension of the model space increases. First, we test the different algorithms on two multiminima and two convex analytic objective functions. Then, we compare them using the residual statics corrections and 1D elastic full-waveform inversion, which are highly nonlinear geophysical optimization problems. Our results demonstrate that FA, FWA, and WOA are characterized by optimal exploration capabilities because they outperform the other approaches in the case of optimization problems with multiminima objective functions. Differently, QPSO and PSO have good exploitation capabilities because they easily solve ill-conditioned optimizations characterized by a nearly flat valley in the objective function. QPSO, PSO, and WCA offer a good compromise between exploitation and exploration.

Accurate forecasting is the key factor in promoting wind power consumption and improving the stable operation of power systems. A short-term wind power forecasting (WPF) and uncertainty analysis method based on whale optimization algorithm (WOA), least squares support vector machine (LSSVM), and nonparametric kernel density estimation (NPKDE) was proposed in this paper. The advantages of WOA (fast convergence speed and high convergence accuracy) were used to optimize the penalty factor and kernel function width of the LSSVM model, and the calculation speed and forecasting accuracy of the LSSVM model were improved. The training sample set is classified according to the wind speed interval, and the WOA-LSSVM forecasting model is trained by subclass after classification to further improve the accuracy of short-term WPF. The NPKDE method is used to accurately calculate the probability density distribution characteristics of the forecasting error of wind power, and the confidence interval of the WPF is accurately calculated based on the probability density distribution characteristics. The calculation results show that the forecasting accuracy of the WOA-LSSVM model is higher than those of the LSSVM, long short-term memory (LSTM), and particle swarm optimization and least squares support vector machine (PSO-LSSVM) models, and the forecasting accuracy of the WOA-LSSVM model can be further improved after classifying the training sample set. The coverage of the confidence intervals in different time scales is higher than the corresponding confidence level, indicating that the NPKDE method can accurately describe the probability density distribution characteristics of the WPF errors.

Visual Simultaneous Localization and Mapping (SLAM) systems suffer seriously from low positioning accuracy and insufficient robustness in indoor environment with weak texture and dynamics. To overcome the disadvantages, we propose a SLAM algorithm (SLAM-LB) combined with the improved line feature extraction algorithm and adaptive nonlinear optimization algorithm based on the ORB-SLAM2 basic system. Main improvements are divided into two aspects. The first is an improved Line Segment Detector (LSD) algorithm for the extraction of line feature, with operating parameters tuned: the image scaling factor is adjusted to 0.6, and the pixel coefficient threshold is adjusted to 0.5. Another adaptive gradient threshold screen part is designed to filter out low quality line segments, increasing the detection rate and matching precision of line features from weak texture regions. The second is an improved Levenberg-Marquardt (LM) nonlinear optimization algorithm.we construct an adaptive modification technique of damping factor to dynamically adjust the scale of optimization steps according to the feature matching residual, and construct a simultaneous change method for intermediate variables to accelerate the robustness and convergence of back-end optimization. Experimental analysis results based on the TUM dataset shows that our proposed SLAM-LB system reduces the ATE on average by 43.7% and 44.8% compared with the original ORB-SLAM2 and PL-SLAM, respectively. The method effectively improves the positioning effect and map stability of the SLAM system to complex indoor scenes, giving reliable technical support to robot indoor navigation tasks.

Aiming at the defects of the Aquila optimizer (AO) in dealing with some complex optimization problems, such as slow convergence speed, low convergence accuracy, and easy to fall into local optimum, in this paper, a hybrid Aquila optimizer (HAO) algorithm based on Gauss map and crisscross operator is proposed. First, Gauss map is introduced to initialize the Aquila population to improve the quality of the initial population. Then use the crisscross operator to promote the exchange of information within the population and maintain the diversity of the population in each iteration, which not only enhances the ability of the algorithm to jump out of the local optimum but also accelerates the global convergence of the algorithm. The results of experiments using 21 classical benchmark functions indicate that HAO has better global search ability, faster convergence speed, and better stability than AO. The overall optimization performance of HAO in different dimensions is better than particle swarm optimization (PSO) algorithm, gray wolf optimization (GWO) algorithm, whale optimization algorithm (WOA), and crisscross optimization (CSO) algorithm. Finally, the results of K-means clustering optimization on six University of California (UCI) standard data sets demonstrate that HAO has significant advantages over three algorithms that are good at clustering optimization.

Biometrics is a technology that identifies or verifies individuals based on unique physical or behavioural traits, offering a reliable form of authentication in sectors like healthcare, law enforcement, and security. Existing gender detection systems using fingerprints face challenges due to poor image quality and complex ridge patterns, while ConvolutionalNeural Networks (CNNs), though promising, are hindered by issues like overfitting, slow convergence, and getting trapped in local minima.Other optimisation algorithms like Genetic Algorithm (GA), Particle Swarm Optimisation (PSO)and Ant Colony Optimisation(ACO)often face issues likepremature convergence,high computational costsand poor global search ability. Whale Optimisation Algorithm (WOA) was chosen for its faster convergence, simplicity, and better balance between exploration and exploitation in optimising CNN parameters.Therefore, this study developed a fingerprint-based gender detection system through the Optimisationof CNN with Whale OptimisationAlgorithm.A dataset of 2,200 gender-labelled fingerprint images (1,320 male and 880 female) was acquired from Kaggle.com. The images underwent preprocessing involving cropping, grayscale conversion, histogram equalization for enhancement, and edge detection filtering to eliminate noise. OptimisedCNN model was formulated using Whale OptimisationAlgorithm (WOA) by tuning CNN hyperparameters: number of neurons and dropout rate. The resulting WOA-CNN was employed for feature extraction (edges, texture patterns, shapes) and detection of fingerprint images. The model was implemented in MATLAB R2023a.Performance was evaluated using accuracy, sensitivity, specificity, false positive rate, precision, and recognition time, with an 80-20% training-testing split. CNN achieved 95.86% accuracy, 96.44% sensitivity, 95.00% specificity, 5.00% false positive rate, 96.66% precision, and 99.90 s recognition time. WOA-CNN achieved 97.23% accuracy, 97.58% sensitivity, 96.70% specificity, 3.30% false positive rate, 97.80% precision, and 87.40 s recognition time.This research showed WOA-CNN outperformed CNN in all metrics. It is recommended for use in biometric authentication, security checkpoints, and forensic investigations.

The Industrial Internet of Things (IIoT) is characterized by the instantaneous communication of diverse critical data across complex, resource-limited networks. To maximize the efficiency and accuracy of task scheduling in such networks, this study introduces a novel task scheduling framework based on the Adaptive Lotus Effect Optimization Algorithm (ALEOA). ALEOA perfectly combines the self-cleaning mechanism and learning function of the Lotus effect with the global search and learning capabilities of the Particle Swarm Optimization (PSO) algorithm to establish equilibrium between local and global search. ALEOA can adaptively adjust routing and task scheduling to support critical data communication and a dynamic network. Results from experiments on typical benchmarking equations and simulations of the IIoT communication environment show that the proposed ALEOA-based model yields higher task acceptance rates, lower communication delays, and improved resource utilization than traditional metaheuristic methods. Statistical analyses using the Wilcoxon Signed Rank test confirmed the effectiveness of this enhancement.

A rising meta-heuristic swarm intelligent computation algorithm, the Whale optimization Algorithm (WOA), which has been proved competitive with other intelligent optimization algorithms in solving different optimization problems. To accelerate the convergence rate of WOA, this paper has proposed a new improved whale optimization algorithm, called Chaos Regulation Whale optimization Algorithm (CRWOA). The chaotic map generator composed with three kinds of chaotic maps has been used to initialize the population. Furthermore, Cauchy distribution and Gauss distribution are introduced to regulate the position in each iteration. To analyze the superiority of CRWOA further, ten single-objective benchmark test functions are chosen. Through the comparison and analysis of the optimal results, CRWOA is demonstrated superior in general. It has faster convergence speed and better results than the other algorithms when less iteration number, less population quantity and wider ranges of variables are set.

Whale Optimization Algorithm (WOA) and Grey Wolf Optimizer (GWO) are well-perform metaheuristic algorithms used by various researchers in solving feature selection problems. Yet, the slow convergence speed issue in Whale Optimization Algorithm and Grey Wolf Optimizer could demote the performance of feature selection and classification accuracy. Therefore, to overcome this issue, a modified WOA (mWOA) and modified GWO (mGWO) for wrapper-based feature selection were proposed in this study. The proposed mWOA and mGWO were given a new inversed control parameter which was expected to enable more search area for the search agents in the early phase of the algorithms and resulted in a faster convergence speed. The objective of this comparative study is to investigate and compare the effectiveness of the inversed control parameter in the proposed methods against the original algorithms in terms of the number of selected features and the classification accuracy. The proposed methods were implemented in MATLAB where 12 datasets with different dimensionality from the UCI repository were used. kNN was chosen as the classifier to evaluate the classification accuracy of the selected features. Based on the experimental results, mGWO did not show significant improvements in feature reduction and maintained similar accuracy as the original GWO. On the contrary, mWOA outperformed the original WOA in terms of the two criteria mentioned even on high-dimensional datasets. Evaluating the execution time of the proposed methods, utilizing different classifiers, and hybridizing proposed methods with other metaheuristic algorithms to solve feature selection problems would be future works worth exploring.

Sensor technology advancements have provided a viable solution to fight COVID and to develop healthcare systems based on Internet of Things (IoTs). In this study, image processing and Artificial Intelligence (AI) are used to improve the IoT framework. Computed Tomography (CT) image‐based forecasting of COVID disease is among the important activities in medicine for measuring the severity of variability in the human body. In COVID CT images, the optimal gamma correction value was optimised using the Whale Optimisation Algorithm (WOA). During the search for the optimal solution, WOA was found to be a highly efficient algorithm, which has the characteristics of high precision and fast convergence. Whale Optimisation Algorithm is used to find best gamma correction value to present detailed information about a lung CT image, Also, in this study, analysis of important AI techniques has been done, such as Support Vector Machine (SVM) and Deep‐Learning (Deep‐Learning (DL)) for COVID disease forecasting in terms of amount of data training and computational power. Many experiments have been implemented to investigate the optimisation: SVM and DL with WOA and without WOA are compared by using confusion matrix parameters. From the results, we find that the DL model outperforms the SVM with WOA and without WOA.

A hybrid modified step Whale Optimization Algorithm with Tabu Search for data clustering