Ground Robot Path Planning Based on Simulated Annealing Genetic Algorithm

Lanfei Wang, Jun Guo, Qu Wang (王曲), Jiangming Kan
{"title":"Ground Robot Path Planning Based on Simulated Annealing Genetic Algorithm","authors":"Lanfei Wang, Jun Guo, Qu Wang (王曲), Jiangming Kan","doi":"10.1109/CYBERC.2018.00081","DOIUrl":null,"url":null,"abstract":"Robot path planning is the key to robot navigation. We implemented the robot path planning based on ant colony algorithm and genetic algorithm, and proposed simulated annealing genetic algorithm. Under the condition that there is not much difference in running time (within 3 seconds), planning results of different terrains, start and end points based on ant colony algorithm(with 200 iterations)and simulated annealing genetic algorithm show that, the optimal path outputted by simulated annealing genetic algorithm is better than the optimal path outputted by ant colony algorithm in terms of avoiding obstacles; The simulated annealing genetic algorithm has shorter average optimal path length than ant colony algorithm in multiple tests, the average path length is reduced by 6.85%.","PeriodicalId":282903,"journal":{"name":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CYBERC.2018.00081","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Robot path planning is the key to robot navigation. We implemented the robot path planning based on ant colony algorithm and genetic algorithm, and proposed simulated annealing genetic algorithm. Under the condition that there is not much difference in running time (within 3 seconds), planning results of different terrains, start and end points based on ant colony algorithm(with 200 iterations)and simulated annealing genetic algorithm show that, the optimal path outputted by simulated annealing genetic algorithm is better than the optimal path outputted by ant colony algorithm in terms of avoiding obstacles; The simulated annealing genetic algorithm has shorter average optimal path length than ant colony algorithm in multiple tests, the average path length is reduced by 6.85%.
基于模拟退火遗传算法的地面机器人路径规划
机器人路径规划是机器人导航的关键。基于蚁群算法和遗传算法实现了机器人路径规划,提出了模拟退火遗传算法。在运行时间相差不大(3秒以内)的情况下,基于蚁群算法(200次迭代)和模拟退火遗传算法对不同地形、起止点的规划结果表明,模拟退火遗传算法输出的最优路径在避障方面优于蚁群算法输出的最优路径;在多次测试中,模拟退火遗传算法的平均最优路径长度比蚁群算法短,平均路径长度减少6.85%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信