Yang Jin

Yang Jin

Auto-generated profile, based on publicly available information

Yang Jin

Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
8 July 2020 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
XTXiaobin Tan
Xiaobin Tan
WFWeiwei Feng
Weiwei Feng
JLJinyang Lv
Jinyang Lv
YJYang Jin
Yang Jin
ZZZhifan Zhao
Zhifan Zhao
JYJian Yang
Jian Yang
As a promising candidate for future Internet architecture, Named Data Networking (NDN) can achieve significant potential advantages over current TCP/IP based Internet in content distribution and mobility support, etc. However, the communication mode in NDN that one Interest packet for pulling one data packet is likely to incur Interest packets flooding and to cause extremely large-scale Pending Interest Table (PIT) of the NDN router, which may substantially degrade the performance of NDN. Moreover, the absence of predefined connections also induces another challenge for NDN to manage the successive and concurrent requests from consumers efficiently. In this paper, we propose flow-based NDN (f-NDN) architecture capable of supporting flow transmission mode for addressing the aforementioned challenges. In the context of f-NDN, a data flow is defined as an aggregate of data packets with the same name prefix, and a flow Interest packet is introduced to pull a data flow rather than a single data packet. The PIT, CS, and FIB are re-designed to enable f-NDN to operate at the granularity of flows. Bitmap structure aided error handling mechanism is further presented for f-NDN to deal with the flow transmission’s uncertain failures. The built-in flow support in f-NDN allows us to conceive a flow-level multi-path transmission regime for balancing the traffic in NDN network and reducing the time consumed for pulling the entire content. Weight-based flow Interest splitting algorithm and optimal rate control algorithm are both proposed for optimizing multi-path transmission. We illustrate the capability of the proposed architecture in supporting flow transmission and multi-path by implementing it in both simulator and prototype systems. The evaluation results are also presented to show its achievable performance.

6 February 2024 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
MXMeng Xu
Meng Xu
XCXinhong Chen
Xinhong Chen
YSYechao She
Yechao She
YJYang Jin
Yang Jin
JWJianping Wang
Jianping Wang
Deep Reinforcement Learning (DRL) has recently been focused on extracting more knowledge from the reward signal to improve sample efficiency. The Multi-Reward Architecture (MRA) achieves this by breaking down the original reward function into multiple sub-reward branches and training a source-specific policy branch for each one. However, existing MRAs treat all source-specific policy branches as equally important or assign a constant level of importance based on current task conditions, which hinders DRL agents from prioritizing the most important branch at different task stages. Additionally, this necessitates a manual and time-consuming reset of weights for each branch when task conditions change. Thus, it is crucial to automate the time-varying importance assignment for branches. We propose a generic MRA approach to achieve this goal, which can be applied to improve state-of-the-art (SOTA) MRA methods. Firstly, we add a policy branch corresponding to the original reward function, allowing MRA to learn from each sub-reward branch without losing the experience provided by the original reward. Then, we apply the Asynchronous Advantage Actor Critic (A3C) algorithm to learn time-varying weights for all policy branches. These weights are then shaped into a one-hot vector to select the suitable policy branch for producing an action. Extensive experiments have demonstrated that the proposed method effectively improves three SOTA MRA methods across four tasks in terms of episode reward, success rate, score difference, and episode duration.

22 February 2024 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
MXMeng Xu
Meng Xu
XCXinhong Chen
Xinhong Chen
YSYechao She
Yechao She
YJYang Jin
Yang Jin
GZGuanyi Zhao
Guanyi Zhao
JWJianping Wang
Jianping Wang
Multi-agent reinforcement learning (MARL) has proven effective in training multi-robot confrontation, such as StarCraft and robot soccer games. However, the current joint action policies utilized in MARL have been unsuccessful in recognizing and preventing actions that often lead to failures on our side. This exacerbates the cooperation dilemma, ultimately resulting in our agents acting independently and being defeated individually by their opponents. To tackle this challenge, we propose a novel joint action policy, referred to as the consensus action policy (CAP). Specifically, CAP records the number of times each joint action has caused our side to fail in the past and computes a cooperation tendency, which is integrated with each agent’sQ-value and Nash bargaining solution to determine a joint action. The cooperation tendency promotes team cooperation by selecting joint actions that have a high tendency of cooperation and avoiding actions that may lead to team failure. Moreover, the proposed CAP policy can be extended to partially observable scenarios by combining it with DeepQnetwork or actor-critic–based methods. We conducted extensive experiments to compare the proposed method with seven existing joint action policies, including four commonly used methods and three state-of-the-art methods, in terms of episode rewards, winning rates, and other metrics. Our results demonstrate that this approach holds great promise for multi-robot confrontation scenarios.

14 November 2023 in ACM Transactions on Intelligent Systems and Technology
Verified
Journal Article
Open access
MXMeng Xu
Meng Xu
YSYechao She
Yechao She
YJYang Jin
Yang Jin
JWJianping Wang
Jianping Wang
In Deep Reinforcement Learning (DRL) domain, a compound learning task is often decomposed into several sub-tasks in a divide-and-conquer manner, each trained separately and then fused concurrently to achieve the original task, referred to as policy fusion. However, the state-of-the-art (SOTA) policy fusion methods treat the importance of sub-tasks equally throughout the task process, eliminating the possibility of the agent relying on different sub-tasks at various stages. To address this limitation, we propose a generic policy fusion approach, referred to as Policy Fusion Learning with Dynamic Weights and Prior Reward (PFLDWPR), to automate the time-varying selection of sub-tasks. Specifically, PFLDWPR produces a time-varying one-hot vector for sub-tasks to dynamically select a suitable sub-task and mask the rest throughout the entire task process, enabling the fused strategy to optimally guide the agent in executing the compound task. The sub-tasks with the dynamic one-hot vector are then aggregated to obtain the action policy for the original task. Moreover, we collect sub-tasks’s rewards at the pre-training stage as a prior reward, which, along with the current reward, is used to train the policy fusion network. Thus, this approach reduces fusion bias by leveraging prior experience. Experimental results under three popular learning tasks demonstrate that the proposed method significantly improves three SOTA policy fusion methods in terms of task duration, episode reward, and score difference.

3 November 2025 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YJYang Jin
Yang Jin
RJRuiyuan Jiang
Ruiyuan Jiang
CWChengming Wang
Chengming Wang
DJDongyao Jia
Dongyao Jia
DNDong Ngoduy
Dong Ngoduy
JWJianping Wang
Jianping Wang
In shared autonomous vehicle systems (S-AVS), efficient and adaptive vehicle repositioning plays a crucial role in meeting time-varying traffic demand, typically achieved by leveraging user demand prediction. However, most existing studies treat traffic demand prediction and shared autonomous vehicle (SAV) scheduling as separate tasks, ignoring the tight interaction between the two components, such as the potential impact of scheduling results on demand prediction. Such a design lacks a deep integration for both, potentially leading to inaccurate predictions and less efficient repositioning performance. To address this issue, we propose DRiVe, an enhanced coupling design for Demand prediction and Repositioning for shared autonomous Vehicle system. Two corresponding coupling strategies are designed, differentiated by their respective coupling locations. Specifically, we consider electric SAVs and employ model predictive control (MPC) to develop the repositioning strategy, aiming to minimize the operator's repositioning costs and passenger dissatisfaction. An online traffic demand prediction mechanism is introduced to transform scheduling actions into additional traffic demand. This additional demand is then incorporated into traditional traffic demand prediction to enhance the accuracy of the final demand prediction. The numerical results indicate that the proposed DRiVe method outperforms existing approaches in reducing passenger waiting times and repositioning distances.