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.展开更多
Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT*),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narr...Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT*),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT*-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT*,the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT*.Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.展开更多
Massive carbon dioxide(CO2)emissions drive climate change.Injecting CO2into unconventional reservoirsachieves both enhanced oil recovery(EOR)and geological sequestration.However,simultaneously optimizing oil exc...Massive carbon dioxide(CO2)emissions drive climate change.Injecting CO2into unconventional reservoirsachieves both enhanced oil recovery(EOR)and geological sequestration.However,simultaneously optimizing oil exchange ratio,CO2storage,and net present value remainschallenging.This study develops an integrated machine learning(ML)-based framework for multi-objective optimization of CO2-EOR.A high-resolution reservoir simulation was constructed from field data,and Latin hypercube sampling generateddiverse scenarios for proxy training.Mantel's test quantified correlations between input parameters and performance metrics,showing that injection strategy strongly controls net present value,whereas geological properties dominate CO2storage.Three ML models—random forest(RF),support vector regression,and artificial neural networks—were evaluated,with RF selected for its superior performance on small datasets.RF was embedded into an improved non-dominatedsorting genetic algorithm II,enhanced with grey difference degree,crowding distance,and adaptive differential evolution to improve diversity and efficiency.Finally,the technique for order preference by similarity to ideal solution ranked Pareto-optimal solutions through integrating oil productivity,storage,and economics.The proposed framework operationalizes simultaneoushigh-efficiency tight oil recovery and field-scale CO2geological storage,delivering quantitative design rules that embed low-carbon practice into upstream operations and advance the energy sector's greenerand sustainable transition.展开更多
The current infrared image pedestrian detectors have problems with high rates of false positives and false negatives. To solve these problems, we proposed an improved anchor-free fully convolutional one-stage object d...The current infrared image pedestrian detectors have problems with high rates of false positives and false negatives. To solve these problems, we proposed an improved anchor-free fully convolutional one-stage object detection(FCOS) algorithm. Firstly, we introduced the channel attention module squeeze excitation(SE)-Block in the FCOS backbone network, which was used to learn how to model the relative importance between different feature channels, and to achieve the weight recalibration of the features extracted from the convolution neural network, and improve the weight values that are more important for pedestrian target detection. Secondly, soft non-maximum suppression(Soft-NMS) replaced the conventional NMS within the algorithm's post-processing phase, which was used to reduce the probability of missed detection for occluded pedestrians. The experimental results show that our improved FCOS algorithm improves the average precision(AP) by 6.71% on the original dataset and 7.97% on the augmented KAIST pedestrian dataset compared with the original FCOS algorithm. Our improvements effectively meet the real-time requirements and there is no significant decrease in speed compared with the original FCOS algorithm, and decreased the false positives and false negatives for infrared image pedestrian detection.展开更多
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.展开更多
This paper suggests an improved you only look once version 8n(YOLOv8n)algorithm for apple leaf disease detection,abbreviated as ALWB-YOLOv8n.The model is comprised of four essential components.Initially,arbitrary kern...This paper suggests an improved you only look once version 8n(YOLOv8n)algorithm for apple leaf disease detection,abbreviated as ALWB-YOLOv8n.The model is comprised of four essential components.Initially,arbitrary kernel convolution(AKConv)replaces the convolution module,which significantly decreases both the model’s parameter count and its overall size.Secondly,the large selective kernel network(LSKNet)attention mechanism is added in the Backbone,which can dynamically adjust the spatial sensory domain,and experiments have proved that this method is extremely advantageous for small target detection.Third,a weighted bi-directional feature pyramid network is introduced,which enables the model to achieve multi-scale feature fusion and is more concise and faster.Finally,wise intersection over union(WIoU)is used to replace complete intersection over union(CIoU)in YOLOv8,and the idea of focal loss is introduced,which effectively solves the detection problems in cases such as apple leaves occluding each other and blurred boundaries of diseased leaves.The improved algorithm exhibits superior performance compared to other common object detection algorithms.Compared with YOLOv8n,the improved algorithm achieves 2.3%improvement in precision,3.8%improvement in recall,and 2.5%and 2.7%improvement in mAP0.5 and mAP0.5:0.95,respectively.Compared with YOLOv8n,the improved model reduces the number of parameters and size of the model and realizes real-time monitoring with a frames per second(FPS)of 50.5.展开更多
In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional R...In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.展开更多
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.展开更多
Aimed at the long and narrow geometric features and poor generalization ability of the damage detection in conveyor belts with steel rope cores using the X-ray image,a detection method of damage X-ray image is propose...Aimed at the long and narrow geometric features and poor generalization ability of the damage detection in conveyor belts with steel rope cores using the X-ray image,a detection method of damage X-ray image is proposed based on the improved fully convolutional one-stage object detection(FCOS)algorithm.The regression performance of bounding boxes was optimized by introducing the complete intersection over union loss function into the improved algorithm.The feature fusion network structure is modified by adding adaptive fusion paths to the feature fusion network structure,which makes full use of the features of accurate localization and semantics of multi-scale feature fusion networks.Finally,the network structure was trained and validated by using the X-ray image dataset of damages in conveyor belts with steel rope cores provided by a flaw detection equipment manufacturer.In addition,the data enhancement methods such as rotating,mirroring,and scaling,were employed to enrich the image dataset so that the model is adequately trained.Experimental results showed that the improved FCOS algorithm promoted the precision rate and the recall rate by 20.9%and 14.8%respectively,compared with the original algorithm.Meanwhile,compared with Fast R-CNN,Faster R-CNN,SSD,and YOLOv3,the improved FCOS algorithm has obvious advantages;detection precision rate and recall rate of the modified network reached 95.8%and 97.0%respectively.Furthermore,it demonstrated a higher detection accuracy without affecting the speed.The results of this work have some reference significance for the automatic identification and detection of steel core conveyor belt damage.展开更多
This paper uses an innovative improved artificial bee colony(IABC)algorithm to aid in the fabrication of a highly responsive phasemodulation surface plasmon resonance(SPR)biosensor.In this biosensor’s sensing structu...This paper uses an innovative improved artificial bee colony(IABC)algorithm to aid in the fabrication of a highly responsive phasemodulation surface plasmon resonance(SPR)biosensor.In this biosensor’s sensing structure,a double-layer Ag-Au metal film is combined with a blue phosphoreneransition metal dichalcogenide(BlueP/TMDC)hybrid structure and graphene.In the optimization function of the IABC method,the reflectivity at resonance angle is incorporated as a constraint to achieve high phase sensitivity.The performance of the Ag-Au-BlueP/TMDC-graphene heterostructure as optimized by the IABC method is compared with that of a similar structure optimized using the traditional ABC algorithm.The results indicate that optimization using the IABC method gives significantly more phase sensitivity,together with lower reflectivity,than can be achieved with the traditional ABC method.The highest phase sensitivity of 3.662×106 °/RIU is achieved with a bilayer of BlueP/WS2 and three layers of graphene.Moreover,analysis of the electric field distribution demonstrates that the optimal arrangement can be utilized for enhanced detection of small biomolecules.Thus,given the exceptional sensitivity achieved,the proposed method based on the IABC algorithm has great promise for use in the design of high-performance SPR biosensors with a variety of multilayer structures.展开更多
Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the p...Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.展开更多
In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of t...In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10-4s,thus meeting the requirements of real-time combat scenarios.展开更多
针对无人船在障碍物环境中路径规划效率低、路径冗余大、平滑性差等问题,提出一种融合人工势场法的改进RRT*算法(Artificial Potential Field Rapidly-exploring Random Tree*,APF-RRT*)。该算法以人工势场模型为引导机制,构...针对无人船在障碍物环境中路径规划效率低、路径冗余大、平滑性差等问题,提出一种融合人工势场法的改进RRT*算法(Artificial Potential Field Rapidly-exploring Random Tree*,APF-RRT*)。该算法以人工势场模型为引导机制,构建包含信息激励势场、引力势场和斥力势场的复合势能函数,从而有目的性地引导采样点朝向目标区域并远离障碍物,提高算法采样效率;同时引入动态步长策略加快扩展速度,最后结合贪心剪枝和路径平滑机制优化初始路径。在2种典型环境下进行仿真对比实验,结果表明文中改进RRT*算法在规划效率、路径长度、平滑度以及稳定性方面优于传统算法,平均规划时长、路径长度、初始路径节点数与改进前相比分别减少了50.88%、6.24%、30.29%。改进算法为无人船在障碍物环境下生成安全、高效的航行路径提供了有力保障。展开更多
Dynamic path planning is crucial for mobile robots to navigate successfully in unstructured envi-ronments.To achieve globally optimal path and real-time dynamic obstacle avoidance during the movement,a dynamic path pl...Dynamic path planning is crucial for mobile robots to navigate successfully in unstructured envi-ronments.To achieve globally optimal path and real-time dynamic obstacle avoidance during the movement,a dynamic path planning algorithm incorporating improved IB-RRT∗and deep reinforce-ment learning(DRL)is proposed.Firstly,an improved IB-RRT∗algorithm is proposed for global path planning by combining double elliptic subset sampling and probabilistic central circle target bi-as.Then,to tackle the slow response to dynamic obstacles and inadequate obstacle avoidance of tra-ditional local path planning algorithms,deep reinforcement learning is utilized to predict the move-ment trend of dynamic obstacles,leading to a dynamic fusion path planning.Finally,the simulation and experiment results demonstrate that the proposed improved IB-RRT∗algorithm has higher con-vergence speed and search efficiency compared with traditional Bi-RRT∗,Informed-RRT∗,and IB-RRT∗algorithms.Furthermore,the proposed fusion algorithm can effectively perform real-time obsta-cle avoidance and navigation tasks for mobile robots in unstructured environments.展开更多
针对传统Informed-RRT*(informing rapidly-exploring random trees with path distance lower bounds)算法在机械臂避障路径规划中目标导向性不足、随机性大、规划效率低以及路径冗余造成运动不平滑等问题,提出一种改进的APF-Inform...针对传统Informed-RRT*(informing rapidly-exploring random trees with path distance lower bounds)算法在机械臂避障路径规划中目标导向性不足、随机性大、规划效率低以及路径冗余造成运动不平滑等问题,提出一种改进的APF-Informed RRT*算法。在采样阶段,引入人工势场法引导采样点,提高随机树扩展的目标导向性。在树生长阶段,通过碰撞检测缓存键和自适应变步长策略,缓存碰撞检测结果,并生成唯一标识为缓存键,通过与障碍物的距离动态调整步长,减少碰撞检测次数,提高搜索效率。在优化阶段,采用分段式贪心算法和三次B样条曲线优化路径。通过与Informed-RRT*、GoalBias-RRT*和RRT*算法在三维环境下的仿真对比实验。结果表明,相较于Informed-RRT*算法,APF-Informed RRT*算法路径长度减少14.08%,时间节约96.17%;与RRT*和GoalBias-RRT*算法相比,APF-Informed RRT*算法路径长度分别减少19.89%和12.24%,时间分别节约88.52%和12.5%,算法的搜索效率得到显著的提升。将算法应用到AUBO i5机械臂平台,机械臂能够成功避开障碍物并准确到达目标点,且各关节的运动曲线平滑,进一步证明了改进算法的有效性。展开更多
To ensure an effective disturbance response and maintain continuous production in hybrid flow shops,this paper focuses on the design of a rescheduling method.A rescheduling model is constructed that minimizes the make...To ensure an effective disturbance response and maintain continuous production in hybrid flow shops,this paper focuses on the design of a rescheduling method.A rescheduling model is constructed that minimizes the makespan,total tardiness,and scheme deviation degree.A hybrid rescheduling driving mechanism based on the latest completion time is designed to effectively trigger rescheduling.The Whale Optimization Algorithm(WOA)is improved by integrating the good point set theory,nonlinear control parameter strategy,and Differential Evolution(DE)algorithm.Moreover,non-dominated sorting and a dynamic external archive mechanism based on crowding distance are introduced to make it suitable for multi-objective optimization problems.The superiority of the Improved Multi-objective Whale Optimization Algorithm(IMOWOA)and the effectiveness of the improved mechanisms are verified through comparative experiments and ablation experiments.Taking the final assembly production line of an agricultural machinery equipment enterprise as an example,a rescheduling scheme is generated based on the practical production requirements,which verifies the feasibility and effectiveness of the proposed method.展开更多
针对RRT(Rapidly-exploring Random Tree)算法在机器人路径规划过程存在采样点随机性高、算法效率低、路径规划时间长以及规划路径冗长等问题,文中提出一种结合人工势场法的双向RRT路径规划算法。将传统RRT算法中单向扩展方式改为由起...针对RRT(Rapidly-exploring Random Tree)算法在机器人路径规划过程存在采样点随机性高、算法效率低、路径规划时间长以及规划路径冗长等问题,文中提出一种结合人工势场法的双向RRT路径规划算法。将传统RRT算法中单向扩展方式改为由起点和终点同时进行扩展,在节点扩展时加入人工势场法进行引导,增加节点扩展的目的性。将固定步长改换为可变步长,使随机树可以更快地向目标点扩展。对生成路径进行剪枝处理,删除路径中的冗余节点,进一步缩短路径长度。利用MATLAB仿真平台在相同环境下对比所提改进算法与RRT-Connect算法、DRRT-Connect(Dynamic Rapidly-exploring Random Tree Connect)算法、GB(Goal-Biased)-RRT算法、A*算法、PRM(Probabilistic Road Map)算法的路径规划效果。仿真结果表明,所提改进算法与其他改进算法相比最短路径缩短了7%,最短搜索时间降低了65%,提高了算法的规划效率。将所提算法应用于机器人,结果证明了其具有较强可行性。展开更多
基金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.
基金National Natural Science Foundation of China(32301712)Natural Science Foundation of Jiangsu Province(BK20230548,BK20250876)+2 种基金Project of Faculty of Agricultural Equipment of Jiangsu University(NGXB20240203)A Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD-2023-87)Open Funding Project of the Key Laboratory of Modern Agricultural Equipment and Technology(Jiangsu University),Ministry of Education(MAET202101)。
摘要Traditional sampling-based path planning algorithms,such as the rapidly-exploring random tree star(RRT*),encounter critical limitations in unstructured orchard environments,including low sampling efficiency in narrow passages,slow convergence,and high computational costs.To address these challenges,this paper proposes a novel hybrid global path planning algorithm integrating Gaussian sampling and quadtree optimization(RRT*-GSQ).This methodology aims to enhance path planning by synergistically combining a Gaussian mixture sampling strategy to improve node generation in critical regions,an adaptive step-size and direction optimization mechanism for enhanced obstacle avoidance,a Quadtree-AABB collision detection framework to lower computational complexity,and a dynamic iteration control strategy for more efficient convergence.In obstacle-free and obstructed scenarios,compared with the conventional RRT*,the proposed algorithm reduced the number of node evaluations by 67.57%and 62.72%,and decreased the search time by 79.72%and 78.52%,respectively.In path tracking tests,the proposed algorithm achieved substantial reductions in RMSE of the final path compared to the conventional RRT*.Specifically,the lateral RMSE was reduced by 41.5%in obstacle-free environments and 59.3%in obstructed environments,while the longitudinal RMSE was reduced by 57.2%and 58.5%,respectively.Furthermore,the maximum absolute errors in both lateral and longitudinal directions were constrained within 0.75 m.Field validation experiments in an operational orchard confirmed the algorithm's practical effectiveness,showing reductions in the mean tracking error of 47.6%(obstacle-free)and 58.3%(with obstructed),alongside a 5.1%and 7.2%shortening of the path length compared to the baseline method.The proposed algorithm effectively enhances path planning efficiency and navigation accuracy for robots,presenting a superior solution for high-precision autonomous navigation of agricultural robots in orchard environments and holding significant value for engineering applications.
基金support from the National Key Research and Development Program of China(2023YFE0120700)National Science and TechnologyMajor Project of China(2025ZD1408303)+1 种基金National Natural Science Foundation of China(52304023)Natural Science Foundation of Chongqing(CSTB2022NSCQMSX0403).
摘要Massive carbon dioxide(CO2)emissions drive climate change.Injecting CO2into unconventional reservoirsachieves both enhanced oil recovery(EOR)and geological sequestration.However,simultaneously optimizing oil exchange ratio,CO2storage,and net present value remainschallenging.This study develops an integrated machine learning(ML)-based framework for multi-objective optimization of CO2-EOR.A high-resolution reservoir simulation was constructed from field data,and Latin hypercube sampling generateddiverse scenarios for proxy training.Mantel's test quantified correlations between input parameters and performance metrics,showing that injection strategy strongly controls net present value,whereas geological properties dominate CO2storage.Three ML models—random forest(RF),support vector regression,and artificial neural networks—were evaluated,with RF selected for its superior performance on small datasets.RF was embedded into an improved non-dominatedsorting genetic algorithm II,enhanced with grey difference degree,crowding distance,and adaptive differential evolution to improve diversity and efficiency.Finally,the technique for order preference by similarity to ideal solution ranked Pareto-optimal solutions through integrating oil productivity,storage,and economics.The proposed framework operationalizes simultaneoushigh-efficiency tight oil recovery and field-scale CO2geological storage,delivering quantitative design rules that embed low-carbon practice into upstream operations and advance the energy sector's greenerand sustainable transition.
基金supported by the Natural Science Fund of Heilongjiang Province(No.PL2024F027)the National Natural Science Foundation of China(No.61601174)。
摘要The current infrared image pedestrian detectors have problems with high rates of false positives and false negatives. To solve these problems, we proposed an improved anchor-free fully convolutional one-stage object detection(FCOS) algorithm. Firstly, we introduced the channel attention module squeeze excitation(SE)-Block in the FCOS backbone network, which was used to learn how to model the relative importance between different feature channels, and to achieve the weight recalibration of the features extracted from the convolution neural network, and improve the weight values that are more important for pedestrian target detection. Secondly, soft non-maximum suppression(Soft-NMS) replaced the conventional NMS within the algorithm's post-processing phase, which was used to reduce the probability of missed detection for occluded pedestrians. The experimental results show that our improved FCOS algorithm improves the average precision(AP) by 6.71% on the original dataset and 7.97% on the augmented KAIST pedestrian dataset compared with the original FCOS algorithm. Our improvements effectively meet the real-time requirements and there is no significant decrease in speed compared with the original FCOS algorithm, and decreased the false positives and false negatives for infrared image pedestrian detection.
基金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.
基金supported by the Intelligent Identification and Early Warning System for Pests and Diseases in Small-seeded Rapeseed(No.24ZYCGSN01360)the Intelligent Management Platform for Vegetable Greenhouses Project(No.YH003001)+1 种基金the Intelligent Agricultural Breeding System Project(No.YH003002)the Research and Application of AIoT Based Big Data System for Apple Tree Pest and Disease Detection(No.2024WA013)。
摘要This paper suggests an improved you only look once version 8n(YOLOv8n)algorithm for apple leaf disease detection,abbreviated as ALWB-YOLOv8n.The model is comprised of four essential components.Initially,arbitrary kernel convolution(AKConv)replaces the convolution module,which significantly decreases both the model’s parameter count and its overall size.Secondly,the large selective kernel network(LSKNet)attention mechanism is added in the Backbone,which can dynamically adjust the spatial sensory domain,and experiments have proved that this method is extremely advantageous for small target detection.Third,a weighted bi-directional feature pyramid network is introduced,which enables the model to achieve multi-scale feature fusion and is more concise and faster.Finally,wise intersection over union(WIoU)is used to replace complete intersection over union(CIoU)in YOLOv8,and the idea of focal loss is introduced,which effectively solves the detection problems in cases such as apple leaves occluding each other and blurred boundaries of diseased leaves.The improved algorithm exhibits superior performance compared to other common object detection algorithms.Compared with YOLOv8n,the improved algorithm achieves 2.3%improvement in precision,3.8%improvement in recall,and 2.5%and 2.7%improvement in mAP0.5 and mAP0.5:0.95,respectively.Compared with YOLOv8n,the improved model reduces the number of parameters and size of the model and realizes real-time monitoring with a frames per second(FPS)of 50.5.
基金supported by Gansu Provincial Science and Technology Program Project(No.23JRRA868)Lanzhou Municipal Talent Innovation and Entrepreneurship Project(No.2019-RC-103)。
摘要In response to the problems of low sampling efficiency,strong randomness of sampling points,and the tortuous shape of the planned path in the traditional rapidly-exploring random tree(RRT)algorithm and bidirectional RRT algorithm used for unmanned aerial vehicle(UAV)path planning in complex environments,an improved bidirectional RRT algorithm was proposed.The algorithm firstly adopted a goal-oriented strategy to guide the sampling points towards the target point,and then the artificial potential field acted on the random tree nodes to avoid collision with obstacles and reduced the length of the search path,and the random tree node growth also combined the UAV’s own flight constraints,and by combining the triangulation method to remove the redundant node strategy and the third-order B-spline curve for the smoothing of the trajectory,the planned path was better.The planned paths were more optimized.Finally,the simulation experiments in complex and dynamic environments showed that the algorithm effectively improved the speed of trajectory planning and shortened the length of the trajectory,and could generate a safe,smooth and fast trajectory in complex environments,which could be applied to online trajectory planning.
基金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.
摘要Aimed at the long and narrow geometric features and poor generalization ability of the damage detection in conveyor belts with steel rope cores using the X-ray image,a detection method of damage X-ray image is proposed based on the improved fully convolutional one-stage object detection(FCOS)algorithm.The regression performance of bounding boxes was optimized by introducing the complete intersection over union loss function into the improved algorithm.The feature fusion network structure is modified by adding adaptive fusion paths to the feature fusion network structure,which makes full use of the features of accurate localization and semantics of multi-scale feature fusion networks.Finally,the network structure was trained and validated by using the X-ray image dataset of damages in conveyor belts with steel rope cores provided by a flaw detection equipment manufacturer.In addition,the data enhancement methods such as rotating,mirroring,and scaling,were employed to enrich the image dataset so that the model is adequately trained.Experimental results showed that the improved FCOS algorithm promoted the precision rate and the recall rate by 20.9%and 14.8%respectively,compared with the original algorithm.Meanwhile,compared with Fast R-CNN,Faster R-CNN,SSD,and YOLOv3,the improved FCOS algorithm has obvious advantages;detection precision rate and recall rate of the modified network reached 95.8%and 97.0%respectively.Furthermore,it demonstrated a higher detection accuracy without affecting the speed.The results of this work have some reference significance for the automatic identification and detection of steel core conveyor belt damage.
基金funded by the National Natural Science Foundation of China(Grant No.52375547)the Natural Science Foundation of Chongqing,China(Grant Nos.CSTB2022NSCQ-BHX0736 and CSTB2022NSCQ-MSX1523)the Chongqing Scientific Institution Incentive Performance Guiding Special Projects(Grant No.CSTB2024JXJL-YFX0034).
摘要This paper uses an innovative improved artificial bee colony(IABC)algorithm to aid in the fabrication of a highly responsive phasemodulation surface plasmon resonance(SPR)biosensor.In this biosensor’s sensing structure,a double-layer Ag-Au metal film is combined with a blue phosphoreneransition metal dichalcogenide(BlueP/TMDC)hybrid structure and graphene.In the optimization function of the IABC method,the reflectivity at resonance angle is incorporated as a constraint to achieve high phase sensitivity.The performance of the Ag-Au-BlueP/TMDC-graphene heterostructure as optimized by the IABC method is compared with that of a similar structure optimized using the traditional ABC algorithm.The results indicate that optimization using the IABC method gives significantly more phase sensitivity,together with lower reflectivity,than can be achieved with the traditional ABC method.The highest phase sensitivity of 3.662×106 °/RIU is achieved with a bilayer of BlueP/WS2 and three layers of graphene.Moreover,analysis of the electric field distribution demonstrates that the optimal arrangement can be utilized for enhanced detection of small biomolecules.Thus,given the exceptional sensitivity achieved,the proposed method based on the IABC algorithm has great promise for use in the design of high-performance SPR biosensors with a variety of multilayer structures.
基金supported by the Natural Science Foundation of Hunan Province of China(Nos.2021JJ10045 and 2025JJ60072)the Open Research Subject of State Key Laboratory of Intelligent Game(No.ZBKF-24-01)+1 种基金the Postdoctoral Fellowship Program of CPSF(No.GZB20240989)the China Postdoctoral Science Foundation(No.2024M754304).
摘要Optimization problems are crucial for a wide range of engineering applications,as efficient solutions lead to better performance.This study introduces an improved coati optimization algorithm(ICOA)that overcomes the primary limitations of the original coati optimization algorithm(COA),notably its insufficient population diversity and propensity to become trapped in local optima.To address these issues,the ICOA integrates three innovative strategies:Latin hypercube sampling(LHS),Lévyflight,and an adaptive local search.LHS is employed to ensure a diverse initial population,thereby laying a foundation for the optimization.Lévy-flight is utilized to facilitate an efficient global search,enhancing the algorithm’s ability to explore the solution space.The adaptive local search is designed to refine solutions,enabling more precise local exploration.Together,these strategies significantly improve the population’s quality and diversity,thereby improving the algorithm’s convergence accuracy and optimization capabilities.The performance of the ICOA is tested against several established algorithms,using 12 benchmark functions.Additionally,the ICOA’s practicality and effectiveness are demonstrated through application to a real-world engineering problem,specifically the design optimization of tension/compression springs.Simulation results show that the ICOA consistently outperforms the other algorithms,providing robust solutions for a wide range of optimization problems.
基金National Natural Science Foundation of China(62373187)Forward-looking Layout Special Projects(ILA220591A22)。
摘要In the field of calculating the attack area of air-to-air missiles in modern air combat scenarios,the limitations of existing research,including real-time calculation,accuracy efficiency trade-off,and the absence of the three-dimensional attack area model,restrict their practical applications.To address these issues,an improved backtracking algorithm is proposed to improve calculation efficiency.A significant reduction in solution time and maintenance of accuracy in the three-dimensional attack area are achieved by using the proposed algorithm.Furthermore,the age-layered population structure genetic programming(ALPS-GP)algorithm is introduced to determine an analytical polynomial model of the three-dimensional attack area,considering real-time requirements.The accuracy of the polynomial model is enhanced through the coefficient correction using an improved gradient descent algorithm.The study reveals a remarkable combination of high accuracy and efficient real-time computation,with a mean error of 91.89 m using the analytical polynomial model of the three-dimensional attack area solved in just 10-4s,thus meeting the requirements of real-time combat scenarios.
摘要针对无人船在障碍物环境中路径规划效率低、路径冗余大、平滑性差等问题,提出一种融合人工势场法的改进RRT*算法(Artificial Potential Field Rapidly-exploring Random Tree*,APF-RRT*)。该算法以人工势场模型为引导机制,构建包含信息激励势场、引力势场和斥力势场的复合势能函数,从而有目的性地引导采样点朝向目标区域并远离障碍物,提高算法采样效率;同时引入动态步长策略加快扩展速度,最后结合贪心剪枝和路径平滑机制优化初始路径。在2种典型环境下进行仿真对比实验,结果表明文中改进RRT*算法在规划效率、路径长度、平滑度以及稳定性方面优于传统算法,平均规划时长、路径长度、初始路径节点数与改进前相比分别减少了50.88%、6.24%、30.29%。改进算法为无人船在障碍物环境下生成安全、高效的航行路径提供了有力保障。
基金the National Natural Science Foundation of China(No.61973275)。
摘要Dynamic path planning is crucial for mobile robots to navigate successfully in unstructured envi-ronments.To achieve globally optimal path and real-time dynamic obstacle avoidance during the movement,a dynamic path planning algorithm incorporating improved IB-RRT∗and deep reinforce-ment learning(DRL)is proposed.Firstly,an improved IB-RRT∗algorithm is proposed for global path planning by combining double elliptic subset sampling and probabilistic central circle target bi-as.Then,to tackle the slow response to dynamic obstacles and inadequate obstacle avoidance of tra-ditional local path planning algorithms,deep reinforcement learning is utilized to predict the move-ment trend of dynamic obstacles,leading to a dynamic fusion path planning.Finally,the simulation and experiment results demonstrate that the proposed improved IB-RRT∗algorithm has higher con-vergence speed and search efficiency compared with traditional Bi-RRT∗,Informed-RRT∗,and IB-RRT∗algorithms.Furthermore,the proposed fusion algorithm can effectively perform real-time obsta-cle avoidance and navigation tasks for mobile robots in unstructured environments.
摘要针对传统Informed-RRT*(informing rapidly-exploring random trees with path distance lower bounds)算法在机械臂避障路径规划中目标导向性不足、随机性大、规划效率低以及路径冗余造成运动不平滑等问题,提出一种改进的APF-Informed RRT*算法。在采样阶段,引入人工势场法引导采样点,提高随机树扩展的目标导向性。在树生长阶段,通过碰撞检测缓存键和自适应变步长策略,缓存碰撞检测结果,并生成唯一标识为缓存键,通过与障碍物的距离动态调整步长,减少碰撞检测次数,提高搜索效率。在优化阶段,采用分段式贪心算法和三次B样条曲线优化路径。通过与Informed-RRT*、GoalBias-RRT*和RRT*算法在三维环境下的仿真对比实验。结果表明,相较于Informed-RRT*算法,APF-Informed RRT*算法路径长度减少14.08%,时间节约96.17%;与RRT*和GoalBias-RRT*算法相比,APF-Informed RRT*算法路径长度分别减少19.89%和12.24%,时间分别节约88.52%和12.5%,算法的搜索效率得到显著的提升。将算法应用到AUBO i5机械臂平台,机械臂能够成功避开障碍物并准确到达目标点,且各关节的运动曲线平滑,进一步证明了改进算法的有效性。
基金funded by National Key Research and Development Program Projects of China under Grant No.2020YFB1713500.
摘要To ensure an effective disturbance response and maintain continuous production in hybrid flow shops,this paper focuses on the design of a rescheduling method.A rescheduling model is constructed that minimizes the makespan,total tardiness,and scheme deviation degree.A hybrid rescheduling driving mechanism based on the latest completion time is designed to effectively trigger rescheduling.The Whale Optimization Algorithm(WOA)is improved by integrating the good point set theory,nonlinear control parameter strategy,and Differential Evolution(DE)algorithm.Moreover,non-dominated sorting and a dynamic external archive mechanism based on crowding distance are introduced to make it suitable for multi-objective optimization problems.The superiority of the Improved Multi-objective Whale Optimization Algorithm(IMOWOA)and the effectiveness of the improved mechanisms are verified through comparative experiments and ablation experiments.Taking the final assembly production line of an agricultural machinery equipment enterprise as an example,a rescheduling scheme is generated based on the practical production requirements,which verifies the feasibility and effectiveness of the proposed method.
摘要针对RRT(Rapidly-exploring Random Tree)算法在机器人路径规划过程存在采样点随机性高、算法效率低、路径规划时间长以及规划路径冗长等问题,文中提出一种结合人工势场法的双向RRT路径规划算法。将传统RRT算法中单向扩展方式改为由起点和终点同时进行扩展,在节点扩展时加入人工势场法进行引导,增加节点扩展的目的性。将固定步长改换为可变步长,使随机树可以更快地向目标点扩展。对生成路径进行剪枝处理,删除路径中的冗余节点,进一步缩短路径长度。利用MATLAB仿真平台在相同环境下对比所提改进算法与RRT-Connect算法、DRRT-Connect(Dynamic Rapidly-exploring Random Tree Connect)算法、GB(Goal-Biased)-RRT算法、A*算法、PRM(Probabilistic Road Map)算法的路径规划效果。仿真结果表明,所提改进算法与其他改进算法相比最短路径缩短了7%,最短搜索时间降低了65%,提高了算法的规划效率。将所提算法应用于机器人,结果证明了其具有较强可行性。