Abstract
UAS-based commercial services such as urban parcel delivery are expected to grow in the upcoming years and may lead to a large volume of UAS operations in urban areas. These flights may pose safety risks to persons and property on the ground, which are referred to as third-party risks. Path-planning methods have been developed to generate a nominal flight path for each UAS flight that poses relative low third-party risks by passing over less risky areas, e.g., areas with low-density unsheltered populations. However, it is not clear if risk minimization per flight works well in a commercial UAS operation that involves a large number of annual flights in an urban area. Recently, it has been shown that when using shortest flight path planning, a UAS-based parcel delivery service in an urban area can lead to society-critical third-party risk levels. The aim of this paper is to evaluate the mitigating effect of state-of-the-art risk-aware path planning on these society-critical third-party risk levels. To accomplish this, a third-party risk simulation using the shortest paths is extended with a state-of-the-art risk-aware path-planning method, and the societal effects on third-party risk levels have been assessed and compared to those obtained using shortest paths. The results show that state-of-the-art risk-aware path planning can reduce the total number of fatalities in an area, but at the cost of a critical increase in safety risks for persons living in areas that are favored by a state-of-the-art risk-aware path-planning method.
Funder
Hong Kong Research Grants Council
City University of Hong Kong Strategic Research Grant
Reference48 articles.
1. Circular 328-AN/190. Unmanned Aircraft Systems (UAS), 2011.
2. Kersten, H., Benedikt, K., and Robin, R. Advanced Air Mobility in 2030. 2021. 2022.
3. eVTOL/Urban Air Mobility TAM Update: A Slow Take-Off, But Sky’s the Limit. 2021. 2022.
4. A survey of motion planning algorithms from the perspective of autonomous UAV guidance;Goerzen;J. Intell. Robot. Syst.,2010
5. A note on two problems in connexion with graphs;Dijkstra;Numer. Math.,1959
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献