Wei Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wei Liu has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
Fangchun Yang
School of Computer Science (National Pilot Software Engineering School), Beijing University of Posts and Telecommunications, Beijing 100876, China; State Key Laboratory of Networking and Switching Technology (Beijing University of Posts and Telecommunications), Beijing 100876, China
1 shared publication- Fangchun Yang
School of Computer Science (National Pilot Software Engineering School), Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication - Linhui Lou
School of Computer Science (National Pilot Software Engineering School), Beijing University of Posts and Telecommunications, Beijing 100876, China
1 shared publication Manzoor Ahmed
College of Computer Science and Technology, Qingdao University, Qingdao, China, Qingdao, 266071, China
1 shared publication- Muhammad Ayzed Mirza
Qilu Institute of Technology
1 shared publication Muhammad Rizwan Anwar
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China, Beijing, 100876, China
1 shared publication
Latest Publications
- 1 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 19 (11) , 282-296
An Enhanced Searching Strategy for Multi-Agent Mobile Applications
Multi-agent mobile applications play an essential role in mobile applications and have attracted more and more researchers' attention. Previous work has always focused on multi-agent applications with perfect information. Researchers are usually based on human-designed rules to provide decision-making searching services. However, existing methods for solving perfect-information mobile applications cannot be directly applied to imperfect-information mobile applications. Here, we take the Contact Bridge, a multi-agent application with imperfect information, for the case study. We propose an enhanced searching strategy to deal with multi-agent applications with imperfect information. We design a self-training bidding system model and apply a Recurrent Neural Network (RNN) to model the bidding process. The bridge system model consists of two parts, a bidding prediction system based on imitation learning to get a contract quickly and a visualization system for hands understanding to realize regular communication between players. Then, to dynamically analyze the impact of other players' unknown hands on our final reward, we design a Monte Carlo sampling algorithm based on the bidding system model (BSM) to deal with imperfect information. At the same time, a double-dummy analysis model is designed to efficiently evaluate the results of sampling. Experimental results indicate that our searching strategy outperforms the top rule-based mobile applications.
- 1 November 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in China Communications
- Vol. 19 (11) , 282-296
An Enhanced Searching Strategy for Multi-Agent Mobile Applications
Multi-agent mobile applications play an essential role in mobile applications and have attracted more and more researchers' attention. Previous work has always focused on multi-agent applications with perfect information. Researchers are usually based on human-designed rules to provide decision-making searching services. However, existing methods for solving perfect-information mobile applications cannot be directly applied to imperfect-information mobile applications. Here, we take the Contact Bridge, a multi-agent application with imperfect information, for the case study. We propose an enhanced searching strategy to deal with multi-agent applications with imperfect information. We design a self-training bidding system model and apply a Recurrent Neural Network (RNN) to model the bidding process. The bridge system model consists of two parts, a bidding prediction system based on imitation learning to get a contract quickly and a visualization system for hands understanding to realize regular communication between players. Then, to dynamically analyze the impact of other players' unknown hands on our final reward, we design a Monte Carlo sampling algorithm based on the bidding system model (BSM) to deal with imperfect information. At the same time, a double-dummy analysis model is designed to efficiently evaluate the results of sampling. Experimental results indicate that our searching strategy outperforms the top rule-based mobile applications.
- Open Access
AI Enabled Bridge Bidding Supporting Interactive Visualization
With the fast progress in perfect information game problems such as AI chess and AI Go, researchers have turned to imperfect information game problems, including Texas Hold’em and Bridge. Bridge is one of the most challenging card games that have significant research value. Bridge playing is divided into two phases: bidding and playing. This paper focuses on bridge bidding and proposes a bridge bidding service framework using deep neural networks, and supports bidding visualization for the first time. The framework consists of two parts: the bidding model (BM) with a multilayer neural network, and a visualization system. The framework predicts not only reasonable bids from the existing bidding system of humans, but also provides intuitive explanations for decisions to enable human–computer information interaction. Experimental results show that this bidding AI outperforms majority of existing systems.
Open AccessAI Enabled Bridge Bidding Supporting Interactive Visualization
With the fast progress in perfect information game problems such as AI chess and AI Go, researchers have turned to imperfect information game problems, including Texas Hold’em and Bridge. Bridge is one of the most challenging card games that have significant research value. Bridge playing is divided into two phases: bidding and playing. This paper focuses on bridge bidding and proposes a bridge bidding service framework using deep neural networks, and supports bidding visualization for the first time. The framework consists of two parts: the bidding model (BM) with a multilayer neural network, and a visualization system. The framework predicts not only reasonable bids from the existing bidding system of humans, but also provides intuitive explanations for decisions to enable human–computer information interaction. Experimental results show that this bidding AI outperforms majority of existing systems.
- Open Access
- 2 June 2020
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 9 (1) , 1-14
An efficient task offloading scheme in vehicular edge computing
Vehicular edge computing (VEC) is a promising paradigm to offload resource-intensive tasks at the network edge. Owing to time-sensitive and computation-intensive vehicular applications and high mobility scenarios, cost-efficient task offloading in the vehicular environment is still a challenging problem. In this paper, we study the partial task offloading problem in vehicular edge computing in an urban scenario. Where the vehicle computes some part of a task locally, and offload the remaining task to a nearby vehicle and to VEC server subject to the maximum tolerable delay and vehicle’s stay time. To make it cost-efficient, including the cost of the required communication and computing resources, we consider to fully exploit the vehicular available resources. We estimate the transmission rates for the vehicle to vehicle and vehicle to infrastructure communication based on practical assumptions. Moreover, we present a mobility-aware partial task offloading algorithm, taking into account the task allocation ratio among the three parts given by the communication environment conditions. Simulation results validate the efficient performance of the proposed scheme that not only enhances the exploitation of vehicular computation resources but also minimizes the overall system cost in comparison to baseline schemes.
- 2 June 2020
- Published by Springer Nature in Journal of Cloud Computing
- Vol. 9 (1) , 1-14
Open AccessAn efficient task offloading scheme in vehicular edge computing
Vehicular edge computing (VEC) is a promising paradigm to offload resource-intensive tasks at the network edge. Owing to time-sensitive and computation-intensive vehicular applications and high mobility scenarios, cost-efficient task offloading in the vehicular environment is still a challenging problem. In this paper, we study the partial task offloading problem in vehicular edge computing in an urban scenario. Where the vehicle computes some part of a task locally, and offload the remaining task to a nearby vehicle and to VEC server subject to the maximum tolerable delay and vehicle’s stay time. To make it cost-efficient, including the cost of the required communication and computing resources, we consider to fully exploit the vehicular available resources. We estimate the transmission rates for the vehicle to vehicle and vehicle to infrastructure communication based on practical assumptions. Moreover, we present a mobility-aware partial task offloading algorithm, taking into account the task allocation ratio among the three parts given by the communication environment conditions. Simulation results validate the efficient performance of the proposed scheme that not only enhances the exploitation of vehicular computation resources but also minimizes the overall system cost in comparison to baseline schemes.