Cheng-Zhong Xu

Cheng-Zhong Xu

Auto-generated profile, based on publicly available information

Cheng-Zhong Xu

State Key Laboratory of IoTSC, University of Macau, Macau, Macao

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

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

Representative Publications

View All Publications
29 December 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JYJiexia Ye
Jiexia Ye
JZJuanjuan Zhao
Juanjuan Zhao
KYKejiang Ye
Kejiang Ye
CXChengzhong Xu
Chengzhong Xu
In recent years, various deep learning architectures have been proposed to solve complex challenges (e.g. spatial dependency, temporal dependency) in traffic domain, which have achieved satisfactory performance. These architectures are composed of multiple deep learning techniques in order to tackle various challenges in traffic tasks. Traditionally, convolution neural networks (CNNs) are utilized to model spatial dependency by decomposing the traffic network as grids. However, many traffic networks are graph-structured in nature. In order to utilize such spatial information fully, it's more appropriate to formulate traffic networks as graphs mathematically. Recently, various novel deep learning techniques have been developed to process graph data, called graph neural networks (GNNs). More and more works combine GNNs with other deep learning techniques to construct an architecture dealing with various challenges in a complex traffic task, where GNNs are responsible for extracting spatial correlations in traffic network. These graph-based architectures have achieved state-of-the-art performance. To provide a comprehensive and clear picture of such emerging trend, this survey carefully examines various graph-based deep learning architectures in many traffic applications. We first give guidelines to formulate a traffic problem based on graph and construct graphs from various kinds of traffic datasets. Then we decompose these graph-based architectures to discuss their shared deep learning techniques, clarifying the utilization of each technique in traffic tasks. What's more, we summarize some common traffic challenges and the corresponding graph-based deep learning solutions to each challenge. Finally, we provide benchmark datasets, open source codes and future research directions in this rapidly growing field.

14 April 2016 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Open access
ZTZhiyong Tian
Zhiyong Tian
TJTaeho Jung
Taeho Jung
YWYi Wang
Yi Wang
FZFan Zhang
Fan Zhang
LTLai Tu
Lai Tu
XLXiang-Yang Li
Xiang-Yang Li
Electric vehicle (EV) taxis have been introduced into the public transportation systems to increase EV market penetration. Different from regular taxis that can refuel in minutes, EV taxis' recharging cycles can be as long as one hour. Due to the long cycle, the bad decision on the charging station, i.e., choosing one without empty charging piles, may lead to a long waiting time of more than an hour in the worst case. Therefore, choosing the right charging station is very important to reduce the overall waiting time. Considering that the waiting time can be a nonnegligible portion to the total work hours, the decision will naturally affect the revenue of individual EV taxis. The current practice of a taxi driver is to choose a station heuristically without a global knowledge. However, the heuristical choice can be a bad one that leads to more waiting time. Such cases can be easily observed in current collected taxi data in Shenzhen, China. Our analysis shows that there exists a large room for improvement in the extra waiting time as large as 30 min/driver. In this paper, we provide a real-time charging station recommendation system for EV taxis via large-scale GPS data mining. By combining each EV taxi's historical recharging events and real-time GPS trajectories, the current operational state of each taxi is predicted. Based on this information, for an EV taxi requesting a recommendation, we can recommend a charging station that leads to the minimal total time before its recharging starts. Extensive experiments verified that our predicted time is relatively accurate and can reduce the cost time of EV taxis by 50% in Shenzhen.

12 April 2022 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
YLYongkang Li
Yongkang Li
YLYanying Lin
Yanying Lin
YWYang Wang
Yang Wang
KYKejiang Ye
Kejiang Ye
CXCheng-Zhong Xu
Cheng-Zhong Xu
Serverless computing is growing in popularity by virtue of its lightweight and simplicity of management. It achieves these merits by reducing the granularity of the computing unit to the function level. Specifically, serverless allows users to focus squarely on the function itself while leaving other cumbersome management and scheduling issues to the platform provider, who is responsible for striking a balance between high-performance scheduling and low resource cost. In this paper, we conduct a comprehensive survey of serverless computing with particular focuses on its infrastructure characteristics. Whereby some existing challenges are identified, and the associated cutting-edge solutions are analyzed. With these results, we further investigate some typical open-source frameworks and study how they address the identified challenges. Given the great advantages of serverless computing, it is expected that its deployment would dominate future cloud platforms. As such, we also envision some promising research opportunities that need to be further explored in the future. We hope that our work in this paper can inspire those researchers and practitioners who are engaged in related fields to appreciate serverless computing, thereby setting foot in this promising area and making great contributions to its developments.

18 December 2011 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
HLHaikun Liu
Haikun Liu
HJHai Jin
Hai Jin
CXCheng-Zhong Xu
Cheng-Zhong Xu
XLXiaofei Liao
Xiaofei Liao

11 August 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Yongliang YangYongliang Yang
Yongliang Yang
BKBahare Kiumarsi
Bahare Kiumarsi
HMHamidreza Modares
Hamidreza Modares
CXChengzhong Xu
Chengzhong Xu
This article presents a model-free λ-policy iteration (λ-PI) for the discrete-time linear quadratic regulation (LQR) problem. To solve the algebraic Riccati equation arising from solving the LQR in an iterative manner, we define two novel matrix operators, named the weighted Bellman operator and the composite Bellman operator. Then, the λ-PI algorithm is first designed as a recursion with the weighted Bellman operator, and its equivalent formulation as a fixed-point iteration with the composite Bellman operator is shown. The contraction and monotonic properties of the composite Bellman operator guarantee the convergence of the λ-PI algorithm. In contrast to the PI algorithm, the λ-PI does not require an admissible initial policy, and the convergence rate outperforms the value iteration (VI) algorithm. Model-free extension of the λ-PI algorithm is developed using the off-policy reinforcement learning technique. It is also shown that the off-policy variants of the λ-PI algorithm are robust against the probing noise. Finally, simulation examples are conducted to validate the efficacy of the λ-PI algorithm.

20 June 2019
Verified
Book Chapter
Closed access
PDF file
WYWensi Yang
Wensi Yang
YZYuhang Zhang
Yuhang Zhang
KYKejiang Ye
Kejiang Ye
LLLi Li
Li Li
CXCheng-Zhong Xu
Cheng-Zhong Xu