{"id":"https://openalex.org/W7124157271","doi":"https://doi.org/10.1109/icpads67057.2025.11323148","title":"PC-DPRRT*: An Efficient Method for Collaborative Multi-UAV Path Planning in 4D Spatiotemporal","display_name":"PC-DPRRT*: An Efficient Method for Collaborative Multi-UAV Path Planning in 4D Spatiotemporal","publication_year":2025,"publication_date":"2025-12-14","ids":{"openalex":"https://openalex.org/W7124157271","doi":"https://doi.org/10.1109/icpads67057.2025.11323148"},"language":null,"primary_location":{"id":"doi:10.1109/icpads67057.2025.11323148","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads67057.2025.11323148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)","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/A5123005306","display_name":"Yuxing Guo","orcid":null},"institutions":[{"id":"https://openalex.org/I125904092","display_name":"Shenyang Aerospace University","ror":"https://ror.org/02423gm04","country_code":"CN","type":"education","lineage":["https://openalex.org/I125904092"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuxing Guo","raw_affiliation_strings":["Shenyang Aerospace University,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Aerospace University,Shenyang,China","institution_ids":["https://openalex.org/I125904092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100454275","display_name":"Jiajia Li","orcid":"https://orcid.org/0000-0001-8158-3970"},"institutions":[{"id":"https://openalex.org/I125904092","display_name":"Shenyang Aerospace University","ror":"https://ror.org/02423gm04","country_code":"CN","type":"education","lineage":["https://openalex.org/I125904092"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiajia Li","raw_affiliation_strings":["Shenyang Aerospace University,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Aerospace University,Shenyang,China","institution_ids":["https://openalex.org/I125904092"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037430663","display_name":"Yang Song","orcid":"https://orcid.org/0000-0001-6787-0279"},"institutions":[{"id":"https://openalex.org/I125904092","display_name":"Shenyang Aerospace University","ror":"https://ror.org/02423gm04","country_code":"CN","type":"education","lineage":["https://openalex.org/I125904092"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yang Song","raw_affiliation_strings":["Shenyang Aerospace University,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Aerospace University,Shenyang,China","institution_ids":["https://openalex.org/I125904092"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026470237","display_name":"Yuanqiang LIU","orcid":null},"institutions":[{"id":"https://openalex.org/I125904092","display_name":"Shenyang Aerospace University","ror":"https://ror.org/02423gm04","country_code":"CN","type":"education","lineage":["https://openalex.org/I125904092"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuanqiang Liu","raw_affiliation_strings":["Shenyang Aerospace University,Shenyang,China"],"affiliations":[{"raw_affiliation_string":"Shenyang Aerospace University,Shenyang,China","institution_ids":["https://openalex.org/I125904092"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5123005306"],"corresponding_institution_ids":["https://openalex.org/I125904092"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.69305205,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"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":0.9520999789237976,"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.9520999789237976,"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/T11489","display_name":"Air Traffic Management and Optimization","score":0.012600000016391277,"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/T11133","display_name":"UAV Applications and Optimization","score":0.006899999920278788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7322999835014343},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6635000109672546},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6205999851226807},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5726000070571899},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5486999750137329},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"Obstacle avoidance","score":0.5058000087738037},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.397599995136261},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.3716999888420105}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7322999835014343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6779000163078308},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6635000109672546},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6205999851226807},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5726000070571899},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5486999750137329},{"id":"https://openalex.org/C6683253","wikidata":"https://www.wikidata.org/wiki/Q7075535","display_name":"Obstacle avoidance","level":4,"score":0.5058000087738037},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5034999847412109},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.397599995136261},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.375},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.359499990940094},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.31869998574256897},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.30239999294281006},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.29499998688697815},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2906000018119812},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.27880001068115234},{"id":"https://openalex.org/C2779669469","wikidata":"https://www.wikidata.org/wiki/Q4895508","display_name":"Battlefield","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.2687999904155731},{"id":"https://openalex.org/C2986897749","wikidata":"https://www.wikidata.org/wiki/Q231761","display_name":"Potential field","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpads67057.2025.11323148","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpads67057.2025.11323148","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 31th International Conference on Parallel and Distributed Systems (ICPADS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.5598742365837097,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W192919555","https://openalex.org/W1814533834","https://openalex.org/W1989407213","https://openalex.org/W2110144538","https://openalex.org/W2940508125","https://openalex.org/W2966735534","https://openalex.org/W3005719827","https://openalex.org/W3094167362","https://openalex.org/W3194226390","https://openalex.org/W3216907783","https://openalex.org/W4214504571","https://openalex.org/W4323361456","https://openalex.org/W4386141647","https://openalex.org/W4391468145","https://openalex.org/W4399851766","https://openalex.org/W4401067591","https://openalex.org/W4404322917"],"related_works":[],"abstract_inverted_index":{"Multi-UAV":[0],"collaborative":[1],"path":[2,9,112,125,144,180],"planning":[3],"in":[4,69,176,206,229],"dynamic":[5,163,208],"environments":[6],"requires":[7],"fast":[8],"response":[10],"and":[11,49,58,83,120,225],"strict":[12],"demand":[13],"that":[14,212],"all":[15],"UAVs":[16,193],"reach":[17],"the":[18,22,26,35,66,88,92,95,114,138,143,185,199,213],"same":[19,23],"target":[20],"at":[21],"time.":[24],"However,":[25],"vast":[27],"majority":[28],"of":[29,37,147,219,234],"existing":[30,223],"methods":[31,43,224],"fail":[32],"to":[33,53,127,137,160],"consider":[34],"scenario":[36],"multi-UAV":[38,62],"coordinated":[39],"arrival.":[40],"Moreover,":[41],"current":[42],"often":[44],"use":[45],"only":[46],"local":[47,162],"avoidance":[48,165],"global":[50,149,203],"re-planning,":[51],"leading":[52],"high":[54],"computation,":[55],"slow":[56],"response,":[57],"poor":[59],"scalability":[60,228],"for":[61,117,166],"cooperation.":[63],"To":[64],"solve":[65],"above":[67],"problems,":[68],"this":[70],"paper,":[71],"we":[72,107],"introduce":[73],"a":[74,152],"database-oriented":[75],"algorithm":[76,116,126,157,215],"PC-DPRRT*,":[77],"which":[78,101],"integrates":[79],"precomputed":[80],"deviation":[81,131,188],"paths":[82,132,170],"reverse":[84],"graph":[85],"optimization":[86],"as":[87,103],"core":[89],"solution.":[90],"First,":[91],"DPRRT*":[93],"recreates":[94],"3D":[96],"airspace":[97],"into":[98,198],"cubic":[99,173],"airblocks,":[100],"serve":[102],"spatio-temporal":[104],"indexes.":[105],"Secondly,":[106],"compute":[108],"an":[109,217],"initial":[110],"obstacle-avoidance":[111],"using":[113],"PC-DPRRT*":[115],"each":[118,134],"UAV,":[119],"then":[121],"improve":[122],"Yen's":[123],"K-shortest":[124],"pre-compute":[128],"multiple":[129],"conflictfree":[130],"from":[133],"air":[135],"cell":[136],"destination.":[139],"This":[140,190],"effectively":[141],"avoids":[142],"search":[145],"cost":[146],"subsequent":[148],"planning.":[150],"Finally,":[151],"heuristic":[153],"artificial":[154],"potential":[155],"field":[156],"is":[158,182,216],"proposed":[159],"handle":[161],"obstacle":[164],"UAVs,":[167],"guiding":[168],"conflict":[169],"toward":[171],"neighboring":[172],"airblocks.":[174],"Then,":[175],"conflict-free":[177],"cubic,":[178],"quick":[179],"switching":[181],"achieved":[183],"with":[184,231],"stored":[186],"pre-computed":[187],"paths.":[189],"strategy":[191],"reintegrates":[192],"more":[194],"quickly":[195],"encountering":[196],"obstacles":[197],"mission":[200],"planning,":[201],"avoiding":[202],"re-planning.":[204],"Experiments":[205],"simulated":[207],"battlefield":[209],"scenarios":[210,230],"show":[211],"PCDPRRT*":[214],"order":[218],"magnitude":[220],"faster":[221],"than":[222],"exhibits":[226],"better":[227],"larger":[232],"numbers":[233],"UAVs.":[235]},"counts_by_year":[],"updated_date":"2026-01-16T23:16:36.188383","created_date":"2026-01-15T00:00:00"}