Path planning of underwater swarm robots using genetic algorithm

Marck P. Vicmudo, E. Dadios, R. R. Vicerra
{"title":"Path planning of underwater swarm robots using genetic algorithm","authors":"Marck P. Vicmudo, E. Dadios, R. R. Vicerra","doi":"10.1109/HNICEM.2014.7016261","DOIUrl":null,"url":null,"abstract":"Path planning is one of the most exciting challenges in building autonomous swarm robots. It consists on finding a route from the origin of the robot to its target destination. It becomes more difficult when some obstacles are added to the environment. This paper consists of multiple obstacles: the robots and their possible path. This paper will present the path planning of underwater swarm robot based on genetic algorithm. Swarm robots will determine the position of pre-defined object and genetic algorithm generates shortest path for each robot to reach the object without collision to one another. The xyz coordinates of possible path of robot are randomly generated and they are encoded into chromosome and their fitness is defined by the summation of their displacement using Euclidian distance formula for 3-dimensional plane. The simulation results demonstrated that proposed algorithm is able to plan safe collision free paths for swarm robots. It also shown that using more population, the optimum path will be obtained. The implementation of genetic algorithm is done using computer simulation and explains the process in section two of this paper.","PeriodicalId":309548,"journal":{"name":"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2014-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Humanoid, Nanotechnology, Information Technology, Communication and Control, Environment and Management (HNICEM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HNICEM.2014.7016261","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Path planning is one of the most exciting challenges in building autonomous swarm robots. It consists on finding a route from the origin of the robot to its target destination. It becomes more difficult when some obstacles are added to the environment. This paper consists of multiple obstacles: the robots and their possible path. This paper will present the path planning of underwater swarm robot based on genetic algorithm. Swarm robots will determine the position of pre-defined object and genetic algorithm generates shortest path for each robot to reach the object without collision to one another. The xyz coordinates of possible path of robot are randomly generated and they are encoded into chromosome and their fitness is defined by the summation of their displacement using Euclidian distance formula for 3-dimensional plane. The simulation results demonstrated that proposed algorithm is able to plan safe collision free paths for swarm robots. It also shown that using more population, the optimum path will be obtained. The implementation of genetic algorithm is done using computer simulation and explains the process in section two of this paper.
基于遗传算法的水下群机器人路径规划
路径规划是构建自主群机器人最令人兴奋的挑战之一。它包括找到从机器人原点到目标目的地的路线。当环境中添加了一些障碍时,它变得更加困难。本文由多个障碍物组成:机器人和它们可能的路径。提出了一种基于遗传算法的水下群机器人路径规划方法。群体机器人将确定预定目标的位置,并通过遗传算法生成每个机器人到达目标的最短路径,而不会相互碰撞。随机生成机器人可能路径的xyz坐标,并将其编码到染色体中,利用三维平面的欧几里得距离公式将其位移之和定义其适应度。仿真结果表明,该算法能够为群机器人规划安全的无碰撞路径。结果表明,在种群数量较多的情况下,可以得到最优路径。本文第二节对遗传算法的实现进行了计算机仿真,并对实现过程进行了说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信