Yichao Li

Mr. Yichao Li


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 March 2025 in Drones
Verified
Journal Article
Open access
PDF file
YZYuan Zheng
Yuan Zheng
YLYichao Li
Yichao Li
JCjie cheng
jie cheng
CLChenglong Li
Chenglong Li
SHShichen Hu
Shichen Hu
The rapid development of the drone industry has facilitated the emergence of concepts such as urban air mobility (UAM), driving a wave of air logistics in urban very low-level (VLL) airspace. However, existing trajectory planning algorithms do not adequately consider the ground risks and secondary conflicts arising from high-density operations in urban VLL airspace. To address these challenges, this paper proposes a two-stage hierarchical 4D trajectory planning method to minimize multiple risks. Specifically, the method consists of a risk-aware global planning module (RAGPM) for preflight trajectory planning and a non-secondary conflict local planning module (NCLPM) for in-flight conflict avoidance. Consequently, low-risk trajectory without secondary conflict can be found in complex environments with high-density operations, as illustrated by extensive experiments.

12 March 2025 in Aerospace
Verified
Journal Article
Open access
PDF file
ZZZhiYuan Zhang
ZhiYuan Zhang
YZYuan Zheng
Yuan Zheng
CLChenglong Li
Chenglong Li
BJBo Jiang
Bo Jiang
YLYichao Li
Yichao Li
The corridor network serves as an effective solution for the airspace structure safety design of UAM. However, current studies rarely account for the ground risk posed by the corridor operation and typically consider a single design objective with limited variables. In this paper, we address these gaps by considering three key factors: demand, safety, and implementation costs. The corridor network design is formulated as a multi-objective optimization problem. In practice, firstly, we define the travel time-saving rate, average population density, and total length of corridors as optimization objectives. Then, we propose a straightforward and efficient corridor network encoding scheme that supports a variable number of corridors, significantly enhancing the diversity and flexibility of corridor network designs. Finally, based on this encoding scheme, we solve the corridor network problem using the unified non-dominated sorting genetic algorithm III (U-NSGA-III). Based on a detailed analysis of the obtained Pareto front, a relatively optimal design scheme across three optimization objectives is determined. The case study conducted in Chengdu illustrates that the corridor network obtained by our method not only achieves a 37.8% reduction in ground risk and a 69.9% decrease in implementation costs, but also saves a comparable 4.7% in time relative to traditional methods.