{"id":"https://openalex.org/W2989176665","doi":"https://doi.org/10.12985/ksaa.2019.27.2.001","title":"Improvement of RRT*-Smart Algorithm for Optimal Path Planning and Application of the Algorithm in 2 & 3-Dimension Environment","display_name":"Improvement of RRT*-Smart Algorithm for Optimal Path Planning and Application of the Algorithm in 2 & 3-Dimension Environment","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2989176665","doi":"https://doi.org/10.12985/ksaa.2019.27.2.001","mag":"2989176665"},"language":"en","primary_location":{"id":"doi:10.12985/ksaa.2019.27.2.001","doi":"https://doi.org/10.12985/ksaa.2019.27.2.001","is_oa":true,"landing_page_url":"https://doi.org/10.12985/ksaa.2019.27.2.001","pdf_url":"http://www.jksaa.org/download/download_pdf?pid=jksaa-27-2-1","source":{"id":"https://openalex.org/S4210206010","display_name":"Journal of the Korean Society for Aviation and Aeronautics","issn_l":"1225-9705","issn":["1225-9705","2466-1791"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Korean Society for Aviation and Aeronautics","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"http://www.jksaa.org/download/download_pdf?pid=jksaa-27-2-1","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113886359","display_name":"Hyeong-Tae Tak","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hyeong-Tae Tak","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113715300","display_name":"Cheon-Geon Park","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cheon-Geon Park","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100676173","display_name":"Sang\u2010Chul Lee","orcid":"https://orcid.org/0000-0002-6973-2416","observed_orcids":["https://orcid.org/0000-0002-6973-2416","https://orcid.org/0000-0002-6241-7392"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sang-Chul Lee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8092,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.70505415,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":98},"biblio":{"volume":"27","issue":"2","first_page":"1","last_page":"8"},"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/2207","display_name":"Control and Systems Engineering"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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.0,"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"}},{"id":"https://openalex.org/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0,"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/rrt","display_name":"RRT*","score":0.8939999938011169},{"id":"https://openalex.org/keywords/optimal-path-planning","display_name":"optimal path planning","score":0.8999999761581421},{"id":"https://openalex.org/keywords/sampling-based-motion-planning","display_name":"sampling-based motion planning","score":0.8349999785423279},{"id":"https://openalex.org/keywords/biased-sampling","display_name":"biased sampling","score":0.9829999804496765},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.8960000276565552},{"id":"https://openalex.org/keywords/autonomous-navigation","display_name":"autonomous navigation","score":0.6930000185966492},{"id":"https://openalex.org/keywords/high-dimensional-environments","display_name":"high-dimensional environments","score":0.7409999966621399},{"id":"https://openalex.org/keywords/path-optimization","display_name":"path optimization","score":0.7350000143051147}],"concepts":[{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.8189024925231934},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6335656642913818},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6225263476371765},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6199050545692444},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5389685034751892},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5039803385734558},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.49283814430236816},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.44354793429374695},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44189831614494324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2568609416484833},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1873939335346222},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.09564056992530823},{"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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.12985/ksaa.2019.27.2.001","doi":"https://doi.org/10.12985/ksaa.2019.27.2.001","is_oa":true,"landing_page_url":"https://doi.org/10.12985/ksaa.2019.27.2.001","pdf_url":"http://www.jksaa.org/download/download_pdf?pid=jksaa-27-2-1","source":{"id":"https://openalex.org/S4210206010","display_name":"Journal of the Korean Society for Aviation and Aeronautics","issn_l":"1225-9705","issn":["1225-9705","2466-1791"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Korean Society for Aviation and Aeronautics","raw_type":"journal-article"},{"id":"mag:3171412344","doi":null,"is_oa":false,"landing_page_url":"http://dspace.kci.go.kr/handle/kci/805547","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"doi:10.12985/ksaa.2019.27.2.001","doi":"https://doi.org/10.12985/ksaa.2019.27.2.001","is_oa":true,"landing_page_url":"https://doi.org/10.12985/ksaa.2019.27.2.001","pdf_url":"http://www.jksaa.org/download/download_pdf?pid=jksaa-27-2-1","source":{"id":"https://openalex.org/S4210206010","display_name":"Journal of the Korean Society for Aviation and Aeronautics","issn_l":"1225-9705","issn":["1225-9705","2466-1791"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":["kci-registered"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Korean Society for Aviation and Aeronautics","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321320","display_name":"Korea Aerospace University","ror":"https://ror.org/05jmm0651"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2989176665.pdf","grobid_xml":"https://content.openalex.org/works/W2989176665.grobid-xml"},"referenced_works_count":6,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1481356306","https://openalex.org/W2040195814","https://openalex.org/W2142156433","https://openalex.org/W2158970477","https://openalex.org/W2557741120"],"related_works":["https://openalex.org/W6982580294","https://openalex.org/W1620919054","https://openalex.org/W4392878903","https://openalex.org/W4324118986","https://openalex.org/W2142156433","https://openalex.org/W3171412344","https://openalex.org/W4410388151","https://openalex.org/W2076162824","https://openalex.org/W7096889021","https://openalex.org/W4395679256"],"abstract_inverted_index":{"Optimal":[0],"path":[1,41,56],"planning":[2,42],"refers":[3],"to":[4,9,22,44,51,64,81],"find":[5],"the":[6,10,36,77,83,88],"safe":[7],"route":[8],"destination":[11],"at":[12],"a":[13,17],"low":[14],"cost,":[15],"is":[16,91],"major":[18],"problem":[19],"with":[20],"regard":[21],"autonomous":[23],"navigation.":[24],"Sampling":[25],"Based":[26],"Planning(SBP)":[27],"approaches,":[28],"such":[29],"as":[30,93],"Rapidly-exploring":[31],"Random":[32],"Tree":[33],"Star(RRT*),":[34],"are":[35],"most":[37],"influential":[38],"algorithm":[39],"in":[40,102],"due":[43],"their":[45],"relatively":[46],"small":[47],"calculations":[48],"and":[49,58,100,117],"scalability":[50],"high-dimensional":[52],"problems.":[53],"RRT*-Smart":[54,99],"introduced":[55],"optimization":[57],"biased":[59,78],"sampling":[60,79],"techniques":[61],"into":[62],"RRT*":[63,116],"increase":[65,82],"convergent":[66,85,113],"rate.":[67],"This":[68],"paper":[69],"presents":[70],"an":[71],"improvement":[72],"plan":[73],"that":[74],"has":[75],"changed":[76],"method":[80],"initial":[84,112],"rate":[86,114],"of":[87],"RRT*-Smart,":[89],"which":[90],"specified":[92],"mRRT*-Smart.":[94],"With":[95],"comparison":[96],"among":[97],"RRT*,":[98],"mRRT*-Smart":[101,107],"2":[103],"&":[104],"3-D":[105],"environments,":[106],"showed":[108],"similar":[109],"or":[110],"increased":[111],"than":[115],"RRT*-Smart.":[118]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2019-11-22T00:00:00"}