Liu Yueyang

Mr. Liu Yueyang

orcid

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
21 February 2024 in Biomimetics
Verified
Journal Article
Open access
PDF file
QZQiang Zhou
Qiang Zhou
HFHouze Feng
Houze Feng
LYLiu Yueyang
Liu Yueyang
Compared to terrestrial transportation systems, the expansion of urban traffic into airspace can not only mitigate traffic congestion, but also foster establish eco-friendly transportation networks. Additionally, unmanned aerial vehicle (UAV) task allocation and trajectory planning are essential research topics for an Urban Air Mobility (UAM) scenario. However, heterogeneous tasks, temporary flight restriction zones, physical buildings, and environment prerequisites put forward challenges for the research. In this paper, multigene and improved anti-collision RRT* (IAC-RRT*) algorithms are proposed to address the challenge of task allocation and path planning problems in UAM scenarios by tailoring the chance of crossover and mutation. It is proved that multigene and IAC-RRT* algorithms can effectively minimize energy consumption and tasks’ completion duration of UAVs. Simulation results demonstrate that the strategy of this work surpasses traditional optimization algorithms, i.e., RRT algorithm and gene algorithm, in terms of numerical stability and convergence speed.

5 November 2024 in IEEE Transactions on Green Communications and Networking
Verified
Journal Article
Closed access
QZQiang Zhou
Qiang Zhou
LYLiu Yueyang
Liu Yueyang
HFHouze Feng
Houze Feng
LWLongjie Wang
Longjie Wang
Given the rapid development of unmanned aerial vehicles (UAVs) and communication technology, the applications of various low-altitude UAVs have become research hotspots in recent years. However, computation capability and power consumption have been the main reasons restricting its development. For mitigating the power consumption pressure of UAVs, we propose a novel scheme for power minimization in the intelligent reflecting surface (IRS)-assisted UAV mobile edge computing (MEC) system with rate-splitting multiple access (RSMA), where the passive reflecting units (PRUs) of IRS are divided into groups for allocation, and the split proportional indices of RSMA is dynamically designed. Furthermore, we define the power minimization problem and subsequently present a solution, namely passive reflecting group allocation and dynamic rate-splitting design (PGADRD) algorithm. By presenting the analytical solution pertaining to optimal phase manipulation and decoding sequence, the power minimization problem is simplified. Then, we partition the simplified problem into three subproblems employing the block coordinate descent method, subsequently converting these subproblems into convex subproblems utilizing the successive convex approximation technique. The optimal resource allocation and multi-UAV trajectories are obtained by alternately solving these convex subproblems. Lastly, our simulation results show that the PGADRD scheme is beneficial in reducing UAVs’ power consumption, which is more obvious with significant path attenuation and computational burdens.

12 March 2026 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
LYLiu Yueyang
Liu Yueyang
JYJinyang Yu
Jinyang Yu
WXWeiliang Xie
Weiliang Xie
QBQi Bi
Qi Bi
In this paper, we propose an optimization algorithm for passive reflecting unit (PRU) group allocation (PGA) aimed at enhancing the minimum average rate (MAR) of the intelligent reflecting surface (IRS)-assisted unmanned aerial vehicle (UAV)-enabled non-orthogonal multiple access (NOMA) communication system. First, we propose a novel IRS allocation scheme and the phase control policy, i.e., the PRUs of the IRS are grouped for allocation. Then, the MAR is maximized by jointly designing the PRU group allocation and UAV power allocation. To address the multi-variable non-convex problem, we employ the block coordinate descent (BCD) method to decompose it into two subproblems. Subsequently, the subproblems are transformed into convex problems using the successive convex approximation (SCA) technique. Simulation results demonstrate that the PGA algorithm outperforms other traditional algorithms, conventional IRS allocation (CIA) with OMA, NOMA.