XKXiangyu Kong

Xiangyu Kong

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xiangyu Kong has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Convex MPC With Unreachable Setpoint for a Class of Affine System

    by Yunshan Deng, Yuanqing Xia, Zhongqi Sun, Yuan Zhang, Jinxian Wu, Xiangyu Kong

    We propose a convex model predictive control (MPC) scheme for a class of affine input systems to reduce the dependence on terminal components and improve real-time control capability. Artificial reference variables are introduced to handle unreachable references, and the terminal set constraint is replaced with an equality constraint. Additionally, the original non-convex problem is replaced by a second-order-cone programming problem, while considering the linearization errors. A tube is constructed to ensure that the predicted states strictly satisfy the state constraints. Moreover, we identified two types of deadlock phenomena in this scheme: one caused by the non-convex characteristics, and the other caused by a zero radius tube. These deadlock are resolved by an adding constraints, and the proposed method is applied to the setpoint tracking problem of wheeled robots. By adjusting the corresponding parameters, a safety region, known as soft obstacle-avoidance constraint, is introduced to the state constraint, which differs from traditional constraint relaxation. Simulation results validate the effectiveness of the proposed method, and the influence of parameters on closed-loop trajectories is analyzed.


  • Differential High Order Control Barrier Function-Based Safe Reinforcement Learning

    by Xiangyu Kong, Yuanqing Xia, Zhongqi Sun, Di-Hua Zhai, Yunshan Deng, Sihua Zhang

    Safe reinforcement learning (RL) aims to learn policy while also ensuring the safety constraints. An increasingly common approach is to design a safety filter based on control barrier function (CBF) or high order control barrier function (HOCBF) for the RL policy. A quadratic programming (QP) is then formulated and solved to modify the RL policy, enabling safe exploration. However, directly integrating the safety filter with RL presents two challenges: (1) the conservativeness of safe policy, and (2) potential infeasibility of the QP under bounded input constraints. These issues limit the performance of safe RL. In this letter, we introduce a differential HOCBF constraint by incorporating neural network-based penalty functions into HOCBF. Furthermore, we propose a differential HOCBF-based safe RL framework in which the penalty functions and RL policy are trained concurrently. To address conservativeness, we train penalty functions to maximize long-term rewards while preventing abrupt changes in safe action, thereby achieving ideal performance. To ensure the feasibility of the formulated QP under bounded input constraints, we calculate a set for penalty functions and prove that the feasibility is guaranteed if the learned penalty functions remain within the set. Finally, we verify the effectiveness of the proposed framework on the wheeled mobile robot navigation and obstacle avoidance task.


  • Adaptive High-Order Control Barrier Function-Based Iterative LQR for Real Time Safety-Critical Motion Planning

    by Xiangyu Kong, Wentao Ning, Yuanqing Xia, Zhongqi Sun, Huahui Xie

    This letter proposes an adaptive high-order control barrier function-based iterative linear quadratic regulator (AHOCBF-ILQR) algorithm for real time safety-critical motion planning. Firstly, we propose a HOCBF-ILQR method, where a HOCBF-based controller is designed as a safety filter of ILQR to guarantee safety. Then, to address the potential infeasibility issue in HOCBF-ILQR, AHOCBF-ILQR is proposed by introducing an auxiliary variable. In AHOCBF-ILQR, only an unconstrained optimization problem and a quadratic programming need to be solved within a sampling interval. The low computation burden significantly enhances the time efficiency of AHOCBF-ILQR. Furthermore, we provide theoretical proof of the safety and feasibility of AHOCBF-ILQR. The algorithms are tested by motion planning experiments for a wheeled mobile robot, where the robot is required to navigate around static or moving obstacles that are unknown in advance. The experimental results show that AHOCBF-ILQR can solve the control inputs within $\text{0.05}\,s$ , and ensure safety.