An intelligent water drops algorithm for solving robot path planning problem

Soheila Salmanpour, H. Omranpour, H. Motameni
{"title":"An intelligent water drops algorithm for solving robot path planning problem","authors":"Soheila Salmanpour, H. Omranpour, H. Motameni","doi":"10.1109/CINTI.2013.6705216","DOIUrl":null,"url":null,"abstract":"In this paper, generalized intelligent water drops (IWD) algorithm is proposed to solve robot path planning problem. The proposed algorithm has two levels; first level, finds best global path. Second level, performs local search at relatively near distances of global path and reduces its length and response time. IWD algorithm, like other nature-inspired algorithms, has not a mechanism to deal with constrained optimization problem. So, a mechanism has been proposed based on repair of infeasible solutions. In this mechanism, proposed local search operator repairs some of infeasible solutions. Simulation result shows ability of IWD algorithm in finding the optimal path.","PeriodicalId":439949,"journal":{"name":"2013 IEEE 14th International Symposium on Computational Intelligence and Informatics (CINTI)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 14th International Symposium on Computational Intelligence and Informatics (CINTI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CINTI.2013.6705216","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

In this paper, generalized intelligent water drops (IWD) algorithm is proposed to solve robot path planning problem. The proposed algorithm has two levels; first level, finds best global path. Second level, performs local search at relatively near distances of global path and reduces its length and response time. IWD algorithm, like other nature-inspired algorithms, has not a mechanism to deal with constrained optimization problem. So, a mechanism has been proposed based on repair of infeasible solutions. In this mechanism, proposed local search operator repairs some of infeasible solutions. Simulation result shows ability of IWD algorithm in finding the optimal path.
求解机器人路径规划问题的智能水滴算法
针对机器人路径规划问题,提出了广义智能水滴(IWD)算法。该算法有两个层次;第一层,找到最佳全局路径。第二层是在全局路径相对较近的距离上进行局部搜索,减少全局路径的长度和响应时间。与其他受自然启发的算法一样,IWD算法没有处理约束优化问题的机制。因此,提出了一种基于不可行解修复的机制。在该机制中,提出的局部搜索算子修复了一些不可行的解。仿真结果表明了该算法在寻找最优路径方面的能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信