期刊文献+
共找到6,098篇文章
< 1 2 250 >
每页显示 20 50 100
Hybrid path planning for USVs using improved A^(*)and DWA
1
作者 WANG Guangwei YANG Le +2 位作者 TAN Zhikun LI Yichen YU Wenbin 《Journal of Systems Engineering and Electronics》 2026年第1期45-63,共19页
A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirement... A safe and reliable path planning algorithm is fundamental for unmanned surface vehicles(USVs)to perform autonomous navigation tasks.However,a single global or local planning strategy cannot fully meet the requirements of complex maritime environments.Global planning alone cannot effectively handle dynamic obstacles,while local planning alone may fall into local optima.To address these issues,this paper proposes a multi-dynamic-obstacle avoidance path planning method that integrates an improved A^(*)algorithm with the dynamic window approach(DWA).The traditional A^(*)algorithm often generates paths that are too close to obstacle boundaries and contain excessive turning points,whereas the traditional DWA tends to skirt densely clustered obstacles,resulting in longer routes and insufficient dynamic obstacle avoidance.To overcome these limitations,improved versions of both algorithms are developed.Key points extracted from the optimized A^(*)path are used as intermediate start-destination pairs for the improved DWA,and the weights of the DWA evaluation function are adjusted to achieve effective fusion.Furthermore,a multi-dynamic-obstacle avoidance strategy is designed for complex navigation scenarios.Simulation results demonstrate that the USV can adaptively switch between dynamic obstacle avoidance and path tracking based on obstacle distribution,validating the effectiveness of the proposed method. 展开更多
关键词 multiple dynamic obstacles A^(*)algorithm dynamic window approach(DWA) unmanned surface vehicle(USV) path planning collision avoidance
在线阅读 下载PDF
基于Hybrid A^(*)与最优控制的农机精准进田转场轨迹规划方法 被引量:1
2
作者 迟瑞娟 付国辉 +4 位作者 马悦琦 班超 苏童 陈嘉翊 李知旻 《农业机械学报》 北大核心 2025年第10期321-331,共11页
狭窄机耕道环境下,农机进田转场轨迹规划影响农机行驶轨迹平滑性和进田作业质量和效率。针对目前农机路径规划在狭窄空间转弯处的轨迹曲率较大、不够平滑和速度规划不够精准,不利于取得较好跟踪效果等问题,本文提出一种基于Hybrid A^(*... 狭窄机耕道环境下,农机进田转场轨迹规划影响农机行驶轨迹平滑性和进田作业质量和效率。针对目前农机路径规划在狭窄空间转弯处的轨迹曲率较大、不够平滑和速度规划不够精准,不利于取得较好跟踪效果等问题,本文提出一种基于Hybrid A^(*)与最优控制的农机精准进田转场轨迹规划方法。获取先验转场的栅格地图、起始位姿和目标位姿,采用Hybrid A^(*)算法获取满足农机运动学约束的最优或者较优转场路径;对路径节点配置时间信息,并通过数据预处理得到非线性问题求解所需初始解;采用最优控制问题的方法,在农机运动学约束、两点边值约束、动力学约束和避障约束等多约束条件下,建立缩短转场时间、提高农机操纵性和提升轨迹平滑性多优化目标代价函数;将最优控制问题转换为非线性规划(NLP)问题,且采用非线性求解器求解,得到农机进田转场轨迹和速度序列。并以洋马VP6E型插秧机作为实验平台,在农机车头背向进田通道和车头朝向进田通道2种场景中进行仿真与实车实验。实验结果表明,轨迹平均曲率为0.2312~0.2517 m^(-1),轨迹平滑性较好,符合车辆运动学特性;在轨迹跟踪实车实验中,平均绝对横向偏差为1.56~2.59 cm,平均绝对航向角偏差为0.97°~1.54°,最大绝对速度偏差为0.058~0.102 m/s,平均绝对速度为0.454~0.528 m/s,因此,插秧机有效跟踪本文轨迹规划方法生成的轨迹,实现了插秧机在狭窄机耕道上精准、快速地进田转场。 展开更多
关键词 精准转场 轨迹规划 最优控制 hybrid A^(*) 非线性规划 轨迹跟踪
在线阅读 下载PDF
基于JPS和变半径RS曲线的Hybrid A^(*)路径规划算法
3
作者 张博强 张成龙 +1 位作者 冯天培 高向川 《郑州大学学报(工学版)》 北大核心 2025年第2期19-25,共7页
为解决混合A^(*)(Hybrid A^(*))算法在高分辨率地图和复杂场景下搜索效率低、耗费时间长的问题,通过对影响传统Hybrid A^(*)算法搜索效率的因素进行分析,提出了J-Hybrid A^(*)算法。首先,在Hybrid A^(*)算法扩展节点前,使用跳点搜索(JPS... 为解决混合A^(*)(Hybrid A^(*))算法在高分辨率地图和复杂场景下搜索效率低、耗费时间长的问题,通过对影响传统Hybrid A^(*)算法搜索效率的因素进行分析,提出了J-Hybrid A^(*)算法。首先,在Hybrid A^(*)算法扩展节点前,使用跳点搜索(JPS)算法进行起点到终点的路径搜索,将该路径进行拉直处理后作为计算节点启发值的基础;其次,设计了新的启发函数,在Hybrid A^(*)算法扩展前就能完成所有节点启发值的计算,减少了Hybrid A^(*)扩展节点时计算启发值所需的时间;最后,将RS曲线由最小转弯半径搜索改为变半径RS曲线搜索,使RS曲线能够更早搜索到一条无碰撞路径,进一步提升了Hybrid A^(*)算法的搜索效率。仿真结果表明:所提J-Hybrid A^(*)算法在简单环境中比传统Hybrid A^(*)算法和反向Hybrid A^(*)算法用时分别缩短68%、21%,在复杂环境中缩短59%、27%。在不同分辨率地图场景中,随着地图分辨率的提高,规划效率显著提升。实车实验表明:所提J-Hybrid A^(*)算法相较于传统Hybrid A^(*)算法和反向Hybrid A^(*)算法的搜索用时分别减少88%、82%,有效提升了Hybrid A^(*)算法的搜索效率、缩短了路径规划所需时间。 展开更多
关键词 hybrid A^(*)算法 启发函数 JPS算法 RS曲线 路径规划
在线阅读 下载PDF
Path Planning for Thermal Power Plant Fan Inspection Robot Based on Improved A^(*)Algorithm 被引量:1
4
作者 Wei Zhang Tingfeng Zhang 《Journal of Electronic Research and Application》 2025年第1期233-239,共7页
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. 展开更多
关键词 Power plant fans Inspection robot Path planning Improved A^(*)algorithm
在线阅读 下载PDF
Multi-Objective Hybrid Sailfish Optimization Algorithm for Planetary Gearbox and Mechanical Engineering Design Optimization Problems 被引量:1
5
作者 Miloš Sedak Maja Rosic Božidar Rosic 《Computer Modeling in Engineering & Sciences》 2025年第2期2111-2145,共35页
This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Op... This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain. 展开更多
关键词 Multi-objective optimization planetary gearbox gear efficiency sailfish optimization differential evolution hybrid algorithms
在线阅读 下载PDF
Grid-Connected/Islanded Switching Control Strategy for Photovoltaic Storage Hybrid Inverters Based on Modified Chimpanzee Optimization Algorithm
6
作者 Chao Zhou Narisu Wang +1 位作者 Fuyin Ni Wenchao Zhang 《Energy Engineering》 EI 2025年第1期265-284,共20页
Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,th... Uneven power distribution,transient voltage,and frequency deviations are observed in the photovoltaic storage hybrid inverter during the switching between grid-connected and island modes.In response to these issues,this paper proposes a grid-connected/island switching control strategy for photovoltaic storage hybrid inverters based on the modified chimpanzee optimization algorithm.The proposed strategy incorporates coupling compensation and power differentiation elements based on the traditional droop control.Then,it combines the angular frequency and voltage amplitude adjustments provided by the phase-locked loop-free pre-synchronization control strategy.Precise pre-synchronization is achieved by regulating the virtual current to zero and aligning the photovoltaic storage hybrid inverter with the grid voltage.Additionally,two novel operators,learning and emotional behaviors are introduced to enhance the optimization precision of the chimpanzee algorithm.These operators ensure high-precision and high-reliability optimization of the droop control parameters for photovoltaic storage hybrid inverters.A Simulink model was constructed for simulation analysis,which validated the optimized control strategy’s ability to evenly distribute power under load transients.This strategy effectively mitigated transient voltage and current surges during mode transitions.Consequently,seamless and efficient switching between gridconnected and island modes was achieved for the photovoltaic storage hybrid inverter.The enhanced energy utilization efficiency,in turn,offers robust technical support for grid stability. 展开更多
关键词 Photovoltaic storage hybrid inverters modified chimpanzee optimization algorithm droop control seamless switching
在线阅读 下载PDF
Fusion Algorithm Based on Improved A^(*)and DWA for USV Path Planning
7
作者 Changyi Li Lei Yao Chao Mi 《哈尔滨工程大学学报(英文版)》 2025年第1期224-237,共14页
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. 展开更多
关键词 Improved A^(*)algorithm Optimized DWA algorithm Unmanned surface vehicles Path planning Fusion algorithm
在线阅读 下载PDF
SL-COA:Hybrid Efficient and Enhanced Coati Optimization Algorithm for Structural Reliability Analysis
8
作者 Yunhan Ling Huajun Peng +4 位作者 Yiqing Shi Chao Xu Jingzhen Yan Jingjing Wang Hui Ma 《Computer Modeling in Engineering & Sciences》 2025年第4期767-808,共42页
Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence spee... Thetraditional first-order reliability method(FORM)often encounters challengeswith non-convergence of results or excessive calculation when analyzing complex engineering problems.To improve the global convergence speed of structural reliability analysis,an improved coati optimization algorithm(COA)is proposed in this paper.In this study,the social learning strategy is used to improve the coati optimization algorithm(SL-COA),which improves the convergence speed and robustness of the newheuristic optimization algorithm.Then,the SL-COAis comparedwith the latest heuristic optimization algorithms such as the original COA,whale optimization algorithm(WOA),and osprey optimization algorithm(OOA)in the CEC2005 and CEC2017 test function sets and two engineering optimization design examples.The optimization results show that the proposed SL-COA algorithm has a high competitiveness.Secondly,this study introduces the SL-COA algorithm into the MPP(Most Probable Point)search process based on FORM and constructs a new reliability analysis method.Finally,the proposed reliability analysis method is verified by four mathematical examples and two engineering examples.The results show that the proposed SL-COA-assisted FORM exhibits fast convergence and avoids premature convergence to local optima as demonstrated by its successful application to problems such as composite cylinder design and support bracket analysis. 展开更多
关键词 hybrid reliability analysis single-loop interactive hybrid analysis most probability point metaheuristic algorithms coati optimization algorithm
在线阅读 下载PDF
A Bi-Level Optimization Model and Hybrid Evolutionary Algorithm for Wind Farm Layout with Different Turbine Types
9
作者 Erping Song Zipin Yao 《Energy Engineering》 2025年第12期5129-5147,共19页
Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and eco... Wind farm layout optimization is a critical challenge in renewable energy development,especially in regions with complex terrain.Micro-siting of wind turbines has a significant impact on the overall efficiency and economic viability of wind farm,where the wake effect,wind speed,types of wind turbines,etc.,have an impact on the output power of the wind farm.To solve the optimization problem of wind farm layout under complex terrain conditions,this paper proposes wind turbine layout optimization using different types of wind turbines,the aim is to reduce the influence of the wake effect and maximize economic benefits.The linear wake model is used for wake flow calculation over complex terrain.Minimizing the unit energy cost is taken as the objective function,considering that the objective function is affected by cost and output power,which influence each other.The cost function includes construction cost,installation cost,maintenance cost,etc.Therefore,a bi-level constrained optimization model is established,in which the upper-level objective function is to minimize the unit energy cost,and the lower-level objective function is to maximize the output power.Then,a hybrid evolutionary algorithm is designed according to the characteristics of the decision variables.The improved genetic algorithm and differential evolution are used to optimize the upper-level and lower-level objective functions,respectively,these evolutionary operations search for the optimal solution as much as possible.Finally,taking the roughness of different terrain,wind farms of different scales and different types of wind turbines as research scenarios,the optimal deployment is solved by using the algorithm in this paper,and four algorithms are compared to verify the effectiveness of the proposed algorithm. 展开更多
关键词 Bi-level optimization genetic algorithm differential evolution hybrid evolutionary algorithm wind farm layout
在线阅读 下载PDF
Derivative Free and Dispatch Algorithm-Based Optimization and Power System Assessment of a Biomass-PV-Hydrogen Storage-Grid Hybrid Renewable Microgrid for Agricultural Applications
10
作者 Md.Fatin Ishraque Akhlaqur Rahman +5 位作者 Kamil Ahmad Sk.A.Shezan Md.Meheraf Hossain Sheikh Rashel Al Ahmed Md.Iasir Arafat Noor E Nahid Bintu 《Energy Engineering》 2025年第8期3347-3375,共29页
In this research work,the localized generation from renewable resources and the distribution of energy to agricultural loads,which is a local microgrid concept,have been considered,and its feasibility has been assesse... In this research work,the localized generation from renewable resources and the distribution of energy to agricultural loads,which is a local microgrid concept,have been considered,and its feasibility has been assessed.Two dispatch algorithms,named Cycle Charging and Load Following,are implemented to find the optimal solution(i.e.,net cost,operation cost,carbon emission.energy cost,component sizing,etc.)of the hybrid system.The microgrid is also modeled in the DIgSILENT Power Factory platform,and the respective power system responses are then evaluated.The development of dispatch algorithms specifically tailored for agricultural applications has enabled to dynamically manage energy flows,responding to fluctuating demands and resource availability in real-time.Through careful consideration of factors such as seasonal variations and irrigation requirements,these algorithms have enhanced the resilience and adaptability of the microgrid to dynamic operational conditions.However,it is revealed that both approaches have produced the same techno-economic results showing no significant difference.This illustrates the fact that the considered microgrid can be implemented with either strategy without significant fluctuation in performance.The study has shown that the harmful gas emission has also been limited to only 17,928 kg/year of CO_(2),and 77.7 kg/year of Sulfur Dioxide.For the proposed microgrid and load profile of 165.29 kWh/day,the net present cost is USD 718,279,and the cost of energy is USD 0.0463 with a renewable fraction of 97.6%.The optimal sizes for PV,Bio,Grid,Electrolyzer,and Converter are 1494,500,999,999,500,and 495 kW,respectively.For a hydrogen tank(HTank),the optimal size is found to be 350 kg.This research work provides critical insights into the techno-economic feasibility and environmental impact of integrating biomass-PV-hydrogen storage-Grid hybrid renewable microgrids into agricultural settings. 展开更多
关键词 Renewable energy derivative-free algorithm OPTIMIZATION hybrid system energy storage
在线阅读 下载PDF
Ship Path Planning Based on Sparse A^(*)Algorithm
11
作者 Yongjian Zhai Jianhui Cui +3 位作者 Fanbin Meng Huawei Xie Chunyan Hou Bin Li 《哈尔滨工程大学学报(英文版)》 2025年第1期238-248,共11页
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith... An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths. 展开更多
关键词 Sparse A^(*)algorithm Path planning RASTERIZATION Coordinate transformation Image preprocessing
在线阅读 下载PDF
Multi-Level Subpopulation-Based Particle Swarm Optimization Algorithm for Hybrid Flow Shop Scheduling Problem with Limited Buffers
12
作者 Yuan Zou Chao Lu +1 位作者 Lvjiang Yin Xiaoyu Wen 《Computers, Materials & Continua》 2025年第8期2305-2330,共26页
The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on th... The shop scheduling problem with limited buffers has broad applications in real-world production scenarios,so this research direction is of great practical significance.However,there is currently little research on the hybrid flow shop scheduling problem with limited buffers(LBHFSP).This paper deeply investigates the LBHFSP to optimize the goal of the total completion time.To better solve the LBHFSP,a multi-level subpopulation-based particle swarm optimization algorithm(MLPSO)is proposed,which is founded on the attributes of the LBHFSP and the shortcomings of the basic PSO(particle swarm optimization)algorithm.In MLPSO,firstly,considering the impact of the limited buffers on the process of subsequent operations,a specific circular decoding strategy is developed to accommodate the characteristics of limited buffers.Secondly,an initialization strategy based on blocking time is designed to enhance the quality and diversity of the initial population.Afterward,a multi-level subpopulation collaborative search is developed to prevent being trapped in a local optimum and improve the global exploration capability.Additionally,a local search strategy based on the first blocked job is designed to enhance the MLPSO algorithm’s exploitation capability.Lastly,numerous experiments are carried out to test the performance of the proposed MLPSO by comparing it with classical intelligent optimization and popular algorithms in recent years.The results confirm that the proposed MLPSO has an outstanding performance when compared to other algorithms when solving LBHFSP. 展开更多
关键词 hybrid flow shop scheduling problem limited buffers PSO algorithm collaborative search blocking phenomenon
在线阅读 下载PDF
Hybrid genetic algorithm for parametric optimization of surface pipeline networks in underground natural gas storage harmonized injection and production conditions
13
作者 Jun Zhou Zichen Li +4 位作者 Shitao Liu Chengyu Li Yunxiang Zhao Zonghang Zhou Guangchuan Liang 《Natural Gas Industry B》 2025年第2期234-250,共17页
The surface injection and production system(SIPS)is a critical component for effective injection and production processes in underground natural gas storage.As a vital channel,the rational design of the surface inject... The surface injection and production system(SIPS)is a critical component for effective injection and production processes in underground natural gas storage.As a vital channel,the rational design of the surface injection and production(SIP)pipeline significantly impacts efficiency.This paper focuses on the SIP pipeline and aims to minimize the investment costs of surface projects.An optimization model under harmonized injection and production conditions was constructed to transform the optimization problem of the SIP pipeline design parameters into a detailed analysis of the injection condition model and the production condition model.This paper proposes a hybrid genetic algorithm generalized reduced gradient(HGA-GRG)method,and compares it with the traditional genetic algorithm(GA)in a practical case study.The HGA-GRG demonstrated significant advantages in optimization outcomes,reducing the initial cost by 345.371×10^(4) CNY compared to the GA,validating the effectiveness of the model.By adjusting algorithm parameters,the optimal iterative results of the HGA-GRG were obtained,providing new research insights for the optimal design of a SIPS. 展开更多
关键词 Underground natural gas storage Surface injection and production pipeline Parameter optimization hybrid genetic algorithm
在线阅读 下载PDF
Hybrid genetic simulated annealing algorithm for agile Earth observation satellite scheduling considering cloud cover distribution
14
作者 SUN Haiquan WANG Zhilong +1 位作者 HU Xiaoxuan XIA Wei 《Journal of Systems Engineering and Electronics》 2025年第6期1595-1612,共18页
Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at... Agile earth observation satellites(AEOSs)represent a new generation of satellites with three degrees of freedom(pitch,roll,and yaw);they possess a long visible time window(VTW)for ground targets and support imaging at any moment within the VTW.However,different observation times demonstrate different cloud cover distributions,which exhibit different effects on the AEOS observation.Previous studies ignored pitch angles,discretized VTWs,or fixed cloud cover for every VTW,which led to the loss of intermediate observation states,thus these studies are not suitable for AEOS scheduling considering cloud cover distribution.In this study,a relationship formula between the cloud cover and observation time is proposed to calculate the cloud cover for every observation time,and a relationship formula between the observation time and pitch angle is designed to calculate the pitch angle for every observation time in the VTW.A refined model including the pitch angle,roll angle,and cloud cover distribution is established,which can make the scheme closer to the actual application of AEOSs.A hybrid genetic simulated annealing(HGSA)algorithm for AEOS scheduling is proposed,which integrates the advantages of genetic and simulated annealing algorithms and can effectively avoid falling into a local optimal solution.The experiments are conducted to compare the proposed algorithm with the traditional algorithms,the results verify that the proposed model and algorithm are efficient and effective for AEOS scheduling considering cloud cover distribution. 展开更多
关键词 agile Earth observation satellite cloud cover distribution hybrid genetic simulated annealing algorithm
在线阅读 下载PDF
Federated Multi-Label Feature Selection via Dual-Layer Hybrid Breeding Cooperative Particle Swarm Optimization with Manifold and Sparsity Regularization
15
作者 Songsong Zhang Huazhong Jin +5 位作者 Zhiwei Ye Jia Yang Jixin Zhang Dongfang Wu Xiao Zheng Dingfeng Song 《Computers, Materials & Continua》 2026年第1期1141-1159,共19页
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal... Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics. 展开更多
关键词 Multi-label feature selection federated learning manifold regularization sparse constraints hybrid breeding optimization algorithm particle swarm optimizatio algorithm privacy protection
在线阅读 下载PDF
Dynamic Boundary Optimization via IDBO-VMD:A Novel Power Allocation Strategy for Hybrid Energy Storage with Enhanced Grid Stability
16
作者 Zujun Ding Qi Xiang +10 位作者 Chengyi Li Mengyu Ma Chutong Zhang Xinfa Gu Jiaming Shi Hui Huang Aoyun Xia Wenjie Wang Wan Chen Ziluo Yu Jie Ji 《Energy Engineering》 2026年第1期527-552,共26页
In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved D... In order to address environmental pollution and resource depletion caused by traditional power generation,this paper proposes an adaptive iterative dynamic-balance optimization algorithm that integrates the Improved Dung Beetle Optimizer(IDBO)with VariationalMode Decomposition(VMD).The IDBO-VMD method is designed to enhance the accuracy and efficiency of wind-speed time-series decomposition and to effectively smooth photovoltaic power fluctuations.This study innovatively improves the traditional variational mode decomposition(VMD)algorithm,and significantly improves the accuracy and adaptive ability of signal decomposition by IDBO selfoptimization of key parameters K and a.On this basis,Fourier transform technology is used to define the boundary point between high frequency and low frequency signals,and a targeted energy distribution strategy is proposed:high frequency fluctuations are allocated to supercapacitors to quickly respond to transient power fluctuations;Lowfrequency components are distributed to lead-carbon batteries,optimizing long-term energy storage and scheduling efficiency.This strategy effectively improves the response speed and stability of the energy storage system.The experimental results demonstrate that the IDBO-VMD algorithm markedly outperforms traditional methods in both decomposition accuracy and computational efficiency.Specifically,it effectively reduces the charge–discharge frequency of the battery,prolongs battery life,and optimizes the operating ranges of the state-of-charge(SOC)for both leadcarbon batteries and supercapacitors.In addition,the energy management strategy based on the algorithm not only improves the overall energy utilization efficiency of the system,but also shows excellent performance in the dynamic management and intelligent scheduling of renewable energy generation. 展开更多
关键词 Energy efficiency hybrid energy storage system intelligent algorithm power fluctuation mitigation renewable energy
在线阅读 下载PDF
基于混合A^(*)和DP-RS曲线的半挂车辆倒车路径规划
17
作者 尉金强 唐圣金 +1 位作者 杜文正 邓刚锋 《现代电子技术》 北大核心 2026年第3期128-136,共9页
针对半挂车辆倒车路径规划中实时性和路径合理性不足的问题,文中提出一种基于混合A^(*)算法和DP-RS曲线的半挂车辆倒车路径规划方法。首先,通过构建描述半挂车运动特性的运动学模型,确保车辆倒车路径规划充分考虑车辆的物理约束;然后,... 针对半挂车辆倒车路径规划中实时性和路径合理性不足的问题,文中提出一种基于混合A^(*)算法和DP-RS曲线的半挂车辆倒车路径规划方法。首先,通过构建描述半挂车运动特性的运动学模型,确保车辆倒车路径规划充分考虑车辆的物理约束;然后,结合混合A^(*)算法和碰撞检测技术进行半挂车辆全局倒车路径搜索,生成初步路径;接着,采用DP-RS曲线对初步倒车路径进行优化和平滑处理,以提升路径规划的精度和适应性;最后,通过仿真实验验证方法的可行性。实验结果表明,优化后的路径提高了车辆倒车效率,在相同场景下,所提方法使路径规划时间减少了64.8%,并在提升路径规划实时性和计算效率的同时,增强了半挂车倒车路径的合理性与安全性。 展开更多
关键词 半挂车辆 车辆倒车 路径规划 DP-RS曲线 混合A^(*)算法 运动学模型 碰撞检测
在线阅读 下载PDF
基于改进混合A^(*)算法的无人船路径规划
18
作者 安焱恒 孙晓界 +3 位作者 唐治齐 徐林 张皓翔 慕东东 《沈阳理工大学学报》 2026年第1期31-35,43,共6页
针对传统A^(*)算法在无人船路径规划中存在转折点过多、路径平滑度不足以及规划效率低下等问题,提出一种改进的混合A^(*)算法。在搜索过程中交替运用四邻域和八邻域策略,有效减少路径中的转折点数量,增强路径探索的灵活性与全面性,突破... 针对传统A^(*)算法在无人船路径规划中存在转折点过多、路径平滑度不足以及规划效率低下等问题,提出一种改进的混合A^(*)算法。在搜索过程中交替运用四邻域和八邻域策略,有效减少路径中的转折点数量,增强路径探索的灵活性与全面性,突破单一邻域搜索的局限性;优化A^(*)算法的估价函数,将启发式搜索与路径优化策略相结合,提升路径规划的效率和适应性。实验结果表明,与传统A^(*)算法相比,改进后的混合A^(*)算法充分考虑了无人船的运动约束,在路径长度和探索节点数等方面均展现出优势,生成的路径更加平滑,对复杂环境的适应性更强。 展开更多
关键词 无人船 路径规划 混合A^(*)算法 四八邻域 交替搜索
在线阅读 下载PDF
基于改进Hybrid A^(*)算法的阿克曼移动机器人路径规划 被引量:1
19
作者 钟佩思 曹泉虎 +3 位作者 刘梅 王晓 梁中源 王铭楷 《组合机床与自动化加工技术》 北大核心 2023年第8期122-126,共5页
针对移动机器人路径规划的效率和所规划路径的安全性问题,基于阿克曼六轮转向模型,提出了一种基于改进Hybrid A^(*)算法的路径规划方法。通过改进Hybrid A^(*)算法中的启发式函数,引入距离惩罚函数,减少了节点搜索数量;通过构建安全走廊... 针对移动机器人路径规划的效率和所规划路径的安全性问题,基于阿克曼六轮转向模型,提出了一种基于改进Hybrid A^(*)算法的路径规划方法。通过改进Hybrid A^(*)算法中的启发式函数,引入距离惩罚函数,减少了节点搜索数量;通过构建安全走廊,引导移动机器人尽可能远离障碍物;在代价函数中加入了节点向前、换向和向后扩展的惩罚项,确保所规划路径的可执行性与安全性。通过仿真表明,基于改进Hybrid A^(*)算法的路径规划方法适用于阿克曼六轮移动机器人,提高了路径规划的效率,规划的路径更具安全保障。 展开更多
关键词 移动机器人 阿克曼六轮转向模型 改进hybrid A^(*)算法 距离惩罚函数 安全走廊
在线阅读 下载PDF
改进Hybrid A^(*)的拖挂式移动机器人路径规划算法 被引量:5
20
作者 焦嵩鸣 陈雨溪 白健鹏 《电子测量技术》 北大核心 2022年第16期80-86,共7页
为了提高传统Hybrid A^(*)算法的路径规划效率和安全系数,提出一种改进的Hybrid A^(*)路径规划算法,并将此算法应用在拖挂式移动机器人系统上。首先,对启发函数进行改进,以减少路径规划过程中的计算量,从而提高规划效率;其次,设计障碍... 为了提高传统Hybrid A^(*)算法的路径规划效率和安全系数,提出一种改进的Hybrid A^(*)路径规划算法,并将此算法应用在拖挂式移动机器人系统上。首先,对启发函数进行改进,以减少路径规划过程中的计算量,从而提高规划效率;其次,设计障碍惩罚函数,进而实现提前避开行进路径上的障碍物,避免在U型障碍中陷入局部最优解;最后,考虑到拖挂式机器人模型结构的特殊性,无法将其视为质点,为此采用碰撞检测算法来提高规划路径的合理性和准确性。仿真试验验证,提出的改进Hybrid A^(*)路径规划算法可适用于拖挂式机器人系统,且具有规划效率和安全性能高、路径平滑等特点,为其在实际应用中的路径规划提供理论依据。 展开更多
关键词 拖挂式机器人 路径规划 改进hybrid A^(*)算法 惩罚函数 碰撞检测算法
原文传递
上一页 1 2 250 下一页 到第
使用帮助 返回顶部