{"id":"https://openalex.org/W2930900158","doi":"https://doi.org/10.1142/s1793351x19400014","title":"Evolutionary Heuristic A* Search: Pathfinding Algorithm with Self-Designed and Optimized Heuristic Function","display_name":"Evolutionary Heuristic A* Search: Pathfinding Algorithm with Self-Designed and Optimized Heuristic Function","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2930900158","doi":"https://doi.org/10.1142/s1793351x19400014","mag":"2930900158"},"language":"en","primary_location":{"id":"doi:10.1142/s1793351x19400014","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793351x19400014","pdf_url":null,"source":{"id":"https://openalex.org/S4210201727","display_name":"International Journal of Semantic Computing","issn_l":"1793-351X","issn":["1793-351X","1793-7108"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Semantic Computing","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/A5074449807","display_name":"Ying Fung Yiu","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ying Fung Yiu","raw_affiliation_strings":["Computer Science & Engineering Department, Texas A&M University, College Station, TX 77840, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering Department, Texas A&M University, College Station, TX 77840, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018591825","display_name":"Jing Du","orcid":"https://orcid.org/0000-0002-0481-4875"},"institutions":[{"id":"https://openalex.org/I33213144","display_name":"University of Florida","ror":"https://ror.org/02y3ad647","country_code":"US","type":"education","lineage":["https://openalex.org/I33213144"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jing Du","raw_affiliation_strings":["Department of Civil Engineering, University of Florida, Gainesville, FL 32603, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Civil Engineering, University of Florida, Gainesville, FL 32603, USA","institution_ids":["https://openalex.org/I33213144"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103702897","display_name":"Rabi Mahapatra","orcid":"https://orcid.org/0000-0003-1702-8045"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rabi Mahapatra","raw_affiliation_strings":["Computer Science & Engineering Department, Texas A&M University, College Station, TX 77840, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science & Engineering Department, Texas A&M University, College Station, TX 77840, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9152,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.78737777,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"13","issue":"01","first_page":"5","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9965000152587891,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9789999723434448,"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.7540099620819092},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.676023006439209},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.6744532585144043},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.6505095362663269},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.5977635979652405},{"id":"https://openalex.org/keywords/consistent-heuristic","display_name":"Consistent heuristic","score":0.5862424969673157},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5347980856895447},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.5261794328689575},{"id":"https://openalex.org/keywords/hyper-heuristic","display_name":"Hyper-heuristic","score":0.5096826553344727},{"id":"https://openalex.org/keywords/evaluation-function","display_name":"Evaluation function","score":0.5030564665794373},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4772096276283264},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.4732150137424469},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46729400753974915},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4519769847393036},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.44666630029678345},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.42582276463508606},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40322741866111755},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3118358254432678},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2510892152786255},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18470978736877441},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17481312155723572},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.066739022731781},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06235590577125549}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7540099620819092},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.676023006439209},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.6744532585144043},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.6505095362663269},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.5977635979652405},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5862424969673157},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5347980856895447},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5261794328689575},{"id":"https://openalex.org/C117270229","wikidata":"https://www.wikidata.org/wiki/Q5957539","display_name":"Hyper-heuristic","level":5,"score":0.5096826553344727},{"id":"https://openalex.org/C131806220","wikidata":"https://www.wikidata.org/wiki/Q852705","display_name":"Evaluation function","level":2,"score":0.5030564665794373},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4772096276283264},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.4732150137424469},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46729400753974915},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4519769847393036},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.44666630029678345},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.42582276463508606},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40322741866111755},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3118358254432678},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2510892152786255},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18470978736877441},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17481312155723572},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.066739022731781},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06235590577125549},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0},{"id":"https://openalex.org/C188888258","wikidata":"https://www.wikidata.org/wiki/Q7353390","display_name":"Robot learning","level":4,"score":0.0},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793351x19400014","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793351x19400014","pdf_url":null,"source":{"id":"https://openalex.org/S4210201727","display_name":"International Journal of Semantic Computing","issn_l":"1793-351X","issn":["1793-351X","1793-7108"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Semantic Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1140243306","https://openalex.org/W1969483458","https://openalex.org/W2035601288","https://openalex.org/W2046589787","https://openalex.org/W2135125135","https://openalex.org/W4250503569"],"related_works":["https://openalex.org/W2101174032","https://openalex.org/W2400861930","https://openalex.org/W3111117784","https://openalex.org/W2038323771","https://openalex.org/W4383897618","https://openalex.org/W2573689326","https://openalex.org/W2357125654","https://openalex.org/W49831056","https://openalex.org/W2900115573","https://openalex.org/W2930900158"],"abstract_inverted_index":{"The":[0,58,103],"performance":[1,182,208],"and":[2,51,65,140,152,186,195,197,202,210,253,265,271],"efficiency":[3],"of":[4,13,27,60,74,97,105,113,183,215,239],"A*":[5,119,163,184],"search":[6,30,120,136,164,185],"algorithm":[7,31,127,205],"heavily":[8],"depends":[9],"on":[10,171],"the":[11,14,24,89,98,111,169,181,200,213,228,269],"quality":[12],"heuristic":[15,21,46,62,83,115,172,216,243],"function.":[16],"Therefore,":[17],"designing":[18],"an":[19,71,126,241,247],"optimal":[20,248],"function":[22,47,63,84,116,158,173,244],"becomes":[23,66],"primary":[25],"goal":[26],"developing":[28],"a":[29,44,61,149,156],"for":[32,54,91,100,118,155],"specific":[33],"domains":[34],"in":[35],"artificial":[36],"intelligence.":[37],"However,":[38],"it":[39],"is":[40,108,237,258],"difficult":[41],"to":[42,68,109,124,133,193,221,226,260],"design":[43,69,117,125,151,174,262],"well-constructed":[45],"without":[48],"careful":[49],"consideration":[50],"trial-and-error,":[52],"especially":[53],"complex":[55,82,114],"pathfinding":[56,224],"problems.":[57],"complexity":[59],"increases":[64],"unmanageable":[67],"when":[70],"increasing":[72],"number":[73],"parameters":[75],"are":[76],"involved.":[77],"Existing":[78],"approaches":[79],"often":[80],"avoid":[81],"design:":[85],"they":[86],"either":[87],"trade-off":[88],"accuracy":[90,139],"faster":[92],"computation":[93],"or":[94],"taking":[95],"advantage":[96],"parallelism":[99],"better":[101],"performance.":[102,229],"objective":[104],"this":[106,145],"paper":[107],"reduce":[110],"difficulty":[112],"algorithm.":[121],"We":[122,218],"aim":[123],"that":[128,234,245],"can":[129,251],"be":[130],"automatically":[131,261],"optimized":[132],"achieve":[134],"rapid":[135],"with":[137],"high":[138,207],"low":[141],"computational":[142],"cost.":[143],"In":[144],"paper,":[146],"we":[147],"present":[148],"novel":[150],"optimization":[153],"method":[154],"Multi-Weighted-Heuristics":[157],"(MWH)":[159],"named":[160],"Evolutionary":[161],"Heuristic":[162],"(EHA*)":[165],"to:":[166],"(1)":[167,236],"minimize":[168],"effort":[170],"via":[175],"Genetic":[176],"Algorithm":[177],"(GA),":[178],"(2)":[179,250],"optimize":[180],"its":[187],"variants":[188],"including":[189],"but":[190],"not":[191],"limited":[192],"WA*":[194],"MHA*,":[196],"(3)":[198,257],"guarantee":[199],"completeness":[201],"optimality.":[203],"EHA*":[204,220,235],"enables":[206],"searches":[209],"significantly":[211],"simplifies":[212],"processing":[214],"design.":[217],"apply":[219],"multiple":[222],"grid-based":[223],"benchmarks":[225],"evaluate":[227],"Our":[230],"experiment":[231],"result":[232],"shows":[233],"capable":[238],"choosing":[240],"accurate":[242],"provides":[246],"solution,":[249],"identify":[252],"eliminate":[254],"inefficient":[255],"heuristics,":[256],"able":[259],"multi-heuristics":[263],"function,":[264],"(4)":[266],"minimizes":[267],"both":[268],"time":[270],"space":[272],"complexity.":[273]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}