Guannan Qu

Guannan Qu

Auto-generated profile, based on publicly available information

Guannan Qu

College of Computer Science and Technology, Jilin University, Changchun, China

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
24 February 2020 in IEEE Access
Verified
Journal Article
Open access
SLShuang Liang
Shuang Liang
ZFZhiyi Fang
Zhiyi Fang
GSGeng Sun
Geng Sun
YLYanheng Liu
Yanheng Liu
GQGuannan Qu
Guannan Qu
YZYing Zhang
Ying Zhang
Antenna arrays are able to improve the directivity performance and reduce the cost of wireless communication systems. However, how to reduce the maximum sidelobe level (SLL) of the beam pattern is a key problem in antenna arrays. In this paper, three kinds of antenna arrays that are linear antenna array (LAA), circular antenna array (CAA) and random antenna array (RAA) are investigated. First, we formulate the SLL suppression optimization problems of LAA, CAA and RAA, respectively. Then, we propose a novel method called improved chicken swarm optimization (ICSO) approach to solve the formulated optimization problems. ICSO introduces four enhanced strategies including the local search factor, weighting factor and global search factor into the update method of conventional chicken swarm optimization (CSO) algorithm, respectively, for achieving better beam pattern optimization results of antenna arrays. Moreover, a variation mechanism is proposed to enhance the population diversity so that further improving the performance of the algorithm. We conduct simulations to evaluate the performance of the proposed ICSO for the maximum SLL suppressions of LAAs, CAAs and RAAs, and the results show that ICSO obtains lower maximum SLLs for different antenna array cases with different numbers of antenna elements compared to several other algorithms.

17 October 2019 in IEEE Access
Verified
Journal Article
Open access
SLShuang Liang
Shuang Liang
ZFZhiyi Fang
Zhiyi Fang
GSGeng Sun
Geng Sun
YLYanheng Liu
Yanheng Liu
XZXiaohui Zhao
Xiaohui Zhao
Victor C. M. LeungVictor C. M. Leung
Victor C. M. Leung

15 January 2026 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
GSGeng Sun
Geng Sun
CLChenbang Liu
Chenbang Liu
JLJiahui Li
Jiahui Li
GQGuannan Qu
Guannan Qu
SLShuang Liang
Shuang Liang
DNDusit Niyato
Dusit Niyato
Unmanned aerial vehicle (UAV) swarms utilizing collaborative beamforming (CB) in low-altitude wireless networks (LAWN) demonstrate significant potential for enhanced communication range, energy efficiency, and signal directivity through the formation of virtual antenna arrays (VAA). However, environmental disturbances, particularly wind fields, significantly degrade CB performance by introducing positional errors that disrupt beam patterns, thereby compromising transmission reliability. This paper investigates the critical challenge of maintaining CB performance in UAV-based VAAs operating in LAWN under wind field disturbances. We propose a comprehensive framework that models the impact of three distinct wind conditions (constant, shear, and turbulent) on UAV array performance, and formulate a long-term real-time optimization problem to maximize directivity while minimizing maximum sidelobe levels through adaptive excitation current weight adjustments. To address the inherent complexity of this problem, we propose a novel proximal policy optimization algorithm with long short-term memory (LSTM) structure and adaptive learning rate (PPO-LA), which effectively captures temporal patterns in wind field disturbances and enables real-time adaptation without requiring extensive prior training for specific wind conditions. Our simulation results demonstrate that the proposed PPO-LA algorithm successfully recovers degraded CB performance across various wind scenarios, and thus significantly outperforming benchmark algorithms.

1 January 2013
Verified
Book Chapter
Closed access
PDF file
JZJianfei Zhang
Jianfei Zhang
ZFZhiyi Fang
Zhiyi Fang
GQGuannan Qu
Guannan Qu
XZXiaohui Zhao
Xiaohui Zhao
SZS. Q. Zheng
S. Q. Zheng

12 September 2022 in arXiv
Verified
Preprint
Open access
PDF file
SSSungho Shin
Sungho Shin
YLYiheng Lin
Yiheng Lin
GQGuannan Qu
Guannan Qu
AWAdam Wierman
Adam Wierman
MAMihai Anitescu
Mihai Anitescu
This paper studies the trade-off between the degree of decentralization and the performance of a distributed controller in a linear-quadratic control setting. We study a system of interconnected agents over a graph and a distributed controller, called $\kappa$-distributed control, which lets the agents make control decisions based on the state information within distance $\kappa$ on the underlying graph. This controller can tune its degree of decentralization using the parameter $\kappa$ and thus allows a characterization of the relationship between decentralization and performance. We show that under mild assumptions, including stabilizability, detectability, and a subexponentially growing graph condition, the performance difference between $\kappa$-distributed control and centralized optimal control becomes exponentially small in $\kappa$. This result reveals that distributed control can achieve near-optimal performance with a moderate degree of decentralization, and thus it is an effective controller architecture for large-scale networked systems.

3 June 2022 in arXiv
Verified
Preprint
Open access
PDF file
TLTongxin Li
Tongxin Li
RYRuixiao Yang
Ruixiao Yang
GQGuannan Qu
Guannan Qu
YLYiheng Lin
Yiheng Lin
SLSteven Low
Steven Low
AWAdam Wierman
Adam Wierman
Machine-learned black-box policies are ubiquitous for nonlinear control problems. Meanwhile, crude model information is often available for these problems from, e.g., linear approximations of nonlinear dynamics. We study the problem of equipping a black-box control policy with model-based advice for nonlinear control on a single trajectory. We first show a general negative result that a naive convex combination of a black-box policy and a linear model-based policy can lead to instability, even if the two policies are both stabilizing. We then propose an adaptive $\lambda$-confident policy, with a coefficient $\lambda$ indicating the confidence in a black-box policy, and prove its stability. With bounded nonlinearity, in addition, we show that the adaptive $\lambda$-confident policy achieves a bounded competitive ratio when a black-box policy is near-optimal. Finally, we propose an online learning approach to implement the adaptive $\lambda$-confident policy and verify its efficacy in case studies about the CartPole problem and a real-world electric vehicle (EV) charging problem with data bias due to COVID-19.