期刊文献+
共找到604篇文章
< 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 被引量:27
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
A novel obstacle avoidance heuristic algorithm of continuum robot based on FABRIK 被引量:1
10
作者 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的采摘机械臂运动路径规划
11
作者 贾通 潘星宇 +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
塔式起重机群动态避障路径规划与应用
12
作者 肖尚风 刘子轩 +2 位作者 侯启示 牟茂林 陈波 《建筑技术开发》 2026年第1期70-72,共3页
研究提出了一种基于改进人工势场算法的塔式起重机群动态避障路径规划方法,通过实时调整权重系数和路径优化策略,解决了传统算法在动态环境中的局部最小值问题。通过在不同仿真场景下进行测试,验证了该算法在塔式起重机之间以及塔式起... 研究提出了一种基于改进人工势场算法的塔式起重机群动态避障路径规划方法,通过实时调整权重系数和路径优化策略,解决了传统算法在动态环境中的局部最小值问题。通过在不同仿真场景下进行测试,验证了该算法在塔式起重机之间以及塔式起重机与移动障碍物之间避让的高效性和安全性。研究结果表明,改进后的算法能够确保塔式起重机群在复杂施工环境中高效、安全地完成作业任务。 展开更多
关键词 塔式起重机群 动态避障 路径规划 改进人工势场算法 协同作业
在线阅读 下载PDF
Path planning in uncertain environment by using firefly algorithm 被引量:17
13
作者 B.K.Patle Anish Pandey +1 位作者 A.Jagadeesh D.R.Parhi 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2018年第6期691-701,共11页
Autonomous mobile robot navigation is one of the most emerging areas of research by using swarm intelligence. Path planning and obstacle avoidance are most researched current topics like navigational challenges for mo... Autonomous mobile robot navigation is one of the most emerging areas of research by using swarm intelligence. Path planning and obstacle avoidance are most researched current topics like navigational challenges for mobile robot. The paper presents application and implementation of Firefly Algorithm(FA)for Mobile Robot Navigation(MRN) in uncertain environment. The uncertainty is defined over the changing environmental condition from static to dynamic. The attraction of one firefly towards the other firefly due to variation of their brightness is the key concept of the proposed study. The proposed controller efficiently explores the environment and improves the global search in less number of iterations and hence it can be easily implemented for real time obstacle avoidance especially for dynamic environment. It solves the challenges of navigation, minimizes the computational calculations, and avoids random moving of fireflies. The performance of proposed controller is better in terms of path optimality when compared to other intelligent navigational approaches. 展开更多
关键词 Mobile robot NAVIGATION FIREFLY algorithm PATH planning obstacle avoidance
在线阅读 下载PDF
Efficient AUV Path Planning in Time-Variant Underwater Environment Using Differential Evolution Algorithm 被引量:6
14
作者 S.Mahmoud Zadeh D.M.W Powers +2 位作者 A.M.Yazdani K.Sammut A.Atyabi 《Journal of Marine Science and Application》 CSCD 2018年第4期585-591,共7页
Robust and efficient AUV path planning is a key element for persistence AUV maneuvering in variable underwater environments. To develop such a path planning system, in this study, differential evolution(DE) algorithm ... Robust and efficient AUV path planning is a key element for persistence AUV maneuvering in variable underwater environments. To develop such a path planning system, in this study, differential evolution(DE) algorithm is employed. The performance of the DE-based planner in generating time-efficient paths to direct the AUV from its initial conditions to the target of interest is investigated within a complexed 3D underwater environment incorporated with turbulent current vector fields, coastal area,islands, and static/dynamic obstacles. The results of simulations indicate the inherent efficiency of the DE-based path planner as it is capable of extracting feasible areas of a real map to determine the allowed spaces for the vehicle deployment while coping undesired current disturbances, exploiting desirable currents, and avoiding collision boundaries in directing the vehicle to its destination. The results are implementable for a realistic scenario and on-board real AUV as the DE planner satisfies all vehicular and environmental constraints while minimizing the travel time/distance, in a computationally efficient manner. 展开更多
关键词 Path planning Differential evolution Autonomous UNDERWATER vehicles EVOLUTIONARY algorithms obstacle avoidance
在线阅读 下载PDF
A dynamic fusion path planning algorithm for mobile robots incorporating improved IB-RRT∗and deep reinforcement learning 被引量:1
15
作者 刘安东 ZHANG Baixin +2 位作者 CUI Qi ZHANG Dan NI Hongjie 《High Technology Letters》 EI CAS 2023年第4期365-376,共12页
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. 展开更多
关键词 mobile robot improved IB-RRT∗algorithm deep reinforcement learning(DRL) real-time dynamic obstacle avoidance
在线阅读 下载PDF
基于改进RRT的协作机器人避障路径规划研究
16
作者 刘哲 何俊杰 +1 位作者 王天琪 王志刚 《组合机床与自动化加工技术》 北大核心 2025年第11期38-42,48,共6页
为了提升协作机器人在复杂多障碍环境中的避障路径规划效率和成功率,通过几何包络法构建了碰撞检测模型,并提出了一种基于扩展动作选择策略融合优化目标偏置策略的改进RRT算法。在传统RRT算法基础上设置一个目标偏置阈值,通过概率值P与... 为了提升协作机器人在复杂多障碍环境中的避障路径规划效率和成功率,通过几何包络法构建了碰撞检测模型,并提出了一种基于扩展动作选择策略融合优化目标偏置策略的改进RRT算法。在传统RRT算法基础上设置一个目标偏置阈值,通过概率值P与阈值大小对比,选择扩展动作,同时为解决局部最优问题引入优化目标偏置策略,通过将X′_(goal)和X_(rand)的矢量合成,确定最终的扩展方向;结合自适应步长,减少搜索时间,提高效率;对冗余节点进行删除,并采用三次B样条插值优化,提高协作机器人轨迹的柔顺性。通过与传统RRT和RRT^(*)算法进行仿真对比,发现路径长度和搜索时间均有显著下降。仿真结果显示,协作机器人在复杂的多障碍环境中表现出较强的适应性,路径搜索的成功率优于传统算法,同时与RRT算法相比,平均路径搜索时间显著缩短,从而提高了算法的效率和成功率。 展开更多
关键词 协作机器人 避障路径规划 优化目标偏置策略 RRT算法
在线阅读 下载PDF
基于视觉感知+蚁群算法的管道检测机器人避障研究 被引量:1
17
作者 刘思默 《兰州石化职业技术大学学报》 2025年第1期37-42,共6页
为了确保管道的安全运行,需要采用有效的检测方法和手段,以发现和评估管道的缺陷和损伤。目前,管道机器人是管道检测最有效的手段,然而在检测过程中会面临各种障碍物(缺陷)的影响,进而降低检测效率。鉴于此,在分析管道内机器人运动特性... 为了确保管道的安全运行,需要采用有效的检测方法和手段,以发现和评估管道的缺陷和损伤。目前,管道机器人是管道检测最有效的手段,然而在检测过程中会面临各种障碍物(缺陷)的影响,进而降低检测效率。鉴于此,在分析管道内机器人运动特性的基础上,提出了基于蚁群算法和双目视觉的管道机器人避障策略。利用双目视觉进行障碍物快速三维重建,有效判断障碍物的距离;利用蚁群算法对管道机器人行驶路径进行规划,有效解决了管道机器人障碍物识别与规避的问题。研究结果表明:该方法能够实现管道机器人障碍物距离判断以及避障过程的路径规划功能,符合管道检测的实用要求,具有较高的实际应用价值。 展开更多
关键词 管道 机器人 避障 蚁群算法 双目视觉
在线阅读 下载PDF
基于蚁群-动态窗口法的无人驾驶汽车动态路径规划
18
作者 郑琰 席宽 +2 位作者 巴文婷 肖玉杰 余伟 《南京信息工程大学学报》 北大核心 2025年第2期256-264,共9页
针对传统路径规划算法在无人驾驶汽车应用中搜索效率低、距离较长和路径不平滑的问题进行改进,使用改进蚁群算法最优路径的关键节点替代动态窗口法的局部目标点,并在动态窗口法评价函数中加入目标距离评价子函数,提高路径规划的效率和... 针对传统路径规划算法在无人驾驶汽车应用中搜索效率低、距离较长和路径不平滑的问题进行改进,使用改进蚁群算法最优路径的关键节点替代动态窗口法的局部目标点,并在动态窗口法评价函数中加入目标距离评价子函数,提高路径规划的效率和平滑性,同时采用路径决策方法解决全局路径失效问题,使车辆摆脱障碍困境,满足路径规划安全性的要求.改进后的蚁群算法利用起止点的位置信息使初始信息素分布不均匀,减少搜索初期阶段的时间消耗;通过维护全局最优路径和强化优秀局部路径的信息素浓度,优化信息素更新机制,提高路径探索效率;对规划路径进行二次优化,优化节点和冗余转折点,减少路径长度.仿真结果表明,相比传统路径规划算法,利用本文提出的融合算法所得到的路径在距离、平滑度和收敛性方面都具有更好的表现,且符合无人驾驶汽车安全行驶的要求. 展开更多
关键词 路径规划 蚁群算法 动态窗口法 动态避障 融合算法
在线阅读 下载PDF
改进粒子群算法的无人机B样条曲线路径规划
19
作者 杨火根 王艳 骆伟 《郑州大学学报(工学版)》 北大核心 2025年第4期8-15,共8页
针对粒子群算法在无人机路径规划中易陷入局部最优解,且在离散路径点光滑处理后对避障考虑不足的问题,提出一种基于改进粒子群算法的无人机三维B样条曲线路径规划方法。首先,综合考虑无人机路径长度、安全避障、飞行高度及平稳性等飞行... 针对粒子群算法在无人机路径规划中易陷入局部最优解,且在离散路径点光滑处理后对避障考虑不足的问题,提出一种基于改进粒子群算法的无人机三维B样条曲线路径规划方法。首先,综合考虑无人机路径长度、安全避障、飞行高度及平稳性等飞行性能要求,利用B样条曲线的几何性质构建路径规划模型;其次,采用改进的粒子群算法对模型进行求解,算法改进主要通过优化粒子初始化策略、惯性权重因子和学习因子更新策略、增加粒子扰动策略来实现;最后,在CEC2017标准测试函数集上进行测试。结果表明:改进的粒子群算法在对比算法中表现出更强的寻优能力,稳定性也更好。两个场景的仿真结果表明:所规划的路径代价可减少2%,稳定性可提高65%,路径安全避障且C 2连续,能满足无人机飞行综合性能要求。 展开更多
关键词 无人机 B样条曲线 路径规划 避障 改进粒子群算法
在线阅读 下载PDF
平滑高效的U型障碍物路径规划
20
作者 姜媛媛 谢宏达 《电子测量与仪器学报》 北大核心 2025年第9期126-136,共11页
针对复杂U型障碍物环境中跳点搜索算法(jump point search,JPS)路径长、拐点多和人工势场法(artificial potential field,APF)陷入U型陷阱引起的路径曲折、寻路效率低等问题,提出融合改进JPS算法和APF算法(JPS^(*)-APF)的移动机器人路... 针对复杂U型障碍物环境中跳点搜索算法(jump point search,JPS)路径长、拐点多和人工势场法(artificial potential field,APF)陷入U型陷阱引起的路径曲折、寻路效率低等问题,提出融合改进JPS算法和APF算法(JPS^(*)-APF)的移动机器人路径规划算法。首先,在传统JPS算法中增加角度偏差函数并删除冗余节点,减小搜索距离和转折次数;其次,改进JPS算法的拐点作为子目标点,分段引导APF算法逃出U型陷阱,自适应生成拐角障碍物斥力或动态子目标点提高路径平滑度;然后,在目标点区域添加对称虚拟障碍物解决目标不可达、融合外部斥力和重规划策略逃出局部最优,提高寻路效率;最后,适时加入相对速度斥力保证动态避障的安全性。针对不同U/L型障碍物环境进行数值仿真,结果表明,JPS^(*)-APF算法较IA^(*)-APF算法平均减少了51.5%的寻路时间和7.3%的路径长度,而且JPS^(*)-APF算法路径更平滑,能有效逃出U型陷阱并提升移动机器人的工作效率;同时通过真实环境实验测试验证了JPS^(*)-APF算法规划的可行性。 展开更多
关键词 JPS算法 APF算法 U型陷阱 平滑 高效 动态避障
原文传递
上一页 1 2 31 下一页 到第
使用帮助 返回顶部