Zongming Jing

Zongming Jing

Auto-generated profile, based on publicly available information

Zongming Jing

School of College of Software, Northeastern University, Shenyang, China

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
6 February 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZGZhen Gao
Zhen Gao
JFJiaming Fu
Jiaming Fu
ZJZongming Jing
Zongming Jing
YDYu Dai
Yu Dai
LYLei Yang
Lei Yang
Existing joint trajectory planning and task offloading (JTPTO) methods provide ultra-low latency services for mobile devices (MDs) in unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC). However, UAVs typically provide services to MDs under partial observation, leading to challenges in achieving optimal service performance due to information loss. Moreover, the JTPTO problem typically involves multi-objective optimization, which is challenging because the objectives may conflict with each other. In this paper, we present a decentralized JTPTO method based on Multi-Objective and Independently Predicted Communication Multi-Agent Actor-Critic (MOIPCMAAC). First, an IPC network is designed to facilitate UAV agents in learning a prior for communication between UAVs. UAV agents learn this prior through causal reasoning, which represents the mapping of UAV’s observation to the level of confidence in choosing communication partners. The effect of one UAV on another UAV is predicted through the critic-network in multi-agent reinforcement learning (MARL) and measured to indicate the necessity of UAV-UAV communication. Further, we regularize JTPTO policies to more effectively utilize exchanged messages. Second, a generalized variant of the Bellman optimality operator with multiple objectives is applied to address the JTPTO problem. We use it to learn a single parameterized expression that encompasses all the best JTPTO policies across the space of preferences. Experiments show that compared to existing solutions, MOIPC-MAAC reduces system costs by 14.23%~19.56% and the communication cost to approximately 11.23%. Moreover, compared to training from scratch, MOIPC-MAAC accelerates the adaptation of new JTPTO tasks with unknown preferences by 13.12%.

23 January 2004
Verified
Conference Paper
Closed access
HCH.J. Chao
H.J. Chao
SLSoung-Yue Liew
Soung-Yue Liew
ZJZ. Jing
Z. Jing
In this paper, we present a new dual-level matching algorithm for 3-stage Clos-network packet switches, called d-MAC. Using a two-level matching algorithm, namely module-level matching and port-level matching, d-MAC is highly scalable and maintains high system performance. The module-level matching is responsible for finding the module-to-module matching according to the queue status of the switch, while the port-level matching is responsible for determining port-to-port matching and route assignment simultaneously. The two-level matchings are computed in a pipelined and parallel manner to speed up packet scheduling.