{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:28:37Z","timestamp":1777703317224,"version":"3.51.4"},"reference-count":25,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T00:00:00Z","timestamp":1444003200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2015,10,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In this paper, a generalized intelligent water drops algorithm (IWD) for solving robot path planning problem is proposed. The authors want to reduce the time of reaching the optimal solution as much as possible. To do this, some new heuristic operators and a multi section graph model of environment is introduced. The authors divide graph to equal sections and compare behaviour of the solutions (paths) in each section with behaviour of them in other sections. This comparison uses a fuzzy inference system. Base on this comparison, a fuzzy number is assigned to each part of solutions. This fuzzy number determines the worth of a solution in a section. Less worth solutions need more improvement. New heuristic operators are used in the sections that need more improvement. The runtime of algorithms are increased by using a memory for keep proper solutions and a global smooth operator that smooth the solutions. The authors used proposed memory to apply heuristic operations on proper solutions more than other one. This method helps to obtain more improvement in lower runtime. The authors introduce two intersection operators for robot path planning problem that apply to solutions in memory. Experimental results show that the proposed algorithms find the optimal solutions in fewer runtime rather than other works.<\/jats:p>","DOI":"10.3233\/ifs-151661","type":"journal-article","created":{"date-parts":[[2015,10,6]],"date-time":"2015-10-06T12:06:23Z","timestamp":1444133183000},"page":"975-986","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":5,"title":["Generalized intelligent Water Drops algorithm by fuzzy local search and intersection operators on partitioning graph for path planning problem"],"prefix":"10.1177","volume":"29","author":[{"given":"Hesamoddin","family":"Monfared","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soheila","family":"Salmanpour","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Tabari University of Babol, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2015,10,5]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2157493"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2011.03.006"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.5897\/IJPS11.1745"},{"key":"e_1_3_1_5_2","first-page":"3226","article-title":"Problem solving by intelligent water drops","author":"Shah-Hosseini H","year":"2007","unstructured":"Shah-HosseiniH2007Problem solving by intelligent water dropsEvolutionary Computation, IEEE Congress on IEEE32263231","journal-title":"Evolutionary Computation, IEEE Congress on IEEE"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbspro.2012.01.033"},{"issue":"1","key":"e_1_3_1_7_2","first-page":"101","article-title":"Classic and heuristic approaches in robot motion planning-a chronological review","volume":"29","author":"Masehian E","year":"2007","unstructured":"MasehianEDavoudS2007Classic and heuristic approaches in robot motion planning-a chronological reviewWorld Academy of Science, Engineering and Technology291101106","journal-title":"World Academy of Science, Engineering and Technology"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"e_1_3_1_11_2","first-page":"1652","article-title":"The focussed D* algorithm for real-time replanning","volume":"95","author":"Stentz A","year":"1995","unstructured":"StentzA1995The focussed D* algorithm for real-time replanningIJCAI9516521659","journal-title":"IJCAI"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2003.12.001"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2004.838026"},{"key":"e_1_3_1_14_2","first-page":"262","article-title":"Anytime dynamic A\u00a0*: An anytime, replanning algorithm","author":"Maxim L","year":"2005","unstructured":"MaximL2005Anytime dynamic A\u00a0*: An anytime, replanning algorithmICAPS262271","journal-title":"ICAPS"},{"key":"e_1_3_1_15_2","first-page":"239","article-title":"Field D*: An interpolation-based path planner and replanner","author":"Ferguson D","year":"2007","unstructured":"FergusonDStentzA2007Field D*: An interpolation-based path planner and replannerRobotics Research Springer Berlin Heidelberg239253","journal-title":"Robotics Research Springer Berlin Heidelberg"},{"key":"e_1_3_1_16_2","unstructured":"NashA2007Theta*: Any-Angle Path Planning on GridsProceedings of the National Conference on Artificial Intelligence2221177Menlo Park CA; Cambridge MA; LondonAAAI Press; MIT Press"},{"key":"e_1_3_1_17_2","first-page":"3808","article-title":"Beamlet-like data processing for accelerated path-planning using multiscale information of the environment","author":"Lu Y","year":"2010","unstructured":"LuYXiaomingHPanagiotisT2010Beamlet-like data processing for accelerated path-planning using multiscale information of the environmentDecision and Control (CDC), 2010 49th IEEE Conference on IEEE38083813","journal-title":"Decision and Control (CDC), 2010 49th IEEE Conference on IEEE"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2011.2157493"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2012.06.016"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4983204"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2009.02.014"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.proeng.2011.08.515"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-011-0682-7"},{"key":"e_1_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/s12293-012-0076-0"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.3233\/IFS-131118"},{"issue":"4","key":"e_1_3_1_26_2","first-page":"1","article-title":"Evolutionary approach for mobile robot path planning in complex environment","volume":"7","author":"Hosseinzadeh A","year":"2010","unstructured":"HosseinzadehAHabibI2010Evolutionary approach for mobile robot path planning in complex environmentIJCSI International Journal of Computer Science Issues7419","journal-title":"IJCSI International Journal of Computer Science Issues"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IFS-151661","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/IFS-151661","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/IFS-151661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:38:22Z","timestamp":1777455502000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/IFS-151661"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,5]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10,5]]}},"alternative-id":["10.3233\/IFS-151661"],"URL":"https:\/\/doi.org\/10.3233\/ifs-151661","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,5]]}}}