Xin-Hai Xia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xin-Hai Xia has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
Fucheng Zheng
Guangzhou Maritime University
1 shared publication- Haopeng Deng
Guangzhou Maritime University
1 shared publication - Jun Cheng
GuangZhou Marine College
1 shared publication Kaixiang Ma
Guangzhou Maritime University
1 shared publicationLun-Hui Xu
School of Civil Engineering and Transportation
1 shared publicationQiang Luo
School of Civil Engineering and Transportation
1 shared publication
Latest Publications
- Open Access
- 3 June 2025
- Published by Springer Nature in Research Square
Adaptive Truncated Schatten Norm for Traffic Data Imputation with Complex Missing Patterns
Accurate traffic data imputation is essential for Intelligent Transportation Systems (ITS), particularly under complex missing patterns. This study presents the Adaptive and Truncated Schatten Norm Low-Rank Tensor Completion (LRTC-ATSN) model, which employs the flexible Schatten norm for low-rank approximation and introduces an adaptive truncation mechanism to suppress noise and retain core features. To address non-convex optimization, the model integrates the Adan algorithm with Nesterov momentum, achieving equilibrium between computational efficiency and recovery precision through dynamic parameter tuning. To evaluate performance, a framework was designed to simulate diverse real-world traffic scenarios with mixed missing patterns. Extensive experiments on datasets from Guangzhou and Seattle demonstrate that LRTC-ATSN outperforms existing methods, yielding 10.6% lower MAPE and 6.1% lower RMSE relative to the best baseline model. Even with 95.85% data loss, the model maintains high reliability. These results underscore LRTC-ATSN’s potential for enhancing ITS data robustness and applications across domains like finance and healthcare.
- 3 June 2025
- Published by Springer Nature in Research Square
Open AccessAdaptive Truncated Schatten Norm for Traffic Data Imputation with Complex Missing Patterns
Accurate traffic data imputation is essential for Intelligent Transportation Systems (ITS), particularly under complex missing patterns. This study presents the Adaptive and Truncated Schatten Norm Low-Rank Tensor Completion (LRTC-ATSN) model, which employs the flexible Schatten norm for low-rank approximation and introduces an adaptive truncation mechanism to suppress noise and retain core features. To address non-convex optimization, the model integrates the Adan algorithm with Nesterov momentum, achieving equilibrium between computational efficiency and recovery precision through dynamic parameter tuning. To evaluate performance, a framework was designed to simulate diverse real-world traffic scenarios with mixed missing patterns. Extensive experiments on datasets from Guangzhou and Seattle demonstrate that LRTC-ATSN outperforms existing methods, yielding 10.6% lower MAPE and 6.1% lower RMSE relative to the best baseline model. Even with 95.85% data loss, the model maintains high reliability. These results underscore LRTC-ATSN’s potential for enhancing ITS data robustness and applications across domains like finance and healthcare.
- 7 July 2018
- Published by Springer Nature
- p. 239-251
Adaptive Traffic Signal Coordinated Timing Decision for Adjacent Intersections with Chicken Game
- 7 July 2018
- Published by Springer Nature
- p. 239-251
Adaptive Traffic Signal Coordinated Timing Decision for Adjacent Intersections with Chicken Game
- 13 October 2015
- Published by Atlantis Press SARL
- p. 137-146
Model of Container Port’s Alliance Under the Perspective of Cooperative Game
- 13 October 2015
- Published by Atlantis Press SARL
- p. 137-146
Model of Container Port’s Alliance Under the Perspective of Cooperative Game
- Open Access
- 21 November 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-10
The Study of Reinforcement Learning for Traffic Self-Adaptive Control under Multiagent Markov Game Environment
Urban traffic self-adaptive control problem is dynamic and uncertain, so the states of traffic environment are hard to be observed. Efficient agent which controls a single intersection can be discovered automatically via multiagent reinforcement learning. However, in the majority of the previous works on this approach, each agent needed perfect observed information when interacting with the environment and learned individually with less efficient coordination. This study casts traffic self-adaptive control as a multiagent Markov game problem. The design employs traffic signal control agent (TSCA) for each signalized intersection that coordinates with neighboring TSCAs. A mathematical model for TSCAs’ interaction is built based on nonzero-sum markov game which has been applied to let TSCAs learn how to cooperate. A multiagent Markov game reinforcement learning approach is constructed on the basis of single-agentQ-learning. This method lets each TSCA learn to update itsQ-values under the joint actions and imperfect information. The convergence of the proposed algorithm is analyzed theoretically. The simulation results show that the proposed method is convergent and effective in realistic traffic self-adaptive control setting.
- 21 November 2013
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2013, 1-10
Open AccessThe Study of Reinforcement Learning for Traffic Self-Adaptive Control under Multiagent Markov Game Environment
Urban traffic self-adaptive control problem is dynamic and uncertain, so the states of traffic environment are hard to be observed. Efficient agent which controls a single intersection can be discovered automatically via multiagent reinforcement learning. However, in the majority of the previous works on this approach, each agent needed perfect observed information when interacting with the environment and learned individually with less efficient coordination. This study casts traffic self-adaptive control as a multiagent Markov game problem. The design employs traffic signal control agent (TSCA) for each signalized intersection that coordinates with neighboring TSCAs. A mathematical model for TSCAs’ interaction is built based on nonzero-sum markov game which has been applied to let TSCAs learn how to cooperate. A multiagent Markov game reinforcement learning approach is constructed on the basis of single-agentQ-learning. This method lets each TSCA learn to update itsQ-values under the joint actions and imperfect information. The convergence of the proposed algorithm is analyzed theoretically. The simulation results show that the proposed method is convergent and effective in realistic traffic self-adaptive control setting.
- 29 November 2012
- Published by Springer Nature
- p. 539-548
Integration of Agent-Based Logistic Operation for Container Terminal
- 29 November 2012
- Published by Springer Nature
- p. 539-548
Integration of Agent-Based Logistic Operation for Container Terminal