{"id":"https://openalex.org/W3013563919","doi":"https://doi.org/10.1109/rcar47638.2019.9044003","title":"Obstacle Induced Stochastic Tree for Fast Path Planning","display_name":"Obstacle Induced Stochastic Tree for Fast Path Planning","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W3013563919","doi":"https://doi.org/10.1109/rcar47638.2019.9044003","mag":"3013563919"},"language":"en","primary_location":{"id":"doi:10.1109/rcar47638.2019.9044003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rcar47638.2019.9044003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Real-time Computing and Robotics (RCAR)","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/A5100359297","display_name":"Xiaofeng Liu","orcid":"https://orcid.org/0000-0002-8971-6624"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiaofeng Liu","raw_affiliation_strings":["Jiangsu Key Laboratory of Special Robots, Changzhou, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Key Laboratory of Special Robots, Changzhou, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100679104","display_name":"Jinming Li","orcid":"https://orcid.org/0000-0003-1317-1928"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jinming Li","raw_affiliation_strings":["Jiangsu Key Laboratory of Special Robots, Changzhou, China"],"affiliations":[{"raw_affiliation_string":"Jiangsu Key Laboratory of Special Robots, Changzhou, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113928539","display_name":"Fang Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fang Hu","raw_affiliation_strings":["School of Electromechanical and Automobile Engineerng, Changzhou Vacational Institue of Engineering, Changzhou, China"],"affiliations":[{"raw_affiliation_string":"School of Electromechanical and Automobile Engineerng, Changzhou Vacational Institue of Engineering, Changzhou, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019906827","display_name":"Chenguang Yang","orcid":"https://orcid.org/0000-0001-5255-5559"},"institutions":[{"id":"https://openalex.org/I4210161128","display_name":"Bristol Robotics Laboratory","ror":"https://ror.org/056sbyc67","country_code":"GB","type":"facility","lineage":["https://openalex.org/I4210161128"]},{"id":"https://openalex.org/I178535277","display_name":"University of the West of England","ror":"https://ror.org/02nwg5t34","country_code":"GB","type":"education","lineage":["https://openalex.org/I178535277"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Chenguang Yang","raw_affiliation_strings":["Bristol Robotics Laboratory, University of the West of England, Bristol, UK"],"affiliations":[{"raw_affiliation_string":"Bristol Robotics Laboratory, University of the West of England, Bristol, UK","institution_ids":["https://openalex.org/I4210161128","https://openalex.org/I178535277"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100359297"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2024,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.57066641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"499","last_page":"503"},"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.9940000176429749,"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/T12158","display_name":"Guidance and Control Systems","score":0.9764999747276306,"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.8372675180435181},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.8247605562210083},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6684176921844482},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.624048113822937},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6040704846382141},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.5922168493270874},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5768303871154785},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.5477119088172913},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4794817864894867},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4243661165237427},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4210500717163086},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.4187057316303253},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4157237410545349},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.35224008560180664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2726890742778778},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22044125199317932},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11270409822463989},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.08675417304039001}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8372675180435181},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.8247605562210083},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6684176921844482},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.624048113822937},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6040704846382141},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.5922168493270874},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5768303871154785},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.5477119088172913},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4794817864894867},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4243661165237427},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4210500717163086},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.4187057316303253},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4157237410545349},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.35224008560180664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2726890742778778},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22044125199317932},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11270409822463989},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.08675417304039001},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rcar47638.2019.9044003","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rcar47638.2019.9044003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Conference on Real-time Computing and Robotics (RCAR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W2000359213","https://openalex.org/W2009513211","https://openalex.org/W2013724094","https://openalex.org/W2050629289","https://openalex.org/W2076162824","https://openalex.org/W2096636360","https://openalex.org/W2099144379","https://openalex.org/W2107941094","https://openalex.org/W2128990851","https://openalex.org/W2169528473","https://openalex.org/W4236251699","https://openalex.org/W4247582681"],"related_works":["https://openalex.org/W3139139461","https://openalex.org/W2108906364","https://openalex.org/W4388759217","https://openalex.org/W3211562997","https://openalex.org/W3011727645","https://openalex.org/W2056737145","https://openalex.org/W2914610299","https://openalex.org/W4381433906","https://openalex.org/W2268712943","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Rapidly-Exploring":[0,20],"Random":[1,21],"Tree":[2,22],"(RRT)":[3],"has":[4,157],"been":[5],"extensively":[6],"applied":[7],"to":[8,59],"robot":[9,95],"navigation":[10],"field":[11],"as":[12,48,116],"a":[13,91,141,145],"fast":[14],"and":[15,64,72,151,163],"effective":[16],"path":[17,40,63,96,131,143,164],"planning":[18,97],"method.":[19],"Star":[23],"(RRT*),":[24],"one":[25],"of":[26,29,44,51,79,94],"the":[27,38,42,49,65,77,82,99,111,117,123,128,155],"extensions":[28],"RRT,":[30],"outperforms":[31],"other":[32],"methods":[33],"because":[34],"it":[35,55],"can":[36,139],"approach":[37],"optimal":[39,62],"with":[41,149],"number":[43,50],"iterations":[45],"increases.":[46],"Nonetheless,":[47],"sampling":[52,80,118,124],"points":[53],"increases,":[54],"takes":[56],"too":[57],"long":[58],"get":[60],"an":[61],"convergence":[66],"speed":[67],"slows":[68],"dramatically":[69],"for":[70,130],"RRT":[71,150],"all":[73],"its":[74,152],"variants,":[75],"since":[76],"range":[78,125],"is":[81],"entire":[83],"configuration":[84],"space.":[85],"In":[86],"this":[87],"paper,":[88],"we":[89],"propose":[90],"novel":[92],"method":[93],"in":[98,114,160],"global":[100],"knowledge":[101],"scenario:":[102],"obstacle":[103],"induced":[104],"stochastic":[105],"tree":[106],"algorithm.":[107],"This":[108],"algorithm":[109,138,156],"regards":[110],"center":[112],"point":[113],"obstacles":[115],"point,":[119],"which":[120],"significantly":[121],"reduces":[122],"then":[126],"shorts":[127],"time":[129,162],"planning.":[132],"Simulation":[133],"results":[134],"demonstrate":[135],"that":[136],"our":[137],"find":[140],"feasible":[142],"at":[144],"rapid":[146],"rate.":[147],"Compared":[148],"variants":[153],"algorithms,":[154],"better":[158],"performance":[159],"both":[161],"cost.":[165]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}