Urban environments, characterized by high population density and intricate infrastructures, are susceptible to a range of emergencies such as fires and traffic accidents. Optimal placement and distribution of fire stations and ambulance centers are thus imperative for safeguarding both life and property. An investigation into the distribution inefficiencies of emergency service facilities in selected districts of Chengdu reveals that imbalanced distribution of these facilities results in suboptimal response times during critical incidents. To address this challenge, a two-stage clustering method, incorporating X-means and K-means algorithms, is employed to identify optimal number and locations for Unmanned Aerial Vehicle (UAV) fire stations and drone ambulance centers. A Mixed-Integer Linear Programming (MILP) model is subsequently constructed and solved using the Gurobi optimization platform. Bayesian optimization-a machine learning technique-is exploited to elucidate the interplay between response speed and service capacity of these UAV-based emergency service stations under an optimized layout. Results affirm that integration of MILP and machine learning provides a robust framework for solving complex problems related to the siting and allocation of emergency service facilities. The proposed hybrid algorithm demonstrates substantial potential for enhancing emergency preparedness and response in urban settings.
Urban ultra-low altitude airspace (ULAA) presents unique challenges for unmanned aerial vehicle (UAV) path planning due to high building density and regulatory constraints. This study analyzes and improves classical path planning algorithms for UAVs in ULAA. Experiments were conducted using A*, RRT, RRT*, and artificial potential field (APF) methods in a simulated environment based on building data from Chengdu City, China. Results show that traditional algorithms struggle in dense obstacle environments, particularly APF due to local minima issues. Enhancements were proposed: a density-aware heuristic for A*, random perturbation for APF, and a hybrid optimization strategy for RRT*. These modifications improved computation time, path length, and obstacle avoidance. The study provides insights into the limitations of classical algorithms and suggests enhancements for more effective UAV path planning in urban environments.
Urban ultra-low altitude airspace (ULAA) presents unique challenges for unmanned aerial vehicle (UAV) path planning due to high building density and regulatory constraints. This study analyzes and improves classical path planning algorithms for UAVs in ULAA. Experiments were conducted using A*, RRT, RRT*, and artificial potential field (APF) methods in a simulated environment based on building data from Chengdu City, China. Results show that traditional algorithms struggle in dense obstacle environments, particularly APF due to local minima issues. Enhancements were proposed: a density-aware heuristic for A*, random perturbation for APF, and a hybrid optimization strategy for RRT*. These modifications improved computation time, path length, and obstacle avoidance. The study provides insights into the limitations of classical algorithms and suggests enhancements for more effective UAV path planning in urban environments.