Aircraft departures often follow standardized and restrictive routes intended to guarantee a safe transition to the en-route network. Since the procedures must take the flight performance of many aircraft types into account, they represent a compromise between numerous optima and must be consistent with noise abatement strategies. This paper investigates the concept of departure funnels, in which flights can adopt their optimal profile within a procedural space based on actual flight performance to replace standard routes. For this, an algorithm based on DBSCAN identifies typical traffic flow funnels for a set of radar tracks as reference and individually optimized flight trajectories as preferred funnels. For the latter, an innovative 3D pathfinding grid is developed, which expands dynamically using the specific flight performance of the aircraft type and enables evaluation of operating costs due to wind and fuel consumption. From the clustered traffic flows, a funnel starting at the runway is determined based on the variance of the flight profiles along their mean trajectory. This funnel provides a restricted space for individual trajectory optimization for the day of operation. The procedure is applied using the example of Munich Airport, where the funnel size and the associated fuel-saving potential are determined. The results indicate an average fuel-saving potential of 0.4% with respect to the trip fuel.
With Unmanned Aerial Vehicles (UAV), a swift response to urgent needs like search \& rescue missions or medical deliveries can be realized. Simultaneously, the legislator is establishing so-called geographical zones, which restrict UAV operations to mitigate the air and ground risk to third parties. These geographical zones serve a particular safety interest, but they may also hinder the efficient usage of UAVs on time-critical missions with a range-limiting battery capacity. In this study, we address a facility location problem for up to two UAV hangars with a robust optimization model considering demand hotspots, geographical zones as restricted areas, a standard mission to satisfy battery capacity constraints, and the impact of wind scenarios. To this end, water rescue missions are used exemplary, for which positive and negative location factors for UAV hangars and areas of increased drowning risk as demand points are derived from open-source georeferenced data. Optimal UAV mission trajectories are computed with an A* algorithm considering five different restriction scenarios. As this pathfinding is very time-consuming, binary occupancy grids and image processing algorithms accelerate the computation by identifying either entirely inaccessible or restriction-free connections beforehand. For the optimal UAV hangar locations, we maximize accessibility while minimizing the service time to the hotspots, resulting in a decrease from the average service time of 570.4 s for all facility candidates to 351.1 s for one and 287.2 s for two optimal UAV hangar locations.
With unmanned aerial vehicle(s) (UAV), swift responses to urgent needs (such as search and rescue missions or medical deliveries) can be realized. Simultaneously, legislators are establishing so-called geographical zones, which restrict UAV operations to mitigate air and ground risks to third parties. These geographical zones serve particular safety interests but they may also hinder the efficient usage of UAVs in time-critical missions with range-limiting battery capacities. In this study, we address a facility location problem for up to two UAV hangars and combine it with a routing problem of a standard UAV mission to consider geographical zones as restricted areas, battery constraints, and the impact of wind to increase the robustness of the solution. To this end, water rescue missions are used exemplary, for which positive and negative location factors for UAV hangars and areas of increased drowning risk as demand points are derived from open-source georeferenced data. Optimum UAV mission trajectories are computed with an A* algorithm, considering five different restriction scenarios. As this pathfinding is very time-consuming, binary occupancy grids and image-processing algorithms accelerate the computation by identifying either entirely inaccessible or restriction-free connections beforehand. For the optimum UAV hangar locations, we maximize accessibility while minimizing the service times to the hotspots, resulting in a decrease from the average service time of 570.4 s for all facility candidates to 351.1 s for one and 287.2 s for two optimum UAV hangar locations.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.