Dijkstra算法
兴旺的
匹配(统计)
商业化
还原(数学)
计算机科学
方案(数学)
路径(计算)
降低成本
运动规划
运筹学
运输工程
最短路径问题
实时计算
工程类
图形
业务
人工智能
数学
计算机网络
统计
机器人
数学分析
社会科学
几何学
理论计算机科学
营销
社会学
作者
Kai Zhou,Kai Wang,Yuhao Wang,Xiaobo Qu
摘要
Abstract Multifarious applications of unmanned aerial vehicles (UAVs) are thriving in extensive fields and facilitating our lives. However, the potential third‐party risks (TPRs) on the ground are neglected by developers and companies, which limits large‐scale commercialization. Risk assessment is an efficacious method for mitigating TPRs before undertaking flight tasks. This article incorporates the probability of UAV crashing into the TPR assessment model and employs an A* path‐planning algorithm to optimize the trade‐off between operational TPR cost and economic cost, thereby maximizing overall benefits. Experiments demonstrate the algorithm outperforms both the best‐first‐search algorithm and Dijkstra's algorithm. In comparison with the path with the least distance, initially, the trade‐off results in a increase in distance while achieving an reduction in TPR. As the trade‐off progresses, this relationship shifts, leading to a reduction in the distance with only a negligible increase in TPR by 0.0001, matching the TPR‐cost‐based algorithm. Furthermore, we conduct simulations on the configuration of UAV path networks in five major cities in China based on real‐world travel data and building data. Results reveal that the networks consist of one‐way paths that are staggered in height. Moreover, in coastal cities particularly, the networks tend to extend over the sea, where the TPR cost is trivial.
科研通智能强力驱动
Strongly Powered by AbleSci AI