| 面向变电站机器人巡检路径规划中的算法研究 |
| |
| 引用本文： | 王秀丽,周鹏,侯静楠,王仕俊,林霞. 面向变电站机器人巡检路径规划中的算法研究[J]. 计算机工程与应用, 2021, 57(14): 245-250. DOI: 10.3778/j.issn.1002-8331.2004-0378 |
| |
| 作者姓名： | 王秀丽 周鹏 侯静楠 王仕俊 林霞 |
| |
| 作者单位： | 1.山西大学 电力工程系,太原 0300132.国网甘肃省电力公司 经济技术研究院,兰州 7300503.国网山西省电力公司,太原 030021 |
| |
| 摘 要： | 针对目前在变电站中应用广泛的巡检机器人,探讨了其巡检路径的问题,依据离散数学理论中的哈密顿回路方法和路径的常规规划算法,研究了一种变电站的巡检路径为矩形分布时的机器人巡检路径问题.针对不同巡检方式,分别提出:全局巡检方式,采用新提出的哈密顿算法,当巡视起点被设定后,其他被巡视的任何点均可被归类,从而找出其巡检路径的哈密...
|
| 关 键 词： | 巡检路径 新哈密顿回路算法 Dijkstra算法 遗传算法 组合算法 |
Research on Algorithm of Inspection Path Planning for Substation Robot |
| |
| WANG Xiuli,ZHOU Peng,HOU Jingnan,WANG Shijun,LIN Xia. Research on Algorithm of Inspection Path Planning for Substation Robot[J]. Computer Engineering and Applications, 2021, 57(14): 245-250. DOI: 10.3778/j.issn.1002-8331.2004-0378 |
| |
| Authors: | WANG Xiuli ZHOU Peng HOU Jingnan WANG Shijun LIN Xia |
| |
| Affiliation: | 1.Department of Electric Engineering, Shanxi University, Taiyuan 030013, China2.Economics and Technology Research Institute of Gansu Electric Power Company, Lanzhou 730050, China3.State Grid Shanxi Electric Power Company, Taiyuan 030021, China |
| |
| Abstract: | In view of the inspection path problem of the inspection robot which is widely used in the substation at present, this paper discusses the inspection path problem, and according to the Hamilton loop method in the discrete mathematics theory and the routine path planning algorithm, this paper studies a kind of robot inspection path problem when the inspection paths of substations are rectangular. According to the different inspection methods, the following suggestions are put forward：global inspection mode, using the new Hamilton algorithm, when the starting point is set, any other point being inspected can be found out the Hamiltonian loop of the inspection path; the inspection mode of key equipment, using the method of Dijkstra algorithm combing with genetic algorithm; fixed-point inspection mode, using Dijkstra algorithm. The simulation results of three inspection methods are given respectively for sufficient power, low power return and continuing inspection after charging, and they are tested in a substation. The results show that the three algorithms are effective and feasible, and the new Hamilton loop algorithm is relatively shorter than the conventional algorithm, and the algorithm is relatively faster. |
| |
| Keywords: | route planning new Hamilton loop algorithm Dijkstra algorithm genetic algorithm combinatorial algorithm |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
|
