Chaotic Tent Map Research Articles

Multi-Objective Optimization of Steel Pipe Pile Cofferdam Construction Based on Improved Sparrow Search Algorithm

This paper develops a multi-objective optimization model to address the absence of systematic and practical evaluation methods for selecting construction schemes for steel pipe pile cofferdams. The model aims to minimize duration and cost while maximizing quality. Additionally, it proposes an improved sparrow search algorithm (ISSA) to solve this problem. First, a tent chaotic map is introduced to initialize the sparrow population, enhancing the diversity of the initial population. Second, the principle of non-dominated ordering is introduced to sort the parent and offspring populations during the iteration process, and the appropriate individuals are selected to form the offspring population. Finally, gray correlation analysis is applied to optimize the Pareto solution set and determine the final construction scheme. The effectiveness and superiority of the ISSA is verified by using the Changsha Jinan Avenue project as a case study. The results indicate that the quality of the optimized construction scheme remains at a high level of 0.90 or more; the duration is shortened by 18 days, a reduction of 21%; and the total cost is reduced by CNY 220,000, saving 3% of the cost.

A Multi-Strategy Siberian Tiger Optimization Algorithm for Task Scheduling in Remote Sensing Data Batch Processing

With advancements in integrated space–air–ground global observation capabilities, the volume of remote sensing data is experiencing exponential growth. Traditional computing models can no longer meet the task processing demands brought about by the vast amounts of remote sensing data. As an important means of processing remote sensing data, distributed cluster computing’s task scheduling directly impacts the completion time and the efficiency of computing resource utilization. To enhance task processing efficiency and optimize the allocation of computing resources, this study proposes a Multi-Strategy Improved Siberian Tiger Optimization (MSSTO) algorithm based on the original Siberian Tiger Optimization (STO) algorithm. The MSSTO algorithm integrates the Tent chaotic map, the Lévy flight strategy, Cauchy mutation, and a learning strategy, showing significant advantages in convergence speed and global optimal solution search compared to the STO algorithm. By combining stochastic key encoding schemes and uniform allocation encoding schemes, taking the task scheduling of aerosol optical depth retrieval as a case study, the research results show that the MSSTO algorithm significantly shortens the completion time (21% shorter compared to the original STO algorithm and an average of 15% shorter compared to nine advanced algorithms, such as a particle swarm algorithm and a gray wolf algorithm). It demonstrates superior solution accuracy and convergence speed over various competing algorithms, achieving the optimal execution sequence and machine allocation scheme for task scheduling.

Multi-Buoy Deployment Method Based on an Improved Tuna Swarm Optimizer Enhanced with Fractional-Order Calculus Method for Marine Observation

Ocean buoys play a critical role in marine hydrological, water quality, and meteorological monitoring, with applications in navigation, environmental observation, and communication. However, accurately modeling and deploying a multi-buoy system in the complex marine environment presents significant challenges. To address these challenges, this study proposes an enhanced deployment strategy using the tuna swarm optimizer enhanced with the fractional-order calculus method for marine observation. The proposed method first introduces a detailed observation model that precisely captures the performance of buoys in terms of coverage and communication efficiency. By integrating the observation coverage ratio and communication energy consumption, we establish an optimal multi-buoy deployment model. The proposed method leverages tent chaotic mapping to improve the diversity of initial solution generation and incorporates fractional-order calculus to strengthen its search capabilities. Simulation experiments and statistical analysis verify the effectiveness of the proposed deployment model, with the proposed method achieving the best performance in deploying the multi-buoy system, reaching a final fitness value of 0.190052 at iteration 449, outperforming TSA, PSO, GWO, and WOA. These results highlight the potential of the proposed method in optimizing multi-buoy system deployment in marine observation.

Optimising Neural Networks for Enhanced Fracture Density Prediction in Surrounding Rock of Coalbed Methane Reservoir

ABSTRACTFractures influence the mechanical strength of coal roof and floor, constraining the design of hydraulic fracturing for coalbed methane production. Currently, the predominant approach involves the integration of petrophysical logging with machine learning for fracture prediction. Nevertheless, challenges exist regarding the model's accuracy. In this study, we present a novel approach to predict fracture density. Our method optimises a back‐propagation (BP) neural network and utilises principal component analysis for feature extraction. We employ logging parameters (density, compensated neutron and acoustic time difference) obtained from Shouyang Block well SY‐1 and fracture density data from electrical imaging logging to construct the FVDC model's dataset. The BP neural network model is optimised using the Sparrow Search algorithm and Tent Chaotic Mapping. The results demonstrate a substantial enhancement over the BP neural network model, with reductions of 80.102% in mean absolute error, 94.182% in mean square error, 75.879% in root mean square error and 79.764% in mean absolute percentage error. When considering accuracy, the optimised model (97.098%) surpasses the support vector regression model (96.478%), the random forest model (94.404%) and the BP neural network model (85.657%). Scalability testing for the optimised model was conducted using data from well SY‐2, yielding a remarkable prediction accuracy of 96.775%. This performance exceeds that of the BP neural network (with an accuracy of 85.102%), as well as the random forest and support vector regression models (with accuracies of 91.234% and 90.384%, respectively). These results underscore the potential of well logging and machine learning in FVDC prediction.

An Improved Cuckoo Search Algorithm and Its Application in Robot Path Planning

This manuscript introduces an improved Cuckoo Search (CS) algorithm, known as BASCS, designed to address the inherent limitations of CS, including insufficient search space coverage, premature convergence, low search accuracy, and slow search speed. The proposed improvements encompass four main areas: the integration of tent chaotic mapping and random migration in population initialization to reduce the impact of random errors, the guidance of Levy flight by the directional determination strategy of the Beetle Antennae Search (BAS) algorithm during the global search phase to improve search accuracy and convergence speed, the adoption of the Sine Cosine Algorithm for local exploitation in later iterations to enhance local optimization and accuracy, and the adaptive adjustment of the step-size factor and elimination probability throughout the iterative process to convergence. The performance of BASCS is validated through ablation experiments on 10 benchmark functions, comparative experiments with the original CS and its four variants, and application to a robot path planning problem. The results demonstrate that BASCS achieves higher convergence accuracy and exhibits faster convergence speed and superior practical applicability compared to other algorithms.

A hybrid load forecasting system based on data augmentation and ensemble learning under limited feature availability

Accurate power load forecasting is an important part of power system operation planning, it can ensure the stable operation of power systems and improve the efficiency of energy utilization. The power load is affected by many factors including temperature, season, population density, and so on, however due to privacy protection and other reasons, it is difficult to obtain some characteristic information that affects the load. The lack of characteristic data will reduce the accuracy of load forecasting and the generalization ability. To solve it, a new hybrid load forecasting framework is proposed, which is composed of two subsystems: a data preprocessing system and a high-precision forecasting system. Based on the load sequence itself, subsystem 1 obtains the trend data and denoising data by variational mode decomposition method, obtains the indicator variable for the weekend according to the one-hot encoding, and also introduces the electricity price data, thus obtaining the 4-dimensional extended data. Subsystem 2 constructs a hybrid prediction model by synthesizing various models, including deep learning and machine learning models, to forecast the expanded data. Finally, the multi-objective JAYA algorithm based on tent chaotic mapping and cross-perturbation strategy is used to ensemble the prediction results of the sub-models. To verify the superiority of the proposed forecasting framework, we conducted experiments using four sets of load data from New South Wales, Australia. The experimental results show that the average absolute percentage error of the hybrid framework on the four data sets are MAPEMarch=0.8070, MAPEJune=0.8296, MAPESeptember=0.7238 and MAPEDecember=0.7709, which are significantly lower than other models and provide a basis for power system scheduling management.

Leak detection in water supply pipeline with small-size leakage using deep learning networks

Pipeline transportation technology has witnessed remarkable development in recent years, while the issue of leakage poses a serious limitation to this technology’s progress, especially for the small-scale leakage in water pipelines that exhibits weaker leakage signals. To address those challenges, this study investigates leak detection in water supply pipeline with an inner pipe diameter of 100 mm in the operating range of volume flow Q = 40–80 m3/h, leakage flow Ql = 0.65–1.33 m3/h and pressure p = 130–220 kPa. The characteristics and propagation of leakage pressure signals are analyzed. An adaptive improved variational mode decomposition (VMD) based on the white shark optimizer (WSO) algorithm is proposed, utilizing sample entropy as the fitness function. Additionally, tent chaotic mapping is employed for parameter initialization, mean normalization is used to minimize the influence of the DC component, and signal relative energy serves as a boundary condition. The processed data is utilized to establish leakage detection models using long short-term memory network (LSTM), gated recurrent unit (GRU), convolutional neural network (CNN) and SqueezeNet framework. The performance of leakage detection models is evaluated and compared using 962 sets’ data using evaluation indicators and confusion matrix. The results indicate that SqueezeNet-GRU demonstrates superior performance in pipeline leak detection and localization applications, achieving 97.40 % accuracy for the total dataset.

Leak aperture recognition of natural gas pipeline based on variational mode decomposition and mutual information

The acoustic emission (AE) signals generated by natural gas pipeline leaks are affected by various noises, making the accurate extraction of feature signals a challenging task. Therefore, this paper introduces a novel adaptive signal denoising approach utilizing Variational Mode Decomposition (VMD).and mutual information (MI). Firstly, the parameters K and α of VMD are optimized using the energy difference. Simultaneously, the correlation coefficient between adjacent IMF components is used as the evaluation criterion to determine the optimal values of K and α. Then, based on MI, a screening criterion is proposed to select effective IMF components for reconstruction. Finally, the ISSA-SVM model was established by introducing Tent chaotic mapping and inertia weight adjustment strategy on the basis of the traditional sparrow search algorithm (SSA). Experimental results demonstrate that the proposed method effectively eliminates noise from pipeline leak AE signals, with a recognition accuracy reaching up to 96.09%.

A Path Planning Method Based on Hybrid Sand Cat Swarm Optimization Algorithm of Green Multimodal Transportation

Aiming at the difficulty of measuring various costs and time-consuming elements in multimodal transport, this paper constructs a green vehicle comprehensive multimodal transport model which incorporates transportation, transit, quality damage, fuel consumption, and carbon emission costs and proposes a hybrid embedded time window to calculate the time penalty cost in order to reflect the actual transport characteristics. Furthermore, in order to better solve the model, a hybrid sand cat swarm optimization (HSCSO) algorithm is proposed by introducing Logistic–Tent chaotic mapping and an adaptive lens opposition-based learning strategy to enhance the global search capability, and inspired by the swarm intelligence scheme, a momentum–bellicose strategy and an equilibrium crossover pool are introduced to improve the search efficiency and convergence ability. Through testing nine benchmark functions, the HSCSO algorithm exhibits superior convergence accuracy and speed in dealing with complex multi-dimensional problems. Based on the excellent global performance, the HSCSO algorithm was utilized for multimodal vehicle transportation in East China, and a path with a lower comprehensive cost was successfully planned, which proved the effectiveness of the HSCSO algorithm in green intermodal transport path planning.

A Novel Approach for Predicting CO2 Emissions in the Building Industry Using a Hybrid Multi-Strategy Improved Particle Swarm Optimization–Long Short-Term Memory Model

The accurate prediction of carbon dioxide (CO2) emissions in the building industry can provide data support and theoretical insights for sustainable development. This study proposes a hybrid model for predicting CO2 emissions that combines a multi-strategy improved particle swarm optimization (MSPSO) algorithm with a long short-term memory (LSTM) model. Firstly, the particle swarm optimization (PSO) algorithm is enhanced by combining tent chaotic mapping, mutation for the least-fit particles, and a random perturbation strategy. Subsequently, the performance of the MSPSO algorithm is evaluated using a set of 23 internationally recognized test functions. Finally, the predictive performance of the MSPSO-LSTM hybrid model is assessed using data from the building industry in the Yangtze River Delta region as a case study. The results indicate that the coefficient of determination (R2) of the model reaches 0.9677, which is more than 10% higher than that of BP, LSTM, and CNN non-hybrid models and demonstrates significant advantages over PSO-LSTM, GWO-LSTM, and WOA-LSTM hybrid models. Additionally, the mean square error (MSE) of the model is 2445.6866 Mt, and the mean absolute error (MAE) is 4.1010 Mt, both significantly lower than those of the BP, LSTM, and CNN non-hybrid models. Overall, the MSPSO-LSTM hybrid model demonstrates high predictive accuracy for CO2 emissions in the building industry, offering robust support for the sustainable development of the industry.

FOX Optimization Algorithm Based on Adaptive Spiral Flight and Multi-Strategy Fusion.

Adaptive spiral flight and multi-strategy fusion are the foundations of a new FOX optimization algorithm that aims to address the drawbacks of the original method, including weak starting individual ergodicity, low diversity, and an easy way to slip into local optimum. In order to enhance the population, inertial weight is added along with Levy flight and variable spiral strategy once the population is initialized using a tent chaotic map. To begin the process of implementing the method, the fox population position is initialized using the created Tent chaotic map in order to provide more ergodic and varied individual beginning locations. To improve the quality of the solution, the inertial weight is added in the second place. The fox random walk mode is then updated using a variable spiral position updating approach. Subsequently, the algorithm's global and local searches are balanced, and the Levy flying method and greedy approach are incorporated to update the fox location. The enhanced FOX optimization technique is then thoroughly contrasted with various swarm intelligence algorithms using engineering application optimization issues and the CEC2017 benchmark test functions. According to the simulation findings, there have been notable advancements in the convergence speed, accuracy, and stability, as well as the jumping out of the local optimum, of the upgraded FOX optimization algorithm.

Intelligent modeling of combined heat and power unit under full operating conditions via improved crossformer and precise sparrow search algorithm

The flexible operation capability of combined heat and power (CHP) unit under full operating conditions must be promoted to suppress the power grid fluctuation in large-scale integration of renewable energy. However, obtaining CHP unit model under large-scale variable loads and deep peak shaving is extremely challenging. To this end, an intelligent modeling method incorporating improved crossformer and precise sparrow search algorithm is designed to provide reference for flexible controller design. Firstly, to address the strong time dependence of CHP unit boiler-turbine coupling process, a bidirectional gated recurrent unit is employed as the position encoding to extract the hidden temporal feature. Secondly, a novel encoder structure with multi-receptive field convolution module is designed to enhance the local feature extraction capability of the network, which is conducive to the analysis of multivariable coupling characteristics of CHP unit. On this basis, a precise sparrow search algorithm with stronger search ability is formed by combining Tent chaotic mapping, osprey optimization algorithm, Cauchy mutation and quantum behavior, which provides support for the dynamic characteristics analysis of CHP unit. The time dependence, local feature information and optimal parameter settings are fully considered in the comprehensive modeling scheme, which results in an accurate identification model for CHP unit under full operating conditions. Finally, the effectiveness of the proposed method is verified based on the actual operating data of a 350 MW CHP unit. The accuracy of established model is greater than 99.4 %, which can well reflect the nonlinear characteristics of the unit. Therefore, the built model can be used for controller design and simulation analysis.

Synthesis of sparse rectangular planar arrays with weight function and improved grey wolf optimization algorithm

AbstractThe present article proposes a novel hybrid approach for addressing the synthesis problem of rectangular planar arrays under multiple constraints, through joint optimization of the weight function and the improved grey wolf optimization (IGWO) algorithm. Firstly, the grey wolf optimization (GWO) algorithm is improved by using tent chaotic mapping, nonlinear convergence factor, dominant wolf dynamic belief strategy, and opposition‐based learning strategy to increase the population diversity and the ability to jump out of the local optimum. Secondly, the array elements are weighted using the weight function to generate the position distribution matrix, which reduces the thinned matrix optimization time and improves the optimization efficiency. Finally, the position distribution matrix is used to generate the thinned array, and the IGWO algorithm is applied to perform the sparse optimization with multiple constraints. The effectiveness of the method is verified through numerical simulation and full‐wave simulation experiments, demonstrating its capability to enhance array antenna performance and reduce peak sidelobe level (PSLL). These experimental results hold significant engineering implications and provide valuable references for addressing the array distribution problem under multiple constraints.

Chaos based image encryption scheme to secure sensitive multimedia content in cloud storage

Cloud computing offers a variety of on-demand services to users and has gained significant prominence in the contemporary era. The security of information stored in cloud data centers has become a central concern, especially for sensitive data like medical images, videos, and multimedia content that require heightened protection when stored in data centers. Cloud users have a responsibility to ensure the security of their data through strategic measures. Focusing on maintaining the privacy of images stored in the cloud, this research introduces an innovative image encryption technique that is based on a modified Skew Tent chaotic map. The suggested modification to the chaotic map includes combining the Skew Tent map with both the sine trigonometric function and perturbation technology. This results in enhanced randomness, more intricate dynamical behavior, a broader chaotic range, and increased sensitivity to initial values in contrast to alternative chaotic maps. The incorporation of this adapted map into a stepwise procedure, involving two rounds of permutation followed by diffusion, effectively accomplishes image data encryption for cloud storage systems. These consecutive operations collectively enhance the encryption method’s randomness and robustness. Through simulations conducted using Cloudsim, the cipher-image exhibits a uniform distribution and achieves a commendable information entropy score of 7.996749. The encryption algorithm significantly reduces correlation coefficients from 1 in the original image to 0 in the encrypted image, while maintaining NPCR (Number of Pixel Change Rate) and UACI (Unified Average Changing Intensity) values within the critical range. Additionally, both theoretical analysis and practical evaluations confirm the algorithm’s resilience against exhaustive, occlusion, and classical attacks. Moreover, extending this encryption framework to video data, a novel video encryption approach is proposed.

Wear state identification of ball screw meta action unit based on parameter optimization VMD and improved Bilstm

In this paper, a novel neural network based on parameter optimization Variational Mode Decomposition (VMD) and improved bidirectional long short-term memory (BiLSTM) is proposed. Wear state recognition method of ball screw element action unit component based on Bilstm. Firstly, Tent chaotic map and adaptive sine cosine Algorithm were used to improve the improved Northern Goshawk Optimisation Algorithm (INGO) to verify the superiority of INGO algorithm and determine the optimal parameter combination of VMD. Secondly, INGO-VMD was used to decompose the collected vibration signals and calculate the correlation of IMF components, and the multi-feature information matrix that could characterize the wear state change of the lead screw was constructed after retaining the IMF components with large correlation. Finally, the divided feature information matrix and labels were input into the Bilstm network model of Bayesian optimization (BO) for training, and the Softmax classifier was used to classify and identify the wear state category.

Research on Multi-Objective Optimization Scheduling Strategy for Cascaded Small Hydropower Stations Based on Improved HBA

Abstract Effective optimization scheduling strategy is the premise and key to improving the power generation and capacity benefits of cascade small hydropower stations (CSHS). However, the power generation of CSHS is significantly affected by complex hydraulic and electrical constraints. To effectively solve this problem, an improved honey badger algorithm (HBA) is proposed by updating the mutation strategy and introducing non-dominated sorting to achieve the multi-objective optimization scheduling solution of CSHS. The following improvements have been made to the standard HBA: Firstly, the Tent chaotic mapping is applied to the population initialization stage, its strong ergodicity and randomness ensure the randomness of the initialization stage and improve the global search ability of CSHS scheduling. Secondly, the powerful optimization ability and fast convergence speed of the Golden-Sine strategy make updating and mutation more efficient, greatly enhancing the local search ability of CSCH scheduling. And then combining the non-dominated sorting of the non-dominated sorting genetic algorithm-II (NSGA-II), an improved multi-objective Honey Badger Algorithm (IMOHBA) is further proposed to achieve multi-objective solutions for CSCH scheduling. Finally, abundant field experiments were tested for validation. The results expressed that compared to other algorithms, the effect of IMOHBA in CSHS scheduling can further increase power generation, while also improving the peak shaving ability of CSHS.

Distributed chaotic bat algorithm for sensor fault diagnosis in AHUs based on a decentralized structure

The effective operation of sensors in heating, ventilation and air conditioning (HVAC) systems to promote high-efficiency, energy-saving and low-risk intelligent buildings. However, most existing methods are either based on a centralized architecture or employ only pure digital simulation platforms for HVAC sensor fault diagnosis and verification, which are difficult to meet the complex and dynamic needs of HVCA systems. To overcome the difficulty in employment of centralized architecture involved multi sensor fault diagnosis and fault diagnosis methods limited by pure digital simulation platform, a fully distributed chaotic bat algorithm is proposed to diagnosis multiple-sensor faults and is verified by the hardware-in-the-loop simulation platform in HVAC systems. First, inspired by the bat swarm intelligence and multiple agents, we characterize the sensor fault diagnosis problem as an optimization problem of the bat predation behavior. Specifically, each sensor node is abstracted as a bat colony, and each bat colony communicates with directly connected neighboring bat colony in physical space. Second, to avoid the tendency of bat algorithm to fall into locally optimal solutions, the tent chaotic map is employed to enhance the bat colony search ability for improving the randomness of bat algorithm, involves escaping from local extreme points and increasing the diversity of the bat colony. Finally, we embed the temperature and humidity sensors into the hardware-in-the-loop simulation platform to construct the near-actual physical environment. The performance and convergence of the proposed method are verified using both a pure digital simulation platform and a built-in hardware-in-the-loop simulation platform. Compared with basic bat algorithm (BA), particle swarm optimization algorithm (PSO) and chaotic bat algorithm (CBA), the proposed fully distributed chaotic bat algorithm (DCBA) have higher accuracy and can achieve the 98.41 % accuracy in fixed bias (FB) sensor faults, 96.96 % accuracy in complete failure (CF), 95.84 % in drift bias (DB) and 96.08 % accuracy in accuracy drops (AD).

Forecasting a Short-Term Photovoltaic Power Model Based on Improved Snake Optimization, Convolutional Neural Network, and Bidirectional Long Short-Term Memory Network.

The precision of short-term photovoltaic power forecasts is of utmost importance for the planning and operation of the electrical grid system. To enhance the precision of short-term output power prediction in photovoltaic systems, this paper proposes a method integrating K-means clustering: an improved snake optimization algorithm with a convolutional neural network-bidirectional long short-term memory network to predict short-term photovoltaic power. Firstly, K-means clustering is utilized to categorize weather scenarios into three categories: sunny, cloudy, and rainy. The Pearson correlation coefficient method is then utilized to determine the inputs of the model. Secondly, the snake optimization algorithm is improved by introducing Tent chaotic mapping, lens imaging backward learning, and an optimal individual adaptive perturbation strategy to enhance its optimization ability. Then, the multi-strategy improved snake optimization algorithm is employed to optimize the parameters of the convolutional neural network-bidirectional long short-term memory network model, thereby augmenting the predictive precision of the model. Finally, the model established in this paper is utilized to forecast photovoltaic power in diverse weather scenarios. The simulation findings indicate that the regression coefficients of this method can reach 0.99216, 0.95772, and 0.93163 on sunny, cloudy, and rainy days, which has better prediction precision and adaptability under various weather conditions.

Fractal Tent Map with Application to Surrogate Testing

Discrete chaotic maps are a mathematical basis for many useful applications. One of the most common is chaos-based pseudorandom number generators (PRNGs), which should be computationally cheap and controllable and possess necessary statistical properties, such as mixing and diffusion. However, chaotic PRNGs have several known shortcomings, e.g., being prone to chaos degeneration, falling in short periods, and having a relatively narrow parameter range. Therefore, it is reasonable to design novel simple chaotic maps to overcome these drawbacks. In this study, we propose a novel fractal chaotic tent map, which is a generalization of the well-known tent map with a fractal function introduced into the right-hand side. We construct and investigate a PRNG based on the proposed map, showing its high level of randomness by applying the NIST statistical test suite. The application of the proposed PRNG to the task of generating surrogate data and a surrogate testing procedure is shown. The experimental results demonstrate that our approach possesses superior accuracy in surrogate testing across three distinct signal types—linear, chaotic, and biological signals—compared to the MATLAB built-in randn() function and PRNGs based on the logistic map and the conventional tent map. Along with surrogate testing, the proposed fractal tent map can be efficiently used in chaos-based communications and data encryption tasks.

An improved white shark optimizer algorithm used to optimize the structural parameters of the oil pad in the hydrostatic bearing

Abstract An improved white shark optimizer (MWSO) algorithm has been proposed. The algorithm adopts an improved tent chaotic mapping strategy to enhance the diversity of the initial population of white sharks, introduces the balance pool strategy of the EO algorithm to improve the convergence speed and accuracy of the algorithm, applies adaptive t-distribution dynamic selection probability perturbation to the global optimal solution, and adjusts the exploration and development ability of the algorithm at different iteration periods. MWSO, WSO, and seven excellent metaheuristic algorithms are tested and compared on 23 classic test functions and the CEC2017 test suite, and two non-parametric tests, a Wilcoxon rank sum test with a significance level of 0.05 and Friedman test, are conducted. The statistical results indicate that the proposed MWSO is significantly superior to other algorithms. In addition, nine algorithms are applied for the first time to optimize the structural parameters of the oil sealing edge of oil pads in response to the issue of the bearing capacity of hydrostatic bearings. This not only further verified the superiority of MWSO, but also provided new ideas for the optimization of hydrostatic bearings.