Jiping Luo

Jiping Luo

Auto-generated profile, based on publicly available information

Jiping Luo

Department of Computer and Information Science, Linkping University, Linkping, Sweden

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
22 February 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
JLJiping Luo
Jiping Luo
Tingting ZhangTingting Zhang
Tingting Zhang
RHRui Hao
Rui Hao
DLDonglin Li
Donglin Li
CCChunsheng Chen
Chunsheng Chen
Qinyu ZhangQinyu Zhang
Qinyu Zhang
Cooperative coordination at unsignalized road intersections, which aims to improve the driving safety and traffic throughput for connected and automated vehicles (CAVs), has attracted increasing interests in recent years. However, most existing investigations either suffer from computational complexity or cannot harness the full potential of the road infrastructure. To this end, we first present a dedicated intersection coordination framework, where the involved vehicles hand over their control authorities and follow instructions from a centralized coordinator. Then a unified cooperative trajectory planning problem will be formulated to maximize the traffic throughput while ensuring driving safety. To address the key computational challenges in the real-world deployment, we reformulate this non-convex sequential decision-making problem into a model-free Markov Decision Process (MDP) and tackle it by devising a Twin Delayed Deep Deterministic Policy Gradient (TD3)-based strategy in the deep reinforcement learning (DRL) framework. Simulation and practical experiments show that the proposed strategy could achieve near-optimal performance in sub-static coordination scenarios and significantly improve the traffic throughput in the realistic continuous traffic flow. The most remarkable advantage is that our strategy could reduce the time complexity of computation to milliseconds, and is shown scalable when the road lanes increase.

20 May 2025 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JLJiping Luo
Jiping Luo
Nikolaos PappasNikolaos Pappas
Nikolaos Pappas
This paper studies the remote estimation of multiple Markov sources over a lossy and rate-constrained channel. Unlike most existing studies that treat all source states equally, we exploit the semantics of information and consider that the remote actuator has different tolerances for the estimation errors. We aim to find an optimal scheduling policy that minimizes the long-term state-dependent costs of estimation errors under a transmission frequency constraint. The optimal scheduling problem is formulated as a constrained Markov decision process (CMDP). We show that the optimal Lagrangian cost follows a piece-wise linear and concave (PWLC) function, and the optimal policy is, at most, a randomized mixture of two simple deterministic policies. By exploiting the structural results, we develop a new intersection search algorithm that finds the optimal policy using only a few iterations. We further propose a reinforcement learning (RL) algorithm to compute the optimal policy without knowing a priori the channel and source statistics. To avoid the “curse of dimensionality” in MDPs, we propose an online low-complexity drift-plus-penalty (DPP) algorithm. Numerical results show that continuous transmission is inefficient, and remarkably, our semantic-aware policies can attain the optimum by strategically utilizing fewer transmissions by exploiting the timing of the important information.

1 August 2022 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYi Cai
Yi Cai
SWShaohua Wu
Shaohua Wu
JLJiping Luo
Jiping Luo
JJJian Jiao
Jian Jiao
NZNing Zhang
Ning Zhang
Qinyu ZhangQinyu Zhang
Qinyu Zhang
With the growing interest in the smart ocean, the satellite-based marine Internet of Remote Things (IoRT) network has been regarded as a promising architecture for sensory data collection and transmission in infrastructure-limited offshore areas. In this article, we investigate the access control problem in the context of GEO/LEO heterogeneous IoRT networks, where multiple gateways are deployed to collect data generated by IoRT devices and then forward them to the terrestrial data center via satellite links. However, most existing access control strategies shed light on the traditional network performance (i.e., transmission delay and communication throughput) in single-layer satellite networks (i.e., low-Earth orbit (LEO) layer or geosynchronous orbit (GEO) layer), whereas the interplay between LEO and GEO layers and the freshness of information are rarely considered. To this end, we first formulate an age-oriented access control problem to minimize the long-term peak Age of Information (AoI) and transform it into a model-free Markov decision process (MDP). Then, a Deep-Double-Dueling- $Q$ -Learning (D3QN) policy is trained offline and can be deployed online to make decisions according to dynamic data arrivals and time-varying channels. Simulation results show that the proposed strategy significantly outperforms the state-of-the-art ones in terms of the long-term AoI performance. Furthermore, our strategy could make cooperative decisions for gateways and obtain a proper tradeoff between satellites on different layers.

3 July 2025 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
JLJiping Luo
Jiping Luo
Nikolaos PappasNikolaos Pappas
Nikolaos Pappas
This paper considers the semantics-aware remote state estimation of an asymmetric Markov chain with prioritized states. Due to resource constraints, the sensor needs to trade off estimation quality against communication cost. The aim is to exploit the significance of information through the history of system realizations to determine the optimal timing of transmission, thereby reducing the amount of uninformative data transmitted in the network. To this end, we introduce a new metric, the significance-aware Age of Consecutive Error (AoCE), that captures three semantic attributes: the significance of estimation error, the cost of consecutive error (or lasting impact, for short), and the urgency of lasting impact. Different costs and non-linear age functions are assigned to different estimation errors to account for their relative importance to system performance. We identify the optimal transmission problem as a countably infinite state Markov decision process (MDP) with unbounded costs. We first give sufficient conditions on the age functions, source pattern, and channel reliability so that an optimal policy exists to have bounded average costs. We show that the optimal policy exhibits a switching structure. That is, the sensor triggers a transmission only when the system has been trapped in an error for a certain number of consecutive time slots. We also provide sufficient conditions under which the switching policy degenerates into a simple threshold policy, i.e., featuring identical thresholds for all estimation errors. Furthermore, we exploit the structural results and develop a structured policy iteration (SPI) algorithm that considerably reduces computation overhead. Numerical results show that the optimal policy outperforms the classic rule-, distortion- and age-based policies. An important takeaway is that the more semantic attributes we utilize, the fewer transmissions are needed.

18 October 2023 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
JLJiping Luo
Jiping Luo
Tingting ZhangTingting Zhang
Tingting Zhang
Qinyu ZhangQinyu Zhang
Qinyu Zhang
In this paper, we investigate cooperative vehicle coordination for connected and automated vehicles (CAVs) at unsignalized intersections. To support high traffic throughput while reducing computational complexity, we present a novel collision region model and decompose the optimal coordination problem into two sub-problems: centralized priority scheduling and distributed trajectory planning. Then, we propose a bi-level coordination framework which includes: (i) a Monte Carlo Tree Search (MCTS)-based high-level priority scheduler aims to find high-quality passing orders to maximize traffic throughput, and (ii) a priority-based low-level trajectory planner that generates optimal collision-free control inputs. Simulation results demonstrate that our bi-level strategy achieves near-optimal coordination performance, comparable to state-of-the-art centralized strategies, and significantly outperform the traffic signal control systems in terms of traffic throughput. Moreover, our approach exhibits good scalability, with computational complexity scaling linearly with the number of vehicles.

14 October 2024
Verified
Conference Paper
Open access
JLJiping Luo
Jiping Luo
Nikolaos PappasNikolaos Pappas
Nikolaos Pappas
We consider the remote estimation of a discrete-state Markov source with normal and alarm states. Data significance is revealed via two semantic attributes: 1) Erroneously announcing a normal state at the destination when the source is actually in an alarm state (i.e., missed alarm error) incurs a significantly higher cost than falsely announcing an alarm state when the source is in a normal state (i.e., false alarm error). 2) Successive reception of an estimation error may cause significant lasting impact, e.g., maintenance cost and wrong operations. Motivated by this, we assign different costs to different estimation errors and introduce two new age metrics, namely the Age of Missed Alarm (AoMA) and the Age of False Alarm (AoFA), to account for the lasting impact incurred by different estimation errors. We aim to achieve an optimal trade-off between the cost of estimation error, lasting impact, and communication utilization. The problem is formulated as an infinite-state Markov decision process (MDP). We show that the optimal policy exhibits a switching structure, i.e., triggering transmissions only when the AoMA or AoFA exceeds a threshold. Numerical results underscore that our approach significantly reduces the amount of less important information transmitted in the networks.