树遍历
运动规划
机器人
障碍物
冗余(工程)
路径(计算)
计算机科学
实时计算
平滑度
节点(物理)
工程类
算法
人工智能
可靠性工程
数学
数学分析
结构工程
程序设计语言
法学
政治学
作者
Wei Zhang,Wanli Li,Xiang Zheng,Bing Sun
标识
DOI:10.1177/00202940251316687
摘要
To solve the intelligent substation inspection robot path planning with low global efficiency, search node redundancy, and may even fail under a dynamic obstacle environment, which is normally based on the A* or dynamic window approach (DWA) algorithms. This study attempted to use the improved A* algorithm and an enhanced DWA algorithms for intelligent substation inspection robot path planning to improve its path planning ability under dynamic inspection. In this study, The neighborhood traversal rule of the A* is refined, and the DWA evaluation function is adjusted to align with the specific demands of intelligent substation inspection. Simulation results demonstrate that combining the improved A* algorithm with the enhanced DWA significantly reduces the inspection path length by 24.4% compared to traditional A* in fixed point inspection condition. This integration greatly enhances the dynamic path-planning performance of substation inspection robots, particularly in terms of path smoothness and inspection efficiency.
科研通智能强力驱动
Strongly Powered by AbleSci AI