{"id":"https://openalex.org/W3018835260","doi":"https://doi.org/10.1109/iciase45644.2019.9074113","title":"Obstacle Avoidance Path Planning Based on Target Heuristic and Repair Genetic Algorithms","display_name":"Obstacle Avoidance Path Planning Based on Target Heuristic and Repair Genetic Algorithms","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W3018835260","doi":"https://doi.org/10.1109/iciase45644.2019.9074113","mag":"3018835260"},"language":"en","primary_location":{"id":"doi:10.1109/iciase45644.2019.9074113","doi":"https://doi.org/10.1109/iciase45644.2019.9074113","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iciase45644.2019.9074113","pdf_url":null,"source":{"id":"https://openalex.org/S7407107705","display_name":"IEEE International Conference of Intelligent Applied Systems on Engineering (ICIASE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference of Intelligent Applied Systems on Engineering (ICIASE)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5103994811","display_name":"Luo Jun-Qi","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210105374","display_name":"Beibu Gulf University","ror":"https://ror.org/01dq3qq95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210105374"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luo Jun-Qi","raw_affiliation_strings":["Department of School of Electric and Information Engineering, Beibu Gulf University, Guangxi, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of School of Electric and Information Engineering, Beibu Gulf University, Guangxi, China","institution_ids":["https://openalex.org/I4210105374"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004639055","display_name":"Wei Chien","orcid":"https://orcid.org/0000-0003-0878-7242","observed_orcids":["https://orcid.org/0000-0003-0878-7242"]},"institutions":[{"id":"https://openalex.org/I4210105374","display_name":"Beibu Gulf University","ror":"https://ror.org/01dq3qq95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210105374"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wei Chien","raw_affiliation_strings":["Department of School of Electric and Information Engineering, Beibu Gulf University, Guangxi, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of School of Electric and Information Engineering, Beibu Gulf University, Guangxi, China","institution_ids":["https://openalex.org/I4210105374"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210105374"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"11","issue":null,"first_page":"44","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0010000000474974513,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0,"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/obstacle-avoidance","display_name":"obstacle avoidance","score":0.878000020980835},{"id":"https://openalex.org/keywords/path-planning","display_name":"path planning","score":0.9179999828338623},{"id":"https://openalex.org/keywords/mobile-robot-navigation","display_name":"mobile robot navigation","score":0.7609999775886536},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.824999988079071},{"id":"https://openalex.org/keywords/repair-operator","display_name":"repair operator","score":0.8989999890327454},{"id":"https://openalex.org/keywords/initial-population-generation","display_name":"initial population generation","score":0.8980000019073486}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7633619904518127},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7090948820114136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6863279342651367},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6572331786155701},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6169326305389404},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.6100919246673584},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6002469062805176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5779920816421509},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5615411996841431},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.53022700548172},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.504852831363678},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4873729348182678},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4511623978614807},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4302602708339691},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3123149275779724},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26478683948516846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.180970698595047},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.16040074825286865},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13248398900032043},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"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/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","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/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iciase45644.2019.9074113","doi":"https://doi.org/10.1109/iciase45644.2019.9074113","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iciase45644.2019.9074113","pdf_url":null,"source":{"id":"https://openalex.org/S7407107705","display_name":"IEEE International Conference of Intelligent Applied Systems on Engineering (ICIASE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference of Intelligent Applied Systems on Engineering (ICIASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1853097234","https://openalex.org/W2025045797","https://openalex.org/W2075800961","https://openalex.org/W2134634502","https://openalex.org/W2155293443","https://openalex.org/W2170431305","https://openalex.org/W2390262015","https://openalex.org/W2482362711"],"related_works":["https://openalex.org/W2117463424","https://openalex.org/W2005888650","https://openalex.org/W2375304287","https://openalex.org/W2025045797","https://openalex.org/W2883132160","https://openalex.org/W2367135232","https://openalex.org/W2153353727","https://openalex.org/W2170431305","https://openalex.org/W2892046370","https://openalex.org/W2386935323"],"abstract_inverted_index":{"Using":[0],"genetic":[1],"algorithm":[2],"(GA)":[3],"to":[4,37,86],"optimize":[5],"the":[6,12,61,65,69,82,88,102,107,113,118,121,128,145],"mobile":[7],"robot":[8],"path":[9,91],"planning":[10],"has":[11],"disadvantages":[13],"of":[14,64,120,134],"low":[15,21],"initial":[16,22,114,122],"population":[17,23,115,123],"generation":[18],"efficiency":[19],"and":[20,29,49,68,84,116,136],"quality,":[24],"especially":[25],"under":[26],"large":[27],"size":[28],"complex":[30],"environment":[31],"model":[32],"in":[33,55,92],"grids.":[34,75],"In":[35,58],"order":[36],"overcome":[38],"this":[39,56,59],"problem,":[40],"a":[41,45,50,93,131,138],"novel":[42],"methodology":[43,103],"contains":[44],"target":[46],"heuristic":[47],"operator":[48,52],"reparation":[51],"is":[53],"proposed":[54,129],"paper.":[57],"study,":[60],"maps":[62],"consist":[63],"obstacles":[66],"areas":[67,71],"feasible":[70],"are":[72,79],"decomposed":[73],"by":[74],"These":[76],"two":[77],"operators":[78],"integrated":[80],"into":[81],"GA":[83],"applied":[85],"acquire":[87],"collision-free":[89],"shortest":[90],"static":[94],"two-dimension":[95],"environment.":[96],"The":[97],"experimental":[98],"data":[99],"show":[100],"that":[101,127],"can":[104],"decrease":[105],"significantly":[106],"random":[108],"search":[109],"time":[110,135],"for":[111],"generating":[112],"improve":[117],"quality":[119],"generation.":[124],"Results":[125],"suggested":[126],"requires":[130],"shorter":[132],"amount":[133],"possesses":[137],"better":[139],"global":[140],"searching":[141],"performance,":[142],"compared":[143],"with":[144],"conventional":[146],"methods.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-10-27T15:51:10.671819","created_date":"2020-05-01T00:00:00"}