{"id":"https://openalex.org/W4415873190","doi":"https://doi.org/10.3390/a18110702","title":"An Improved Bi-RRT Algorithm for Optimal Puncture Path Planning","display_name":"An Improved Bi-RRT Algorithm for Optimal Puncture Path Planning","publication_year":2025,"publication_date":"2025-11-04","ids":{"openalex":"https://openalex.org/W4415873190","doi":"https://doi.org/10.3390/a18110702"},"language":"en","primary_location":{"id":"doi:10.3390/a18110702","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18110702","pdf_url":"https://www.mdpi.com/1999-4893/18/11/702/pdf?version=1762260030","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/18/11/702/pdf?version=1762260030","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033598490","display_name":"Shigang Wang","orcid":"https://orcid.org/0000-0002-6868-6542"},"institutions":[{"id":"https://openalex.org/I18570673","display_name":"Guangxi University of Science and Technology","ror":"https://ror.org/02fj6b627","country_code":"CN","type":"education","lineage":["https://openalex.org/I18570673"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Shigang Wang","raw_affiliation_strings":["School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China"],"affiliations":[{"raw_affiliation_string":"School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China","institution_ids":["https://openalex.org/I18570673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110011453","display_name":"Y. Ran","orcid":"https://orcid.org/0009-0005-3107-5720"},"institutions":[{"id":"https://openalex.org/I18570673","display_name":"Guangxi University of Science and Technology","ror":"https://ror.org/02fj6b627","country_code":"CN","type":"education","lineage":["https://openalex.org/I18570673"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunqi Ran","raw_affiliation_strings":["School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China"],"affiliations":[{"raw_affiliation_string":"School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China","institution_ids":["https://openalex.org/I18570673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100676089","display_name":"Zhan Chen","orcid":"https://orcid.org/0000-0002-5542-675X"},"institutions":[{"id":"https://openalex.org/I18570673","display_name":"Guangxi University of Science and Technology","ror":"https://ror.org/02fj6b627","country_code":"CN","type":"education","lineage":["https://openalex.org/I18570673"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhan Chen","raw_affiliation_strings":["School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China"],"affiliations":[{"raw_affiliation_string":"School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China","institution_ids":["https://openalex.org/I18570673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5033598490"],"corresponding_institution_ids":["https://openalex.org/I18570673"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.30916791,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"18","issue":"11","first_page":"702","last_page":"702"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10868","display_name":"Soft Robotics and Applications","score":0.902899980545044,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10868","display_name":"Soft Robotics and Applications","score":0.902899980545044,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.017500000074505806,"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/T14189","display_name":"Intravenous Infusion Technology and Safety","score":0.010900000110268593,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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.8237000107765198},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.6449999809265137},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6331999897956848},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6218000054359436},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5996000170707703},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.45559999346733093},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4424999952316284},{"id":"https://openalex.org/keywords/matlab","display_name":"MATLAB","score":0.4140999913215637}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8237000107765198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6812000274658203},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.6449999809265137},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6331999897956848},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6218000054359436},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5996000170707703},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5773000121116638},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49070000648498535},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.45559999346733093},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4424999952316284},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.4140999913215637},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.39820000529289246},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3785000145435333},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3327000141143799},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.32280001044273376},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.3025999963283539},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.26510000228881836}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18110702","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18110702","pdf_url":"https://www.mdpi.com/1999-4893/18/11/702/pdf?version=1762260030","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:0b2005aebf31405c9e3498456cd31999","is_oa":true,"landing_page_url":"https://doaj.org/article/0b2005aebf31405c9e3498456cd31999","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 11, p 702 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18110702","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18110702","pdf_url":"https://www.mdpi.com/1999-4893/18/11/702/pdf?version=1762260030","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1280631668","display_name":null,"funder_award_id":"2025GXNSFHA069207","funder_id":"https://openalex.org/F4320313613","funder_display_name":"Natural Science Foundation of Guangxi Zhuang Autonomous Region"}],"funders":[{"id":"https://openalex.org/F4320313613","display_name":"Natural Science Foundation of Guangxi Zhuang Autonomous Region","ror":null}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415873190.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1756618330","https://openalex.org/W2036471941","https://openalex.org/W2107550832","https://openalex.org/W2130841298","https://openalex.org/W2138282218","https://openalex.org/W2141933910","https://openalex.org/W2146593008","https://openalex.org/W2169528473","https://openalex.org/W2440321054","https://openalex.org/W2802569337","https://openalex.org/W2953235417","https://openalex.org/W3202853322","https://openalex.org/W3217142009","https://openalex.org/W4252460882","https://openalex.org/W4367665998","https://openalex.org/W4387747219","https://openalex.org/W4391133901","https://openalex.org/W4405991897","https://openalex.org/W4407308314","https://openalex.org/W4408791296","https://openalex.org/W4410638697"],"related_works":[],"abstract_inverted_index":{"Percutaneous":[0],"puncture":[1,46,58,176],"has":[2],"become":[3],"one":[4],"of":[5,20,38,104,131,174],"the":[6,77,116,123,142,145,149],"most":[7],"widely":[8],"used":[9],"minimally":[10],"invasive":[11],"techniques":[12],"in":[13,110,129,141],"clinical":[14],"practice":[15],"due":[16],"to":[17,44,92],"its":[18,90],"advantages":[19,128],"low":[21],"trauma,":[22],"quick":[23],"recovery":[24],"and":[25,35,48,80,98,106,120,136,161],"easy":[26],"operation.":[27],"However,":[28],"incomplete":[29],"needle":[30],"tip":[31],"movement,":[32],"tissue":[33],"barriers":[34],"complex":[36,108],"distribution":[37],"sensitive":[39],"organs":[40],"make":[41],"it":[42],"difficult":[43],"balance":[45],"accuracy":[47],"safety.":[49],"To":[50],"this":[51,53],"end,":[52],"paper":[54],"proposes":[55],"a":[56,168],"new":[57],"path":[59,81,132,151],"planning":[60,150,173],"algorithm":[61,119,125,147],"for":[62,171],"flexible":[63,178],"needles,":[64],"which":[65,166],"integrates":[66],"gravitational":[67],"guidance,":[68],"bi-directional":[69],"adaptive":[70],"expansion,":[71],"optimal":[72],"node":[73,137],"selection":[74],"based":[75],"on":[76],"A*":[78],"algorithm,":[79,122],"optimization":[82],"strategies,":[83],"with":[84,115,155,159,164,177],"Bi-Rapid-Research":[85],"Random":[86],"Trees":[87],"(Bi-RRTs)":[88],"at":[89],"core,":[91],"significantly":[93],"improve":[94],"obstacle":[95],"avoidance":[96],"capability":[97],"computational":[99],"efficiency.":[100],"The":[101],"simulation":[102],"results":[103],"2D":[105],"3D":[107,143],"scenes":[109],"MATLAB":[111],"show":[112],"that":[113],"compared":[114,154,158,163],"traditional":[117],"RRT":[118],"Bi-RRT":[121],"GBOPBi-RRT":[124,146],"achieves":[126],"significant":[127],"terms":[130],"length,":[133],"computation":[134],"time":[135],"size.":[138],"In":[139],"particular,":[140],"environment,":[144],"shortens":[148],"by":[152],"43.21%":[153],"RRT,":[156],"27.47%":[157],"RRT*":[160],"30.33%":[162],"Bi-RRT,":[165],"provides":[167],"reliable":[169],"solution":[170],"efficient":[172],"percutaneous":[175],"needles.":[179]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-04T00:00:00"}