{"id":"https://openalex.org/W2028341538","doi":"https://doi.org/10.1109/meco.2013.6601347","title":"Harmony search based algorithm for mobile robot global path planning","display_name":"Harmony search based algorithm for mobile robot global path planning","publication_year":2013,"publication_date":"2013-06-01","ids":{"openalex":"https://openalex.org/W2028341538","doi":"https://doi.org/10.1109/meco.2013.6601347","mag":"2028341538"},"language":"en","primary_location":{"id":"doi:10.1109/meco.2013.6601347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco.2013.6601347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 2nd Mediterranean Conference on Embedded Computing (MECO)","raw_type":"proceedings-article"},"type":"article","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/A5076282067","display_name":"Stojanche Panov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210161475","display_name":"Goce Delcev University","ror":"https://ror.org/058q1cn43","country_code":"MK","type":"education","lineage":["https://openalex.org/I4210161475"]}],"countries":["MK"],"is_corresponding":true,"raw_author_name":"Stojanche Panov","raw_affiliation_strings":["Faculty of Computer Science, Goce Delchev University, Stip, Macedonia","Fac. of Comput. Sci., Goce Delchev Univ., Stip, Macedonia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Goce Delchev University, Stip, Macedonia","institution_ids":["https://openalex.org/I4210161475"]},{"raw_affiliation_string":"Fac. of Comput. Sci., Goce Delchev Univ., Stip, Macedonia","institution_ids":["https://openalex.org/I4210161475"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091768600","display_name":"Sa\u0161o Koceski","orcid":"https://orcid.org/0000-0002-5513-1898"},"institutions":[{"id":"https://openalex.org/I4210161475","display_name":"Goce Delcev University","ror":"https://ror.org/058q1cn43","country_code":"MK","type":"education","lineage":["https://openalex.org/I4210161475"]}],"countries":["MK"],"is_corresponding":false,"raw_author_name":"Saso Koceski","raw_affiliation_strings":["Faculty of Computer Science, Goce Delchev University, Stip, Macedonia","Fac. of Comput. Sci., Goce Delchev Univ., Stip, Macedonia"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, Goce Delchev University, Stip, Macedonia","institution_ids":["https://openalex.org/I4210161475"]},{"raw_affiliation_string":"Fac. of Comput. Sci., Goce Delchev Univ., Stip, Macedonia","institution_ids":["https://openalex.org/I4210161475"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076282067"],"corresponding_institution_ids":["https://openalex.org/I4210161475"],"apc_list":null,"apc_paid":null,"fwci":0.5443,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6976863,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"31","issue":null,"first_page":"168","last_page":"171"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/harmony-search","display_name":"Harmony search","score":0.9234300851821899},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6818323135375977},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6247765421867371},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.617153525352478},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5619732141494751},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4955340623855591},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.44697535037994385},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.44697463512420654},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.43151891231536865},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42120909690856934},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.4104892611503601},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.40784692764282227},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36893266439437866},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.324169397354126}],"concepts":[{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.9234300851821899},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6818323135375977},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6247765421867371},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.617153525352478},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5619732141494751},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4955340623855591},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.44697535037994385},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.44697463512420654},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.43151891231536865},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42120909690856934},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.4104892611503601},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.40784692764282227},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36893266439437866},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.324169397354126},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/meco.2013.6601347","is_oa":false,"landing_page_url":"https://doi.org/10.1109/meco.2013.6601347","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 2nd Mediterranean Conference on Embedded Computing (MECO)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.ugd.edu.mk:8761","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306402353","display_name":"Goce Delchev University Repository (Goce Del\u010dev University of \u0160tip)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210161475","host_organization_name":"Goce Delcev University","host_organization_lineage":["https://openalex.org/I4210161475"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6100000143051147,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W62328324","https://openalex.org/W1573676079","https://openalex.org/W1982237321","https://openalex.org/W1985574982","https://openalex.org/W1992106482","https://openalex.org/W1994164464","https://openalex.org/W2017950320","https://openalex.org/W2066928512","https://openalex.org/W2084474153","https://openalex.org/W2098437763","https://openalex.org/W2124668458","https://openalex.org/W2132985387","https://openalex.org/W2140996842","https://openalex.org/W2142055760","https://openalex.org/W2152195021","https://openalex.org/W2168309003","https://openalex.org/W2170431305","https://openalex.org/W2378836004","https://openalex.org/W2394367122","https://openalex.org/W2543580944","https://openalex.org/W2914275007","https://openalex.org/W2977684190","https://openalex.org/W4292083457","https://openalex.org/W6602521272","https://openalex.org/W6671630449","https://openalex.org/W6678623197","https://openalex.org/W6681222522","https://openalex.org/W6804185732"],"related_works":["https://openalex.org/W1496413023","https://openalex.org/W4307526247","https://openalex.org/W4200518988","https://openalex.org/W2368795992","https://openalex.org/W2394276631","https://openalex.org/W3216096898","https://openalex.org/W4308080200","https://openalex.org/W2908094156","https://openalex.org/W2389896347","https://openalex.org/W4395071568"],"abstract_inverted_index":{"The":[0,76,93],"global":[1],"path":[2],"planning":[3],"problem":[4,9,17,25],"is":[5,99],"very":[6],"challenging":[7],"NP-complete":[8,16],"in":[10,30,101],"the":[11,108,121],"domain":[12],"of":[13,24,90,103,107],"robotics.":[14],"An":[15],"would":[18],"be":[19,28],"explained":[20],"as":[21],"a":[22,59],"type":[23],"that":[26,97],"can't":[27],"solved":[29],"real-time":[31],"by":[32],"using":[33],"na\u00efve":[34],"deterministic":[35],"techniques.":[36],"Many":[37],"metaheuristic":[38,114],"approaches":[39],"have":[40,95],"been":[41,80],"developed":[42,77],"up":[43],"to":[44,46,51,111,118],"date,":[45],"provide":[47],"an":[48],"optimal":[49,122],"solution":[50,109],"this":[52,55],"problem.":[53],"In":[54],"work":[56],"we":[57],"present":[58],"novel":[60],"Quad-Harmony":[61],"Search":[62,74],"(QHS)":[63],"algorithm":[64,78],"based":[65,85],"on":[66,82],"Quad-tree":[67],"free":[68],"space":[69],"decomposition":[70],"methodology":[71],"and":[72,105,116],"Harmony":[73],"optimization.":[75],"has":[79],"evaluated":[81],"various":[83],"grid":[84],"environments":[86],"with":[87],"different":[88],"percentage":[89],"obstacle":[91],"coverage.":[92],"results":[94],"demonstrated":[96],"it":[98],"superior":[100],"terms":[102],"time":[104],"optimality":[106],"compared":[110],"other":[112],"known":[113],"algorithms":[115],"promised":[117],"always":[119],"find":[120],"solution.":[123]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}