{"id":"https://openalex.org/W7117974471","doi":"https://doi.org/10.1017/s0263574725103093","title":"A novel path planning algorithm based on synergistic bidirectional optimization","display_name":"A novel path planning algorithm based on synergistic bidirectional optimization","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7117974471","doi":"https://doi.org/10.1017/s0263574725103093"},"language":"en","primary_location":{"id":"doi:10.1017/s0263574725103093","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574725103093","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","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/A5109753849","display_name":"Shixuan Qi","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shixuan Qi","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121769939","display_name":"Haofei Lu","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haofei Lu","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101731051","display_name":"Ziyi Wang","orcid":"https://orcid.org/0000-0002-7752-7439"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ziyi Wang","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121793718","display_name":"Xin Gao","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xin Gao","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018935552","display_name":"SiYao Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Siyao Chen","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5121775116","display_name":"Yuanjian Liu","orcid":null},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanjian Liu","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]},{"author_position":"last","author":{"id":null,"display_name":"Weigang Wang","orcid":"https://orcid.org/0000-0003-3623-1858"},"institutions":[{"id":"https://openalex.org/I41198531","display_name":"Nanjing University of Posts and Telecommunications","ror":"https://ror.org/043bpky34","country_code":"CN","type":"education","lineage":["https://openalex.org/I41198531"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Weigang Wang","raw_affiliation_strings":["Nanjing University of Posts and Telecommunications"],"raw_orcid":"https://orcid.org/0000-0003-3623-1858","affiliations":[{"raw_affiliation_string":"Nanjing University of Posts and Telecommunications","institution_ids":["https://openalex.org/I41198531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5109753849"],"corresponding_institution_ids":["https://openalex.org/I41198531"],"apc_list":null,"apc_paid":null,"fwci":20.8282,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.96967492,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"44","issue":"1","first_page":"52","last_page":"70"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.8870000243186951,"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.8870000243186951,"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.008299999870359898,"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.007600000128149986,"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/motion-planning","display_name":"Motion planning","score":0.6985999941825867},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6499999761581421},{"id":"https://openalex.org/keywords/curse-of-dimensionality","display_name":"Curse of dimensionality","score":0.6182000041007996},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.607200026512146},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5426999926567078},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5421000123023987},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.41659998893737793},{"id":"https://openalex.org/keywords/weighting","display_name":"Weighting","score":0.41269999742507935},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.3898000121116638}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7185999751091003},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6985999941825867},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6499999761581421},{"id":"https://openalex.org/C111030470","wikidata":"https://www.wikidata.org/wiki/Q1430460","display_name":"Curse of dimensionality","level":2,"score":0.6182000041007996},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.607200026512146},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5426999926567078},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5421000123023987},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.534500002861023},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.41659998893737793},{"id":"https://openalex.org/C183115368","wikidata":"https://www.wikidata.org/wiki/Q856577","display_name":"Weighting","level":2,"score":0.41269999742507935},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3898000121116638},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.3779999911785126},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3668999969959259},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34439998865127563},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.3149999976158142},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.28839999437332153},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2870999872684479},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.27869999408721924},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.2759000062942505},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.26489999890327454},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.2597000002861023},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.25920000672340393},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0263574725103093","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0263574725103093","pdf_url":null,"source":{"id":"https://openalex.org/S92163612","display_name":"Robotica","issn_l":"0263-5747","issn":["0263-5747","1469-8668"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Robotica","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","score":0.9014835953712463,"id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1982809790","https://openalex.org/W2124058244","https://openalex.org/W2152375882","https://openalex.org/W2220860189","https://openalex.org/W2895647709","https://openalex.org/W3090027660","https://openalex.org/W3124152587","https://openalex.org/W3217170181","https://openalex.org/W4293812070","https://openalex.org/W4313249511","https://openalex.org/W4324049775","https://openalex.org/W4387247642","https://openalex.org/W4388574524","https://openalex.org/W4388776341","https://openalex.org/W4389395925","https://openalex.org/W4390086644","https://openalex.org/W4391102937","https://openalex.org/W4394699125","https://openalex.org/W4399802285","https://openalex.org/W4400131723","https://openalex.org/W4401069942","https://openalex.org/W4401702147","https://openalex.org/W4402608346","https://openalex.org/W4405179627","https://openalex.org/W4407087207","https://openalex.org/W4408297401","https://openalex.org/W4410445128"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Path":[1],"planning,":[2],"as":[3,141],"a":[4,42,75],"critical":[5],"component":[6],"of":[7,65,100],"mobile":[8,190],"robotic":[9],"systems,":[10],"significantly":[11],"impacts":[12],"operational":[13],"efficiency":[14,99],"and":[15,32,88,97,147,167,186],"energy":[16],"consumption":[17],"ratios.":[18],"State-of-the-art":[19],"algorithms":[20],"often":[21],"suffer":[22],"from":[23],"inadequate":[24],"real-time":[25],"adjustment":[26],"capability,":[27],"insufficient":[28],"dynamic":[29,85],"environment":[30],"adaptation,":[31],"suboptimal":[33],"computational":[34,148],"efficiency.":[35],"To":[36,150],"resolve":[37],"these":[38,152],"limitations,":[39],"we":[40,69,105,154],"propose":[41,106],"bidirectionally":[43],"optimized":[44],"path":[45,82,170,179,192],"planning":[46,180],"algorithm":[47],"named":[48],"Bidirectional":[49],"Q-learning":[50,101,129],"LPA*":[51,67,109],"(BQ-LPA*),":[52],"which":[53,80,116,139],"incorporates":[54],"three":[55],"key":[56],"innovations.":[57],"Specifically,":[58],"to":[59,92,111],"enhance":[60],"the":[61,66,94,108,128,169],"global":[62],"search":[63],"capability":[64],"framework,":[68],"replace":[70],"fixed":[71],"heuristic":[72,78,86],"functions":[73],"with":[74,177],"Q-learning-driven":[76],"adaptive":[77],"mechanism,":[79],"improves":[81],"quality":[83],"through":[84],"weighting":[87],"update":[89],"strategies.":[90],"Additionally,":[91],"improve":[93],"convergence":[95,188],"rate":[96],"sample":[98],"in":[102,135,189],"complex":[103],"environments,":[104],"integrating":[107],"framework":[110],"provide":[112],"prior":[113],"knowledge":[114],"guidance,":[115],"can":[117,162],"effectively":[118],"minimize":[119],"redundant":[120],"exploration":[121],"attempts":[122],"by":[123],"informed":[124],"pathfinding":[125],"initialization.":[126],"Moreover,":[127],"method":[130],"inherently":[131],"faces":[132],"dimensionality":[133,166],"challenges":[134],"high-dimensional":[136],"continuous":[137],"spaces,":[138],"manifest":[140],"action":[142,164],"space":[143,158,165],"congestion,":[144],"storage":[145],"bottlenecks,":[146],"inefficiency.":[149],"mitigate":[151],"risks,":[153],"devise":[155],"an":[156],"LPA*-based":[157],"discretization":[159],"strategy":[160],"that":[161],"reduce":[163],"preserve":[168],"feasibility.":[171],"Experimental":[172],"results":[173],"show":[174],"that,":[175],"compared":[176],"mainstream":[178],"algorithms,":[181],"BQ-LPA*":[182],"achieves":[183],"higher":[184],"accuracy":[185],"faster":[187],"robot":[191],"planning.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-05-29T09:21:14.243279","created_date":"2026-01-02T00:00:00"}