{"id":"https://openalex.org/W7119118508","doi":"https://doi.org/10.1109/vtc2025-fall65116.2025.11310335","title":"Hierarchical Reinforcement Learning A* for Path Planning","display_name":"Hierarchical Reinforcement Learning A* for Path Planning","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W7119118508","doi":"https://doi.org/10.1109/vtc2025-fall65116.2025.11310335"},"language":null,"primary_location":{"id":"doi:10.1109/vtc2025-fall65116.2025.11310335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtc2025-fall65116.2025.11310335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 102nd Vehicular Technology Conference (VTC2025-Fall)","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/A5110098422","display_name":"Guang Lan Liao","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Guang Liao","raw_affiliation_strings":["National University of Defense Technology,College of Electronic Engineering,Hefei,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Electronic Engineering,Hefei,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122187281","display_name":"Jian Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jian Wang","raw_affiliation_strings":["National University of Defense Technology,College of Electronic Engineering,Hefei,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Electronic Engineering,Hefei,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015814760","display_name":"Dujia Yang","orcid":"https://orcid.org/0000-0002-9309-9067"},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dujia Yang","raw_affiliation_strings":["National University of Defense Technology,College of Electronic Engineering,Hefei,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Electronic Engineering,Hefei,China","institution_ids":["https://openalex.org/I170215575"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5107264615","display_name":"Junan Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I170215575","display_name":"National University of Defense Technology","ror":"https://ror.org/05d2yfz11","country_code":"CN","type":"education","lineage":["https://openalex.org/I170215575"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Junan Yang","raw_affiliation_strings":["National University of Defense Technology,College of Electronic Engineering,Hefei,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National University of Defense Technology,College of Electronic Engineering,Hefei,China","institution_ids":["https://openalex.org/I170215575"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60097345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9254999756813049,"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.9254999756813049,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.00570000009611249,"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/T11622","display_name":"Maritime Navigation and Safety","score":0.0035000001080334187,"subfield":{"id":"https://openalex.org/subfields/2212","display_name":"Ocean 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.7434999942779541},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.7376000285148621},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6226999759674072},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5906000137329102},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5073999762535095},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.49790000915527344},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4447999894618988},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4390999972820282}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7434999942779541},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.7376000285148621},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6226999759674072},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5906000137329102},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5622000098228455},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5073999762535095},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.49790000915527344},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.48420000076293945},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4672999978065491},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4447999894618988},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4390999972820282},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.43380001187324524},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3887999951839447},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.3422999978065491},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C114073186","wikidata":"https://www.wikidata.org/wiki/Q2631895","display_name":"Automated planning and scheduling","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2759000062942505},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.2734000086784363},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2685999870300293},{"id":"https://openalex.org/C191489605","wikidata":"https://www.wikidata.org/wiki/Q6043021","display_name":"Integrated business planning","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.26330000162124634},{"id":"https://openalex.org/C47702885","wikidata":"https://www.wikidata.org/wiki/Q5441227","display_name":"Feedforward neural network","level":3,"score":0.2540000081062317}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/vtc2025-fall65116.2025.11310335","is_oa":false,"landing_page_url":"https://doi.org/10.1109/vtc2025-fall65116.2025.11310335","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 102nd Vehicular Technology Conference (VTC2025-Fall)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5251789689064026,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1971086298","https://openalex.org/W2035601288","https://openalex.org/W2062638825","https://openalex.org/W2169528473","https://openalex.org/W2617599361","https://openalex.org/W3004297049","https://openalex.org/W3018656899","https://openalex.org/W3036557346","https://openalex.org/W3089965689","https://openalex.org/W3159605226","https://openalex.org/W4285295684","https://openalex.org/W4380434642","https://openalex.org/W4385741291","https://openalex.org/W4391542568","https://openalex.org/W4391544046","https://openalex.org/W4403765774"],"related_works":[],"abstract_inverted_index":{"In":[0],"addressing":[1],"the":[2,9,12,29,40,63,66,94,113,120,123,134,167,170,176,195,213,218,231,235],"path":[3,43,86,96,102,131,185,204,236],"planning":[4,87,92,97,103,124,129,132,186],"problem,":[5],"recent":[6],"works":[7],"consider":[8],"integration":[10],"of":[11,42,65,108,122,169,220],"traditional":[13],"A*":[14,67,143,183],"algorithm":[15,68,171,187,197],"with":[16,32,153,234],"deep":[17],"reinforcement":[18,33],"learning,":[19,34],"employing":[20],"artificial":[21],"neural":[22,30,151],"networks":[23,31],"as":[24,156],"heuristic":[25,149],"function,":[26],"and":[27,160],"training":[28],"has":[35],"been":[36],"demonstrated":[37],"to":[38,70,112,119,133,230,240],"enhance":[39],"efficiency":[41],"search":[44,75],"in":[45,74,146,205],"complex":[46],"environments.":[47],"However,":[48],"two":[49],"problems":[50],"exist.":[51],"1)":[52],"network":[53,152],"retraining":[54],"is":[55,158,172,188,223],"required":[56],"when":[57],"encountering":[58],"unfamiliar":[59],"environments,":[60],"2)":[61],"following":[62],"framework":[64],"leads":[69,118],"a":[71,84,100,106,139,148,179,201],"limited":[72],"improvement":[73,121],"efficiency.":[76,125],"To":[77],"address":[78],"these":[79],"problems,":[80],"this":[81],"paper":[82],"proposes":[83],"hierarchical":[85,177],"framework.":[88],"The":[89,126,190],"upper":[90],"level":[91,128],"transforms":[93],"global":[95],"problem":[98,104],"into":[99],"multi-stage":[101],"for":[105,215],"sequence":[107],"subgoal":[109,135],"points":[110,136],"according":[111],"shortest":[114],"distance":[115],"principle,":[116],"which":[117,147],"lower":[127],"implements":[130],"by":[137,162,225],"proposing":[138],"Local-environment":[140],"Reinforcement":[141,181],"Learning":[142,182],"(LRLA*)":[144],"mechanism,":[145],"function":[150],"local":[154],"environment":[155],"input":[157],"constructed":[159],"trained":[161],"self-generated":[163],"paths,":[164],"so":[165],"that":[166,194],"generalization":[168],"guaranteed.":[173],"Based":[174],"on":[175],"framework,":[178],"Hierarchical":[180],"(HRLA*)":[184],"designed.":[189],"experimental":[191],"results":[192],"demonstrate":[193],"HRLA*":[196],"can":[198],"rapidly":[199],"generate":[200],"bounded":[202],"suboptimal":[203],"randomly":[206],"generated":[207],"environments":[208],"after":[209],"one-shot":[210],"training,":[211],"eliminating":[212],"need":[214],"retraining.":[216],"Furthermore,":[217],"number":[219],"node":[221],"expansions":[222],"reduced":[224],"more":[226],"than":[227],"80%":[228],"compared":[229],"state-of-the-art":[232],"algorithm,":[233],"cost":[237],"loss":[238],"comparable":[239],"existing":[241],"algorithms.":[242]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-01-08T00:00:00"}