{"id":"https://openalex.org/W4312991110","doi":"https://doi.org/10.1145/3560470.3560481","title":"Path Planning Algorithm for UAV Based on Smooth Rapidly Exploring Random Tree","display_name":"Path Planning Algorithm for UAV Based on Smooth Rapidly Exploring Random Tree","publication_year":2022,"publication_date":"2022-05-06","ids":{"openalex":"https://openalex.org/W4312991110","doi":"https://doi.org/10.1145/3560470.3560481"},"language":"en","primary_location":{"id":"doi:10.1145/3560470.3560481","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3560470.3560481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Human Machine Interaction (ICHMI)","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/A5070020885","display_name":"Jinming Hu","orcid":"https://orcid.org/0000-0001-6010-0730"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jinming Hu","raw_affiliation_strings":["School of Electronics and Communication Engineering, Sun Yat-sen University, China"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Communication Engineering, Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052499671","display_name":"Kai Xie","orcid":"https://orcid.org/0000-0003-0953-8248"},"institutions":[{"id":"https://openalex.org/I157773358","display_name":"Sun Yat-sen University","ror":"https://ror.org/0064kty71","country_code":"CN","type":"education","lineage":["https://openalex.org/I157773358"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Kai Xie","raw_affiliation_strings":["School of Electronics and Communication Engineering, Sun Yat-sen University, China"],"affiliations":[{"raw_affiliation_string":"School of Electronics and Communication Engineering, Sun Yat-sen University, China","institution_ids":["https://openalex.org/I157773358"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070020885"],"corresponding_institution_ids":["https://openalex.org/I157773358"],"apc_list":null,"apc_paid":null,"fwci":0.1006,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.40857249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"79","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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":0.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12288","display_name":"Optimization and Search Problems","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/random-tree","display_name":"Random tree","score":0.8416581153869629},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.771390438079834},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7231840491294861},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.6988394856452942},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6556919813156128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6553192138671875},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6252027750015259},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5812571048736572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5225405097007751},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4618581235408783},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22012674808502197},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17614829540252686}],"concepts":[{"id":"https://openalex.org/C2776839635","wikidata":"https://www.wikidata.org/wiki/Q14942679","display_name":"Random tree","level":4,"score":0.8416581153869629},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.771390438079834},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7231840491294861},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.6988394856452942},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6556919813156128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6553192138671875},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6252027750015259},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5812571048736572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5225405097007751},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4618581235408783},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22012674808502197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17614829540252686},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"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.1145/3560470.3560481","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3560470.3560481","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Human Machine Interaction (ICHMI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"No poverty","score":0.5,"id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2048023556","https://openalex.org/W2501076807","https://openalex.org/W2866122684","https://openalex.org/W6605295560"],"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/W1660309994","https://openalex.org/W2118356379"],"abstract_inverted_index":{"To":[0],"overcome":[1],"the":[2,33,36,55,59,66,86,89,94,97],"difficulties":[3],"of":[4,35,62,79,88],"poor":[5],"real-time":[6],"performance":[7,101],"in":[8,29,54],"UAV":[9,49],"path":[10,37],"planning,":[11],"a":[12,21,44],"smooth":[13],"Rapidly":[14,70],"Exploring":[15,71],"Random":[16,72],"Tree(RRT)":[17],"algorithm":[18,39,90],"based":[19],"on":[20],"priori":[22,45],"sampling":[23],"and":[24,102],"cost":[25],"function":[26],"is":[27,52,82,91],"proposed":[28],"this":[30],"paper.":[31],"Thus":[32],"convergence":[34,100],"planning":[38,103],"can":[40,74],"be":[41],"accelerated.":[42],"The":[43],"information":[46],"such":[47],"as":[48],"dynamics":[50,80],"constraints":[51,81],"used":[53],"method":[56],"to":[57],"optimize":[58],"search":[60],"space":[61],"expansion":[63],"points,":[64],"so":[65],"problem":[67],"that":[68],"original":[69],"Tree":[73],"hardly":[75],"make":[76],"full":[77],"use":[78],"solved.":[83],"At":[84],"last,":[85],"feasibility":[87],"verified":[92],"by":[93],"simulation.":[95],"Moreover,":[96],"operation":[98],"efficiency,":[99],"capability":[104],"are":[105],"all":[106],"improved.":[107]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}