Han Long

Prof. Han Long


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
1 August 2023 in Neural Networks
Verified
Journal Article
Closed access
HLHan Long
Han Long
JCJingxuan Ci
Jingxuan Ci
ZGZhenyuan Guo
Zhenyuan Guo
Shiping WenShiping Wen
Shiping Wen
THTingwen Huang
Tingwen Huang

31 December 2022 in Drones
Verified
Journal Article
Open access
PDF file
XDXu Dan
Xu Dan
YGYunxiao Guo
Yunxiao Guo
ZYZhongyi Yu
Zhongyi Yu
ZWZhenfeng Wang
Zhenfeng Wang
RLRongze Lan
Rongze Lan
HLHan Long
Han Long
Flocking for fixed-Wing Unmanned Aerial Vehicles (UAVs) is an extremely complex challenge due to fixed-wing UAV’s control problem and the system’s coordinate difficulty. Recently, flocking approaches based on reinforcement learning have attracted attention. However, current methods also require that each UAV makes the decision decentralized, which increases the cost and computation of the whole UAV system. This paper researches a low-cost UAV formation system consisting of one leader (equipped with the intelligence chip) with five followers (without the intelligence chip), and proposes a centralized collision-free formation-keeping method. The communication in the whole process is considered and the protocol is designed by minimizing the communication cost. In addition, an analysis of the Proximal Policy Optimization (PPO) algorithm is provided; the paper derives the estimation error bound, and reveals the relationship between the bound and exploration. To encourage the agent to balance their exploration and estimation error bound, a version of PPO named PPO-Exploration (PPO-Exp) is proposed. It can adjust the clip constraint parameter and make the exploration mechanism more flexible. The results of the experiments show that PPO-Exp performs better than the current algorithms in these tasks.

13 October 2022 in Neural Networks
Verified
Journal Article
Closed access
JCJingxuan Ci
Jingxuan Ci
ZGZhenyuan Guo
Zhenyuan Guo
HLHan Long
Han Long
Shiping WenShiping Wen
Shiping Wen
THTingwen Huang
Tingwen Huang

13 April 2023
Verified
Book Chapter
Closed access
PDF file
YGYunxiao Guo
Yunxiao Guo
XXXinjia Xie
Xinjia Xie
RZRunhao Zhao
Runhao Zhao
CZChenglan Zhu
Chenglan Zhu
JYJiangting Yin
Jiangting Yin
HLHan Long
Han Long

18 March 2022
Verified
Book Chapter
Closed access
PDF file
ZZZhe Zhao
Zhe Zhao
YRYing Rao
Ying Rao
HLHan Long
Han Long
XSXiangdong Sun
Xiangdong Sun
ZLZhihong Liu
Zhihong Liu

4 March 2022 in arXiv
Verified
Preprint
Open access
PDF file
YGYunxiao Guo
Yunxiao Guo
HLHan Long
Han Long
XDXiaojun Duan
Xiaojun Duan
KFKaiyuan Feng
Kaiyuan Feng
MLMaochu Li
Maochu Li
XMXiaying Ma
Xiaying Ma
As an algorithm based on deep reinforcement learning, Proximal Policy Optimization (PPO) performs well in many complex tasks and has become one of the most popular RL algorithms in recent years. According to the mechanism of penalty in surrogate objective, PPO can be divided into PPO with KL Divergence (KL-PPO) and PPO with Clip function(Clip-PPO). Clip-PPO is widely used in a variety of practical scenarios and has attracted the attention of many researchers. Therefore, many variations have also been created, making the algorithm better and better. However, as a more theoretical algorithm, KL-PPO was neglected because its performance was not as good as CliP-PPO. In this article, we analyze the asymmetry effect of KL divergence on PPO's objective function , and give the inequality that can indicate when the asymmetry will affect the efficiency of KL-PPO. Proposed PPO with Correntropy Induced Metric algorithm(CIM-PPO) that use the theory of correntropy(a symmetry metric method that was widely used in M-estimation to evaluate two distributions' difference)and applied it in PPO. Then, we designed experiments based on OpenAIgym to test the effectiveness of the new algorithm and compare it with KL-PPO and CliP-PPO.