Application of Improved Butterfly Optimization Algorithm in Mobile Robot Path Planning

运动规划 最短路径问题 人口 数学优化 计算机科学 延氏算法 移动机器人 约束最短路径优先 网格参考 路径(计算) 算法 K最短路径路由 机器人 数学 人工智能 Dijkstra算法 理论计算机科学 图形 人口学 社会学 程序设计语言
作者
Rongjie Zhai,Ping Xiao,Da Shu,Y Sun,Min Jiang
出处
期刊:Electronics [MDPI AG]
卷期号:12 (16): 3424-3424
标识
DOI:10.3390/electronics12163424
摘要

An improved butterfly optimization algorithm (IBOA) is proposed to overcome the disadvantages, including slow convergence, generation of local optimum solutions, and deadlock phenomenon, of the optimization algorithm in the path planning of mobile robots. A path-planning grid model is established based on an improved obstacle model. First, the population diversity is improved by introducing kent mapping during population position renewal in the normal butterfly optimization algorithm (BOA) to enhance the global search ability of the butterfly population. Second, an adaptive weight coefficient is introduced in the renewal process of each generation to increase the convergence speed and accuracy. An opposition-based learning strategy based on convex lens imaging is introduced to help the butterfly population jump out of the local optimum. Finally, a mutation strategy is introduced to solve the path planning problem. On this basis, two path simplification strategies are proposed to make up for the shortcomings of planning paths in grid maps. The shortest path lengths solved by IBOA, BOA, and GA in the 20 × 20 map are 30.97, 31.799, and 31.799, respectively. The numbers of iterations for the shortest paths searched by IBOA, BOA, and GA are 14, 24, and 38 in that order. The shortest path lengths solved by IBOA, BOA and GA in the 40 × 40 map are 63.84, 65.60, and 65.84, respectively. The number of iterations for the shortest paths searched by IBOA, BOA and GA are 32, 40, and 46, respectively. Simulation results show that IBOA has a strong ability to solve robot path planning problems and that the proposed path simplification strategy can effectively reduce the length of the optimal path in the grid map to solve the path planning problem of mobile robots. The shortest paths solved by IBOA in 20 × 20 and 40 × 40 maps are simplified to lengths of 30.2914 and 61.03, respectively.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
4秒前
搜集达人应助浅音采纳,获得10
5秒前
5秒前
7秒前
kiterunner完成签到,获得积分10
8秒前
老迟到的凌青完成签到,获得积分10
8秒前
陆驳发布了新的文献求助10
9秒前
答案发布了新的文献求助10
10秒前
evilbatuu发布了新的文献求助20
10秒前
12秒前
mint-WANG完成签到,获得积分10
12秒前
Justtry发布了新的文献求助10
14秒前
鳗鱼发布了新的文献求助20
15秒前
小潘同学完成签到,获得积分10
16秒前
17秒前
飘逸依柔关注了科研通微信公众号
19秒前
20秒前
完美世界应助ysta采纳,获得10
21秒前
22秒前
xxy完成签到,获得积分20
23秒前
爆米花应助Kevin Li采纳,获得30
24秒前
思恩Shen发布了新的文献求助10
26秒前
26秒前
evilbatuu发布了新的文献求助20
26秒前
拼搏的勒完成签到 ,获得积分10
26秒前
27秒前
liie发布了新的文献求助10
27秒前
orixero应助余小胖采纳,获得30
29秒前
xxy发布了新的文献求助30
30秒前
瘦瘦芸发布了新的文献求助10
30秒前
祖乐松发布了新的文献求助30
30秒前
赘婿应助的虔采纳,获得10
31秒前
搜集达人应助长孙归尘采纳,获得10
31秒前
阿大呆呆应助李小明采纳,获得30
32秒前
32秒前
τ涛发布了新的文献求助10
34秒前
34秒前
小准完成签到,获得积分10
36秒前
充电宝应助话家采纳,获得10
37秒前
高分求助中
One Man Talking: Selected Essays of Shao Xunmei, 1929–1939 1000
Yuwu Song, Biographical Dictionary of the People's Republic of China 700
[Lambert-Eaton syndrome without calcium channel autoantibodies] 520
Sphäroguß als Werkstoff für Behälter zur Beförderung, Zwischen- und Endlagerung radioaktiver Stoffe - Untersuchung zu alternativen Eignungsnachweisen: Zusammenfassender Abschlußbericht 500
少脉山油柑叶的化学成分研究 430
Revolutions 400
MUL.APIN: An Astronomical Compendium in Cuneiform 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2454319
求助须知:如何正确求助?哪些是违规求助? 2126130
关于积分的说明 5414758
捐赠科研通 1854787
什么是DOI,文献DOI怎么找? 922484
版权声明 562340
科研通“疑难数据库(出版商)”最低求助积分说明 493566