The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,a...The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,and temperature fluctuations can compromise the accuracy of contour extraction.To address these limitations,an improved Alpha-shape-based point cloud contour extraction method is proposed.The proposed approach uses a hierarchical strategy to process three-dimensional laser scanning point clouds.The processed data are then subjected to curvatureadaptive voxel filtering to reduce acquisition noise.In addition,an enhanced iterative closest point(ICP)variant with correspondence validation accurately aligns the discrete point cloud segments.The proposed curvature-responsive Alpha-shape framework enables multiscale contour delineation through topology-adaptive threshold modulation,which resolves boundary ambiguities in geometrically complex cross-sections.The method was experimentally validated using field-acquired measurement datasets from the Zhangjinggao Yangtze River Bridge tower segments,confirming its capability to reconstruct noncanonical cross-sectional geometries.Three contour extraction methods,including Poisson reconstruction,the conventional Alpha-shape algorithm,and random sample consensus with ICP(RANSAC-ICP),were compared to evaluate the performance of the proposed Alpha-shape algorithm.The results demonstrate that the proposed method achieves superior contour extraction accuracy and data reduction efficiency,highlighting its effectiveness in contour extraction tasks.展开更多
With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper...With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper proposes a fault self-healing cooperative strategy for the new energy distribution network based on an improved ant colony-genetic hybrid algorithm.Firstly,the graph theory adjacency matrix is used to characterize the topology of the distribution network,and the dynamic positioning of new energy nodes is realized.Secondly,based on the output model and load characteristic model of wind,photovoltaic,and energy storage,a two-layer cooperative self-healing model of the distribution network is constructed.The upper layer is based on the improved depth-breadth hybrid search(DFS-BFS)to divide the island,with the maximum weight load recovery and the minimum number of switching actions as the goal,combined with the load priority to dynamically restore the key load.The lower layer uses the improved ant colony-genetic hybrid algorithm to solve the fault recovery path with the minimum total power loss load and the minimum network loss as the goal,generate the optimal switching sequence,and verify the power flow constraints.Finally,the simulation results based on the IEEE 33-bus system show that the proposed method can guarantee the power supply of key loads in the distribution network with high-tech energy penetration,restore the power supply of more load nodes with the least switching operation,and effectively reduce the line loss,which verifies the effectiveness and superiority of the method.展开更多
To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the conc...To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs.展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale...An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10^(−4) p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach.展开更多
Due to the lack of accurate data and complex parameterization,the prediction of groundwater depth is a chal-lenge for numerical models.Machine learning can effectively solve this issue and has been proven useful in th...Due to the lack of accurate data and complex parameterization,the prediction of groundwater depth is a chal-lenge for numerical models.Machine learning can effectively solve this issue and has been proven useful in the prediction of groundwater depth in many areas.In this study,two new models are applied to the prediction of groundwater depth in the Ningxia area,China.The two models combine the improved dung beetle optimizer(DBO)algorithm with two deep learning models:The Multi-head Attention-Convolution Neural Network-Long Short Term Memory networks(MH-CNN-LSTM)and the Multi-head Attention-Convolution Neural Network-Gated Recurrent Unit(MH-CNN-GRU).The models with DBO show better prediction performance,with larger R(correlation coefficient),RPD(residual prediction deviation),and lower RMSE(root-mean-square error).Com-pared with the models with the original DBO,the R and RPD of models with the improved DBO increase by over 1.5%,and the RMSE decreases by over 1.8%,indicating better prediction results.In addition,compared with the multiple linear regression model,a traditional statistical model,deep learning models have better prediction performance.展开更多
To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The...To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.展开更多
This research proposes an improved Puma optimization algorithm(IPuma)as a novel dynamic recon-figuration tool for a photovoltaic(PV)array linked in total-cross-tied(TCT).The proposed algorithm utilizes the Newton-Raph...This research proposes an improved Puma optimization algorithm(IPuma)as a novel dynamic recon-figuration tool for a photovoltaic(PV)array linked in total-cross-tied(TCT).The proposed algorithm utilizes the Newton-Raphson search rule(NRSR)to boost the exploration process,especially in search spaces with more local regions,and boost the exploitation with adaptive parameters alternating with random parameters in the original Puma.The effectiveness of the introduced IPuma is confirmed through comprehensive evaluations on the CEC’20 benchmark problems.It shows superior performance compared to both established and modern metaheuristic algorithms in terms of effectively navigating the search space and achieving convergence towards near-optimal regions.The findings indicated that the IPuma algorithm demonstrates considerable statistical promise and surpasses the performance of competing algorithms.In addition,the proposed IPuma is utilized to reconfigure a 9×9 PV array that operates under different shade patterns,such as lower triangular(LT),long wide(LW),and short wide(SW).In addition to other programmed approaches,such as the Whale optimization algorithm(WOA),grey wolf optimizer(GWO),Harris Hawks optimization(HHO),particle swarm optimization(PSO),gravitational search algorithm(GSA),biogeography-based optimization(BBO),sine cosine algorithm(SCA),equilibrium optimizer(EO),and original Puma,the indicated method is contrasted to the traditional configurations of TCT and Sudoku.In addition,the metrics of mismatch power loss,maximum efficiency improvement,efficiency improvement ratio,and peak-to-mean ratio are calculated to assess the effectiveness of the indicated approach.The proposed IPuma improved the generated power by 36.72%,28.03%,and 40.97%for SW,LW,and LT,respectively,outperforming the TCT configuration.In addition,it achieved the best maximum efficiency improvement among the algorithms considered,with 26.86%,21.89%,and 29.07%for the examined patterns.The results highlight the superiority and competence of the proposed approach in both convergence rates and stability,as well as applicability to dynamically reconfigure the PV system and enhance its harvested energy.展开更多
Objective:To analyze the impact of improved emergency integrated nursing on the treatment effectiveness and safety of emergency trauma patients.Methods:Study duration:December 2024 to December 2025.Observation target:...Objective:To analyze the impact of improved emergency integrated nursing on the treatment effectiveness and safety of emergency trauma patients.Methods:Study duration:December 2024 to December 2025.Observation target:emergency trauma patients in our hospital.Sample size:92 cases.Using computer-based grouping,the 92 patients were divided into two equally sized groups:a control group of 46 patients who received conventional emergency nursing care,and an observation group of 46 patients who underwent an improved emergency integrated nursing model.The treatment-related indicators,treatment effectiveness,and incidence of adverse events were evaluated in both groups.Results:After intervention,the pre-hospital emergency care time,emergency diagnosis time,total emergency rescue duration,and examination waiting time in the control group were all longer than those in the observation group(p<0.05);the treatment effectiveness in the control group(effective rate:82.61%)was worse than that in the observation group(effective rate:95.65%),p<0.05;compared with the control group,the observation group had a lower incidence of adverse events,p<0.05.Conclusion:Implementing an improved emergency integrated nursing model for emergency trauma patients helps streamline the treatment process,enhance treatment effectiveness,and reduce the incidence of adverse events.展开更多
The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant...The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability.展开更多
The improved cross-correlation algorithm for the strain demodulation of Vernier-effect-based optical fiber sensor(VE-OFS)is proposed in this article.The algorithm identifies the most similar spectrum to the measured o...The improved cross-correlation algorithm for the strain demodulation of Vernier-effect-based optical fiber sensor(VE-OFS)is proposed in this article.The algorithm identifies the most similar spectrum to the measured one from the database of the collected spectra by employing the cross-correlation operation,subsequently deriving the predicted value via weighted calculation.As the algorithm uses the complete information in the measured raw spectrum,more accurate results and larger measurement range can be obtained.Additionally,the improved cross-correlation algorithm also has the potential to improve the measurement speed compared to current standards due to the possibility for the collection using low sampling rate.This work presents an important algorithm towards a simpler,faster way to improve the demodulation performance of VE-OFS.展开更多
Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characte...Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.展开更多
Aiming at the problem that the existing algorithms for vehicle detection in smart factories are difficult to detect partial occlusion of vehicles,vulnerable to background interference,lack of global vision,and excessi...Aiming at the problem that the existing algorithms for vehicle detection in smart factories are difficult to detect partial occlusion of vehicles,vulnerable to background interference,lack of global vision,and excessive suppression of real targets,which ultimately cause accuracy degradation.At the same time,to facilitate the subsequent positioning of vehicles in the factory,this paper proposes an improved YOLOv8 algorithm.Firstly,the RFCAConv module is combined to improve the original YOLOv8 backbone.Pay attention to the different features in the receptive field,and give priority to the spatial features of the receptive field to capture more vehicle feature information and solve the problem that the vehicle is partially occluded and difficult to detect.Secondly,the SFE module is added to the neck of v8,which improves the saliency of the target in the reasoning process and reduces the influence of background interference on vehicle detection.Finally,the head of the RT-DETR algorithm is used to replace the head in the original YOLOv8 algorithm,which avoids the excessive suppression of the real target while combining the context information.The experimental results show that compared with the original YOLOv8 algorithm,the detection accuracy of the improved YOLOv8 algorithm is improved by 4.6%on the self-made smart factory data set,and the detection speed also meets the real-time requirements of smart factory vehicle detection and subsequent vehicle positioning.展开更多
The internal flow fields within a three-dimensional inward-tunning combined inlet are extremely complex,especially during the engine mode transition,where the tunnel changes may impact the flow fields significantly.To...The internal flow fields within a three-dimensional inward-tunning combined inlet are extremely complex,especially during the engine mode transition,where the tunnel changes may impact the flow fields significantly.To develop an efficient flow field reconstruction model for this,we present an Improved Conditional Denoising Diffusion Generative Adversarial Network(ICDDGAN),which integrates Conditional Denoising Diffusion Probabilistic Models(CDDPMs)with Style GAN,and introduce a reconstruction discrimination mechanism and dynamic loss weight learning strategy.We establish the Mach number flow field dataset by numerical simulation at various backpressures for the mode transition process from turbine mode to ejector ramjet mode at Mach number 2.5.The proposed ICDDGAN model,given only sparse parameter information,can rapidly generate high-quality Mach number flow fields without a large number of samples for training.The results show that ICDDGAN is superior to CDDGAN in terms of training convergence and stability.Moreover,the interpolation and extrapolation test results during backpressure conditions show that ICDDGAN can accurately and quickly reconstruct Mach number fields at various tunnel slice shapes,with a Structural Similarity Index Measure(SSIM)of over 0.96 and a Mean-Square Error(MSE)of 0.035%to actual flow fields,reducing time costs by 7-8 orders of magnitude compared to Computational Fluid Dynamics(CFD)calculations.This can provide an efficient means for rapid computation of complex flow fields.展开更多
The accurate estimation of lithium battery state of health(SOH)plays an important role in the health management of battery systems.In order to improve the prediction accuracy of SOH,this paper proposes a stochastic co...The accurate estimation of lithium battery state of health(SOH)plays an important role in the health management of battery systems.In order to improve the prediction accuracy of SOH,this paper proposes a stochastic configuration network based on a multi-converged black-winged kite search algorithm,called SBKA-CLSCN.Firstly,the indirect health index(HI)of the battery is extracted by combining it with Person correlation coefficients in the battery charging and discharging cycle point data.Secondly,to address the problem that the black-winged kite optimization algorithm(BKA)falls into the local optimum problem and improve the convergence speed,the Sine chaotic black-winged kite search algorithm(SBKA)is designed,which mainly utilizes the Sine mapping and the golden-sine strategy to enhance the algorithm’s global optimality search ability;secondly,the Cauchy distribution and Laplace regularization techniques are used in the SCN model,which is referred to as CLSCN,thereby improving the model’s overall search capability and generalization ability.Finally,the performance of SBKA and SBKA-CLSCN is evaluated using eight benchmark functions and the CALCE battery dataset,respectively,and compared in comparison with the Long Short-Term Memory(LSTM)model and the Gated Recurrent Unit(GRU)model,and the experimental results demonstrate the feasibility and effectiveness of the SBKA-CLSCN algorithm.展开更多
The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,wh...The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.展开更多
Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,...Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,integer,or mixed,and are often given based on experience but largely affect the effectiveness of activity recognition.In order to adapt to different hyper-parameter optimization problems,our improved Cuckoo Search(CS)algorithm is proposed to optimize the mixed hyper-parameters in deep learning algorithm.The algorithm optimizes the hyper-parameters in the deep learning model robustly,and intelligently selects the combination of integer type and continuous hyper-parameters that make the model optimal.Then,the mixed hyper-parameter in Convolutional Neural Network(CNN),Long-Short-Term Memory(LSTM)and CNN-LSTM are optimized based on the methodology on the smart home activity recognition datasets.Results show that the methodology can improve the performance of the deep learning model and whether we are experienced or not,we can get a better deep learning model using our method.展开更多
The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation ...The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation deployment process was established,and the relationship between the deployment window and the phase difference of the orbit insertion point,as well as the cost of phase adjustment after orbit insertion,was derived.Then,the combination of the constellation deployment position sequence was treated as a parameter,together with the sequence of satellite deployment intervals,as optimization variables,simplifying a highdimensional search problem within a wide range of dates to a finite-dimensional integer programming problem.An improved genetic algorithm with local search on deployment dates was introduced to optimize the launch deployment strategy.With the new description of the optimization variables,the total number of elements in the solution space was reduced by N orders of magnitude.Numerical simulation confirms that the proposed optimization method accelerates the convergence speed from hours to minutes.展开更多
A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the s...A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances.展开更多
The application of multi-material topology optimization affords greater design flexibility compared to traditional single-material methods.However,density-based topology optimization methods encounter three unique cha...The application of multi-material topology optimization affords greater design flexibility compared to traditional single-material methods.However,density-based topology optimization methods encounter three unique challenges when inertial loads become dominant:non-monotonous behavior of the objective function,possible unconstrained characterization of the optimal solution,and parasitic effects.Herein,an improved Guide-Weight approach is introduced,which effectively addresses the structural topology optimization problem when subjected to inertial loads.Smooth and fast convergence of the compliance is achieved by the approach,while also maintaining the effectiveness of the volume constraints.The rational approximation of material properties model and smooth design are utilized to guarantee clear boundaries of the final structure,facilitating its seamless integration into manufacturing processes.The framework provided by the alternating active-phase algorithm is employed to decompose the multi-material topological problem under inertial loading into a set of sub-problems.The optimization of multi-material under inertial loads is accomplished through the effective resolution of these sub-problems using the improved Guide-Weight method.The effectiveness of the proposed approach is demonstrated through numerical examples involving two-phase and multi-phase materials.展开更多
基金The National Natural Science Foundation of China(No.52338011)the Start-up Research Fund of Southeast University(No.RF1028624058)+1 种基金the Southeast University Interdisciplinary Research Program for Young Scholarsthe National Key Research and Development Program of China(No.2024YFC3014103).
文摘The virtual preassembly of super-high steel bridge towers faces a challenge in the efficient and precise extraction of complex cross-sectional features.Factors such as fabrication errors,gravity-induced deformations,and temperature fluctuations can compromise the accuracy of contour extraction.To address these limitations,an improved Alpha-shape-based point cloud contour extraction method is proposed.The proposed approach uses a hierarchical strategy to process three-dimensional laser scanning point clouds.The processed data are then subjected to curvatureadaptive voxel filtering to reduce acquisition noise.In addition,an enhanced iterative closest point(ICP)variant with correspondence validation accurately aligns the discrete point cloud segments.The proposed curvature-responsive Alpha-shape framework enables multiscale contour delineation through topology-adaptive threshold modulation,which resolves boundary ambiguities in geometrically complex cross-sections.The method was experimentally validated using field-acquired measurement datasets from the Zhangjinggao Yangtze River Bridge tower segments,confirming its capability to reconstruct noncanonical cross-sectional geometries.Three contour extraction methods,including Poisson reconstruction,the conventional Alpha-shape algorithm,and random sample consensus with ICP(RANSAC-ICP),were compared to evaluate the performance of the proposed Alpha-shape algorithm.The results demonstrate that the proposed method achieves superior contour extraction accuracy and data reduction efficiency,highlighting its effectiveness in contour extraction tasks.
基金supported by the Installation of OCS Distribution Network Program Control 2.0 and Other Functions for Dongguan Power Supply Bureau of Guangdong Power Grid Co.,Ltd.(No.:031900GS62220049).
文摘With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper proposes a fault self-healing cooperative strategy for the new energy distribution network based on an improved ant colony-genetic hybrid algorithm.Firstly,the graph theory adjacency matrix is used to characterize the topology of the distribution network,and the dynamic positioning of new energy nodes is realized.Secondly,based on the output model and load characteristic model of wind,photovoltaic,and energy storage,a two-layer cooperative self-healing model of the distribution network is constructed.The upper layer is based on the improved depth-breadth hybrid search(DFS-BFS)to divide the island,with the maximum weight load recovery and the minimum number of switching actions as the goal,combined with the load priority to dynamically restore the key load.The lower layer uses the improved ant colony-genetic hybrid algorithm to solve the fault recovery path with the minimum total power loss load and the minimum network loss as the goal,generate the optimal switching sequence,and verify the power flow constraints.Finally,the simulation results based on the IEEE 33-bus system show that the proposed method can guarantee the power supply of key loads in the distribution network with high-tech energy penetration,restore the power supply of more load nodes with the least switching operation,and effectively reduce the line loss,which verifies the effectiveness and superiority of the method.
文摘To enhance the accuracy of path planning of unmanned surface vehicles(USVs),the particle swarm optimization algorithm(PSO)is improved based on species migration strategies observed in ecology.By incorporating the concept of particle sight distance,an improved algorithm,called SD-IPSO,is proposed for the real-time autonomous navigation of USVs in marine environments.The algorithm refines the individual behavior pattern of particles in the population,effectively improving both local and global search capabilities while avoiding premature convergence.The effectiveness of the algorithm is validated using standard test functions from CEC-2017 function library,assessing it from multiple dimensions.Sensitivity analysis is conducted on key parameters in the algorithm,including particle sight distance and population size.Results indicate that compared with PSO,SD-IPSO demonstrates significant advantages in optimization accuracy and convergence speed.The application of SD-IPSO in path planning is further investigated through a 14-point traveling salesman problem(TSP)example and navigation autonomous tests of USVs in marine environments.Findings demonstrate that the proposed algorithm exhibits superior optimization capabilities and can effectively address the path planning challenges of USVs.
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
文摘Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
基金supported by Yunnan Power Grid Co.,Ltd.Science and Technology Project:Research and application of key technologies for graphical-based power grid accident reconstruction and simulation(YNKJXM20240333).
文摘An optimized volt-ampere reactive(VAR)control framework is proposed for transmission-level power systems to simultaneously mitigate voltage deviations and active-power losses through coordinated control of large-scale wind/solar farms with shunt static var generators(SVGs).The model explicitly represents reactive-power regulation characteristics of doubly-fed wind turbines and PV inverters under real-time meteorological conditions,and quantifies SVG high-speed compensation capability,enabling seamless transition from localized VAR management to a globally coordinated strategy.An enhanced adaptive gain-sharing knowledge optimizer(AGSK-SD)integrates simulated annealing and diversity maintenance to autonomously tune voltage-control actions,renewable source reactive-power set-points,and SVG output.The algorithm adaptively modulates knowledge factors and ratios across search phases,performs SA-based fine-grained local exploitation,and periodically re-injects population diversity to prevent premature convergence.Comprehensive tests on IEEE 9-bus and 39-bus systems demonstrate AGSK-SD’s superiority over NSGA-II and MOPSO in hypervolume(HV),inverse generative distance(IGD),and spread metrics while maintaining acceptable computational burden.The method reduces network losses from 2.7191 to 2.15 MW(20.79%reduction)and from 15.1891 to 11.22 MW(26.16%reduction)in the 9-bus and 39-bus systems respectively.Simultaneously,the cumulative voltage-deviation index decreases from 0.0277 to 3.42×10^(−4) p.u.(98.77%reduction)in the 9-bus system,and from 0.0556 to 0.0107 p.u.(80.76%reduction)in the 39-bus system.These improvements demonstrate significant suppression of line losses and voltage fluctuations.Comparative analysis with traditional heuristic optimization algorithms confirms the superior performance of the proposed approach.
基金supported by the National Natural Science Foundation of China [grant numbers 42088101 and 42375048]。
文摘Due to the lack of accurate data and complex parameterization,the prediction of groundwater depth is a chal-lenge for numerical models.Machine learning can effectively solve this issue and has been proven useful in the prediction of groundwater depth in many areas.In this study,two new models are applied to the prediction of groundwater depth in the Ningxia area,China.The two models combine the improved dung beetle optimizer(DBO)algorithm with two deep learning models:The Multi-head Attention-Convolution Neural Network-Long Short Term Memory networks(MH-CNN-LSTM)and the Multi-head Attention-Convolution Neural Network-Gated Recurrent Unit(MH-CNN-GRU).The models with DBO show better prediction performance,with larger R(correlation coefficient),RPD(residual prediction deviation),and lower RMSE(root-mean-square error).Com-pared with the models with the original DBO,the R and RPD of models with the improved DBO increase by over 1.5%,and the RMSE decreases by over 1.8%,indicating better prediction results.In addition,compared with the multiple linear regression model,a traditional statistical model,deep learning models have better prediction performance.
文摘To improve the efficiency and accuracy of path planning for fan inspection tasks in thermal power plants,this paper proposes an intelligent inspection robot path planning scheme based on an improved A^(*)algorithm.The inspection robot utilizes multiple sensors to monitor key parameters of the fans,such as vibration,noise,and bearing temperature,and upload the data to the monitoring center.The robot’s inspection path employs the improved A^(*)algorithm,incorporating obstacle penalty terms,path reconstruction,and smoothing optimization techniques,thereby achieving optimal path planning for the inspection robot in complex environments.Simulation results demonstrate that the improved A^(*)algorithm significantly outperforms the traditional A^(*)algorithm in terms of total path distance,smoothness,and detour rate,effectively improving the execution efficiency of inspection tasks.
基金funded by the Deanship of Scientific Research and Libraries,Princess Nourah bint Abdulrahman University,through the Program of Research Project Funding After Publication,grant No.(RPFAP-82-1445)。
文摘This research proposes an improved Puma optimization algorithm(IPuma)as a novel dynamic recon-figuration tool for a photovoltaic(PV)array linked in total-cross-tied(TCT).The proposed algorithm utilizes the Newton-Raphson search rule(NRSR)to boost the exploration process,especially in search spaces with more local regions,and boost the exploitation with adaptive parameters alternating with random parameters in the original Puma.The effectiveness of the introduced IPuma is confirmed through comprehensive evaluations on the CEC’20 benchmark problems.It shows superior performance compared to both established and modern metaheuristic algorithms in terms of effectively navigating the search space and achieving convergence towards near-optimal regions.The findings indicated that the IPuma algorithm demonstrates considerable statistical promise and surpasses the performance of competing algorithms.In addition,the proposed IPuma is utilized to reconfigure a 9×9 PV array that operates under different shade patterns,such as lower triangular(LT),long wide(LW),and short wide(SW).In addition to other programmed approaches,such as the Whale optimization algorithm(WOA),grey wolf optimizer(GWO),Harris Hawks optimization(HHO),particle swarm optimization(PSO),gravitational search algorithm(GSA),biogeography-based optimization(BBO),sine cosine algorithm(SCA),equilibrium optimizer(EO),and original Puma,the indicated method is contrasted to the traditional configurations of TCT and Sudoku.In addition,the metrics of mismatch power loss,maximum efficiency improvement,efficiency improvement ratio,and peak-to-mean ratio are calculated to assess the effectiveness of the indicated approach.The proposed IPuma improved the generated power by 36.72%,28.03%,and 40.97%for SW,LW,and LT,respectively,outperforming the TCT configuration.In addition,it achieved the best maximum efficiency improvement among the algorithms considered,with 26.86%,21.89%,and 29.07%for the examined patterns.The results highlight the superiority and competence of the proposed approach in both convergence rates and stability,as well as applicability to dynamically reconfigure the PV system and enhance its harvested energy.
文摘Objective:To analyze the impact of improved emergency integrated nursing on the treatment effectiveness and safety of emergency trauma patients.Methods:Study duration:December 2024 to December 2025.Observation target:emergency trauma patients in our hospital.Sample size:92 cases.Using computer-based grouping,the 92 patients were divided into two equally sized groups:a control group of 46 patients who received conventional emergency nursing care,and an observation group of 46 patients who underwent an improved emergency integrated nursing model.The treatment-related indicators,treatment effectiveness,and incidence of adverse events were evaluated in both groups.Results:After intervention,the pre-hospital emergency care time,emergency diagnosis time,total emergency rescue duration,and examination waiting time in the control group were all longer than those in the observation group(p<0.05);the treatment effectiveness in the control group(effective rate:82.61%)was worse than that in the observation group(effective rate:95.65%),p<0.05;compared with the control group,the observation group had a lower incidence of adverse events,p<0.05.Conclusion:Implementing an improved emergency integrated nursing model for emergency trauma patients helps streamline the treatment process,enhance treatment effectiveness,and reduce the incidence of adverse events.
文摘The multi-objective optimization problems,especially in constrained environments such as power distribution planning,demand robust strategies for discovering effective solutions.This work presents the improved variant of the Multi-population Cooperative Constrained Multi-Objective Optimization(MCCMO)Algorithm,termed Adaptive Diversity Preservation(ADP).This enhancement is primarily focused on the improvement of constraint handling strategies,local search integration,hybrid selection approaches,and adaptive parameter control.Theimproved variant was experimented on with the RWMOP50 power distribution systemplanning benchmark.As per the findings,the improved variant outperformed the original MCCMO across the eleven performance metrics,particularly in terms of convergence speed,constraint handling efficiency,and solution diversity.The results also establish that MCCMOADP consistently delivers substantial performance gains over the baseline MCCMO,demonstrating its effectiveness across performancemetrics.The new variant also excels atmaintaining the balanced trade-off between exploration and exploitation throughout the search process,making it especially suitable for complex optimization problems in multiconstrained power systems.These enhancements make MCCMO-ADP a valuable and promising candidate for handling problems such as renewable energy scheduling,logistics planning,and power system optimization.Future work will benchmark the MCCMO-ADP against widely recognized algorithms such as NSGA-Ⅱ,NSGA-Ⅲ,and MOEA/D and will also extend its validation to large-scale real-world optimization domains to further consolidate its generalizability.
文摘The improved cross-correlation algorithm for the strain demodulation of Vernier-effect-based optical fiber sensor(VE-OFS)is proposed in this article.The algorithm identifies the most similar spectrum to the measured one from the database of the collected spectra by employing the cross-correlation operation,subsequently deriving the predicted value via weighted calculation.As the algorithm uses the complete information in the measured raw spectrum,more accurate results and larger measurement range can be obtained.Additionally,the improved cross-correlation algorithm also has the potential to improve the measurement speed compared to current standards due to the possibility for the collection using low sampling rate.This work presents an important algorithm towards a simpler,faster way to improve the demodulation performance of VE-OFS.
文摘Optimization algorithms are crucial for solving NP-hard problems in engineering and computational sciences.Metaheuristic algorithms,in particular,have proven highly effective in complex optimization scenarios characterized by high dimensionality and intricate variable relationships.The Mountain Gazelle Optimizer(MGO)is notably effective but struggles to balance local search refinement and global space exploration,often leading to premature convergence and entrapment in local optima.This paper presents the Improved MGO(IMGO),which integrates three synergistic enhancements:dynamic chaos mapping using piecewise chaotic sequences to boost explo-ration diversity;Opposition-Based Learning(OBL)with adaptive,diversity-driven activation to speed up convergence;and structural refinements to the position update mechanisms to enhance exploitation.The IMGO underwent a comprehensive evaluation using 52 standardised benchmark functions and seven engineering optimization problems.Benchmark evaluations showed that IMGO achieved the highest rank in best solution quality for 31 functions,the highest rank in mean performance for 18 functions,and the highest rank in worst-case performance for 14 functions among 11 competing algorithms.Statistical validation using Wilcoxon signed-rank tests confirmed that IMGO outperformed individual competitors across 16 to 50 functions,depending on the algorithm.At the same time,Friedman ranking analysis placed IMGO with an average rank of 4.15,compared to the baseline MGO’s 4.38,establishing the best overall performance.The evaluation of engineering problems revealed consistent improvements,including an optimal cost of 1.6896 for the welded beam design vs.MGO’s 1.7249,a minimum cost of 5885.33 for the pressure vessel design vs.MGO’s 6300,and a minimum weight of 2964.52 kg for the speed reducer design vs.MGO’s 2990.00 kg.Ablation studies identified OBL as the strongest individual contributor,whereas complete integration achieved superior performance through synergistic interactions among components.Computational complexity analysis established an O(T×N×5×f(P))time complexity,representing a 1.25×increase in fitness evaluation relative to the baseline MGO,validating the favorable accuracy-efficiency trade-offs for practical optimization applications.
基金funded by Changzhou Science and Technology Project(No.CZ20230025)Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.XSJCX23_36).
文摘Aiming at the problem that the existing algorithms for vehicle detection in smart factories are difficult to detect partial occlusion of vehicles,vulnerable to background interference,lack of global vision,and excessive suppression of real targets,which ultimately cause accuracy degradation.At the same time,to facilitate the subsequent positioning of vehicles in the factory,this paper proposes an improved YOLOv8 algorithm.Firstly,the RFCAConv module is combined to improve the original YOLOv8 backbone.Pay attention to the different features in the receptive field,and give priority to the spatial features of the receptive field to capture more vehicle feature information and solve the problem that the vehicle is partially occluded and difficult to detect.Secondly,the SFE module is added to the neck of v8,which improves the saliency of the target in the reasoning process and reduces the influence of background interference on vehicle detection.Finally,the head of the RT-DETR algorithm is used to replace the head in the original YOLOv8 algorithm,which avoids the excessive suppression of the real target while combining the context information.The experimental results show that compared with the original YOLOv8 algorithm,the detection accuracy of the improved YOLOv8 algorithm is improved by 4.6%on the self-made smart factory data set,and the detection speed also meets the real-time requirements of smart factory vehicle detection and subsequent vehicle positioning.
文摘The internal flow fields within a three-dimensional inward-tunning combined inlet are extremely complex,especially during the engine mode transition,where the tunnel changes may impact the flow fields significantly.To develop an efficient flow field reconstruction model for this,we present an Improved Conditional Denoising Diffusion Generative Adversarial Network(ICDDGAN),which integrates Conditional Denoising Diffusion Probabilistic Models(CDDPMs)with Style GAN,and introduce a reconstruction discrimination mechanism and dynamic loss weight learning strategy.We establish the Mach number flow field dataset by numerical simulation at various backpressures for the mode transition process from turbine mode to ejector ramjet mode at Mach number 2.5.The proposed ICDDGAN model,given only sparse parameter information,can rapidly generate high-quality Mach number flow fields without a large number of samples for training.The results show that ICDDGAN is superior to CDDGAN in terms of training convergence and stability.Moreover,the interpolation and extrapolation test results during backpressure conditions show that ICDDGAN can accurately and quickly reconstruct Mach number fields at various tunnel slice shapes,with a Structural Similarity Index Measure(SSIM)of over 0.96 and a Mean-Square Error(MSE)of 0.035%to actual flow fields,reducing time costs by 7-8 orders of magnitude compared to Computational Fluid Dynamics(CFD)calculations.This can provide an efficient means for rapid computation of complex flow fields.
文摘The accurate estimation of lithium battery state of health(SOH)plays an important role in the health management of battery systems.In order to improve the prediction accuracy of SOH,this paper proposes a stochastic configuration network based on a multi-converged black-winged kite search algorithm,called SBKA-CLSCN.Firstly,the indirect health index(HI)of the battery is extracted by combining it with Person correlation coefficients in the battery charging and discharging cycle point data.Secondly,to address the problem that the black-winged kite optimization algorithm(BKA)falls into the local optimum problem and improve the convergence speed,the Sine chaotic black-winged kite search algorithm(SBKA)is designed,which mainly utilizes the Sine mapping and the golden-sine strategy to enhance the algorithm’s global optimality search ability;secondly,the Cauchy distribution and Laplace regularization techniques are used in the SCN model,which is referred to as CLSCN,thereby improving the model’s overall search capability and generalization ability.Finally,the performance of SBKA and SBKA-CLSCN is evaluated using eight benchmark functions and the CALCE battery dataset,respectively,and compared in comparison with the Long Short-Term Memory(LSTM)model and the Gated Recurrent Unit(GRU)model,and the experimental results demonstrate the feasibility and effectiveness of the SBKA-CLSCN algorithm.
基金Supported by the EDD of China(No.80912020104)the Science and Technology Commission of Shanghai Municipality(No.22ZR1427700 and No.23692106900).
文摘The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.
基金Supported by the Anhui Province Sports Health Information Monitoring Technology Engineering Research Center Open Project (KF2023012)。
文摘Deep learning algorithm is an effective data mining method and has been used in many fields to solve practical problems.However,the deep learning algorithms often contain some hyper-parameters which may be continuous,integer,or mixed,and are often given based on experience but largely affect the effectiveness of activity recognition.In order to adapt to different hyper-parameter optimization problems,our improved Cuckoo Search(CS)algorithm is proposed to optimize the mixed hyper-parameters in deep learning algorithm.The algorithm optimizes the hyper-parameters in the deep learning model robustly,and intelligently selects the combination of integer type and continuous hyper-parameters that make the model optimal.Then,the mixed hyper-parameter in Convolutional Neural Network(CNN),Long-Short-Term Memory(LSTM)and CNN-LSTM are optimized based on the methodology on the smart home activity recognition datasets.Results show that the methodology can improve the performance of the deep learning model and whether we are experienced or not,we can get a better deep learning model using our method.
文摘The research on optimization methods for constellation launch deployment strategies focused on the consideration of mission interval time constraints at the launch site.Firstly,a dynamic modeling of the constellation deployment process was established,and the relationship between the deployment window and the phase difference of the orbit insertion point,as well as the cost of phase adjustment after orbit insertion,was derived.Then,the combination of the constellation deployment position sequence was treated as a parameter,together with the sequence of satellite deployment intervals,as optimization variables,simplifying a highdimensional search problem within a wide range of dates to a finite-dimensional integer programming problem.An improved genetic algorithm with local search on deployment dates was introduced to optimize the launch deployment strategy.With the new description of the optimization variables,the total number of elements in the solution space was reduced by N orders of magnitude.Numerical simulation confirms that the proposed optimization method accelerates the convergence speed from hours to minutes.
基金The National Natural Science Foundation of China(No.U19B2031).
文摘A new method based on the iterative adaptive algorithm(IAA)and blocking matrix preprocessing(BMP)is proposed to study the suppression of multi-mainlobe interference.The algorithm is applied to precisely estimate the spatial spectrum and the directions of arrival(DOA)of interferences to overcome the drawbacks associated with conventional adaptive beamforming(ABF)methods.The mainlobe interferences are identified by calculating the correlation coefficients between direction steering vectors(SVs)and rejected by the BMP pretreatment.Then,IAA is subsequently employed to reconstruct a sidelobe interference-plus-noise covariance matrix for the preferable ABF and residual interference suppression.Simulation results demonstrate the excellence of the proposed method over normal methods based on BMP and eigen-projection matrix perprocessing(EMP)under both uncorrelated and coherent circumstances.
基金supported by the National Natural Science Foundation of China(Grant No.52172356)the Hunan Provincial Natural Science Foundation of China(Grant No.2022JJ10012).
文摘The application of multi-material topology optimization affords greater design flexibility compared to traditional single-material methods.However,density-based topology optimization methods encounter three unique challenges when inertial loads become dominant:non-monotonous behavior of the objective function,possible unconstrained characterization of the optimal solution,and parasitic effects.Herein,an improved Guide-Weight approach is introduced,which effectively addresses the structural topology optimization problem when subjected to inertial loads.Smooth and fast convergence of the compliance is achieved by the approach,while also maintaining the effectiveness of the volume constraints.The rational approximation of material properties model and smooth design are utilized to guarantee clear boundaries of the final structure,facilitating its seamless integration into manufacturing processes.The framework provided by the alternating active-phase algorithm is employed to decompose the multi-material topological problem under inertial loading into a set of sub-problems.The optimization of multi-material under inertial loads is accomplished through the effective resolution of these sub-problems using the improved Guide-Weight method.The effectiveness of the proposed approach is demonstrated through numerical examples involving two-phase and multi-phase materials.
