Yan Cao

Yan Cao

Auto-generated profile, based on publicly available information

Yan Cao

School of Aerospace Engineering, Beijing Institute of Technology, Beijing, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
1 July 2022 in Chinese Journal of Aeronautics
Verified
Journal Article
Open access
TLTeng Long
Teng Long
YCYan Cao
Yan Cao
JSJingliang Sun
Jingliang Sun
GXGuangtong Xu
Guangtong Xu

17 July 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YCYan Cao
Yan Cao
TLTeng Long
Teng Long
JSJingliang Sun
Jingliang Sun
ZWZhu Wang
Zhu Wang
GXGuangtong Xu
Guangtong Xu
This letter comprehensively investigates the performance of six state-of-art distributed task allocation algorithms (i.e., CBAA, CBBA, HIPC, PI, DHBA, and DGA) subject to non-ideal communication factors. The package loss, bit error, and time delay factors are considered in the distributed task allocation process. The performance of the algorithms for multi-UAV collaborative visit missions is compared under pre-allocation and dynamic allocation scenarios. The synchronous and asynchronous communication modes are separately utilized in different allocation scenarios for analyzing the effects of non-ideal communication factors. Comparison results show that bit error factors cause conflicted allocations. For the pre-allocation scenario, CBBA outperforms the competitors in terms of reliability, communication overhead, and efficiency. For the dynamic scenario, CBBA performs best optimality, while DHBA exhibits better reliability and lower overhead in harsh communication conditions.

28 February 2022 in Information Processing & Management
Verified
Journal Article
Closed access
WLWeidong Liu
Weidong Liu
ZYZhiwei Yang
Zhiwei Yang
YCYan Cao
Yan Cao
JHJinchen Huo
Jinchen Huo

3 January 2020 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
YCYan Cao
Yan Cao
ZHZhiqiu Huang
Zhiqiu Huang
YYYaoshen Yu
Yaoshen Yu
CKChangbo Ke
Changbo Ke
ZWZihao Wang
Zihao Wang


1 May 2017
Verified
Conference Paper
Closed access
YCYan Cao
Yan Cao
TLTeng Long
Teng Long
ZWZhu Wang
Zhu Wang
Xiaohong CHENXiaohong CHEN
Xiaohong CHEN
JWJiabo Wang
Jiabo Wang
LLLi Liu
Li Liu
To reduce the radar detection probability of the aircraft during penetration, the sparse A* search considering the radar cross section (RCS) distribution characteristic is proposed for route planning. Firstly, the aircraft RCS model and the radar detection probability model are established by considering the attitude and space position of the aircraft. Two kinds of turning modes are studied (the maximum overload mode and the minimum roll angle mode) considering the kinematics constraints of the aircraft. The minimization of radar detection probability and route length are taken as two cost functions. Then the sparse A* search algorithm is applied to get the satisfied route. Finally, the results of Monte Carlo simulation show that the route planned by the proposed method can navigate the aircraft to reach the target with low detection probability, and the comparison results show that the penetration performance of the minimum roll angle turning mode is better than that of the maximum overload turning mode.