{"id":"https://openalex.org/W2936092336","doi":"https://doi.org/10.1109/ecai.2018.8679051","title":"Water Cycle Algorithm for Robot Path Planning","display_name":"Water Cycle Algorithm for Robot Path Planning","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2936092336","doi":"https://doi.org/10.1109/ecai.2018.8679051","mag":"2936092336"},"language":"en","primary_location":{"id":"doi:10.1109/ecai.2018.8679051","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecai.2018.8679051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 10th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050579174","display_name":"Eva Tuba","orcid":"https://orcid.org/0000-0003-4866-9048"},"institutions":[{"id":"https://openalex.org/I170253739","display_name":"Singidunum University","ror":"https://ror.org/017v7rz39","country_code":"RS","type":"education","lineage":["https://openalex.org/I170253739"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Eva Tuba","raw_affiliation_strings":["Faculty of Informatics and Computing, Singidunum University, Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Informatics and Computing, Singidunum University, Belgrade, Serbia","institution_ids":["https://openalex.org/I170253739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014487485","display_name":"Edin Doli\u0107anin","orcid":null},"institutions":[{"id":"https://openalex.org/I207056914","display_name":"State University of Novi Pazar","ror":"https://ror.org/00ggq9r86","country_code":"RS","type":"education","lineage":["https://openalex.org/I207056914"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Edin Dolicanin","raw_affiliation_strings":["Department of Technical Sciences, State University of Novi Pazar, Novi Pazar, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Technical Sciences, State University of Novi Pazar, Novi Pazar, Serbia","institution_ids":["https://openalex.org/I207056914"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067245090","display_name":"Milan Tuba","orcid":"https://orcid.org/0000-0003-3794-3056"},"institutions":[{"id":"https://openalex.org/I170253739","display_name":"Singidunum University","ror":"https://ror.org/017v7rz39","country_code":"RS","type":"education","lineage":["https://openalex.org/I170253739"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Milan Tuba","raw_affiliation_strings":["Faculty of Informatics and Computing, Singidunum University, Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Informatics and Computing, Singidunum University, Belgrade, Serbia","institution_ids":["https://openalex.org/I170253739"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.984000027179718,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8511375784873962},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6973940134048462},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.658850371837616},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.6274624466896057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6202218532562256},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5842206478118896},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5006406307220459},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.482867032289505},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.48109835386276245},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.47512704133987427},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.4592466354370117},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4235534965991974},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4061344563961029},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2145232856273651},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1833210587501526},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.16655954718589783},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07881167531013489}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8511375784873962},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6973940134048462},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.658850371837616},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.6274624466896057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6202218532562256},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5842206478118896},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5006406307220459},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.482867032289505},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.48109835386276245},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.47512704133987427},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4592466354370117},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4235534965991974},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4061344563961029},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2145232856273651},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1833210587501526},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.16655954718589783},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07881167531013489},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ecai.2018.8679051","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecai.2018.8679051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 10th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/6","display_name":"Clean water and sanitation","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W137929096","https://openalex.org/W1523741643","https://openalex.org/W1535723536","https://openalex.org/W1777985119","https://openalex.org/W2073117529","https://openalex.org/W2075488806","https://openalex.org/W2096673585","https://openalex.org/W2114947023","https://openalex.org/W2150923807","https://openalex.org/W2162327234","https://openalex.org/W2170400052","https://openalex.org/W2175593282","https://openalex.org/W2336145052","https://openalex.org/W2345227437","https://openalex.org/W2402907396","https://openalex.org/W2411820260","https://openalex.org/W2417637069","https://openalex.org/W2440044738","https://openalex.org/W2500791560","https://openalex.org/W2510642710","https://openalex.org/W2558059637","https://openalex.org/W2563442283","https://openalex.org/W2571268510","https://openalex.org/W2607631091","https://openalex.org/W2609031355","https://openalex.org/W2615589554","https://openalex.org/W2620563979","https://openalex.org/W2735541649","https://openalex.org/W2761828842","https://openalex.org/W2771523178","https://openalex.org/W2781235574","https://openalex.org/W2784307518","https://openalex.org/W2792795540","https://openalex.org/W2795636552","https://openalex.org/W2796335625","https://openalex.org/W2888567463","https://openalex.org/W2927356562","https://openalex.org/W2963103847","https://openalex.org/W3081504217","https://openalex.org/W4235301680","https://openalex.org/W6674854391","https://openalex.org/W6712905487","https://openalex.org/W6718037465","https://openalex.org/W6747548282","https://openalex.org/W6760858107","https://openalex.org/W6782497632"],"related_works":["https://openalex.org/W4400246438","https://openalex.org/W2576812951","https://openalex.org/W2368795992","https://openalex.org/W2908094156","https://openalex.org/W2990979393","https://openalex.org/W2966249567","https://openalex.org/W4308080200","https://openalex.org/W1997369033","https://openalex.org/W2914610299","https://openalex.org/W4210716962"],"abstract_inverted_index":{"Path":[0,40],"planning":[1,41],"problem":[2],"is":[3],"one":[4],"of":[5],"the":[6,15,19,62,85],"fundamental":[7],"problems":[8],"in":[9,67],"robotics.":[10],"It":[11],"refers":[12],"to":[13,33,78,98],"finding":[14,61],"optimal":[16],"path":[17,66],"between":[18],"start":[20],"and":[21,30,76],"target":[22],"positions,":[23],"where":[24],"optimality":[25],"depends":[26],"on":[27],"various":[28],"factors":[29],"it":[31],"needs":[32],"be":[34,43],"defined":[35],"considering":[36],"all":[37],"relevant":[38],"demands.":[39],"can":[42],"described":[44],"as":[45],"a":[46,92],"hard":[47],"optimization":[48],"problem.":[49],"In":[50],"this":[51],"paper,":[52],"we":[53],"used":[54],"swarm":[55],"intelligence":[56],"water":[57],"cycle":[58],"algorithm":[59],"for":[60],"shortest":[63],"collision":[64],"free":[65],"two":[68],"dimensional":[69],"environments.":[70],"The":[71],"proposed":[72,89],"method":[73,81,94],"was":[74,96],"tested":[75],"compared":[77],"other":[79],"state-of-the-art":[80],"from":[82],"literature.":[83],"Considering":[84],"simulation":[86],"results,":[87],"our":[88],"approach":[90],"represents":[91],"robust":[93],"that":[95],"able":[97],"find":[99],"better":[100],"paths.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}