{"id":"https://openalex.org/W7131631771","doi":"https://doi.org/10.1007/s10846-026-02353-5","title":"An Efficient Sampling-Based Planner towards Optimal Path Planning in Complex Environments","display_name":"An Efficient Sampling-Based Planner towards Optimal Path Planning in Complex Environments","publication_year":2026,"publication_date":"2026-02-26","ids":{"openalex":"https://openalex.org/W7131631771","doi":"https://doi.org/10.1007/s10846-026-02353-5"},"language":"en","primary_location":{"id":"doi:10.1007/s10846-026-02353-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10846-026-02353-5","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Robotic Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s10846-026-02353-5","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106670276","display_name":"Jianxing Liu","orcid":"https://orcid.org/0000-0002-2201-3887"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiarui Liu","raw_affiliation_strings":["College Of Information Science and Engineering, Northeastern University, Shenyang, 110819, Liaoning, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College Of Information Science and Engineering, Northeastern University, Shenyang, 110819, Liaoning, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jinhai Liu","orcid":"https://orcid.org/0000-0002-1256-1337"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jinhai Liu","raw_affiliation_strings":["College Of Information Science and Engineering, Northeastern University, Shenyang, 110819, Liaoning, China"],"raw_orcid":"https://orcid.org/0000-0002-1256-1337","affiliations":[{"raw_affiliation_string":"College Of Information Science and Engineering, Northeastern University, Shenyang, 110819, Liaoning, China","institution_ids":["https://openalex.org/I9224756"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101962189","display_name":"Zhenning Wu","orcid":"https://orcid.org/0000-0002-8742-904X"},"institutions":[{"id":"https://openalex.org/I9224756","display_name":"Northeastern University","ror":"https://ror.org/03awzbc87","country_code":"CN","type":"education","lineage":["https://openalex.org/I9224756"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhenning Wu","raw_affiliation_strings":["College Of Information Science and Engineering, Northeastern University, Shenyang, 110819, Liaoning, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College Of Information Science and Engineering, Northeastern University, Shenyang, 110819, Liaoning, China","institution_ids":["https://openalex.org/I9224756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5106670276"],"corresponding_institution_ids":["https://openalex.org/I9224756"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.34779663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"112","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":0.9814000129699707,"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.9814000129699707,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.0027000000700354576,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.002300000051036477,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7430999875068665},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6944000124931335},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.6134999990463257},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5152000188827515},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.513700008392334},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4948999881744385}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7430999875068665},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6944000124931335},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6195999979972839},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6134999990463257},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6123999953269958},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5152000188827515},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.513700008392334},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4948999881744385},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3483000099658966},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.26460000872612}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10846-026-02353-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10846-026-02353-5","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Robotic Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10846-026-02353-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10846-026-02353-5","pdf_url":null,"source":{"id":"https://openalex.org/S91329792","display_name":"Journal of Intelligent & Robotic Systems","issn_l":"0921-0296","issn":["0921-0296","1573-0409"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Intelligent & Robotic Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2587347264","display_name":null,"funder_award_id":"U21A20481","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1976930960","https://openalex.org/W2086860466","https://openalex.org/W2139017160","https://openalex.org/W2142156433","https://openalex.org/W2273777546","https://openalex.org/W2909688514","https://openalex.org/W2973864946","https://openalex.org/W3005907094","https://openalex.org/W3081784301","https://openalex.org/W3114748666","https://openalex.org/W3135798356","https://openalex.org/W3160167368","https://openalex.org/W3195143297","https://openalex.org/W4200197476","https://openalex.org/W4220893856","https://openalex.org/W4320039820","https://openalex.org/W4323542744","https://openalex.org/W4361005303","https://openalex.org/W4387789663","https://openalex.org/W4388295255","https://openalex.org/W4388868804","https://openalex.org/W4388909995","https://openalex.org/W4390422049","https://openalex.org/W4392405436","https://openalex.org/W4392902005","https://openalex.org/W4394842439","https://openalex.org/W4398272007","https://openalex.org/W4400316259","https://openalex.org/W4402631126"],"related_works":[],"abstract_inverted_index":{"Efficient":[0],"and":[1,12,50,57,92,126,176,191,207],"robust":[2],"path":[3,27,45,58,90,103,125,142],"planning":[4,10,28,93],"is":[5,71,137],"crucial":[6],"to":[7,30,47,139,157],"ensure":[8],"the":[9,79,87,109,124,141,147,159,178,197],"efficiency":[11,56,94],"operational":[13],"safety":[14],"for":[15,170],"autonomous":[16],"inspection":[17],"robot.":[18],"While":[19],"sampling-based":[20],"methods":[21,35],"are":[22],"widely":[23],"used":[24],"in":[25,40,65,95,123,172,183,200],"robot":[26],"due":[29,46],"their":[31,63,117],"computational":[32],"efficiency,":[33,206],"these":[34,75],"still":[36],"face":[37],"following":[38],"challenges":[39],"real":[41],"applications:":[42],"(1)":[43],"sub-optimal":[44],"slow":[48],"convergence":[49],"(2)":[51],"inherent":[52],"trade-off":[53],"between":[54,89],"search":[55,143,164,205],"quality.":[59],"These":[60],"limitations":[61],"restrict":[62],"effectiveness":[64],"complex":[66,96,184],"scenarios,":[67],"where":[68],"reliable":[69],"navigation":[70,208],"required.":[72],"To":[73],"overcome":[74],"limitations,":[76],"we":[77,99,151],"propose":[78,100],"Swift":[80],"Optimization":[81],"Bidirectional":[82],"RRT*":[83],"(SOB-RRT*)":[84],"that":[85,106],"refines":[86],"balance":[88,161],"optimization":[91,110,169],"environments.":[97],"First,":[98],"a":[101,132,153],"foresighted":[102],"generation":[104],"method":[105],"incrementally":[107],"expands":[108],"region":[111],"of":[112,162,196,202],"tree":[113],"nodes":[114],"based":[115],"on":[116],"hierarchical":[118],"connection,":[119],"significantly":[120],"reducing":[121],"zigzags":[122],"effectively":[127],"mitigating":[128],"local":[129],"optima.":[130],"Second,":[131],"flexible":[133],"greedy":[134],"connection":[135,148],"strategy":[136,156],"proposed":[138,198],"accelerate":[140],"by":[144,186],"dynamically":[145],"selecting":[146],"target.":[149],"Finally,":[150],"introduce":[152],"constrained":[154],"swapping":[155,188],"maintain":[158],"growth":[160],"two":[163,174],"trees.":[165],"This":[166],"guarantees":[167],"sufficient":[168],"paths":[171],"both":[173],"trees":[175],"prevents":[177],"planner":[179,199],"from":[180],"being":[181],"trapped":[182],"scenarios":[185],"restricting":[187],"frequency.":[189],"Simulations":[190],"real-world":[192],"experiments":[193],"show":[194],"improvements":[195],"terms":[201],"time":[203],"cost,":[204],"success":[209],"rate.":[210]},"counts_by_year":[],"updated_date":"2026-05-05T08:41:31.759640","created_date":"2026-02-27T00:00:00"}