XWXinyang Wang

Xinyang Wang

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Xinyang Wang has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Reciprocal-Compensated Control Barrier Functions for Dynamic Environments With Unknown Derivatives

    by Xinyang Wang, Wei Xiao, Hongwei Zhang

    Guaranteeing safety of a control system is challenging under dynamic environments. Although environmental control barrier functions (ECBFs) have been recently proposed to handle this scenario, they typically require high-order derivatives of environmental information for safe controller synthesis. This letter proposes a new class of ECBFs, termed reciprocal-compensated ECBFs (rECBFs) to strictly guarantee safety under dynamic environments whose high-order derivatives are not available for controller design. A high-order extension of rECBFs is further proposed for constraints with arbitrary relative degree. A case study on adaptive cruise control illustrates the efficacy of the proposed approach.

  • Reinforcement Learning in Pursuit–Evasion Differential Game: Safety, Stability, and Robustness

    by Xinyang Wang, Hongwei Zhang, Jun Xu, Shimin Wang, Martin Guay

    Safety and stability are two critical concerns in pursuit-evasion (PE) problems in an obstacle-rich environment. Most existing works combine control barrier functions (CBFs) and reinforcement learning (RL) to provide an efficient and safe solution. However, they do not consider the presence of disturbances, such as wind gust and actuator fault, which exist in many practical applications. This article integrates CBFs and a sliding mode control (SMC) term into RL to simultaneously address safety, stability, and robustness. However, this integration is significantly challenging due to the strong coupling between the CBF and SMC terms. Inspired by the Stackelberg game, we handle the coupling issue by proposing a hierarchical design scheme where SMC and safe control terms interact with each other in a leader-follower manner. Specifically, the CBF controller, acting as the leader, enforces safety independently of the SMC design; while the SMC term, as the follower, is designed based on the CBF controller. We then formulate the PE problem as a zero-sum game and propose a safe, robust RL framework to learn the min-max strategy online. A sufficient condition is provided under which the proposed algorithm remains effective even when constraints are conflicting. Simulation results demonstrate the effectiveness of the proposed safe, robust RL framework.


  • Control Oriented Reinforcement Learning: A Survey of Recent Progress and Applications

    by Xinyang Wang, Hongwei Zhang, Hao Liu, Frank L. Lewis

    Modern control systems are expected not only to pursue optimality, but also to dynamically adapt to varying environments. Bridging the gap between adaptive control, optimal control, and data‐driven learning control, reinforcement learning has emerged as a computationally efficient approach to achieve adaptive optimal control of systems. This paper surveys both theoretical advancements and practical applications of control oriented reinforcement learning methods, especially adaptive dynamic programming (ADP). We discuss recent progress of ADP in several key control disciplines, including optimal control, robust control, event‐triggered control, distributed control and safe control; as well as real‐world applications of ADP in various scenarios such as unmanned vehicles, power systems, intelligent transportation, robot manipulators, and motors.


  • Strategic Learning for Disturbance Rejection in Multi‐Agent Systems: Nash and Minmax in Graphical Games

    by Xinyang Wang, Martin Guay, Shimin Wang, Hongwei Zhang

    This article investigates the optimal control problem with disturbance rejection for discrete‐time multi‐agent systems under cooperative and non‐cooperative graphical games frameworks. Given the practical challenges of obtaining accurate models, Q‐function‐based policy iteration methods are proposed to seek the Nash equilibrium solution for the cooperative graphical game and the distributed minmax solution for the non‐cooperative graphical game. To implement these methods online, two reinforcement learning frameworks are developed, an actor‐disturber‐critic structure for the cooperative graphical game and an actor‐adversary‐disturber‐critic structure for the non‐cooperative graphical game. The stability of the proposed methods is rigorously analyzed, and simulation results are provided to illustrate the effectiveness of the proposed methods.


  • Open Access

    KLF5 promotes apoptosis induced by phorbol ester as an effector of the autocrine factor TNFα in LNCaP prostate cancer cells

    by Qi Shi, Jing Jia, Ke Hui, Yang Gao, Shan Xu, Bing Guan, Xiaoshuang Tang, Xinyang Wang, Dalin He, Peng Guo

    Krüppel-like factor 5 (KLF5) is frequently deleted and inactivated in prostate cancer, and exerts tumor-suppressing function in prostate cancer cells. However, the function of KLF5 in the apoptosis of prostate cancer cells remains unclear. In the present study, the effect of KLF5 on phorbol 12-myristate 13-acetate (PMA)-induced apoptosis was investigated in prostate cancer LNCaP cells. It was demonstrated that PMA induced the expression of KLF5 at the mRNA and protein level. To identify whether KLF5 regulates the activity of the downstream pathway, stable KLF5 knockdown or overexpression cell lines were constructed with lentivirus harboring shRNA targeting KLF5 or full-length KLF5 in LNCaP cells. Knockdown of KLF5 significantly decreased PMA-induced apoptosis, while cell apoptosis was significantly increased following KLF5 overexpression compared with the corresponding control groups. Consistently, expression of cleaved poly(ADP-ribose) polymerase and caspase-3 induced by PMA was decreased following KLF5 knockdown and increased following KLF5 overexpression. Using the control medium from cells treated with PMA, it was demonstrated that KLF5 is required for the control medium to induce apoptosis. c-Jun N-terminal kinase (JNK) activity is essential for the apoptosis induced by PMA. It was revealed that knockdown of KLF5 decreased, while overexpression of KLF5 increased the phosphorylation of JNK induced by PMA and control medium treatment. Furthermore, inhibition of tumor necrosis factor α (TNFα) decreased KLF5 expression and significantly decreased cell apoptosis induced by PMA, and control medium. This data indicates that KLF5 is essential for the apoptosis induced by PMA in LNCaP prostate cancer cells. Furthermore, KLF5 is essential for activity of the autocrine factor TNFα, which is secreted by cells treated with PMA and mediates the function of PMA-induced apoptosis through regulating the activity of JNK signaling pathway. These results provide novel insights into the complexity of the signaling pathways regulating apoptosis in prostate cancer cells, which could aid in the development of novel treatments for patients with prostate cancer.


  • Open Access

    Obtaining Quality-Proved Near Optimal Results for Traveling Salesman Problem

    by Wenhong Tian, Chaojie Huang, Xinyang Wang, Qin Xiong

    The traveling salesman problem (TSP) is one of the most challenging NP-hard problems. It has widely applications in various disciplines such as physics, biology, computer science and so forth. The best known approximation algorithm for Symmetric TSP (STSP) whose cost matrix satisfies the triangle inequality (called $\triangle$STSP) is Christofides algorithm which was proposed in 1976 and is a $\frac{3}{2}$-approximation. Since then no proved improvement is made and improving upon this bound is a fundamental open question in combinatorial optimization. In this paper, for the first time, we propose Truncated Generalized Beta distribution (TGB) for the probability distribution of optimal tour lengths in a TSP. We then introduce an iterative TGB approach to obtain quality-proved near optimal approximation, i.e., (1+$\frac{1}{2}(\frac{\alpha+1}{\alpha+2})^{K-1}$)-approximation where $K$ is the number of iterations in TGB and $\alpha (>>1)$ is the shape parameters of TGB. The result can approach the true optimum as $K$ increases.