基于边缘计算的电网检测路径研究

Ye Fengchun, He Ninghui, Wu Xutao
{"title":"基于边缘计算的电网检测路径研究","authors":"Ye Fengchun, He Ninghui, Wu Xutao","doi":"10.1109/ICUEMS50872.2020.00058","DOIUrl":null,"url":null,"abstract":"With the development of intelligent power systems, establishment of intelligent inspection paths is studied in this paper so that disadvantages such as inaccessible network, cumbersome operation, and low safety performance in existing power grid inspections can be solved. Besides, power network topology is constructed based on study of characteristics in power grid environment and requirements of inspection tasks. Moreover, two-layer heuristic algorithm is proposed in this paper based on edge computing. On the basis of ant colony algorithm, deviation degree is used to guide pheromone update so as to solve dual-objective problem in path planning. Meanwhile, annealing mechanism is introduced to effectively avoid “premature” phenomenon in ant colony algorithm, which speed up algorithm convergence. Every time simulated annealing runs, entire ant colony algorithm needs to be run. After all ants complete a round of search, optimal ants will be selected for node swapping, inversion, and translation to generate new solutions and accept new solutions according to annealing rules, which completes combination of simulated annealing and ant colony algorithm. After simulation experiment analysis, it is proved that research method proposed in this paper effectively improves global search ability and avoids falling into local optimum. Therefore, if deviation degree is used as the criterion to evaluate pros and cons of solution as well as guide pheromone update, convergence speed of algorithm can be accelerated.","PeriodicalId":285594,"journal":{"name":"2020 International Conference on Urban Engineering and Management Science (ICUEMS)","volume":"183 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Research on Power Grid Inspection Path Based on Edge Computing\",\"authors\":\"Ye Fengchun, He Ninghui, Wu Xutao\",\"doi\":\"10.1109/ICUEMS50872.2020.00058\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the development of intelligent power systems, establishment of intelligent inspection paths is studied in this paper so that disadvantages such as inaccessible network, cumbersome operation, and low safety performance in existing power grid inspections can be solved. Besides, power network topology is constructed based on study of characteristics in power grid environment and requirements of inspection tasks. Moreover, two-layer heuristic algorithm is proposed in this paper based on edge computing. On the basis of ant colony algorithm, deviation degree is used to guide pheromone update so as to solve dual-objective problem in path planning. Meanwhile, annealing mechanism is introduced to effectively avoid “premature” phenomenon in ant colony algorithm, which speed up algorithm convergence. Every time simulated annealing runs, entire ant colony algorithm needs to be run. After all ants complete a round of search, optimal ants will be selected for node swapping, inversion, and translation to generate new solutions and accept new solutions according to annealing rules, which completes combination of simulated annealing and ant colony algorithm. After simulation experiment analysis, it is proved that research method proposed in this paper effectively improves global search ability and avoids falling into local optimum. Therefore, if deviation degree is used as the criterion to evaluate pros and cons of solution as well as guide pheromone update, convergence speed of algorithm can be accelerated.\",\"PeriodicalId\":285594,\"journal\":{\"name\":\"2020 International Conference on Urban Engineering and Management Science (ICUEMS)\",\"volume\":\"183 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 International Conference on Urban Engineering and Management Science (ICUEMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUEMS50872.2020.00058\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Conference on Urban Engineering and Management Science (ICUEMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUEMS50872.2020.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

随着智能电力系统的发展,本文对智能巡检路径的建立进行了研究,以解决现有电网巡检中网络不通、操作繁琐、安全性能低等缺点。在研究电网环境特点和巡检任务要求的基础上,构建了电网拓扑结构。此外,本文还提出了基于边缘计算的两层启发式算法。在蚁群算法的基础上,利用偏差度引导信息素更新,解决路径规划中的双目标问题。同时,引入退火机制,有效避免了蚁群算法中的“早熟”现象,加快了算法的收敛速度。每次模拟退火运算都需要运行整个蚁群算法。在所有蚂蚁完成一轮搜索后,选择最优蚂蚁进行节点交换、反演、平移,根据退火规则生成新解并接受新解,完成模拟退火与蚁群算法的结合。经过仿真实验分析,证明本文提出的研究方法有效地提高了全局搜索能力,避免了陷入局部最优。因此,如果以偏差度作为评价解的优劣和引导信息素更新的标准,可以加快算法的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Power Grid Inspection Path Based on Edge Computing
With the development of intelligent power systems, establishment of intelligent inspection paths is studied in this paper so that disadvantages such as inaccessible network, cumbersome operation, and low safety performance in existing power grid inspections can be solved. Besides, power network topology is constructed based on study of characteristics in power grid environment and requirements of inspection tasks. Moreover, two-layer heuristic algorithm is proposed in this paper based on edge computing. On the basis of ant colony algorithm, deviation degree is used to guide pheromone update so as to solve dual-objective problem in path planning. Meanwhile, annealing mechanism is introduced to effectively avoid “premature” phenomenon in ant colony algorithm, which speed up algorithm convergence. Every time simulated annealing runs, entire ant colony algorithm needs to be run. After all ants complete a round of search, optimal ants will be selected for node swapping, inversion, and translation to generate new solutions and accept new solutions according to annealing rules, which completes combination of simulated annealing and ant colony algorithm. After simulation experiment analysis, it is proved that research method proposed in this paper effectively improves global search ability and avoids falling into local optimum. Therefore, if deviation degree is used as the criterion to evaluate pros and cons of solution as well as guide pheromone update, convergence speed of algorithm can be accelerated.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信