{"id":"https://openalex.org/W4414432878","doi":"https://doi.org/10.1109/case58245.2025.11163825","title":"Dual-Replanning Tree: Fast Multi-Query Path Planning in Dynamic Environments","display_name":"Dual-Replanning Tree: Fast Multi-Query Path Planning in Dynamic Environments","publication_year":2025,"publication_date":"2025-08-17","ids":{"openalex":"https://openalex.org/W4414432878","doi":"https://doi.org/10.1109/case58245.2025.11163825"},"language":"en","primary_location":{"id":"doi:10.1109/case58245.2025.11163825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11163825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100354225","display_name":"Cheng Li","orcid":"https://orcid.org/0000-0001-6110-8099"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Cheng Li","raw_affiliation_strings":["Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering,Xi’an,China,710049"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering,Xi’an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060392834","display_name":"Ziang Huang","orcid":null},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ziang Huang","raw_affiliation_strings":["Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering,Xi’an,China,710049"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering,Xi’an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043647130","display_name":"Chao-Bo Yan","orcid":"https://orcid.org/0000-0002-6396-0610"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Chao-Bo Yan","raw_affiliation_strings":["Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering,Xi’an,China,710049"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi’an Jiaotong University,State Key Laboratory for Manufacturing Systems Engineering,Xi’an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032341258","display_name":"Jianchen Hu","orcid":"https://orcid.org/0000-0002-4143-9955"},"institutions":[{"id":"https://openalex.org/I87445476","display_name":"Xi'an Jiaotong University","ror":"https://ror.org/017zhmm22","country_code":"CN","type":"education","lineage":["https://openalex.org/I87445476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianchen Hu","raw_affiliation_strings":["Xi’an Jiaotong University,School of Automation Science and Engineering, Faculty of Electronic and Information Engineering,Xi’an,China,710049"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Xi’an Jiaotong University,School of Automation Science and Engineering, Faculty of Electronic and Information Engineering,Xi’an,China,710049","institution_ids":["https://openalex.org/I87445476"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I87445476"],"apc_list":null,"apc_paid":null,"fwci":1.4158,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.83998791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"669","last_page":"675"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9987999796867371,"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.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9678999781608582,"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/T11106","display_name":"Data Management and Algorithms","score":0.9584000110626221,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/tree","display_name":"Tree (set theory)","score":0.7074999809265137},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7017999887466431},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6852999925613403},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5060999989509583},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5004000067710876},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4810999929904938},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4480000138282776}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7074999809265137},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7017999887466431},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6852999925613403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5699999928474426},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5060999989509583},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5004000067710876},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4810999929904938},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4481000006198883},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4480000138282776},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.4293999969959259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42879998683929443},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.38960000872612},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.3716999888420105},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.3222000002861023},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.3188000023365021},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.30790001153945923},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.26660001277923584},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.2644999921321869},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2565999925136566}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case58245.2025.11163825","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11163825","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1608481154","https://openalex.org/W1969483458","https://openalex.org/W1982809790","https://openalex.org/W2009893899","https://openalex.org/W2013724094","https://openalex.org/W2099593662","https://openalex.org/W2104186994","https://openalex.org/W2108643443","https://openalex.org/W2112271657","https://openalex.org/W2113256452","https://openalex.org/W2141664020","https://openalex.org/W2169528473","https://openalex.org/W2294424735","https://openalex.org/W2335799662","https://openalex.org/W4212795265","https://openalex.org/W4389667779"],"related_works":[],"abstract_inverted_index":{"This":[0,112],"paper":[1],"presents":[2],"Dual-Replanning":[3],"Tree":[4],"(DRT),":[5],"a":[6,102],"real-time":[7],"multi-query":[8,19,45,66,161],"path":[9,17,46,67,104,114,162],"planning":[10,68],"algorithm":[11,133,174,178],"that":[12,92,141,167],"integrates":[13],"local":[14,118],"and":[15,21,110,185],"global":[16],"generation,":[18],"planning,":[20],"dynamic":[22,81,152],"obstacle":[23],"avoidance.":[24],"Existing":[25],"algorithms,":[26],"such":[27],"as":[28],"FAT,":[29],"which":[30,55],"fix":[31,142],"the":[32,36,49,57,61,87,94,98,131,143,147,151,155,172,176],"tree":[33,58,95,144,156],"root":[34,59,96,145,157],"at":[35,146],"destination,":[37],"exhibit":[38],"high":[39],"replanning":[40,88,137],"efficiency":[41,138],"but":[42,69],"struggle":[43],"with":[44],"planning.":[47,163],"On":[48],"other":[50],"hand,":[51],"algorithms":[52,91,140],"like":[53],"RT-RRT*,":[54],"maintain":[56],"near":[60,97],"robot,":[62],"are":[63,70],"advantageous":[64],"for":[65],"significantly":[71],"affected":[72],"by":[73,100],"newly":[74],"detected":[75],"obstacles,":[76],"limiting":[77],"their":[78],"performance":[79],"in":[80,122,179],"environments.":[82],"Our":[83],"method":[84],"innovatively":[85],"improves":[86],"strategy":[89],"of":[90,154],"keep":[93],"robot":[99],"introducing":[101],"reference":[103,113,129],"mechanism,":[105],"enabling":[106],"efficient":[107],"node":[108],"rewiring":[109],"expansion.":[111],"is":[115],"obtained":[116],"through":[117],"small-scale":[119],"rewiring,":[120],"resulting":[121],"low":[123],"computational":[124],"overhead.":[125],"Based":[126],"on":[127],"this":[128],"path,":[130],"proposed":[132],"can":[134],"achieve":[135],"higher":[136],"than":[139],"destination":[148],"while":[149],"retaining":[150],"adjustment":[153],"to":[158,160],"adapt":[159],"Experimental":[164],"results":[165],"demonstrate":[166],"under":[168],"various":[169],"environmental":[170],"conditions,":[171],"DRT":[173],"outperforms":[175],"FAT":[177],"two":[180],"key":[181],"metrics:":[182],"execution":[183],"cost":[184],"arrival":[186],"time.":[187]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}