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.
We consider the problem of estimating the expected value of information (the knowledge gradient) for Bayesian learning problems where the belief model is nonlinear in the parameters. Our goal is to maximize some metric, while simultaneously learning the unknown parameters of the nonlinear belief model, by guiding a sequential experimentation process which is expensive. We overcome the problem of computing the expected value of an experiment, which is computationally intractable, by using a sampled approximation, which helps to guide experiments but does not provide an accurate estimate of the unknown parameters. We then introduce a resampling process which allows the sampled model to adapt to new information, exploiting past experiments. We show theoretically that the method converges asymptotically to the true parameters, while simultaneously maximizing our metric. We show empirically that the process exhibits rapid convergence, yielding good results with a very small number of experiments.
High-tech giants and start-ups are investing in drone technologies to provide urban air delivery service, which is expected to solve the last-mile problem and mitigate road traffic congestion. However, air delivery service will not scale up without proper traffic management for drones in dense urban environment. Currently, a range of Concepts of Operations (ConOps) for unmanned aircraft system traffic management (UTM) are being proposed and evaluated by researchers, operators, and regulators. Among these, the tube-based (or corridor-based) ConOps has emerged in operations in some regions of the world for drone deliveries and is expected to continue serving certain scenarios that with dense and complex airspace and requires centralized control in the future. Towards the tube-based ConOps, we develop a route network planning method to design routes (tubes) in a complex urban environment in this paper. In this method, we propose a priority structure to decouple the network planning problem, which is NP-hard, into single-path planning problems. We also introduce a novel space cost function to enable the design of dense and aligned routes in a network. The proposed method is tested on various scenarios and compared with other state-of-the-art methods. Results show that our method can generate near-optimal route networks with significant computational time-savings.