期刊文献+
共找到617篇文章
< 1 2 31 >
每页显示 20 50 100
Application of A* Algorithm for Real-time Path Re-planning of an Unmanned Surface Vehicle Avoiding Underwater Obstacles 被引量:9
1
作者 Thanapong Phanthong Toshihiro Maki +2 位作者 Tamaki Ura Takashi Sakamaki Pattara Aiyarak 《Journal of Marine Science and Application》 2014年第1期105-116,共12页
This paper describes path re-planning techniques and underwater obstacle avoidance for unmanned surface vehicle(USV) based on multi-beam forward looking sonar(FLS). Near-optimal paths in static and dynamic environment... This paper describes path re-planning techniques and underwater obstacle avoidance for unmanned surface vehicle(USV) based on multi-beam forward looking sonar(FLS). Near-optimal paths in static and dynamic environments with underwater obstacles are computed using a numerical solution procedure based on an A* algorithm. The USV is modeled with a circular shape in 2 degrees of freedom(surge and yaw). In this paper, two-dimensional(2-D) underwater obstacle avoidance and the robust real-time path re-planning technique for actual USV using multi-beam FLS are developed. Our real-time path re-planning algorithm has been tested to regenerate the optimal path for several updated frames in the field of view of the sonar with a proper update frequency of the FLS. The performance of the proposed method was verified through simulations, and sea experiments. For simulations, the USV model can avoid both a single stationary obstacle, multiple stationary obstacles and moving obstacles with the near-optimal trajectory that are performed both in the vehicle and the world reference frame. For sea experiments, the proposed method for an underwater obstacle avoidance system is implemented with a USV test platform. The actual USV is automatically controlled and succeeded in its real-time avoidance against the stationary undersea obstacle in the field of view of the FLS together with the Global Positioning System(GPS) of the USV. 展开更多
关键词 UNDERWATER obstacle avoidance real-time pathre-planning A* algorithm SONAR image unmanned surface vehicle
在线阅读 下载PDF
Obstacle avoidance for multi-missile network via distributed coordination algorithm 被引量:14
2
作者 Zhao Jiang Zhou Rui 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2016年第2期441-447,共7页
A distributed coordination algorithm is proposed to enhance the engagement of the multi-missile network in consideration of obstacle avoidance. To achieve a cooperative interception, the guidance law is developed in a... A distributed coordination algorithm is proposed to enhance the engagement of the multi-missile network in consideration of obstacle avoidance. To achieve a cooperative interception, the guidance law is developed in a simple form that consists of three individual components for tar- get capture, time coordination and obstacle avoidance. The distributed coordination algorithm enables a group of interceptor missiles to reach the target simultaneously, even if some member in the multi-missile network can only collect the information from nearest neighbors. The simula- tion results show that the guidance strategy provides a feasible tool to implement obstacle avoid- ance for the multi-missile network with satisfactory accuracy of target capture. The effects of the gain parameters are also discussed to evaluate the proposed approach. 展开更多
关键词 Cooperative guidance Distributed algorithms Impact time Missile guidance Multiple missiles obstacle avoidance Proportional navigation
原文传递
Improved Dijkstra Algorithm for Mobile Robot Path Planning and Obstacle Avoidance 被引量:29
3
作者 Shaher Alshammrei Sahbi Boubaker Lioua Kolsi 《Computers, Materials & Continua》 SCIE EI 2022年第9期5939-5954,共16页
Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots(MRs)in both research and education.In this paper,an optimal collision-free algorithm is designed and implemented prac... Optimal path planning avoiding obstacles is among the most attractive applications of mobile robots(MRs)in both research and education.In this paper,an optimal collision-free algorithm is designed and implemented practically based on an improved Dijkstra algorithm.To achieve this research objectives,first,the MR obstacle-free environment is modeled as a diagraph including nodes,edges and weights.Second,Dijkstra algorithm is used offline to generate the shortest path driving the MR from a starting point to a target point.During its movement,the robot should follow the previously obtained path and stop at each node to test if there is an obstacle between the current node and the immediately following node.For this aim,the MR was equipped with an ultrasonic sensor used as obstacle detector.If an obstacle is found,the MR updates its diagraph by excluding the corresponding node.Then,Dijkstra algorithm runs on the modified diagraph.This procedure is repeated until reaching the target point.To verify the efficiency of the proposed approach,a simulation was carried out on a hand-made MR and an environment including 9 nodes,19 edges and 2 obstacles.The obtained optimal path avoiding obstacles has been transferred into motion control and implemented practically using line tracking sensors.This study has shown that the improved Dijkstra algorithm can efficiently solve optimal path planning in environments including obstacles and that STEAM-based MRs are efficient cost-effective tools to practically implement the designed algorithm. 展开更多
关键词 Mobile robot(MR) STEAM path planning obstacle avoidance improved dijkstra algorithm
在线阅读 下载PDF
Dynamic A^*path finding algorithm and 3D lidar based obstacle avoidance strategy for autonomous vehicles 被引量:3
4
作者 Wang Xiaohua Ma Pin +1 位作者 Wang Hua Li Li 《High Technology Letters》 EI CAS 2020年第4期383-389,共7页
This paper presents a novel dynamic A^*path finding algorithm and 3D lidar based local obstacle avoidance strategy for an autonomous vehicle.3D point cloud data is collected and analyzed in real time.Local obstacles a... This paper presents a novel dynamic A^*path finding algorithm and 3D lidar based local obstacle avoidance strategy for an autonomous vehicle.3D point cloud data is collected and analyzed in real time.Local obstacles are detected online and a 2D local obstacle grid map is constructed at 10 Hz/s.The A^*path finding algorithm is employed to generate a local path in this local obstacle grid map by considering both the target position and obstacles.The vehicle avoids obstacles under the guidance of the generated local path.Experiment results have shown the effectiveness of the obstacle avoidance navigation algorithm proposed. 展开更多
关键词 autonomous navigation local obstacle avoidance dynamic A*path finding algorithm point cloud processing local obstacle map
在线阅读 下载PDF
LSDA-APF:A Local Obstacle Avoidance Algorithm for Unmanned Surface Vehicles Based on 5G Communication Environment 被引量:1
5
作者 Xiaoli Li Tongtong Jiao +2 位作者 Jinfeng Ma Dongxing Duan Shengbin Liang 《Computer Modeling in Engineering & Sciences》 SCIE EI 2024年第1期595-617,共23页
In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone ... In view of the complex marine environment of navigation,especially in the case of multiple static and dynamic obstacles,the traditional obstacle avoidance algorithms applied to unmanned surface vehicles(USV)are prone to fall into the trap of local optimization.Therefore,this paper proposes an improved artificial potential field(APF)algorithm,which uses 5G communication technology to communicate between the USV and the control center.The algorithm introduces the USV discrimination mechanism to avoid the USV falling into local optimization when the USV encounter different obstacles in different scenarios.Considering the various scenarios between the USV and other dynamic obstacles such as vessels in the process of performing tasks,the algorithm introduces the concept of dynamic artificial potential field.For the multiple obstacles encountered in the process of USV sailing,based on the International Regulations for Preventing Collisions at Sea(COLREGS),the USV determines whether the next step will fall into local optimization through the discriminationmechanism.The local potential field of the USV will dynamically adjust,and the reverse virtual gravitational potential field will be added to prevent it from falling into the local optimization and avoid collisions.The objective function and cost function are designed at the same time,so that the USV can smoothly switch between the global path and the local obstacle avoidance.The simulation results show that the improved APF algorithm proposed in this paper can successfully avoid various obstacles in the complex marine environment,and take navigation time and economic cost into account. 展开更多
关键词 Unmanned surface vehicles local obstacle avoidance algorithm artificial potential field algorithm path planning collision detection
在线阅读 下载PDF
A Lightweight UAV Visual Obstacle Avoidance Algorithm Based on Improved YOLOv8 被引量:1
6
作者 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
Distance Control Algorithm for Automobile Automatic Obstacle Avoidance and Cruise System
7
作者 Jinguo Zhao 《Computer Modeling in Engineering & Sciences》 SCIE EI 2018年第7期69-88,共20页
With the improvement of automobile ownership in recent years,the incidence of traffic accidents constantly increases and requirements on the security of automobiles become increasingly higher.As science and technology... With the improvement of automobile ownership in recent years,the incidence of traffic accidents constantly increases and requirements on the security of automobiles become increasingly higher.As science and technology develops constantly,the development of automobile automatic obstacle avoidance and cruise system accelerates gradually,and the requirement on distance control becomes stricter.Automobile automatic obstacle avoidance and cruise system can determine the conditions of automobiles and roads using sensing technology,automatically adopt measures to control automobile after discovering road safety hazards,thus to reduce the incidence of traffic accidents.To prevent accidental collision of automobile which are installed with automatic obstacle avoidance and cruise system,active brake should be controlled during driving.This study put forward a neural network based proportional-integral-derivative(PID)control algorithm.The active brake of automobiles was effectively controlled using the system to keep the distance between automobiles.Moreover the algorithm was tested using professional automobile simulation platform.The results demonstrated that neural network based PID control algorithm can precisely and efficiently control the distance between two cars.This work provides a reference for the development of automobile automatic obstacle avoidance and cruise system. 展开更多
关键词 obstacle avoidance and CRUISE DISTANCE control AUTOMOBILE algorithm
在线阅读 下载PDF
Swarm intelligence based dynamic obstacle avoidance for mobile robots under unknown environment using WSN 被引量:4
8
作者 薛晗 马宏绪 《Journal of Central South University of Technology》 EI 2008年第6期860-868,共9页
To solve dynamic obstacle avoidance problems, a novel algorithm was put forward with the advantages of wireless sensor network (WSN). In view of moving velocity and direction of both the obstacles and robots, a mathem... To solve dynamic obstacle avoidance problems, a novel algorithm was put forward with the advantages of wireless sensor network (WSN). In view of moving velocity and direction of both the obstacles and robots, a mathematic model was built based on the exposure model, exposure direction and critical speeds of sensors. Ant colony optimization (ACO) algorithm based on bionic swarm intelligence was used for solution of the multi-objective optimization. Energy consumption and topology of the WSN were also discussed. A practical implementation with real WSN and real mobile robots were carried out. In environment with multiple obstacles, the convergence curve of the shortest path length shows that as iterative generation grows, the length of the shortest path decreases and finally reaches a stable and optimal value. Comparisons show that using sensor information fusion can greatly improve the accuracy in comparison with single sensor. The successful path of robots without collision validates the efficiency, stability and accuracy of the proposed algorithm, which is proved to be better than tradition genetic algorithm (GA) for dynamic obstacle avoidance in real time. 展开更多
关键词 wireless sensor network dynamic obstacle avoidance mobile robot ant colony algorithm swarm intelligence path planning NAVIGATION
在线阅读 下载PDF
Obstacle avoidance technology of bionic quadruped robot based on multi-sensor information fusion
9
作者 韩宝玲 张天 +2 位作者 罗庆生 朱颖 宋明辉 《Journal of Beijing Institute of Technology》 EI CAS 2016年第4期448-454,共7页
In order to improve the ability of a bionic quadruped robot to percept the location of obstacles in a complex and dynamic environment, the information fusion between an ultrasonic sensor and a binocular sensor was stu... In order to improve the ability of a bionic quadruped robot to percept the location of obstacles in a complex and dynamic environment, the information fusion between an ultrasonic sensor and a binocular sensor was studied under the condition that the robot moves in the Walk gait on a structured road. Firstly, the distance information of obstacles from these two sensors was separately processed by the Kalman filter algorithm, which largely reduced the noise interference. After that, we obtained two groups of estimated distance values from the robot to the obstacle and a variance of the estimation value. Additionally, a fusion of the estimation values and the variances was achieved based on the STF fusion algorithm. Finally, a simulation was performed to show that the curve of a real value was tracked well by that of the estimation value, which attributes to the effectiveness of the Kalman filter algorithm. In contrast to statistics before fusion, the fusion variance of the estimation value was sharply decreased. The precision of the position information is 4. 6 cm, which meets the application requirements of the robot. 展开更多
关键词 MULTI-SENSOR Kalman filter algorithm constant velocity (CV) model STF fusion algo-rithm obstacle avoidance of robot
在线阅读 下载PDF
基于改进全局和局部融合的智能粮仓机器人运动控制研究
10
作者 贺建华 夏帅 刘洋 《粮食与饲料工业》 2026年第1期79-84,共6页
针对全局和局部路径规划应用于智能粮仓机器人运动控制存在的环境适应性差问题,提出一种基于改进全局和局部融合的路径规划方法。该方法在全局规划阶段设计一种平衡搜索速度与精度的新型启发式估算代价函数,并引入跳跃点优化机制。在局... 针对全局和局部路径规划应用于智能粮仓机器人运动控制存在的环境适应性差问题,提出一种基于改进全局和局部融合的路径规划方法。该方法在全局规划阶段设计一种平衡搜索速度与精度的新型启发式估算代价函数,并引入跳跃点优化机制。在局部规划阶段,基于机器人运动学模型构建动态权重调整的评价函数,新增轨迹偏离惩罚项与动态避障评价项,实现对环境实时变化的自适应响应。为验证算法性能,在MATLAB R2023b平台上构建20×20与40×40两种规模的栅格地图进行仿真试验,并与A^(*)算法、跳点搜索算法、RRT^(*)算法、F-RRT^(*)算法及文献[16]算法进行对比。结果表明,在20×20地图中,所提算法规划时间为23 ms,路径长度为21.71,节点数仅为7个,总转弯角度为59°,相较于传统A^(*)算法,路径长度缩短5.5%,节点数减少63.2%,转弯角度降低81.3%;在40×40地图中,算法仍保持35 ms的高效规划时间,路径长度为46.09,节点数为12,转弯角度为143°,相比A^(*)算法,路径长度减少3.2%,节点数降低67.6%,转弯角度减少64.7%,同时在路径平滑度与实时避障能力方面均显著优于对比算法。这为提升智能粮仓机器人在复杂动态环境中的运动控制性能提供了一种可行的导航解决方案。 展开更多
关键词 智能粮仓机器人 路径规划 全局和局部融合 融合算法 动态避障 运动控制
在线阅读 下载PDF
A novel obstacle avoidance heuristic algorithm of continuum robot based on FABRIK 被引量:1
11
作者 WU HaoRan YU JingJun +1 位作者 PAN Jie PEI Xu 《Science China(Technological Sciences)》 SCIE EI CAS CSCD 2022年第12期2952-2966,共15页
Obstacle avoidance and path planning of continuum robots are challenging tasks due to the hyper-redundant degree of freedoms(DOFs)and restricted working environments.Meanwhile,most current heuristic algorithm-based ob... Obstacle avoidance and path planning of continuum robots are challenging tasks due to the hyper-redundant degree of freedoms(DOFs)and restricted working environments.Meanwhile,most current heuristic algorithm-based obstacle avoidance algorithms exist with low computational efficiency,complex solution process,and inability to add global constraints.This paper proposes a novel obstacle avoidance heuristic algorithm based on the forward and backward reaching inverse kinematics(FABRIK)algorithm.The update of key nodes in this algorithm is modeled as the movement of charges in an electric field,avoiding complex nonlinear operations.The algorithm achieves the robustness of inverse kinematics and path tracking in complex environments by imposing constraints on key nodes and determining the location of obstacles in advance.This algorithm is characterized by a high convergence rate,low computational cost,and can be used for real-time applications.The proposed approach also has wide applicability and can be applied to both mobile and fixed-base continuum robots.And it can be further extended to the field of hyper-redundant robots.The algorithm's effectiveness is further validated by simulating the path tracking and obstacle avoidance of a five-segment continuum robot in various environments and comparisons with classical methods. 展开更多
关键词 continuum robot FABRIK algorithm obstacle avoidance motion planning
原文传递
基于改进APF-RRT的采摘机械臂运动路径规划 被引量:1
12
作者 贾通 潘星宇 +3 位作者 钱振东 路红 李佩娟 张文 《农机化研究》 北大核心 2026年第2期173-182,共10页
在农业自动化快速发展的背景下,机械臂作为果园智能采摘作业的核心设备,其路径规划能力直接影响作业效率。然而果园环境复杂,传统人工势场法(APF)、快速随机搜索树(RRT)等路径规划算法在避障能力与运动平滑等方面仍存在一定不足,难以满... 在农业自动化快速发展的背景下,机械臂作为果园智能采摘作业的核心设备,其路径规划能力直接影响作业效率。然而果园环境复杂,传统人工势场法(APF)、快速随机搜索树(RRT)等路径规划算法在避障能力与运动平滑等方面仍存在一定不足,难以满足高效、安全的采摘需求。针对上述问题,提出了一种基于改进APF-RRT的路径规划算法。通过人工势场引导目标采样方向,增强路径趋近性,并引入非线性斥力场模型平滑势能分布,缓解斥力突变导致的局部震荡;同时,设计了基于最小障碍距离的动态步长策略,自适应调整采样粒度,以兼顾搜索效率和避障精度;通过障碍可行性检测方法去除冗余节点,结合三次B样条曲线实现路径平滑处理,提升路径连续性与执行稳定性。试验表明:在二维空间环境下,改进APF-RRT算法较RRT与APF-RRT算法分别缩短耗时78.75%、58.99%,路径长度减少16.88%、5.93%;在三维空间环境下,耗时缩短88.85%、65.20%,路径长度减少19.60%、5.61%;在机械臂仿真环境中,改进算法生成的路径更加平滑,转折点数量减少。研究结果验证了改进APF-RRT算法在复杂果园下具备良好的全局搜索与避障能力,以及较好的有效性与稳定性。 展开更多
关键词 采摘机械臂 路径规划 人工势场法 快速随机搜索树 改进APF-RRT算法 避障
在线阅读 下载PDF
海洋钻井作业钻井液站输配路径规划研究
13
作者 周波 张懿 +4 位作者 韩金锟 黄磊 王金堂 侯林 张行 《石油机械》 北大核心 2026年第1期66-74,共9页
随着海洋石油钻井朝着环保、安全和高效等方向发展,钻井液工程技术服务需要满足更高的要求。针对传统钻井液站依赖人工经验进行钻井液输配路径规划效率低下的问题,设计了一种基于改进型Dijkstra算法的钻井液配制、储存和外输管线自动寻... 随着海洋石油钻井朝着环保、安全和高效等方向发展,钻井液工程技术服务需要满足更高的要求。针对传统钻井液站依赖人工经验进行钻井液输配路径规划效率低下的问题,设计了一种基于改进型Dijkstra算法的钻井液配制、储存和外输管线自动寻径系统,实现海洋钻井作业钻井液站输配效率的提升。在设计过程中,引入阀门数量、管线实际距离和流动难易度计算出管线综合系数,并将其作为最优路径的决策标准。从数据库中提取电控器件的状态数据,对数据进行处理后建立邻接矩阵。在此基础上,针对海洋钻井作业钻井液站的功能需求,构建了配液、剪切、倒罐和输出功能。综合考虑特征向量中心度与接近中心性,测试系统的避障功能。研究结果表明,基于改进型Dijkstra算法的自动寻径系统可快速寻找最优输配路径并完成指令下达,能够有效提高钻井液站的输配效率。 展开更多
关键词 海洋钻井作业 输配路径规划 改进型Dijkstra算法 自动寻径系统 避障功能
在线阅读 下载PDF
基于改进TSO_DWA算法的割草机局部避障
14
作者 徐正桓 张业鹏 杨光友 《农机化研究》 北大核心 2026年第4期214-224,共11页
针对传统动态窗口法(DWA)在密集障碍物区域和直线移动障碍物区域存在难以选取最优路径和生成路径不平滑等问题,提出了一种基于改进金枪鱼算法(TSO)觅食行为的DWA优化方法,以实现割草机的局部路径避障。首先,用Fuch无限折叠混沌法初始化... 针对传统动态窗口法(DWA)在密集障碍物区域和直线移动障碍物区域存在难以选取最优路径和生成路径不平滑等问题,提出了一种基于改进金枪鱼算法(TSO)觅食行为的DWA优化方法,以实现割草机的局部路径避障。首先,用Fuch无限折叠混沌法初始化金枪鱼群初始位置,来提升算法寻求最优解的搜索效率,其遍历性可有效避免传统随机初始化陷入局部最优的问题;其次,利用学习率ρ调节DWA算法权重系数的更新步长,强化路径寻优能力,并增加扰动项r和扰动系数σ,提高寻求最优权重系数的速度,减小航向角权重系数在复杂环境中占比不变导致路径不平滑的影响;最后,用改进后的评价函数对选取路径进行评价计算得分,对比迭代次数和评价得分,从而确定最优轨迹。仿真试验和草地试验表明:在仿真环境中,TSO_DWA算法在密集障碍物区域和直线移动障碍物区域能规划出更平滑、合理的运动路径;在草地和行人场景中,割草机具备自主导航能力,且定位误差与最大跟踪误差均小于等于0.16 m,满足实际需求。 展开更多
关键词 割草机 局部避障 改进TSO_DWA算法 轨迹优化
在线阅读 下载PDF
基于改进A^(*)-DWA算法的移动机器人避障技术
15
作者 余风军 周晓平 《现代制造工程》 北大核心 2026年第2期30-34,65,共6页
为解决传统A^(*)算法在实际应用中存在的动态性不足、避障效率低及运行时间长等问题,提出一种考虑运动学约束A^(*)算法与动态窗口法(Dynamic Window Approach,DWA)相结合的方法。首先,在考虑机器人运动学的基础上,改进A^(*)算法的节点... 为解决传统A^(*)算法在实际应用中存在的动态性不足、避障效率低及运行时间长等问题,提出一种考虑运动学约束A^(*)算法与动态窗口法(Dynamic Window Approach,DWA)相结合的方法。首先,在考虑机器人运动学的基础上,改进A^(*)算法的节点扩展方法和启发函数模型,以提高搜索效率并减少路径转向次数,从而使得A^(*)算法生成的路径更好地满足机器人运动约束。其次,优化DWA算法的路径评价函数,使DWA算法规划的局部路径更加平滑连贯,更有利于机器人运动执行。最后,从A^(*)算法规划的全局路径中提取关键节点,指导DWA算法进行局部规划和动态避障。仿真结果表明,改进A^(*)-DWA算法较其他算法规划耗时最多节约45.09%,行驶距离最多减少13.49%。实验验证了改进A^(*)-DWA算法的有效性。 展开更多
关键词 A^(*)算法 动态窗口法 机器人 避障 运动学约束 路径评价
在线阅读 下载PDF
基于深度强化学习的多无人车协同路径规划方法
16
作者 戴晟潭 王寅 尚晨晨 《北京航空航天大学学报》 北大核心 2026年第2期541-550,共10页
为解决多无人车系统中的协同路径规划问题,利用深度强化学习方法,设计了一种高效的路径规划框架。构建基于双轮差速无人车的运动学模型和协同避障场景的数学模型;在此基础上,进一步分析深度强化学习在处理高维度状态空间和连续动作空间... 为解决多无人车系统中的协同路径规划问题,利用深度强化学习方法,设计了一种高效的路径规划框架。构建基于双轮差速无人车的运动学模型和协同避障场景的数学模型;在此基础上,进一步分析深度强化学习在处理高维度状态空间和连续动作空间等复杂动态场景时训练速度慢、采样效率低和适应能力差的机理,为多无人车协同路径规划研究提供理论基础。针对全部可观测条件下多无人车协同路径规划避障围捕的策略生成问题,提出改进双延迟深度确定性策略梯度(AE-TD3)算法,在围捕无人车输出的动作上添加来自高斯分布的随机噪声,并权衡探索或利用输出动作,使围捕无人车在未知环境中能更有效地探索,实现多无人车高效稳定的协同避障围捕。仿真实验表明,改进算法相较于双延迟深度确定性策略梯度(TD3)算法,平均奖励的收敛速度更快,围捕时间缩短16.7%,验证了改进算法的可行性。 展开更多
关键词 路径规划 协同避障和围捕 深度强化学习 双延迟深度确定性策略梯度算法 动作增强探索策略
原文传递
基于改进Lazy-PRM算法的双臂巡检机器人避障路径规划
17
作者 詹桦 吴添权 +2 位作者 林凯煌 张湃 张杰雄 《机械传动》 北大核心 2026年第2期192-199,共8页
【目的】针对双臂巡检机器人路径规划中存在的路径冗余、运动冲突及避障能力差、协调性低的问题,提出一种基于改进惰性概率路图(Lazy Probabilistic Roadmap,Lazy-PRM)算法的避障路径规划方法,提升机器人在复杂环境中的作业可靠性。【... 【目的】针对双臂巡检机器人路径规划中存在的路径冗余、运动冲突及避障能力差、协调性低的问题,提出一种基于改进惰性概率路图(Lazy Probabilistic Roadmap,Lazy-PRM)算法的避障路径规划方法,提升机器人在复杂环境中的作业可靠性。【方法】首先,采用改进D-H方法与栅格法,构建双机械臂运动学模型及工作空间三维体素环境模型,为路径规划提供基础;其次,设置不同机械臂姿态偏好,辅助逆运动学解选择,保障轨迹平滑性;然后,通过伪随机采样点构建连通图,结合分布式评价函数筛选潜在最优路径;最后,通过碰撞检测验证路径可行性,利用五次多项式插值优化轨迹平滑性。【结果】仿真与试验结果表明,改进算法规划的路径长度最短(1737.68 mm),较RRT*算法缩短5.2%、较传统Lazy-PRM算法缩短20.5%;可操作度达0.2186,优于对比算法;双机械臂无运动冲突,连通图可重复使用。研究可为双臂巡检机器人高效避障路径规划提供参考。 展开更多
关键词 双臂巡检机器人 Lazy-PRM算法 路径规划 避障策略 评价函数
在线阅读 下载PDF
基于改进RRT算法的采摘机械臂路径规划研究
18
作者 孙波 彭浩 +2 位作者 周健康 陈红明 赵伟 《农机化研究》 北大核心 2026年第3期169-177,共9页
为了使采摘机械臂在复杂环境下完成采摘任务,提出了改进RRT算法有效规划机器臂路径,以提高机械臂的避障能力。针对标准RRT算法在多自由度机械臂路径规划中存在规划耗时长、导向性较差,冗余节点多和路径质量差等问题,引入动态采样域策略... 为了使采摘机械臂在复杂环境下完成采摘任务,提出了改进RRT算法有效规划机器臂路径,以提高机械臂的避障能力。针对标准RRT算法在多自由度机械臂路径规划中存在规划耗时长、导向性较差,冗余节点多和路径质量差等问题,引入动态采样域策略和目标偏置概率策略,提高了算法的导向性和收敛速度。设置了机械臂路径规划的两种仿真实验环境,包含多个小球体的小型障碍物环境和一个大球体的大型障碍物环境,并进行仿真对比实验。在小型障碍物环境下的仿真结果表明,相比GB-RRT算法,改进算法的时间代价减少了87.79%、最终路径的节点数减少了95.08%、路径代价减少了14.63%;在大型障碍物环境下的仿真结果表明,GB-RRT算法路径规划失败,而改进算法能够规划出一条合理的路径,使机械臂顺利避开障碍物。 展开更多
关键词 采摘机械臂 路径规划 RRT避障算法 动态采样域策略 B样条曲线
在线阅读 下载PDF
基于改进人工势场法的无人船路径规划
19
作者 孙岩林 齐向东 +2 位作者 熊攀 赵正阳 秦钜灏 《舰船科学技术》 北大核心 2026年第4期179-184,共6页
本文针对传统人工势场法在无人船向目标点移动过程中,由于障碍物斥力与目标点引力相平衡而导致局部极小值现象,以及目标点可能处于障碍物斥力影响范围从而无法到达的问题,提出基于粒子群优化算法的人工势场法。首先,将无人船与目标点之... 本文针对传统人工势场法在无人船向目标点移动过程中,由于障碍物斥力与目标点引力相平衡而导致局部极小值现象,以及目标点可能处于障碍物斥力影响范围从而无法到达的问题,提出基于粒子群优化算法的人工势场法。首先,将无人船与目标点之间的直线距离引入斥力函数中,解决目标点不可达问题;随后,在局部极小值区域的特定范围内利用粒子群优化算法生成若干粒子,并基于评价函数确定最优虚拟目标点,此虚拟目标点可引导无人船脱离局部极小值区域。仿真实验结果表明,改进后的算法能够成功使无人船摆脱局部极小值陷阱并顺利到达目标点,且整体路径平滑度有所提高,用时较短,提升了在复杂环境下的鲁棒性。 展开更多
关键词 人工势场法 路径规划 局部极小值 斥力势场 避障 粒子群优化算法
在线阅读 下载PDF
Hybrid path planning for USVs using improved A^(*)and DWA
20
作者 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
上一页 1 2 31 下一页 到第
使用帮助 返回顶部