A study on path optimization of construction machinery by fusing ant colony optimization and artificial potential field

Gaomei Luo, Yang Shen
{"title":"A study on path optimization of construction machinery by fusing ant colony optimization and artificial potential field","authors":"Gaomei Luo,&nbsp;Yang Shen","doi":"10.1002/adc2.125","DOIUrl":null,"url":null,"abstract":"<p>With the progress of manufacturing capability and the requirements of modern project construction clustering and safety, unmanned technology has become a major development direction for construction machinery. The study analyzes the defects of the ACO applied to path planning, uses the basic ant colony method combined with the APF algorithm to construct comprehensive heuristic information to improve the efficiency of the initial iteration, and adds a pseudo-random proportional transfer rule to improve its transfer rule, in addition to proposing an optimal ant pheromone release rule to ensure that the pheromone update can effectively improve the effect of the later iteration. In the 20 × 20 raster map, the optimal path of both the basic and potential field ant colony algorithms is 31.52, while the basic ant colony algorithm does not converge to the optimal path after 200 iterations in the 30 × 30 raster map, and the comparison algorithm converges to the optimal path after 156 iterations, while the potential field ant colony algorithm converges to the optimal path after 25 iterations at 47.52. And the potential field ant colony The potential field ant colony algorithm converges to the optimal path of 47.52 after 25 iterations, and the number of turns in both raster maps of different sizes is only about 50% of the basic ant colony algorithm, which is also better than that of the comparison algorithm. The proposed algorithm improves the ability of the ant colony algorithm to explore and exploit raster maps, enhances its path planning capability, and improves the construction efficiency well in practical applications.</p>","PeriodicalId":100030,"journal":{"name":"Advanced Control for Applications","volume":"6 2","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2023-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/adc2.125","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advanced Control for Applications","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/adc2.125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the progress of manufacturing capability and the requirements of modern project construction clustering and safety, unmanned technology has become a major development direction for construction machinery. The study analyzes the defects of the ACO applied to path planning, uses the basic ant colony method combined with the APF algorithm to construct comprehensive heuristic information to improve the efficiency of the initial iteration, and adds a pseudo-random proportional transfer rule to improve its transfer rule, in addition to proposing an optimal ant pheromone release rule to ensure that the pheromone update can effectively improve the effect of the later iteration. In the 20 × 20 raster map, the optimal path of both the basic and potential field ant colony algorithms is 31.52, while the basic ant colony algorithm does not converge to the optimal path after 200 iterations in the 30 × 30 raster map, and the comparison algorithm converges to the optimal path after 156 iterations, while the potential field ant colony algorithm converges to the optimal path after 25 iterations at 47.52. And the potential field ant colony The potential field ant colony algorithm converges to the optimal path of 47.52 after 25 iterations, and the number of turns in both raster maps of different sizes is only about 50% of the basic ant colony algorithm, which is also better than that of the comparison algorithm. The proposed algorithm improves the ability of the ant colony algorithm to explore and exploit raster maps, enhances its path planning capability, and improves the construction efficiency well in practical applications.

Abstract Image

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
融合蚁群优化和人工势场的工程机械路径优化研究
随着制造能力的进步和现代工程建设集群化、安全化的要求,无人驾驶技术已成为工程机械的主要发展方向。该研究分析了ACO应用于路径规划的缺陷,利用基本蚁群方法结合APF算法构建综合启发式信息,提高初始迭代效率,并加入伪随机比例转移规则完善其转移规则,此外还提出了最优蚂蚁信息素释放规则,确保信息素更新能有效提高后期迭代效果。在20×20栅格图中,基本蚁群算法和潜在田野蚁群算法的最优路径均为31.52,而在30×30栅格图中,基本蚁群算法在迭代200次后没有收敛到最优路径,比较算法在迭代156次后收敛到最优路径,而潜在田野蚁群算法在迭代25次后收敛到最优路径,为47.52。而势场蚁群算法经过 25 次迭代后收敛到最优路径的次数为 47.52 次,在两种不同大小的栅格地图中的转弯次数仅为基本蚁群算法的 50%左右,也优于对比算法。所提出的算法提高了蚁群算法探索和利用栅格地图的能力,增强了其路径规划能力,在实际应用中很好地提高了构建效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.60
自引率
0.00%
发文量
0
期刊最新文献
Issue Information Efficient parameter estimation for second order plus dead time systems in process plant control Optimal installation of DG in radial distribution network using arithmetic optimization algorithm To cascade feedback loops, or not? A novel modulation for four-switch Buck-boost converter to eliminate the right half plane zero point
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1