期刊文献+
共找到366,383篇文章
< 1 2 250 >
每页显示 20 50 100
An Underwater Target Detection Algorithm Based on Attention Mechanism and Improved YOLOv7 被引量:1
1
作者 Liqiu Ren Zhanying Li +2 位作者 Xueyu He Lingyan Kong Yinghao Zhang 《Computers, Materials & Continua》 SCIE EI 2024年第2期2829-2845,共17页
For underwater robots in the process of performing target detection tasks,the color distortion and the uneven quality of underwater images lead to great difficulties in the feature extraction process of the model,whic... For underwater robots in the process of performing target detection tasks,the color distortion and the uneven quality of underwater images lead to great difficulties in the feature extraction process of the model,which is prone to issues like error detection,omission detection,and poor accuracy.Therefore,this paper proposed the CER-YOLOv7(CBAM-EIOU-RepVGG-YOLOv7)underwater target detection algorithm.To improve the algorithm’s capability to retain valid features from both spatial and channel perspectives during the feature extraction phase,we have added a Convolutional Block Attention Module(CBAM)to the backbone network.The Reparameterization Visual Geometry Group(RepVGG)module is inserted into the backbone to improve the training and inference capabilities.The Efficient Intersection over Union(EIoU)loss is also used as the localization loss function,which reduces the error detection rate and missed detection rate of the algorithm.The experimental results of the CER-YOLOv7 algorithm on the UPRC(Underwater Robot Prototype Competition)dataset show that the mAP(mean Average Precision)score of the algorithm is 86.1%,which is a 2.2%improvement compared to the YOLOv7.The feasibility and validity of the CER-YOLOv7 are proved through ablation and comparison experiments,and it is more suitable for underwater target detection. 展开更多
关键词 Deep learning underwater object detection improved YOLOv7 attention mechanism
下载PDF
Path Planning for AUVs Based on Improved APF-AC Algorithm 被引量:1
2
作者 Guojun Chen Danguo Cheng +2 位作者 Wei Chen Xue Yang Tiezheng Guo 《Computers, Materials & Continua》 SCIE EI 2024年第3期3721-3741,共21页
With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater envir... With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater environments.However,nowadays AUVs generally have drawbacks such as weak endurance,low intelligence,and poor detection ability.The research and implementation of path-planning methods are the premise of AUVs to achieve actual tasks.To improve the underwater operation ability of the AUV,this paper studies the typical problems of path-planning for the ant colony algorithm and the artificial potential field algorithm.In response to the limitations of a single algorithm,an optimization scheme is proposed to improve the artificial potential field ant colony(APF-AC)algorithm.Compared with traditional ant colony and comparative algorithms,the APF-AC reduced the path length by 1.57%and 0.63%(in the simple environment),8.92%and 3.46%(in the complex environment).The iteration time has been reduced by approximately 28.48%and 18.05%(in the simple environment),18.53%and 9.24%(in the complex environment).Finally,the improved APF-AC algorithm has been validated on the AUV platform,and the experiment is consistent with the simulation.Improved APF-AC algorithm can effectively reduce the underwater operation time and overall power consumption of the AUV,and shows a higher safety. 展开更多
关键词 PATH-PLANNING autonomous underwater vehicle ant colony algorithm artificial potential field bio-inspired neural network
下载PDF
Optimization of jamming formation of USV offboard active decoy clusters based on an improved PSO algorithm
3
作者 Zhaodong Wu Yasong Luo Shengliang Hu 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期529-540,共12页
Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for t... Offboard active decoys(OADs)can effectively jam monopulse radars.However,for missiles approaching from a particular direction and distance,the OAD should be placed at a specific location,posing high requirements for timing and deployment.To improve the response speed and jamming effect,a cluster of OADs based on an unmanned surface vehicle(USV)is proposed.The formation of the cluster determines the effectiveness of jamming.First,based on the mechanism of OAD jamming,critical conditions are identified,and a method for assessing the jamming effect is proposed.Then,for the optimization of the cluster formation,a mathematical model is built,and a multi-tribe adaptive particle swarm optimization algorithm based on mutation strategy and Metropolis criterion(3M-APSO)is designed.Finally,the formation optimization problem is solved and analyzed using the 3M-APSO algorithm under specific scenarios.The results show that the improved algorithm has a faster convergence rate and superior performance as compared to the standard Adaptive-PSO algorithm.Compared with a single OAD,the optimal formation of USV-OAD cluster effectively fills the blind area and maximizes the use of jamming resources. 展开更多
关键词 Electronic countermeasure Offboard active decoy USV cluster Jamming formation optimization improved PSO algorithm
下载PDF
Research on Defect Detection of Wind Turbine Blades Based on Morphology and Improved Otsu Algorithm Using Infrared Images
4
作者 Shuang Kang Yinchao He +1 位作者 Wenwen Li Sen Liu 《Computers, Materials & Continua》 SCIE EI 2024年第10期933-949,共17页
To address the issues of low accuracy and high false positive rate in traditional Otsu algorithm for defect detection on infrared images of wind turbine blades(WTB),this paper proposes a technique that combines morpho... To address the issues of low accuracy and high false positive rate in traditional Otsu algorithm for defect detection on infrared images of wind turbine blades(WTB),this paper proposes a technique that combines morphological image enhancement with an improved Otsu algorithm.First,mathematical morphology’s differential multi-scale white and black top-hat operations are applied to enhance the image.The algorithm employs entropy as the objective function to guide the iteration process of image enhancement,selecting appropriate structural element scales to execute differential multi-scale white and black top-hat transformations,effectively enhancing the detail features of defect regions and improving the contrast between defects and background.Afterwards,grayscale inversion is performed on the enhanced infrared defect image to better adapt to the improved Otsu algorithm.Finally,by introducing a parameter K to adjust the calculation of inter-class variance in the Otsu method,the weight of the target pixels is increased.Combined with the adaptive iterative threshold algorithm,the threshold selection process is further fine-tuned.Experimental results show that compared to traditional Otsu algorithms and other improvements,the proposed method has significant advantages in terms of defect detection accuracy and reducing false positive rates.The average defect detection rate approaches 1,and the average Hausdorff distance decreases to 0.825,indicating strong robustness and accuracy of the method. 展开更多
关键词 Morphological enhancement improved Otsu algorithm infrared image grayscale inversion adaptive iterative thresholding
下载PDF
Research on Evacuation Path Planning Based on Improved Sparrow Search Algorithm
5
作者 Xiaoge Wei Yuming Zhang +2 位作者 Huaitao Song Hengjie Qin Guanjun Zhao 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第5期1295-1316,共22页
Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Fi... Reducing casualties and property losses through effective evacuation route planning has been a key focus for researchers in recent years.As part of this effort,an enhanced sparrow search algorithm(MSSA)was proposed.Firstly,the Golden Sine algorithm and a nonlinear weight factor optimization strategy were added in the discoverer position update stage of the SSA algorithm.Secondly,the Cauchy-Gaussian perturbation was applied to the optimal position of the SSA algorithm to improve its ability to jump out of local optima.Finally,the local search mechanism based on the mountain climbing method was incorporated into the local search stage of the SSA algorithm,improving its local search ability.To evaluate the effectiveness of the proposed algorithm,the Whale Algorithm,Gray Wolf Algorithm,Improved Gray Wolf Algorithm,Sparrow Search Algorithm,and MSSA Algorithm were employed to solve various test functions.The accuracy and convergence speed of each algorithm were then compared and analyzed.The results indicate that the MSSA algorithm has superior solving ability and stability compared to other algorithms.To further validate the enhanced algorithm’s capabilities for path planning,evacuation experiments were conducted using different maps featuring various obstacle types.Additionally,a multi-exit evacuation scenario was constructed according to the actual building environment of a teaching building.Both the sparrow search algorithm and MSSA algorithm were employed in the simulation experiment for multiexit evacuation path planning.The findings demonstrate that the MSSA algorithm outperforms the comparison algorithm,showcasing its greater advantages and higher application potential. 展开更多
关键词 Sparrow search algorithm optimization and improvement function test set evacuation path planning
下载PDF
An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time
6
作者 Xiaoqing Wang Peng Duan +1 位作者 Leilei Meng Kaidong Yang 《Computers, Materials & Continua》 SCIE EI 2024年第7期931-947,共17页
Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario.In this study,we investigated the post-disaster rescue path planning probl... Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster scenario.In this study,we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem(TSP)with life-strength constraints.To address this problem,we proposed an improved iterated greedy(IIG)algorithm.First,a push-forward insertion heuristic(PFIH)strategy was employed to generate a high-quality initial solution.Second,a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ability.Furthermore,three problem-specific swap operators were developed to improve the algorithm’s exploitation ability.Additionally,an improved simulated annealing(SA)strategy was used as an acceptance criterion to effectively prevent the algorithm from falling into local optima.To verify the effectiveness of the proposed algorithm,the Solomon dataset was extended to generate 27 instances for simulation.Finally,the proposed IIG was compared with five state-of-the-art algorithms.The parameter analysiswas conducted using the design of experiments(DOE)Taguchi method,and the effectiveness analysis of each component has been verified one by one.Simulation results indicate that IIGoutperforms the compared algorithms in terms of the number of rescue survivors and convergence speed,proving the effectiveness of the proposed algorithm. 展开更多
关键词 Rescue robot path planning life strength improved iterative greedy algorithm problem-specific swap operators
下载PDF
Image encryption algorithm based on multiple chaotic systems and improved Joseph block scrambling
7
作者 Dingkang Mou Yumin Dong 《Chinese Physics B》 SCIE EI CAS CSCD 2024年第10期248-257,共10页
With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and... With the rapid development of digital information technology,images are increasingly used in various fields.To ensure the security of image data,prevent unauthorized tampering and leakage,maintain personal privacy,and protect intellectual property rights,this study proposes an innovative color image encryption algorithm.Initially,the Mersenne Twister algorithm is utilized to generate high-quality pseudo-random numbers,establishing a robust basis for subsequent operations.Subsequently,two distinct chaotic systems,the autonomous non-Hamiltonian chaotic system and the tentlogistic-cosine chaotic mapping,are employed to produce chaotic random sequences.These chaotic sequences are used to control the encoding and decoding process of the DNA,effectively scrambling the image pixels.Furthermore,the complexity of the encryption process is enhanced through improved Joseph block scrambling.Thorough experimental verification,research,and analysis,the average value of the information entropy test data reaches as high as 7.999.Additionally,the average value of the number of pixels change rate(NPCR)test data is 99.6101%,which closely approaches the ideal value of 99.6094%.This algorithm not only guarantees image quality but also substantially raises the difficulty of decryption. 展开更多
关键词 mersenne twister algorithm DNA coding confusion pixel XOR operation improved Joseph block scrambling
下载PDF
Hybrid Gene Selection Methods for High-Dimensional Lung Cancer Data Using Improved Arithmetic Optimization Algorithm
8
作者 Mutasem K.Alsmadi 《Computers, Materials & Continua》 SCIE EI 2024年第6期5175-5200,共26页
Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression ... Lung cancer is among the most frequent cancers in the world,with over one million deaths per year.Classification is required for lung cancer diagnosis and therapy to be effective,accurate,and reliable.Gene expression microarrays have made it possible to find genetic biomarkers for cancer diagnosis and prediction in a high-throughput manner.Machine Learning(ML)has been widely used to diagnose and classify lung cancer where the performance of ML methods is evaluated to identify the appropriate technique.Identifying and selecting the gene expression patterns can help in lung cancer diagnoses and classification.Normally,microarrays include several genes and may cause confusion or false prediction.Therefore,the Arithmetic Optimization Algorithm(AOA)is used to identify the optimal gene subset to reduce the number of selected genes.Which can allow the classifiers to yield the best performance for lung cancer classification.In addition,we proposed a modified version of AOA which can work effectively on the high dimensional dataset.In the modified AOA,the features are ranked by their weights and are used to initialize the AOA population.The exploitation process of AOA is then enhanced by developing a local search algorithm based on two neighborhood strategies.Finally,the efficiency of the proposed methods was evaluated on gene expression datasets related to Lung cancer using stratified 4-fold cross-validation.The method’s efficacy in selecting the optimal gene subset is underscored by its ability to maintain feature proportions between 10%to 25%.Moreover,the approach significantly enhances lung cancer prediction accuracy.For instance,Lung_Harvard1 achieved an accuracy of 97.5%,Lung_Harvard2 and Lung_Michigan datasets both achieved 100%,Lung_Adenocarcinoma obtained an accuracy of 88.2%,and Lung_Ontario achieved an accuracy of 87.5%.In conclusion,the results indicate the potential promise of the proposed modified AOA approach in classifying microarray cancer data. 展开更多
关键词 Lung cancer gene selection improved arithmetic optimization algorithm and machine learning
下载PDF
Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm
9
作者 Huanan Yu Hangyu Li +1 位作者 He Wang Shiqiang Li 《Energy Engineering》 EI 2024年第6期1535-1555,共21页
The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optim... The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach. 展开更多
关键词 Optimal allocation improved particle swarm algorithm fault location compressed sensing DC distribution network
下载PDF
An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem
10
作者 Zhaolin Lv Yuexia Zhao +2 位作者 Hongyue Kang Zhenyu Gao Yuhang Qin 《Computers, Materials & Continua》 SCIE EI 2024年第2期2337-2360,共24页
Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been... Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms. 展开更多
关键词 Flexible job shop scheduling improved Harris hawk optimization algorithm(GNHHO) premature convergence maximum completion time(makespan)
下载PDF
Prediction Model of Wax Deposition Rate in Waxy Crude Oil Pipelines by Elman Neural Network Based on Improved Reptile Search Algorithm
11
作者 Zhuo Chen Ningning Wang +1 位作者 Wenbo Jin Dui Li 《Energy Engineering》 EI 2024年第4期1007-1026,共20页
A hard problem that hinders the movement of waxy crude oil is wax deposition in oil pipelines.To ensure the safe operation of crude oil pipelines,an accurate model must be developed to predict the rate of wax depositi... A hard problem that hinders the movement of waxy crude oil is wax deposition in oil pipelines.To ensure the safe operation of crude oil pipelines,an accurate model must be developed to predict the rate of wax deposition in crude oil pipelines.Aiming at the shortcomings of the ENN prediction model,which easily falls into the local minimum value and weak generalization ability in the implementation process,an optimized ENN prediction model based on the IRSA is proposed.The validity of the new model was confirmed by the accurate prediction of two sets of experimental data on wax deposition in crude oil pipelines.The two groups of crude oil wax deposition rate case prediction results showed that the average absolute percentage errors of IRSA-ENN prediction models is 0.5476% and 0.7831%,respectively.Additionally,it shows a higher prediction accuracy compared to the ENN prediction model.In fact,the new model established by using the IRSA to optimize ENN can optimize the initial weights and thresholds in the prediction process,which can overcome the shortcomings of the ENN prediction model,such as weak generalization ability and tendency to fall into the local minimum value,so that it has the advantages of strong implementation and high prediction accuracy. 展开更多
关键词 Waxy crude oil wax deposition rate chaotic map improved reptile search algorithm Elman neural network prediction accuracy
下载PDF
Multi-Objective Optimization of VBHF in Deep Drawing Based on the Improved QO-Jaya Algorithm
12
作者 Xiangyu Jiang Zhaoxi Hong +1 位作者 Yixiong Feng Jianrong Tan 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2024年第1期189-202,共14页
Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of d... Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of deep drawing.The variable blank holder force(VBHF)varying with the drawing stage can overcome this problem at an extent.The optimization of VBHF is to determine the optimal BHF in every deep drawing stage.In this paper,a new heuristic optimization algorithm named Jaya is introduced to solve the optimization efficiently.An improved“Quasi-oppositional”strategy is added to Jaya algorithm for improving population diversity.Meanwhile,an innovated stop criterion is added for better convergence.Firstly,the quality evaluation criteria for wrinkling and tearing are built.Secondly,the Kriging models are developed to approximate and quantify the relation between VBHF and forming defects under random sampling.Finally,the optimization models are established and solved by the improved QO-Jaya algorithm.A VBHF optimization example of component with complicated shape and thin wall is studied to prove the effectiveness of the improved Jaya algorithm.The optimization results are compared with that obtained by other algorithms based on the TOPSIS method. 展开更多
关键词 Variable blank holder force Multi-objective optimization QO-Jaya algorithm algorithm stop criterion
下载PDF
An Improved Image Steganography Security and Capacity Using Ant Colony Algorithm Optimization
13
作者 Zinah Khalid Jasim Jasim Sefer Kurnaz 《Computers, Materials & Continua》 SCIE EI 2024年第9期4643-4662,共20页
This advanced paper presents a new approach to improving image steganography using the Ant Colony Optimization(ACO)algorithm.Image steganography,a technique of embedding hidden information in digital photographs,shoul... This advanced paper presents a new approach to improving image steganography using the Ant Colony Optimization(ACO)algorithm.Image steganography,a technique of embedding hidden information in digital photographs,should ideally achieve the dual purposes of maximum data hiding and maintenance of the integrity of the cover media so that it is least suspect.The contemporary methods of steganography are at best a compromise between these two.In this paper,we present our approach,entitled Ant Colony Optimization(ACO)-Least Significant Bit(LSB),which attempts to optimize the capacity in steganographic embedding.The approach makes use of a grayscale cover image to hide the confidential data with an additional bit pair per byte,both for integrity verification and the file checksumof the secret data.This approach encodes confidential information into four pairs of bits and embeds it within uncompressed grayscale images.The ACO algorithm uses adaptive exploration to select some pixels,maximizing the capacity of data embedding whileminimizing the degradation of visual quality.Pheromone evaporation is introduced through iterations to avoid stagnation in solution refinement.The levels of pheromone are modified to reinforce successful pixel choices.Experimental results obtained through the ACO-LSB method reveal that it clearly improves image steganography capabilities by providing an increase of up to 30%in the embedding capacity compared with traditional approaches;the average Peak Signal to Noise Ratio(PSNR)is 40.5 dB with a Structural Index Similarity(SSIM)of 0.98.The approach also demonstrates very high resistance to detection,cutting down the rate by 20%.Implemented in MATLAB R2023a,the model was tested against one thousand publicly available grayscale images,thus providing robust evidence of its effectiveness. 展开更多
关键词 STEGANOGRAPHY STEGANALYSIS capacity optimization ant colony algorithm
下载PDF
Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm-Based Clustering Scheme for Augmenting Network Lifetime in WSNs
14
作者 N Tamilarasan SB Lenin +1 位作者 P Mukunthan NC Sendhilkumar 《China Communications》 SCIE CSCD 2024年第9期159-178,共20页
In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending netw... In Wireless Sensor Networks(WSNs),Clustering process is widely utilized for increasing the lifespan with sustained energy stability during data transmission.Several clustering protocols were devised for extending network lifetime,but most of them failed in handling the problem of fixed clustering,static rounds,and inadequate Cluster Head(CH)selection criteria which consumes more energy.In this paper,Stochastic Ranking Improved Teaching-Learning and Adaptive Grasshopper Optimization Algorithm(SRITL-AGOA)-based Clustering Scheme for energy stabilization and extending network lifespan.This SRITL-AGOA selected CH depending on the weightage of factors such as node mobility degree,neighbour's density distance to sink,single-hop or multihop communication and Residual Energy(RE)that directly influences the energy consumption of sensor nodes.In specific,Grasshopper Optimization Algorithm(GOA)is improved through tangent-based nonlinear strategy for enhancing the ability of global optimization.On the other hand,stochastic ranking and violation constraint handling strategies are embedded into Teaching-Learning-based Optimization Algorithm(TLOA)for improving its exploitation tendencies.Then,SR and VCH improved TLOA is embedded into the exploitation phase of AGOA for selecting better CH by maintaining better balance amid exploration and exploitation.Simulation results confirmed that the proposed SRITL-AGOA improved throughput by 21.86%,network stability by 18.94%,load balancing by 16.14%with minimized energy depletion by19.21%,compared to the competitive CH selection approaches. 展开更多
关键词 Adaptive Grasshopper Optimization algorithm(AGOA) Cluster Head(CH) network lifetime Teaching-Learning-based Optimization algorithm(TLOA) Wireless Sensor Networks(WSNs)
下载PDF
A Lightweight UAV Visual Obstacle Avoidance Algorithm Based on Improved YOLOv8
15
作者 Zongdong Du Xuefeng Feng +2 位作者 Feng Li Qinglong Xian Zhenhong Jia 《Computers, Materials & Continua》 SCIE EI 2024年第11期2607-2627,共21页
The importance of unmanned aerial vehicle(UAV)obstacle avoidance algorithms lies in their ability to ensure flight safety and collision avoidance,thereby protecting people and property.We propose UAD-YOLOv8,a lightwei... The importance of unmanned aerial vehicle(UAV)obstacle avoidance algorithms lies in their ability to ensure flight safety and collision avoidance,thereby protecting people and property.We propose UAD-YOLOv8,a lightweight YOLOv8-based obstacle detection algorithm optimized for UAV obstacle avoidance.The algorithm enhances the detection capability for small and irregular obstacles by removing the P5 feature layer and introducing deformable convolution v2(DCNv2)to optimize the cross stage partial bottleneck with 2 convolutions and fusion(C2f)module.Additionally,it reduces the model’s parameter count and computational load by constructing the unite ghost and depth-wise separable convolution(UGDConv)series of lightweight convolutions and a lightweight detection head.Based on this,we designed a visual obstacle avoidance algorithm that can improve the obstacle avoidance performance of UAVs in different environments.In particular,we propose an adaptive distance detection algorithm based on obstacle attributes to solve the ranging problem for multiple types and irregular obstacles to further enhance the UAV’s obstacle avoidance capability.To verify the effectiveness of the algorithm,the UAV obstacle detection(UAD)dataset was created.The experimental results show that UAD-YOLOv8 improves mAP50 by 3.4%and reduces GFLOPs by 34.5%compared to YOLOv8n while reducing the number of parameters by 77.4%and the model size by 73%.These improvements significantly enhance the UAV’s obstacle avoidance performance in complex environments,demonstrating its wide range of applications. 展开更多
关键词 Unmanned aerial vehicle obstacle detection obstacle avoidance algorithm
下载PDF
Research on Flexible Job Shop Scheduling Based on Improved Two-Layer Optimization Algorithm
16
作者 Qinhui Liu Laizheng Zhu +2 位作者 Zhijie Gao Jilong Wang Jiang Li 《Computers, Materials & Continua》 SCIE EI 2024年第1期811-843,共33页
To improve the productivity,the resource utilization and reduce the production cost of flexible job shops,this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization p... To improve the productivity,the resource utilization and reduce the production cost of flexible job shops,this paper designs an improved two-layer optimization algorithm for the dual-resource scheduling optimization problem of flexible job shop considering workpiece batching.Firstly,a mathematical model is established to minimize the maximum completion time.Secondly,an improved two-layer optimization algorithm is designed:the outer layer algorithm uses an improved PSO(Particle Swarm Optimization)to solve the workpiece batching problem,and the inner layer algorithm uses an improved GA(Genetic Algorithm)to solve the dual-resource scheduling problem.Then,a rescheduling method is designed to solve the task disturbance problem,represented by machine failures,occurring in the workshop production process.Finally,the superiority and effectiveness of the improved two-layer optimization algorithm are verified by two typical cases.The case results show that the improved two-layer optimization algorithm increases the average productivity by 7.44% compared to the ordinary two-layer optimization algorithm.By setting the different numbers of AGVs(Automated Guided Vehicles)and analyzing the impact on the production cycle of the whole order,this paper uses two indicators,the maximum completion time decreasing rate and the average AGV load time,to obtain the optimal number of AGVs,which saves the cost of production while ensuring the production efficiency.This research combines the solved problem with the real production process,which improves the productivity and reduces the production cost of the flexible job shop,and provides new ideas for the subsequent research. 展开更多
关键词 Dual resource scheduling workpiece batching RESCHEDULING particle swarm optimization genetic algorithm
下载PDF
Multi-Label Feature Selection Based on Improved Ant Colony Optimization Algorithm with Dynamic Redundancy and Label Dependence
17
作者 Ting Cai Chun Ye +5 位作者 Zhiwei Ye Ziyuan Chen Mengqing Mei Haichao Zhang Wanfang Bai Peng Zhang 《Computers, Materials & Continua》 SCIE EI 2024年第10期1157-1175,共19页
The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challengi... The world produces vast quantities of high-dimensional multi-semantic data.However,extracting valuable information from such a large amount of high-dimensional and multi-label data is undoubtedly arduous and challenging.Feature selection aims to mitigate the adverse impacts of high dimensionality in multi-label data by eliminating redundant and irrelevant features.The ant colony optimization algorithm has demonstrated encouraging outcomes in multi-label feature selection,because of its simplicity,efficiency,and similarity to reinforcement learning.Nevertheless,existing methods do not consider crucial correlation information,such as dynamic redundancy and label correlation.To tackle these concerns,the paper proposes a multi-label feature selection technique based on ant colony optimization algorithm(MFACO),focusing on dynamic redundancy and label correlation.Initially,the dynamic redundancy is assessed between the selected feature subset and potential features.Meanwhile,the ant colony optimization algorithm extracts label correlation from the label set,which is then combined into the heuristic factor as label weights.Experimental results demonstrate that our proposed strategies can effectively enhance the optimal search ability of ant colony,outperforming the other algorithms involved in the paper. 展开更多
关键词 Multi-label feature selection ant colony optimization algorithm dynamic redundancy high-dimensional data label correlation
下载PDF
A Multi-Strategy-Improved Northern Goshawk Optimization Algorithm for Global Optimization and Engineering Design
18
作者 Liang Zeng Mai Hu +2 位作者 Chenning Zhang Quan Yuan Shanshan Wang 《Computers, Materials & Continua》 SCIE EI 2024年第7期1677-1709,共33页
Optimization algorithms play a pivotal role in enhancing the performance and efficiency of systems across various scientific and engineering disciplines.To enhance the performance and alleviate the limitations of the ... Optimization algorithms play a pivotal role in enhancing the performance and efficiency of systems across various scientific and engineering disciplines.To enhance the performance and alleviate the limitations of the Northern Goshawk Optimization(NGO)algorithm,particularly its tendency towards premature convergence and entrapment in local optima during function optimization processes,this study introduces an advanced Improved Northern Goshawk Optimization(INGO)algorithm.This algorithm incorporates a multifaceted enhancement strategy to boost operational efficiency.Initially,a tent chaotic map is employed in the initialization phase to generate a diverse initial population,providing high-quality feasible solutions.Subsequently,after the first phase of the NGO’s iterative process,a whale fall strategy is introduced to prevent premature convergence into local optima.This is followed by the integration of T-distributionmutation strategies and the State Transition Algorithm(STA)after the second phase of the NGO,achieving a balanced synergy between the algorithm’s exploitation and exploration.This research evaluates the performance of INGO using 23 benchmark functions alongside the IEEE CEC 2017 benchmark functions,accompanied by a statistical analysis of the results.The experimental outcomes demonstrate INGO’s superior achievements in function optimization tasks.Furthermore,its applicability in solving engineering design problems was verified through simulations on Unmanned Aerial Vehicle(UAV)trajectory planning issues,establishing INGO’s capability in addressing complex optimization challenges. 展开更多
关键词 Northern Goshawk Optimization tent chaotic map T-distribution disturbance state transition algorithm UAV path planning
下载PDF
A flexible multiscale algorithm based on an improved smoothed particle hydrodynamics method for complex viscoelastic flows
19
作者 Jinlian REN Peirong LU +2 位作者 Tao JIANG Jianfeng LIU Weigang LU 《Applied Mathematics and Mechanics(English Edition)》 SCIE EI CSCD 2024年第8期1387-1402,共16页
Viscoelastic flows play an important role in numerous engineering fields,and the multiscale algorithms for simulating viscoelastic flows have received significant attention in order to deepen our understanding of the ... Viscoelastic flows play an important role in numerous engineering fields,and the multiscale algorithms for simulating viscoelastic flows have received significant attention in order to deepen our understanding of the nonlinear dynamic behaviors of viscoelastic fluids.However,traditional grid-based multiscale methods are confined to simple viscoelastic flows with short relaxation time,and there is a lack of uniform multiscale scheme available for coupling different solvers in the simulations of viscoelastic fluids.In this paper,a universal multiscale method coupling an improved smoothed particle hydrodynamics(SPH)and multiscale universal interface(MUI)library is presented for viscoelastic flows.The proposed multiscale method builds on an improved SPH method and leverages the MUI library to facilitate the exchange of information among different solvers in the overlapping domain.We test the capability and flexibility of the presented multiscale method to deal with complex viscoelastic flows by solving different multiscale problems of viscoelastic flows.In the first example,the simulation of a viscoelastic Poiseuille flow is carried out by two coupled improved SPH methods with different spatial resolutions.The effects of exchanging different physical quantities on the numerical results in both the upper and lower domains are also investigated as well as the absolute errors in the overlapping domain.In the second example,the complex Wannier flow with different Weissenberg numbers is further simulated by two improved SPH methods and coupling the improved SPH method and the dissipative particle dynamics(DPD)method.The numerical results show that the physical quantities for viscoelastic flows obtained by the presented multiscale method are in consistence with those obtained by a single solver in the overlapping domain.Moreover,transferring different physical quantities has an important effect on the numerical results. 展开更多
关键词 multiscale method improved smoothed particle hydrodynamics(SPH) dissipative particle dynamics(DPD) multiscale universal interface(MUI) complex viscoelastic flow
下载PDF
Maximum Power Point Tracking Based on Improved Kepler Optimization Algorithm and Optimized Perturb&Observe under Partial Shading Conditions
20
作者 Zhaoqiang Wang Fuyin Ni 《Energy Engineering》 EI 2024年第12期3779-3799,共21页
Under the partial shading conditions(PSC)of Photovoltaic(PV)modules in a PV hybrid system,the power output curve exhibits multiple peaks.This often causes traditional maximum power point tracking(MPPT)methods to fall ... Under the partial shading conditions(PSC)of Photovoltaic(PV)modules in a PV hybrid system,the power output curve exhibits multiple peaks.This often causes traditional maximum power point tracking(MPPT)methods to fall into local optima and fail to find the global optimum.To address this issue,a composite MPPT algorithm is proposed.It combines the improved kepler optimization algorithm(IKOA)with the optimized variable-step perturb and observe(OIP&O).The update probabilities,planetary velocity and position step coefficients of IKOA are nonlinearly and adaptively optimized.This adaptation meets the varying needs of the initial and later stages of the iterative process and accelerates convergence.During stochastic exploration,the refined position update formulas enhance diversity and global search capability.The improvements in the algorithmreduces the likelihood of falling into local optima.In the later stages,the OIP&O algorithm decreases oscillation and increases accuracy.compared with cuckoo search(CS)and gray wolf optimization(GWO),simulation tests of the PV hybrid inverter demonstrate that the proposed IKOA-OIP&O algorithm achieves faster convergence and greater stability under static,local and dynamic shading conditions.These results can confirm the feasibility and effectiveness of the proposed PV MPPT algorithm for PV hybrid systems. 展开更多
关键词 PV hybrid inverter kepler optimization algorithm maximum power point tracking perturb and observe
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部