勘探车全覆盖路径算法设计

Junwen Chen, Honghua Tan, Xu Wang
{"title":"勘探车全覆盖路径算法设计","authors":"Junwen Chen, Honghua Tan, Xu Wang","doi":"10.1109/AICIT55386.2022.9930287","DOIUrl":null,"url":null,"abstract":"The survey work for urban underground pipelines is mostly carried out outdoors, and the randomness of its environment brings a lot of difficulties to the full-coverage path planning work of intelligent exploration vehicles. To adapt to the complex outdoor environment and improve the performance and efficiency of the crossing, this article constructs the exploration vehicle model and improves the traditional DFS algorithm. Changing its backtracking strategy based on the original algorithm and introducing a node cost function to linearly constrain the number of turns of the exploration vehicle. Through simulation experiments, the improved DFS algorithm can efficiently complete the full-coverage exploration task for pipeline exploration sites and compared with some classical algorithms, the improved algorithm has a significant reduction in the map traversal repetition rate, and also shows obvious advantages in solving the full-coverage path planning problem in complex environments, which can complete the related work more efficiently.","PeriodicalId":231070,"journal":{"name":"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Design of Full Coverage Path Algorithm for exploration truck\",\"authors\":\"Junwen Chen, Honghua Tan, Xu Wang\",\"doi\":\"10.1109/AICIT55386.2022.9930287\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The survey work for urban underground pipelines is mostly carried out outdoors, and the randomness of its environment brings a lot of difficulties to the full-coverage path planning work of intelligent exploration vehicles. To adapt to the complex outdoor environment and improve the performance and efficiency of the crossing, this article constructs the exploration vehicle model and improves the traditional DFS algorithm. Changing its backtracking strategy based on the original algorithm and introducing a node cost function to linearly constrain the number of turns of the exploration vehicle. Through simulation experiments, the improved DFS algorithm can efficiently complete the full-coverage exploration task for pipeline exploration sites and compared with some classical algorithms, the improved algorithm has a significant reduction in the map traversal repetition rate, and also shows obvious advantages in solving the full-coverage path planning problem in complex environments, which can complete the related work more efficiently.\",\"PeriodicalId\":231070,\"journal\":{\"name\":\"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICIT55386.2022.9930287\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Artificial Intelligence and Computer Information Technology (AICIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICIT55386.2022.9930287","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

城市地下管线的调查工作多在室外进行,其环境的随机性给智能勘探车的全覆盖路径规划工作带来了很多困难。为了适应复杂的室外环境,提高交叉口的性能和效率,本文构建了探测车辆模型,并对传统的DFS算法进行了改进。该算法在原有算法的基础上改进了回溯策略,引入节点代价函数对探测车的转弯次数进行线性约束。通过仿真实验,改进的DFS算法可以高效地完成管道勘探点的全覆盖勘探任务,并且与一些经典算法相比,改进算法在地图遍历重复率上显著降低,在解决复杂环境下的全覆盖路径规划问题上也显示出明显的优势,可以更高效地完成相关工作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design of Full Coverage Path Algorithm for exploration truck
The survey work for urban underground pipelines is mostly carried out outdoors, and the randomness of its environment brings a lot of difficulties to the full-coverage path planning work of intelligent exploration vehicles. To adapt to the complex outdoor environment and improve the performance and efficiency of the crossing, this article constructs the exploration vehicle model and improves the traditional DFS algorithm. Changing its backtracking strategy based on the original algorithm and introducing a node cost function to linearly constrain the number of turns of the exploration vehicle. Through simulation experiments, the improved DFS algorithm can efficiently complete the full-coverage exploration task for pipeline exploration sites and compared with some classical algorithms, the improved algorithm has a significant reduction in the map traversal repetition rate, and also shows obvious advantages in solving the full-coverage path planning problem in complex environments, which can complete the related work more efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信