Qingpeng Liang
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
Research Subjects
Qingpeng Liang has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Yanzhi Wu
Southwest Jiaotong University
13 shared publications - Jiangping Hu
School of Automation Engineering, University of Electronic Science and Technology of China, Chengdu 611731, China
11 shared publications - Linsong Du
Southwest Jiaotong University
10 shared publications - Zheng Ma
Southwest Jiaotong University
8 shared publications - Lei Ma
Southwest Jiaotong University
5 shared publications - Pingzhi Fan
Southwest Jiaotong University
5 shared publications
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 299-309
Optimal Tracking Control for Markov Jump Systems via Reinforcement Learning
- 2 July 2026
- Published by Springer Nature
- p. 299-309
Optimal Tracking Control for Markov Jump Systems via Reinforcement Learning
- 9 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 19 (4) , 1157-1168
Distributed Fixed-Time Optimization of Multiagent Systems With Nonlinear Unknown Disturbances
In this article, distributed fixed-time optimization is investigated for multiagent systems (MAS) with unknown time-varying disturbances, where the global objective function is the sum of all local objective functions. The goal is to design a smooth distributed adaptive control algorithm that can collaboratively solve this optimization problem, with each node limited to accessing its neighboring states and its own nonconvex local cost function. The unknown disturbances are modeled using linearly parameterized models, and distributed adaptive laws are designed to estimate these parameters, ensuring fixed-time convergence of these estimations. A novel fixed-time distributed control method for consensus in MAS is introduced, which differs from traditional methods that rely on fractional power state feedback or signum functions (where the convergence time depends on initial conditions and the control action is nonsmooth or discontinuous). Specifically, this method is based on regular state feedback to facilitate a uniformly smooth control process. This approach is validated through simulations, demonstrating that each agent’s state converges to the optimal solution within a fixed time.
- 9 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 19 (4) , 1157-1168
Distributed Fixed-Time Optimization of Multiagent Systems With Nonlinear Unknown Disturbances
In this article, distributed fixed-time optimization is investigated for multiagent systems (MAS) with unknown time-varying disturbances, where the global objective function is the sum of all local objective functions. The goal is to design a smooth distributed adaptive control algorithm that can collaboratively solve this optimization problem, with each node limited to accessing its neighboring states and its own nonconvex local cost function. The unknown disturbances are modeled using linearly parameterized models, and distributed adaptive laws are designed to estimate these parameters, ensuring fixed-time convergence of these estimations. A novel fixed-time distributed control method for consensus in MAS is introduced, which differs from traditional methods that rely on fractional power state feedback or signum functions (where the convergence time depends on initial conditions and the control action is nonsmooth or discontinuous). Specifically, this method is based on regular state feedback to facilitate a uniformly smooth control process. This approach is validated through simulations, demonstrating that each agent’s state converges to the optimal solution within a fixed time.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 72 (1) , 130-143
Discrete Reflection Coefficients RIS for Interference Suppression in Multicast Transmissions
Reconfigurable Intelligent Surface (RIS) introduces a novel strategy for mitigating channel interference. However, the assumption of continuous reflection coefficients (CRC) in most existing studies on interference neutralization utilizing RIS is unrealistic due to hardware constraints. This work centers on interference neutralization in RIS-supported multicast transmission with the more common discrete reflection coefficients (DRC). Here, an RIS comprised of reflectors is utilized to improve the multicast channel and diminish the interference channel by designing DRC. In this context, a problem that maximizes the signal-to-interference-plus-noise ratio is defined as the attainable rate maximization by choosing the feasible DRC and a beamforming vector. First, an alternating optimization approach iteratively updates the DRC and beamforming vector. It combines Gaussian randomization with bisection search to solve feasibility problems, neutralizing interference by adjusting the interference channel without cooperator involvement. Then, for RIS-assisted multicast under millimeter-wave interference, the asymptotic behaviors of achievable rate is analyzed via the Toeplitz structure of channel covariance matrices. Last, this demonstrates that the RIS can greatly enhance the multicast rate in the presence of interference.
- 22 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Broadcasting
- Vol. 72 (1) , 130-143
Discrete Reflection Coefficients RIS for Interference Suppression in Multicast Transmissions
Reconfigurable Intelligent Surface (RIS) introduces a novel strategy for mitigating channel interference. However, the assumption of continuous reflection coefficients (CRC) in most existing studies on interference neutralization utilizing RIS is unrealistic due to hardware constraints. This work centers on interference neutralization in RIS-supported multicast transmission with the more common discrete reflection coefficients (DRC). Here, an RIS comprised of reflectors is utilized to improve the multicast channel and diminish the interference channel by designing DRC. In this context, a problem that maximizes the signal-to-interference-plus-noise ratio is defined as the attainable rate maximization by choosing the feasible DRC and a beamforming vector. First, an alternating optimization approach iteratively updates the DRC and beamforming vector. It combines Gaussian randomization with bisection search to solve feasibility problems, neutralizing interference by adjusting the interference channel without cooperator involvement. Then, for RIS-assisted multicast under millimeter-wave interference, the asymptotic behaviors of achievable rate is analyzed via the Toeplitz structure of channel covariance matrices. Last, this demonstrates that the RIS can greatly enhance the multicast rate in the presence of interference.
- 11 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (11) , 12502-12517
Priority-Based Sensing Strategy for ISAC Systems With Primary and Secondary Targets
Integrated sensing and communication (ISAC) holds significant commercial potential in future 6G. The 3GPP technical report indicates that it is crucial to prioritize the sensing services of the ISAC system to ensure the efficient execution of critical services due to resource-constrained environments. Thus, this paper investigates priority-based resource allocation in ISAC systems, where an ISAC base station (BS) simultaneously serves a communication user (CU) and detects both a primary sensing target (PST) and a secondary sensing target (SST). First, A priority criteria for this ISAC system is proposed: 1) Above all, to ensure that the Cramer-Rao bound (CRB) for PST is maintained below a threshold; 2) Following this, the CRB of the SST should be optimized, while ensuring the communication spectral efficiency is preserved. Then, based on this criterion, three cases are derived, and for each case, a distinct resource allocation problem is formulated, yielding closed-form or semi-closed-form expressions of the optimal resource allocation for each problem. Furthermore, An algorithm is also proposed to determine the occurrence of each case and provide the corresponding optimal resource allocation. In addition, system performance under each case is analyzed based on these expressions. Finally, the simulation results demonstrate the impact of the priority strategy on performance, which is consistent with the previous performance analysis.
- 11 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (11) , 12502-12517
Priority-Based Sensing Strategy for ISAC Systems With Primary and Secondary Targets
Integrated sensing and communication (ISAC) holds significant commercial potential in future 6G. The 3GPP technical report indicates that it is crucial to prioritize the sensing services of the ISAC system to ensure the efficient execution of critical services due to resource-constrained environments. Thus, this paper investigates priority-based resource allocation in ISAC systems, where an ISAC base station (BS) simultaneously serves a communication user (CU) and detects both a primary sensing target (PST) and a secondary sensing target (SST). First, A priority criteria for this ISAC system is proposed: 1) Above all, to ensure that the Cramer-Rao bound (CRB) for PST is maintained below a threshold; 2) Following this, the CRB of the SST should be optimized, while ensuring the communication spectral efficiency is preserved. Then, based on this criterion, three cases are derived, and for each case, a distinct resource allocation problem is formulated, yielding closed-form or semi-closed-form expressions of the optimal resource allocation for each problem. Furthermore, An algorithm is also proposed to determine the occurrence of each case and provide the corresponding optimal resource allocation. In addition, system performance under each case is analyzed based on these expressions. Finally, the simulation results demonstrate the impact of the priority strategy on performance, which is consistent with the previous performance analysis.
- 23 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (6) , 2742-2753
Fixed-Time Distributed Average Tracking for a Class of Nonlinear Multiagent Systems With Unity Relative Degree
This article investigates the fixed-time distributed average tracking (DAT) problem for nonlinear multiagent systems with unity relative degree under external disturbances. A distributed control framework is developed to guarantee fixed-time convergence of all agents’ outputs to the target trajectory, which is defined as the average of multiple nonlinear reference signals. The approach consists of three main components. First, a steady-state generator is introduced to reconstruct the desired trajectory. Using this generator, a distributed observer is designed to estimate the target trajectory while ensuring robustness against initialization errors. Subsequently, an observer-based output-feedback controller is developed to guarantee the convergence of each agent’s output to its corresponding reference signal within a fixed time. Through rigorous theoretical analysis, it is proved that the proposed control architecture ensures fixed-time convergence to the target trajectory, effectively solving the fixed-time DAT problem. The effectiveness of the proposed method is validated through numerical simulations.
- 23 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (6) , 2742-2753
Fixed-Time Distributed Average Tracking for a Class of Nonlinear Multiagent Systems With Unity Relative Degree
This article investigates the fixed-time distributed average tracking (DAT) problem for nonlinear multiagent systems with unity relative degree under external disturbances. A distributed control framework is developed to guarantee fixed-time convergence of all agents’ outputs to the target trajectory, which is defined as the average of multiple nonlinear reference signals. The approach consists of three main components. First, a steady-state generator is introduced to reconstruct the desired trajectory. Using this generator, a distributed observer is designed to estimate the target trajectory while ensuring robustness against initialization errors. Subsequently, an observer-based output-feedback controller is developed to guarantee the convergence of each agent’s output to its corresponding reference signal within a fixed time. Through rigorous theoretical analysis, it is proved that the proposed control architecture ensures fixed-time convergence to the target trajectory, effectively solving the fixed-time DAT problem. The effectiveness of the proposed method is validated through numerical simulations.