{"id":"https://openalex.org/W2971095011","doi":"https://doi.org/10.1109/icinfa.2018.8812520","title":"Tropistic RRT*: An Efficient Planning Algorithm via Adaptive Restricted Sampling Space","display_name":"Tropistic RRT*: An Efficient Planning Algorithm via Adaptive Restricted Sampling Space","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2971095011","doi":"https://doi.org/10.1109/icinfa.2018.8812520","mag":"2971095011"},"language":"en","primary_location":{"id":"doi:10.1109/icinfa.2018.8812520","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icinfa.2018.8812520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Information and Automation (ICIA)","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, Chinese University of Hong Kong, N.T., Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Chinese University of Hong Kong, N.T., Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030232172","display_name":"Charles X.-T. Li","orcid":null},"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":"Charles X.-T. Li","raw_affiliation_strings":["Department of Electronic Engineering, Chinese University of Hong Kong, N.T., Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Chinese University of Hong Kong, N.T., Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014759749","display_name":"Wenzheng Chi","orcid":"https://orcid.org/0000-0002-8121-2624"},"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":"Wenzheng Chi","raw_affiliation_strings":["Department of Electronic Engineering, Chinese University of Hong Kong, N.T., Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Chinese University of Hong Kong, N.T., 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, Chinese University of Hong Kong, N.T., Hong Kong SAR, China"],"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Chinese University of Hong Kong, N.T., Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5043461784"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.8357,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.79807868,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1639","last_page":"1646"},"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.9968000054359436,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.9836999773979187,"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.8810736536979675},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.6704041361808777},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.6621658802032471},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5946273803710938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5884337425231934},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.49706199765205383},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4806467592716217},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4751201272010803},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4554675221443176},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39200401306152344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3493068516254425},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26606106758117676},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.25713664293289185},{"id":"https://openalex.org/keywords/computer-vision","display_name":"Computer vision","score":0.11797276139259338}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8810736536979675},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6704041361808777},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.6621658802032471},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5946273803710938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5884337425231934},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.49706199765205383},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4806467592716217},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4751201272010803},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4554675221443176},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39200401306152344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3493068516254425},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26606106758117676},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25713664293289185},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.11797276139259338},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icinfa.2018.8812520","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icinfa.2018.8812520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Information and Automation (ICIA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.6399999856948853,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1777783943","https://openalex.org/W1969483458","https://openalex.org/W1971086298","https://openalex.org/W1976930960","https://openalex.org/W2000359213","https://openalex.org/W2008972180","https://openalex.org/W2013724094","https://openalex.org/W2076162824","https://openalex.org/W2099144379","https://openalex.org/W2110144538","https://openalex.org/W2125035363","https://openalex.org/W2128990851","https://openalex.org/W2156969101","https://openalex.org/W2294424735","https://openalex.org/W2414947275","https://openalex.org/W2594530875","https://openalex.org/W3102121895","https://openalex.org/W3104753760","https://openalex.org/W4236251699","https://openalex.org/W4248010533"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W1987694097","https://openalex.org/W3158818664","https://openalex.org/W2797949337","https://openalex.org/W2863424594","https://openalex.org/W2359600231","https://openalex.org/W2372633663","https://openalex.org/W2380019117","https://openalex.org/W4388720133","https://openalex.org/W1660309994"],"abstract_inverted_index":{"As":[0],"a":[1,158],"sampling":[2,53,80],"based":[3,47],"path":[4,75,102,113],"planning":[5,45,76,103,106,114,155],"method,":[6],"Rapidly-exploring":[7],"Random":[8],"Tree":[9],"(RRT)":[10],"is":[11,56,182],"powerful":[12],"for":[13,157],"its":[14],"high":[15],"efficiency":[16,72],"in":[17,108,137,152,167,190],"finding":[18],"feasible":[19],"solutions.":[20],"Optimal":[21],"RRT":[22,25],"(RRT*)":[23],"improves":[24,70],"by":[26,58,77],"asymptotically":[27],"searching":[28],"the":[29,34,59,71,74,79,84,89,112,118,134,138,164,168,176],"optimal":[30,44],"solution,":[31],"however,":[32],"at":[33],"cost":[35,143,166,178],"of":[36,61,73,91,179,187],"time":[37,165,177],"consuming.":[38],"This":[39],"paper":[40],"proposes":[41],"an":[42],"efficient":[43],"algorithm":[46,120,151,181],"on":[48],"RRT*":[49,69,122,125,189],"with":[50,121],"adaptive":[51],"restricted":[52],"space,":[54],"which":[55],"inspired":[57],"tropism":[60],"plants":[62],"and":[63,104,123,126,144,162,193],"named":[64],"as":[65],"tropistic":[66],"RRT*.":[67],"Tropistic":[68],"restricting":[78],"space":[81],"to":[82],"approach":[83],"goal":[85],"position":[86],"just":[87],"like":[88],"phototropism":[90],"plants.":[92],"To":[93],"validate":[94],"our":[95,131,150,180],"proposed":[96,119],"algorithm,":[97],"we":[98,116,147],"carry":[99],"out":[100],"both":[101,191],"motion":[105,154],"experiments":[107],"2D":[109],"environments.":[110,195],"In":[111],"experiments,":[115],"compare":[117,163],"Informed":[124],"experimental":[127],"results":[128,173],"show":[129],"that":[130,175,186],"method":[132],"outperforms":[133],"other":[135],"two":[136],"convergence":[139],"rate,":[140],"final":[141],"solution":[142],"robustness.":[145],"Furthermore,":[146],"also":[148],"implement":[149],"solving":[153],"problem":[156],"nonholonomic":[159],"mobile":[160],"robot":[161,169],"navigation":[170],"process.":[171],"Compared":[172],"exhibit":[174],"much":[183],"less":[184],"than":[185],"Real-Time":[188],"static":[192],"dynamic":[194]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}