{"id":"https://openalex.org/W2014664943","doi":"https://doi.org/10.4304/jcp.7.2.470-474","title":"GA-based Global Path Planning for Mobile Robot Employing A* Algorithm","display_name":"GA-based Global Path Planning for Mobile Robot Employing A* Algorithm","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2014664943","doi":"https://doi.org/10.4304/jcp.7.2.470-474","mag":"2014664943"},"language":"en","primary_location":{"id":"doi:10.4304/jcp.7.2.470-474","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.7.2.470-474","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","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/A5065041546","display_name":"Cen Zeng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cen Zeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100381999","display_name":"Qiang Zhang","orcid":"https://orcid.org/0000-0003-3776-9799"},"institutions":[{"id":"https://openalex.org/I4210092944","display_name":"Dalian University","ror":"https://ror.org/00g2ypp58","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210092944"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiang Zhang","raw_affiliation_strings":["Dalian University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian University","institution_ids":["https://openalex.org/I4210092944"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003257736","display_name":"Xiaopeng Wei","orcid":"https://orcid.org/0000-0002-8497-611X"},"institutions":[{"id":"https://openalex.org/I4210092944","display_name":"Dalian University","ror":"https://ror.org/00g2ypp58","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210092944"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaopeng Wei","raw_affiliation_strings":["Dalian University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dalian University","institution_ids":["https://openalex.org/I4210092944"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.996,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.9210756,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"7","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9894000291824341,"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"}},{"id":"https://openalex.org/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9876000285148621,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.706524133682251},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7007434368133545},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5973984599113464},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5610407590866089},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36093902587890625},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3054298162460327},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09118270874023438}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.706524133682251},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7007434368133545},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5973984599113464},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5610407590866089},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36093902587890625},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3054298162460327},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09118270874023438}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jcp.7.2.470-474","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jcp.7.2.470-474","pdf_url":null,"source":{"id":"https://openalex.org/S77894049","display_name":"Journal of Computers","issn_l":"1796-203X","issn":["1796-203X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1490327735","https://openalex.org/W1535691782","https://openalex.org/W1638918000","https://openalex.org/W1809059965","https://openalex.org/W1827199899","https://openalex.org/W1904799423","https://openalex.org/W1957742077","https://openalex.org/W2019373186","https://openalex.org/W2022637272","https://openalex.org/W2024060531","https://openalex.org/W2051626883","https://openalex.org/W2101938656","https://openalex.org/W2114323019","https://openalex.org/W2120042273","https://openalex.org/W2123037532","https://openalex.org/W2138137463","https://openalex.org/W2141736308","https://openalex.org/W2153526431","https://openalex.org/W2158334497","https://openalex.org/W2161650191","https://openalex.org/W2353145982","https://openalex.org/W2368507093","https://openalex.org/W2904250082","https://openalex.org/W4298110920","https://openalex.org/W6636440504","https://openalex.org/W6638415272","https://openalex.org/W6639902923","https://openalex.org/W6708150950"],"related_works":["https://openalex.org/W2122871747","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W3114279067","https://openalex.org/W2161428574","https://openalex.org/W2618632915","https://openalex.org/W2077416514","https://openalex.org/W2359600231","https://openalex.org/W4292862729"],"abstract_inverted_index":{"Global":[0],"path":[1,54,104],"planning":[2],"for":[3,44],"mobile":[4,36,56,101],"robot":[5,102],"using":[6],"genetic":[7,69],"algorithm":[8,11,19,41,64,67,77,83],"and":[9,68,90,93],"A*":[10,66],"is":[12,27,42,58,96],"investigated":[13],"in":[14,84],"this":[15],"paper.":[16],"The":[17],"proposed":[18,76],"includes":[20],"three":[21],"steps:":[22],"the":[23,31,51,62,75],"MAKLINK":[24],"graph":[25],"theory":[26],"adopted":[28],"to":[29,100],"establish":[30],"free":[32],"space":[33],"model":[34],"of":[35,55,65,86],"robots":[37,57],"firstly,":[38],"then":[39],"Dijkstra":[40,82],"utilized":[43],"finding":[45],"a":[46,97],"feasible":[47],"collision-free":[48],"path,":[49],"finally":[50],"global":[52,103],"optimal":[53],"obtained":[59],"based":[60],"on":[61],"hybrid":[63],"algorithm.":[70],"Experimental":[71],"results":[72],"indicate":[73],"that":[74],"has":[78],"better":[79],"performance":[80],"than":[81],"term":[85],"both":[87],"solution":[88],"quality":[89],"computational":[91],"time,":[92],"thus":[94],"it":[95],"viable":[98],"approach":[99],"planning.":[105]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}