Urban air mobility is an effective solution to address the current issue of ground traffic congestion in future cities. However, as the user scale continues to expand, the current civil aviation flight scheduling and control methods are becoming inadequate to meet the high-volume flight guarantee demands of future urban air transportation. In order to effectively handle and resolve potential issues in this field in the future, this paper proposes a method for planning urban air mobility route networks. The planning process is divided into two stages: construction and optimization. Methods for constructing urban air mobility route networks based on flight routes and global optimization methods based on node movement are proposed in each stage. In the construction stage, a complete construction process is designed to generate routes based on existing flight routes, in line with the trend of urban air transportation development. In the optimization stage, inspired by the ant colony algorithm, node transfer rules and information transfer rules are incorporated to design a global optimization process and algorithm for route networks. Experimental results demonstrate the effectiveness and advancement of the proposed planning method.

With the rapid advancement of unmanned aerial vehicle (UAV) technology, the widespread utilization of UAVs poses significant challenges to urban low-altitude safety and airspace management. In the coming future, the quantity of drones is expected to experience a substantial surge. Effectively regulating the flight behavior of UAVs has become an urgent and imperative issue that needs to be addressed. Hence, this paper proposes a standardized approach to UAV flight through the design of an air channel network. The air channel network comprises numerous single air channels, and this study focuses on investigating the characteristics of a single air channel. To achieve optimal outcomes, the concept of the artificial potential field algorithm is integrated into the deep Q-learning algorithm during the establishment of a single air channel. By improving the action space and reward mechanism, the resulting single air channel enables efficient avoidance of various buildings and obstacles. Finally, the algorithm is assessed through comprehensive simulation experiments, demonstrating its effective fulfillment of the aforementioned requirements.