{"id":"https://openalex.org/W4312826859","doi":"https://doi.org/10.1109/tase.2022.3225821","title":"TargetTree-RRT*: Continuous-Curvature Path Planning Algorithm for Autonomous Parking in Complex Environments","display_name":"TargetTree-RRT*: Continuous-Curvature Path Planning Algorithm for Autonomous Parking in Complex Environments","publication_year":2022,"publication_date":"2022-12-05","ids":{"openalex":"https://openalex.org/W4312826859","doi":"https://doi.org/10.1109/tase.2022.3225821"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2022.3225821","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3225821","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/A5100362682","display_name":"Minsoo Kim","orcid":"https://orcid.org/0000-0003-2300-1279"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Minsoo Kim","raw_affiliation_strings":["DYROS Laboratory, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea"],"raw_orcid":"https://orcid.org/0000-0003-2300-1279","affiliations":[{"raw_affiliation_string":"DYROS Laboratory, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026382364","display_name":"Joonwoo Ahn","orcid":"https://orcid.org/0000-0001-6217-1356"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Joonwoo Ahn","raw_affiliation_strings":["DYROS Laboratory, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea"],"raw_orcid":"https://orcid.org/0000-0001-6217-1356","affiliations":[{"raw_affiliation_string":"DYROS Laboratory, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031070386","display_name":"Jaeheung Park","orcid":"https://orcid.org/0000-0002-5062-8264"},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]},{"id":"https://openalex.org/I4210120602","display_name":"Advanced Institute of Convergence Technology","ror":"https://ror.org/01w62yz22","country_code":"KR","type":"facility","lineage":["https://openalex.org/I139264467","https://openalex.org/I4210120602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jaeheung Park","raw_affiliation_strings":["DYROS Laboratory, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea","Advanced Institutes of Convergence Technology (AICT), Suwon, South Korea"],"raw_orcid":"https://orcid.org/0000-0002-5062-8264","affiliations":[{"raw_affiliation_string":"DYROS Laboratory, Graduate School of Convergence Science and Technology, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467"]},{"raw_affiliation_string":"Advanced Institutes of Convergence Technology (AICT), Suwon, South Korea","institution_ids":["https://openalex.org/I4210120602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.914,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.94773741,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"21","issue":"1","first_page":"606","last_page":"617"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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/T12707","display_name":"Vehicle License Plate Recognition","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"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.791377067565918},{"id":"https://openalex.org/keywords/random-tree","display_name":"Random tree","score":0.6067385673522949},{"id":"https://openalex.org/keywords/curvature","display_name":"Curvature","score":0.5950853824615479},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5923895835876465},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.574383556842804},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5138412117958069},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4979369640350342},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4725113809108734},{"id":"https://openalex.org/keywords/discontinuity","display_name":"Discontinuity (linguistics)","score":0.4551307260990143},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4519592523574829},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.33009421825408936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2662551999092102},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2348310351371765},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.09951239824295044}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.791377067565918},{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.6067385673522949},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.5950853824615479},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5923895835876465},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.574383556842804},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5138412117958069},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4979369640350342},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4725113809108734},{"id":"https://openalex.org/C2777042112","wikidata":"https://www.wikidata.org/wiki/Q5281658","display_name":"Discontinuity (linguistics)","level":2,"score":0.4551307260990143},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4519592523574829},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.33009421825408936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2662551999092102},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2348310351371765},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09951239824295044},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tase.2022.3225821","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2022.3225821","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.6700000166893005,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W82705568","https://openalex.org/W1544016679","https://openalex.org/W1570402058","https://openalex.org/W1965958007","https://openalex.org/W1971086298","https://openalex.org/W1979426683","https://openalex.org/W1996183429","https://openalex.org/W2008929839","https://openalex.org/W2060854363","https://openalex.org/W2061626909","https://openalex.org/W2110762409","https://openalex.org/W2112271657","https://openalex.org/W2133066324","https://openalex.org/W2163385431","https://openalex.org/W2345973286","https://openalex.org/W2562830346","https://openalex.org/W2739483405","https://openalex.org/W2739637850","https://openalex.org/W2741758001","https://openalex.org/W2783485394","https://openalex.org/W2791468499","https://openalex.org/W2895830705","https://openalex.org/W2902241648","https://openalex.org/W2909908358","https://openalex.org/W2914872182","https://openalex.org/W2970911366","https://openalex.org/W3005523007","https://openalex.org/W3015470607","https://openalex.org/W3022310485","https://openalex.org/W3036279515","https://openalex.org/W3082946196","https://openalex.org/W3092350077","https://openalex.org/W3136885705","https://openalex.org/W3193992130","https://openalex.org/W3198919602","https://openalex.org/W4205668268","https://openalex.org/W6640616170"],"related_works":["https://openalex.org/W1991478428","https://openalex.org/W2797949337","https://openalex.org/W3158818664","https://openalex.org/W4388720133","https://openalex.org/W2372633663","https://openalex.org/W2863424594","https://openalex.org/W2564325388","https://openalex.org/W2108906364","https://openalex.org/W2371294653","https://openalex.org/W1660309994"],"abstract_inverted_index":{"Rapidly-exploring":[0],"random":[1],"tree":[2,45,109,136],"(RRT)":[3],"has":[4],"been":[5,235],"studied":[6,236],"for":[7,31,103,147,218,267,272,311],"autonomous":[8,219,269,335,349],"parking":[9,36,50,61,76,295,313,320,325],"as":[10,66,159,348],"it":[11,67,74,259],"quickly":[12,182],"finds":[13,289],"an":[14,247],"initial":[15,248],"path":[16,33,158,215,249,266,291,326,360],"and":[17,71,145,176,183,194,213,250,274,315],"is":[18,110,129,331],"easily":[19,251],"scalable":[20],"in":[21,34,52,86,166,223,228,237,256],"complex":[22,87,104,229],"environments.":[23,105,230,306],"However,":[24,65],"the":[25,32,40,43,82,100,122,148,151,160,171,207,241,268,279,285,357,369],"planning":[26,41,83,123,198,216,232,245,361],"time":[27,84,124,162,262],"increases":[28,85],"by":[29,94,206,292],"searching":[30,146],"narrow":[35],"spots.":[37],"To":[38,277],"reduce":[39,121],"time,":[42],"target":[44,108,135],"algorithm,":[46],"which":[47],"substitutes":[48],"a":[49,55,107,126,133,156,211,265,290,294,298,318],"goal":[51,296,358],"RRT":[53,144],"with":[54,142,184,240,297,365],"set":[56,299],"(target":[57],"tree)":[58],"of":[59,69,79,197,243,246,300,359],"backward":[60,89],"paths,":[62,73,368],"was":[63,204],"proposed.":[64],"consists":[68],"circular":[70],"straight":[72],"deteriorates":[75],"accuracy":[77],"because":[78],"curvature-discontinuity.":[80,118],"Moreover,":[81],"environments;":[88],"paths":[90,114,178,303],"can":[91,338,362,372],"be":[92,339,363,373],"blocked":[93],"obstacles.":[95,139],"Therefore,":[96],"this":[97,238,282],"paper":[98],"introduces":[99],"TargetTree-RRT*":[101,153,286,307],"algorithm":[102,154,217,330,371],"First,":[106],"designed":[111],"using":[112,191],"clothoid":[113],"to":[115,120,131,201,209,263,323,334,341],"address":[116,278],"such":[117,347],"Second,":[119],"further,":[125],"cost":[127],"function":[128],"defined":[130],"initialize":[132],"proper":[134],"that":[137,170],"considers":[138],"By":[140],"integrating":[141],"optimal-variant":[143],"shortest":[149],"path,":[150,321],"proposed":[152,329,370],"obtains":[155,317],"near-optimal":[157,319],"sampling":[161],"increases.":[163],"Experiment":[164],"results":[165],"real":[167,312],"environments":[168,225],"showed":[169],"vehicle":[172,270],"parked":[173],"more":[174,181],"accurately,":[175],"continuous-curvature":[177,302],"were":[179],"obtained":[180],"higher":[185],"success":[186],"rates":[187],"than":[188],"those":[189],"acquired":[190],"other":[192,195,324,342],"sampling-based":[193],"types":[196],"algorithms.":[199],"Note":[200],"Practitioners\u2014This":[202],"work":[203],"motivated":[205],"need":[208],"develop":[210],"fast":[212],"practical":[214],"parking,":[220],"not":[221,332],"only":[222],"simple":[224],"but":[226],"also":[227],"Sampling-based":[231],"algorithms":[233],"have":[234],"area,":[239],"advantages":[242],"rapid":[244],"reflecting":[252],"vehicle\u2019s":[253],"constraints.":[254],"Nevertheless,":[255],"cluttered":[257,305],"environments,":[258],"needs":[260],"considerable":[261],"obtain":[264],"easy":[271],"tracking":[273],"precise":[275],"parking.":[276],"aforementioned":[280],"issue,":[281],"article":[283],"presents":[284],"algorithm.":[287],"It":[288,337],"replacing":[293],"pre-defined":[301],"considering":[304],"achieves":[308],"better":[309],"performance":[310],"scenarios":[314],"rapidly":[316],"compared":[322],"planners.":[327],"The":[328],"limited":[333],"vehicles.":[336],"applied":[340],"unmanned":[343],"vehicles":[344,351],"or":[345],"robots,":[346],"underwater":[350],"(AUVs).":[352],"In":[353],"any":[354],"application":[355],"where":[356],"replaced":[364],"predefined":[366],"standardized":[367],"extended.":[374]},"counts_by_year":[{"year":2026,"cited_by_count":15},{"year":2025,"cited_by_count":26},{"year":2024,"cited_by_count":11},{"year":2023,"cited_by_count":5}],"updated_date":"2026-07-16T13:24:37.021932","created_date":"2025-10-10T00:00:00"}