{"id":"https://openalex.org/W2565125300","doi":"https://doi.org/10.1109/iros.2016.7759703","title":"Anytime RRBT for handling uncertainty and dynamic objects","display_name":"Anytime RRBT for handling uncertainty and dynamic objects","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2565125300","doi":"https://doi.org/10.1109/iros.2016.7759703","mag":"2565125300"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2016.7759703","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5061669987","display_name":"Hyun-Chul Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyunchul Yang","raw_affiliation_strings":["Robotics Program, KAIST, Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Robotics Program, KAIST, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061007351","display_name":"Jongwoo Lim","orcid":"https://orcid.org/0000-0002-2814-4765"},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jongwoo Lim","raw_affiliation_strings":["Division of Computer Science and Engineering, Hanyang University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Division of Computer Science and Engineering, Hanyang University, Seoul, South Korea","institution_ids":["https://openalex.org/I4575257"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078173428","display_name":"Sung\u2010Eui Yoon","orcid":"https://orcid.org/0000-0002-7123-1119"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sung-eui Yoon","raw_affiliation_strings":["KAIST, School of Computing, Daejeon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KAIST, School of Computing, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.338,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.6860025,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"4786","last_page":"4793"},"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.9940999746322632,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.8064299821853638},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.7406465411186218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.729956328868866},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7038065791130066},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5885480642318726},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5803332328796387},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.5657690167427063},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5371023416519165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48367199301719666},{"id":"https://openalex.org/keywords/collision-avoidance","display_name":"Collision avoidance","score":0.47847744822502136},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.47570520639419556},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4480191767215729},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4095911383628845},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.36772406101226807},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31264418363571167},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.22920918464660645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14874044060707092}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8064299821853638},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.7406465411186218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.729956328868866},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7038065791130066},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5885480642318726},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5803332328796387},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.5657690167427063},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5371023416519165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48367199301719666},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.47847744822502136},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.47570520639419556},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4480191767215729},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4095911383628845},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.36772406101226807},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31264418363571167},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.22920918464660645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14874044060707092},{"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/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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2016.7759703","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759703","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6700000166893005}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322030","display_name":"Ministry of Science, ICT and Future Planning","ror":"https://ror.org/032e49973"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W1580535863","https://openalex.org/W1626571806","https://openalex.org/W1777783943","https://openalex.org/W1969483458","https://openalex.org/W1987188608","https://openalex.org/W1987629235","https://openalex.org/W1989345169","https://openalex.org/W2002201291","https://openalex.org/W2006817210","https://openalex.org/W2024802078","https://openalex.org/W2036016432","https://openalex.org/W2072033067","https://openalex.org/W2072195747","https://openalex.org/W2072337003","https://openalex.org/W2082511574","https://openalex.org/W2087939536","https://openalex.org/W2097639646","https://openalex.org/W2103052138","https://openalex.org/W2112271657","https://openalex.org/W2128990851","https://openalex.org/W2133765004","https://openalex.org/W2141664020","https://openalex.org/W2142943472","https://openalex.org/W2146934839","https://openalex.org/W2149716029","https://openalex.org/W2159555929","https://openalex.org/W2265008281","https://openalex.org/W2294808847","https://openalex.org/W2296385533"],"related_works":["https://openalex.org/W2930076404","https://openalex.org/W4253519380","https://openalex.org/W2071957557","https://openalex.org/W2596413128","https://openalex.org/W4391249562","https://openalex.org/W2356867392","https://openalex.org/W2913749762","https://openalex.org/W2321940404","https://openalex.org/W2782776446","https://openalex.org/W3043170174"],"abstract_inverted_index":{"We":[0,65,81,103],"present":[1],"an":[2,30,84],"efficient":[3],"anytime":[4,31],"motion":[5],"planner":[6],"for":[7],"mobile":[8],"robots":[9],"that":[10,111],"considers":[11],"both":[12],"other":[13],"dynamic":[14,95,120],"obstacles":[15,96],"and":[16,22,49,79],"uncertainty":[17],"caused":[18],"by":[19,75,98],"various":[20],"sensors":[21],"low-level":[23],"controllers.":[24],"Our":[25],"planning":[26],"algorithm,":[27],"which":[28],"is":[29],"extension":[32],"of":[33],"the":[34,41,46,50,56,124],"Rapidly-exploring":[35],"Random":[36],"Belief":[37],"Tree":[38],"(RRBT),":[39],"maintains":[40],"best":[42],"possible":[43],"path":[44,52,77,138],"throughout":[45],"robot":[47],"execution,":[48],"generated":[51],"gets":[53],"closer":[54],"to":[55,70,93,130],"optimal":[57],"one":[58],"as":[59,88],"more":[60],"computation":[61],"resources":[62],"are":[63],"allocated.":[64],"propose":[66,83],"a":[67,89,100,136],"branch-and-bound":[68],"method":[69,107],"cull":[71],"out":[72],"unpromising":[73],"areas":[74],"considering":[76],"lengths":[78],"uncertainty.":[80],"also":[82],"uncertainty-aware":[85],"velocity":[86],"obstacle":[87],"simple":[90],"local":[91],"analysis":[92],"avoid":[94],"efficiently":[97],"finding":[99],"collision-free":[101],"velocity.":[102],"have":[104,112],"tested":[105],"our":[106],"with":[108,119],"three":[109],"benchmarks":[110],"non-linear":[113],"measurement":[114],"regions":[115],"or":[116],"potential":[117],"collisions":[118],"obstacles.":[121],"By":[122],"using":[123],"proposed":[125],"methods,":[126],"we":[127],"achieve":[128],"up":[129],"five":[131],"times":[132],"faster":[133],"performance":[134],"given":[135],"fixed":[137],"cost.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}