{"id":"https://openalex.org/W4399774182","doi":"https://doi.org/10.3233/jcm-247133","title":"An improved genetic algorithm for robot path planning","display_name":"An improved genetic algorithm for robot path planning","publication_year":2024,"publication_date":"2024-06-17","ids":{"openalex":"https://openalex.org/W4399774182","doi":"https://doi.org/10.3233/jcm-247133"},"language":"en","primary_location":{"id":"doi:10.3233/jcm-247133","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcm-247133","pdf_url":null,"source":{"id":"https://openalex.org/S2765058733","display_name":"Journal of Computational Methods in Sciences and Engineering","issn_l":"1472-7978","issn":["1472-7978","1875-8983"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Methods in Sciences and Engineering","raw_type":"journal-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/A5101917779","display_name":"Zhifeng Yao","orcid":"https://orcid.org/0000-0003-2509-3859"},"institutions":[{"id":"https://openalex.org/I111971639","display_name":"Qiqihar University","ror":"https://ror.org/01khf5d59","country_code":"CN","type":"education","lineage":["https://openalex.org/I111971639"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Zhifeng Yao","raw_affiliation_strings":["School of Mechanical and Electronic Engineering, Qiqihar University, Qiqihar, Heilongjiang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Electronic Engineering, Qiqihar University, Qiqihar, Heilongjiang, China","institution_ids":["https://openalex.org/I111971639"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100573971","display_name":"Ye Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I111971639","display_name":"Qiqihar University","ror":"https://ror.org/01khf5d59","country_code":"CN","type":"education","lineage":["https://openalex.org/I111971639"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ye Xu","raw_affiliation_strings":["School of Mechanical and Electronic Engineering, Qiqihar University, Qiqihar, Heilongjiang, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Electronic Engineering, Qiqihar University, Qiqihar, Heilongjiang, China","institution_ids":["https://openalex.org/I111971639"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101917779"],"corresponding_institution_ids":["https://openalex.org/I111971639"],"apc_list":null,"apc_paid":null,"fwci":1.0829,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77760325,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"24","issue":"3","first_page":"1331","last_page":"1340"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9944000244140625,"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/computer-science","display_name":"Computer science","score":0.7150751352310181},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6204958558082581},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.60814368724823},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6033198833465576},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4157978594303131},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39855068922042847},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37021225690841675},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.14791938662528992},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.10942870378494263}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7150751352310181},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6204958558082581},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.60814368724823},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6033198833465576},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4157978594303131},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39855068922042847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37021225690841675},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.14791938662528992},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.10942870378494263}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.3233/jcm-247133","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcm-247133","pdf_url":null,"source":{"id":"https://openalex.org/S2765058733","display_name":"Journal of Computational Methods in Sciences and Engineering","issn_l":"1472-7978","issn":["1472-7978","1875-8983"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computational Methods in Sciences and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1969670211","https://openalex.org/W2558150887","https://openalex.org/W2746418572","https://openalex.org/W2766102233","https://openalex.org/W2887439418","https://openalex.org/W2894163687","https://openalex.org/W2952804260","https://openalex.org/W2969086206","https://openalex.org/W2987662691","https://openalex.org/W3101149728","https://openalex.org/W3134856403","https://openalex.org/W3162258544","https://openalex.org/W3197335971","https://openalex.org/W4200420783","https://openalex.org/W4200572892","https://openalex.org/W4220802429","https://openalex.org/W4285126229","https://openalex.org/W6754203390","https://openalex.org/W6764366470","https://openalex.org/W6770176259"],"related_works":["https://openalex.org/W4289260319","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W2153702122","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W3154539612"],"abstract_inverted_index":{"The":[0,95],"conventional":[1],"genetic":[2],"algorithm":[3,40,51,97],"(GA)":[4],"for":[5],"path":[6,108],"planning":[7],"exists":[8],"several":[9],"drawbacks,":[10],"such":[11],"as":[12],"uncertainty":[13],"in":[14],"the":[15,73,89,93,101],"direction":[16],"of":[17,45,75,92],"robot":[18],"movement,":[19],"circuitous":[20],"routes,":[21],"low":[22],"convergence":[23],"rates,":[24],"and":[25,47,61,80,110],"prolonged":[26],"search":[27,86,112],"time.":[28],"To":[29],"solve":[30],"these":[31],"problems,":[32],"this":[33],"study":[34],"introduces":[35],"an":[36],"improved":[37],"GA-based":[38],"path-planning":[39],"that":[41,57],"adopts":[42],"adaptive":[43,67],"regulation":[44],"crossover":[46,79],"mutation":[48],"probabilities.":[49],"This":[50],"uses":[52],"a":[53,84],"hybrid":[54],"selection":[55,64],"strategy":[56],"merges":[58],"elite,":[59],"tournament,":[60],"roulette":[62],"wheel":[63],"methods.":[65],"An":[66],"approach":[68],"is":[69],"implemented":[70],"to":[71],"control":[72],"speed":[74],"population":[76],"evolution":[77],"through":[78,104],"mutation.":[81],"Combining":[82],"with":[83,100],"local":[85],"operation":[87],"enhances":[88],"optimization":[90],"capability":[91],"algorithm.":[94],"proposed":[96],"was":[98],"compared":[99],"traditional":[102],"GA":[103],"simulations,":[105],"demonstrating":[106],"shorter":[107],"lengths":[109],"reduced":[111],"times.":[113]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-15T08:34:33.830935","created_date":"2025-10-10T00:00:00"}