Yan Cao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yan Cao has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Teng Long
School of Aerospace Engineering, Beijing Institute of Technology, Beijing, China
3 shared publications - Zhu Wang
Baoding Key Laboratory of Intelligent Robot Perception and Control in Electric Power System,and department of Automation, North China Electric Power University, Baoding, China
3 shared publications - Guangtong Xu
Huzhou Institute, Zhejiang University, Huzhou, China
2 shared publications - Jingliang Sun
School of Aerospace Engineering, Beijing Institute of Technology, Beijing, China
2 shared publications - Changbo Ke
School of Computer Science, Nanjing University of Posts and Telecommunications, Nanjing, Jiangsu, China
1 shared publication Guangtong Xu
1 shared publication
Latest Publications
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (2) , 1928-1935
Comparison of Distributed Task Allocation Algorithms Considering Non-Ideal Communication Factors for Multi-UAV Collaborative Visit Missions
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.
- 17 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 10 (2) , 1928-1935
Comparison of Distributed Task Allocation Algorithms Considering Non-Ideal Communication Factors for Multi-UAV Collaborative Visit Missions
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 November 2022
- Published by Elsevier in ISA Transactions
- Vol. 136, 715-726
Real-time multi-quadrotor trajectory generation via distributed receding architecture and hierarchical planning in complex environments
- 28 November 2022
- Published by Elsevier in ISA Transactions
- Vol. 136, 715-726
Real-time multi-quadrotor trajectory generation via distributed receding architecture and hierarchical planning in complex environments
- Open Access
- 1 July 2022
- Published by Elsevier in Chinese Journal of Aeronautics
- Vol. 35 (7) , 113-127
Adaptive event-triggered distributed optimal guidance design via adaptive dynamic programming
- 1 July 2022
- Published by Elsevier in Chinese Journal of Aeronautics
- Vol. 35 (7) , 113-127
Open AccessAdaptive event-triggered distributed optimal guidance design via adaptive dynamic programming
- 28 February 2022
- Published by Elsevier in Information Processing & Management
- Vol. 59 (3) , 102908
Discovering the influences of the patent innovations on the stock market
- 28 February 2022
- Published by Elsevier in Information Processing & Management
- Vol. 59 (3) , 102908
Discovering the influences of the patent innovations on the stock market
- 3 January 2020
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 14 (4) , 1-16
A topology and risk-aware access control framework for cyber-physical space
- 3 January 2020
- Published by Springer Nature in Frontiers of Computer Science
- Vol. 14 (4) , 1-16
A topology and risk-aware access control framework for cyber-physical space
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5380-5385
Aircraft route planning for stealth penetration based on sparse A* search
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.
- 1 May 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 5380-5385
Aircraft route planning for stealth penetration based on sparse A* search
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.