{"id":"https://openalex.org/W2594530875","doi":"https://doi.org/10.1109/robio.2016.7866392","title":"An improved RRT algorithm incorporating obstacle boundary information","display_name":"An improved RRT algorithm incorporating obstacle boundary information","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2594530875","doi":"https://doi.org/10.1109/robio.2016.7866392","mag":"2594530875"},"language":"en","primary_location":{"id":"doi:10.1109/robio.2016.7866392","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2016.7866392","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Robotics and Biomimetics (ROBIO)","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/A5043461784","display_name":"Jiankun Wang","orcid":"https://orcid.org/0000-0001-9139-0291"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiankun Wang","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100337413","display_name":"Xintong Li","orcid":"https://orcid.org/0000-0002-0028-3333"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xintong Li","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021531143","display_name":"Max Q.\u2010H. Meng","orcid":"https://orcid.org/0000-0002-5255-5898"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Max Q.-H. Meng","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043461784"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":1.1826,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.86178647,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":"19","issue":null,"first_page":"625","last_page":"630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/obstacle","display_name":"Obstacle","score":0.6758021712303162},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.641543447971344},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5715571045875549},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4420276880264282},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18182659149169922},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.05960419774055481}],"concepts":[{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.6758021712303162},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.641543447971344},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5715571045875549},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4420276880264282},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18182659149169922},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.05960419774055481},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/robio.2016.7866392","is_oa":false,"landing_page_url":"https://doi.org/10.1109/robio.2016.7866392","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Conference on Robotics and Biomimetics (ROBIO)","raw_type":"proceedings-article"},{"id":"mag:2752177340","is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/en/public/20090422/201702225655247406","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6800000071525574,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1480152866","https://openalex.org/W1954775787","https://openalex.org/W1971086298","https://openalex.org/W1985397417","https://openalex.org/W2098746304","https://openalex.org/W2110762409","https://openalex.org/W2128990851","https://openalex.org/W2213416523","https://openalex.org/W2244029971","https://openalex.org/W2287992105","https://openalex.org/W2336416123","https://openalex.org/W2414947275","https://openalex.org/W2461374934","https://openalex.org/W4250200009"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2794103424","https://openalex.org/W1996530509","https://openalex.org/W4245435724","https://openalex.org/W3028317537","https://openalex.org/W2389515972","https://openalex.org/W2055301889","https://openalex.org/W1505959757","https://openalex.org/W2376554934","https://openalex.org/W2077790809"],"abstract_inverted_index":{"Rapidly-Exploring":[0],"Random":[1],"Trees":[2],"(RRT)":[3],"is":[4,33,84],"a":[5,18,156],"sampling-based":[6],"path":[7,16,97,159],"planning":[8,39],"method,":[9],"which":[10],"aims":[11],"at":[12],"finding":[13],"the":[14,28,66,74,78,96,110,118],"feasible":[15,158],"using":[17],"randomized":[19],"data":[20],"structure.":[21],"But":[22],"RRT":[23,50,144],"usually":[24],"can":[25,134,154],"not":[26],"find":[27,155],"optimal":[29,36],"path.":[30],"Although":[31],"RRT*":[32],"an":[34,48],"asymptotically":[35],"algorithm,":[37,131],"its":[38,91],"time":[40],"scales":[41],"poorly.":[42],"In":[43,146],"this":[44],"paper,":[45],"we":[46,89,132,149],"propose":[47],"improved":[49],"algorithm":[51,153],"incorporating":[52],"obstacle":[53,75,139],"boundary":[54,92,140],"information":[55,93,141],"to":[56,94,103,117],"deal":[57],"with":[58],"these":[59],"two":[60],"problems.":[61],"We":[62],"classify":[63],"obstacles":[64],"in":[65,129,136],"environment":[67],"into":[68],"valuable":[69,87],"and":[70,80,88],"valueless":[71],"obstacles.":[72],"For":[73],"placed":[76],"between":[77],"start":[79],"goal":[81,119],"positions,":[82],"it":[83,102],"regarded":[85],"as":[86],"use":[90],"make":[95],"planner":[98],"sample":[99],"points":[100],"around":[101],"avoid":[104],"other":[105],"bad":[106],"sampling":[107],"points.":[108],"Then":[109],"random":[111],"tree":[112],"will":[113],"grow":[114],"more":[115],"intentionally":[116],"position.":[120],"By":[121],"applying":[122],"Partially":[123],"Observed":[124],"Markov":[125],"Decision":[126],"Process":[127],"(POMDP)":[128],"our":[130,147,152],"also":[133],"prove":[135],"theory":[137],"that":[138,151],"really":[142],"improves":[143],"algorithm.":[145],"experiments,":[148],"show":[150],"better":[157],"faster":[160],"than":[161],"RRT.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}