{"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.