{"id":"https://openalex.org/W2902731060","doi":"https://doi.org/10.1109/tase.2018.2877963","title":"Risk-DTRRT-Based Optimal Motion Planning Algorithm for Mobile Robots","display_name":"Risk-DTRRT-Based Optimal Motion Planning Algorithm for Mobile Robots","publication_year":2018,"publication_date":"2018-11-30","ids":{"openalex":"https://openalex.org/W2902731060","doi":"https://doi.org/10.1109/tase.2018.2877963","mag":"2902731060"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2018.2877963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2018.2877963","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-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/A5014759749","display_name":"Wenzheng Chi","orcid":"https://orcid.org/0000-0002-8121-2624"},"institutions":[{"id":"https://openalex.org/I3923682","display_name":"Soochow University","ror":"https://ror.org/05t8y2r12","country_code":"CN","type":"education","lineage":["https://openalex.org/I3923682"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Wenzheng Chi","raw_affiliation_strings":["Robotics and Microsystems Center, School of Mechanical and Electric Engineering, Soochow University, Suzhou, China"],"raw_orcid":"https://orcid.org/0000-0002-8121-2624","affiliations":[{"raw_affiliation_string":"Robotics and Microsystems Center, School of Mechanical and Electric Engineering, Soochow University, Suzhou, China","institution_ids":["https://openalex.org/I3923682"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100616949","display_name":"Chaoqun Wang","orcid":"https://orcid.org/0000-0001-5780-7284"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Chaoqun Wang","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0001-5780-7284","affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","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":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Jiankun Wang","raw_affiliation_strings":["Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong"],"raw_orcid":"https://orcid.org/0000-0001-9139-0291","affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, The Chinese University of Hong Kong, Hong Kong","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/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Max Q.-H. Meng","raw_affiliation_strings":["Shenzhen Research Institute, The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"],"raw_orcid":"https://orcid.org/0000-0002-5255-5898","affiliations":[{"raw_affiliation_string":"Shenzhen Research Institute, The Chinese University of Hong Kong, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":3.4372,"has_fulltext":false,"cited_by_count":84,"citation_normalized_percentile":{"value":0.93425564,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"16","issue":"3","first_page":"1271","last_page":"1288"},"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.9955999851226807,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.995199978351593,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/trajectory","display_name":"Trajectory","score":0.7089976668357849},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6615800261497498},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6432638764381409},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6336865425109863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5931218862533569},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4957462251186371},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4782375693321228},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4759666323661804},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.45643460750579834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4538035988807678},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.4135289788246155},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.30874645709991455},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22302868962287903},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.20127025246620178}],"concepts":[{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7089976668357849},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6615800261497498},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6432638764381409},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6336865425109863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5931218862533569},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4957462251186371},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4782375693321228},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4759666323661804},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.45643460750579834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4538035988807678},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.4135289788246155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.30874645709991455},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22302868962287903},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.20127025246620178},{"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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2018.2877963","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2018.2877963","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1777783943","https://openalex.org/W1963969090","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W2000790002","https://openalex.org/W2004094350","https://openalex.org/W2034801091","https://openalex.org/W2037907469","https://openalex.org/W2095095223","https://openalex.org/W2095757353","https://openalex.org/W2099593662","https://openalex.org/W2103120971","https://openalex.org/W2128990851","https://openalex.org/W2130422193","https://openalex.org/W2158246215","https://openalex.org/W2167869989","https://openalex.org/W2169528473","https://openalex.org/W2248868695","https://openalex.org/W2266853061","https://openalex.org/W2277190572","https://openalex.org/W2295417718","https://openalex.org/W2323490143","https://openalex.org/W2335799662","https://openalex.org/W2519453022","https://openalex.org/W2561619970","https://openalex.org/W2580509961","https://openalex.org/W2753598779","https://openalex.org/W2768361032","https://openalex.org/W2794029453","https://openalex.org/W2962827902","https://openalex.org/W3103855880","https://openalex.org/W4312769317","https://openalex.org/W6605295560","https://openalex.org/W6644448126","https://openalex.org/W6674861906","https://openalex.org/W6684672043","https://openalex.org/W6693458136","https://openalex.org/W6697205691"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W2618632915","https://openalex.org/W3158818664","https://openalex.org/W2077416514","https://openalex.org/W2170661558","https://openalex.org/W2372633663"],"abstract_inverted_index":{"In":[0,19,244,282],"a":[1,15,22,39,44,52,64,77,95,106,136,287,295,306,320],"human-robot":[2],"coexisting":[3],"environment,":[4,41],"reaching":[5],"the":[6,34,49,70,81,86,99,124,128,131,144,151,157,164,172,176,184,187,194,197,235,247,263,267,275,279,313,316,327,337,340,345,348,358,361],"target":[7],"place":[8],"efficiently":[9],"and":[10,63,88,183,207,221,260,343,365],"safely":[11],"is":[12,31,67,76,91,102,112,140,155,228,302,323],"pivotal":[13],"for":[14,33,69,234,256],"mobile":[16,236,363,372],"service":[17,237,373],"robot.":[18],"this":[20,89,245,283,292],"paper,":[21,284],"Risk-based":[23],"Dual-Tree":[24],"Rapidly":[25,297],"exploring":[26,298],"Random":[27,299],"Tree":[28,300],"(Risk-DTRRT)":[29],"algorithm":[30,111,139,166,355],"proposed":[32,68,113,141,198,213,331,352],"robot":[35],"motion":[36,249,268,349,353,378],"planning":[37,231,250,269,354,379],"in":[38,150,171,203,218,239,370],"dynamic":[40,222,240],"which":[42],"provides":[43],"homotopy":[45,173],"optimal":[46,170],"trajectory":[47,71,83,101,161,318],"on":[48,315],"basis":[50,129],"of":[51,59,85,130,175,186,196,266,311,339,347,360],"heuristic":[53,96,100,145,177,307,317,328],"trajectory.":[54,97,146,178,308,329],"A":[55],"dual-tree":[56,288,332],"framework":[57,289,333],"consisting":[58],"an":[60],"RRT":[61,74,341],"tree":[62,66,75,90,137,148,152,322,342],"rewired":[65,122,158,321],"searching.":[72],"The":[73,147,160,179,200,351],"time-based":[78,118],"tree,":[79],"considering":[80],"future":[82],"predictions":[84],"pedestrians,":[87],"utilized":[92],"to":[93,114,142,168,192,225,274,290,304,325,375],"generate":[94,305],"However,":[98,262],"usually":[103],"nonoptimal.":[104],"Then,":[105,309],"line-of-sight":[107],"(LoS)":[108],"control":[109,133],"checking":[110,134],"detect":[115],"whether":[116],"two":[117],"nodes":[119,314],"can":[120,334,367],"be":[121,169,271,368],"with":[123,242],"least":[125],"cost.":[126],"On":[127],"LoS":[132],"algorithm,":[135],"rewiring":[138,153],"optimize":[143,326],"generated":[149,162],"process":[154],"called":[156],"tree.":[159],"by":[163,230,278],"Risk-DTRRT":[165],"proves":[167],"class":[174],"navigation":[180],"run":[181],"time":[182],"lengths":[185],"planned":[188],"trajectories":[189,233],"are":[190],"selected":[191],"demonstrate":[193],"effectiveness":[195],"algorithm.":[199],"experimental":[201],"results":[202],"both":[204,219],"simulation":[205],"studies":[206],"real-world":[208],"implementations":[209],"reveal":[210],"that":[211],"our":[212],"method":[214],"achieves":[215],"convincing":[216],"performance":[217],"static":[220],"environments.":[223],"Note":[224],"Practitioners-This":[226],"paper":[227],"motivated":[229],"optimized":[232],"robots":[238,374],"environments":[241],"pedestrians.":[243,281],"area,":[246],"sampling-based":[248],"algorithms":[251],"have":[252],"been":[253],"widely":[254],"used":[255],"their":[257,377],"high":[258],"efficiency":[259],"robustness.":[261],"real-time":[264],"optimality":[265],"cannot":[270],"guaranteed":[272],"due":[273],"challenges":[276],"caused":[277],"moving":[280],"we":[285],"propose":[286],"solve":[291],"problem.":[293],"First,":[294],"classic":[296],"(RRT)":[301],"constructed":[303],"instead":[310],"reconnecting":[312],"directly,":[319],"built":[324],"This":[330],"fully":[335],"exploit":[336],"information":[338],"ensure":[344],"completeness":[346],"planning.":[350],"also":[356],"considers":[357],"constraints":[359],"nonholonomic":[362],"robots,":[364],"it":[366],"applied":[369],"most":[371],"improve":[376],"quality.":[380]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":15},{"year":2023,"cited_by_count":15},{"year":2022,"cited_by_count":13},{"year":2021,"cited_by_count":20},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":3}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}