Xiaoshan Bai

Prof. Dr. Xiaoshan Bai

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
21 April 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
Zhe ChenZhe Chen
Zhe Chen
JAJavier Alonso-Mora
Javier Alonso-Mora
XBXiaoshan Bai
Xiaoshan Bai
DHDaniel Damir Harabor
Daniel Damir Harabor
PSPeter Stuckey
Peter Stuckey
Multi-agent Pickup and Delivery (MAPD) is a challenging industrial problem where a team of robots is tasked with transporting a set of tasks, each from an initial location and each to a specified target location. Appearing in the context of automated warehouse logistics and automated mail sortation, MAPD requires first deciding which robot is assigned what task (i.e., Task Assignment or TA) followed by a subsequent coordination problem where each robot must be assigned collision-free paths so as to successfully complete its assignment (i.e., Multi-Agent Path Finding or MAPF). Leading methods in this area solve MAPD sequentially: first assigning tasks, then assigning paths. In this work we propose a new coupled method where task assignment choices are informed by actual delivery costs instead of by lower-bound estimates. The main ingredients of our approach are a marginal-cost assignment heuristic and a meta-heuristic improvement strategy based on Large Neighbourhood Search. As a further contribution, we also consider a variant of the MAPD problem where each robot can carry multiple tasks instead of just one. Numerical simulations show that our approach yields efficient and timely solutions and we report significant improvement compared with other recent methods from the literature.

25 May 2022 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
XBXiaoshan Bai
Xiaoshan Bai
ASAndrés Fielbaum Schnitzler
Andrés Fielbaum Schnitzler
MKMaximilian Kronmüller
Maximilian Kronmüller
LKLuzia Knoedler
Luzia Knoedler
JAJavier Alonso-Mora
Javier Alonso-Mora
This paper studies the multi-robot task assignment problem in which a fleet of dispersed robots needs to efficiently transport a set of dynamically appearing packages from their initial locations to corresponding destinations within prescribed time-windows. Each robot can carry multiple packages simultaneously within its capacity. Given a sufficiently large robot fleet, the objective is to minimize the robots' total travel time to transport the packages within their respective time-window constraints. The problem is shown to be NP-hard, and we design two group-based distributed auction algorithms to solve this task assignment problem. Guided by the auction algorithms, robots first distributively calculate feasible package groups that they can serve, and then communicate to find an assignment of package groups. We quantify the potential of the algorithms with respect to the number of employed robots and the capacity of the robots by considering the robots' total travel time to transport all packages. Simulation results show that the designed algorithms are competitive compared with an exact centralized Integer Linear Program representation solved with the commercial solver Gurobi, and superior to popular greedy algorithms and a heuristic distributed task allocation method.

7 August 2024 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
Ahmad AliAhmad Ali
Ahmad Ali
Inam UllahInam Ullah
Inam Ullah
Mohammad ShabazMohammad Shabaz
Mohammad Shabaz
ASAmin Sharafian
Amin Sharafian
MKMuhammad Attique Khan
Muhammad Attique Khan
LQLi Qiu
Li Qiu
Predicting traffic is the main duty of an intelligent transportation system (ITS). Precise traffic forecasts can significantly enhance the use of public funds. However, the dynamic and complex nature of spatio-temporal relationships presents significant challenges. Most current methods utilize static adjacency matrices, leading to reduced forecasting accuracy and precision. This approach fails to account for the complex spatio-temporal correlations that interact simultaneously. In order to show how different spatio-temporal correlations change over time in the traffic flow network, this study suggests a unified simultaneous Multi Fusion Graph Network (DMFGNet) model. The goal of the suggested DMFGNet model is to identify dynamic spatio-temporal linkages between various regions. Meanwhile, we propose a model, the Spatio-Temporal Attention Unit (STAU), to control the weights of neighbor aggregation. It is capable of meticulously combining spatio-temporal characteristics from different neighbors. We tested the model for both real-time and pre-processed predictions using a combination of edge and cloud infrastructure. This setup performs prediction tasks at the edge layer and conducts training in the remote cloud. This approach guarantees the use of only relevant data for model training and prediction-making, thereby boosting the system’s overall effectiveness. This approach not only optimizes resource allocation but also aids in reducing latency and enhancing the overall performance of cloud-based prediction models, potentially enhancing the capabilities of consumer technology and electronics solutions. We carefully tested and evaluated two large real-world traffic flow datasets to show that the proposed method works and is useful. The results of the tests show that the suggested model is better than the current best baseline methods. Additionally, the results demonstrate the effectiveness and usefulness of the recommended strategy.

26 February 2025 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
Ahmad AliAhmad Ali
Ahmad Ali
Inam UllahInam Ullah
Inam Ullah
SAShabir Ahmad
Shabir Ahmad
QTQi Tan
Qi Tan
JLJianqiang Li
Jianqiang Li
XBXiaoshan Bai
Xiaoshan Bai
In the context of rapidly growing city road networks, understanding complex traffic patterns and implementing effective safety monitoring through advanced Transportation Cyber-Physical Systems (T-CPS) has become increasingly challenging. This involves understanding spatial relationships and non-linear temporal associations. Accurately predicting traffic in such scenarios, particularly for long-term sequences, is challenging due to the complexity of the data. Traditional ways of predicting traffic flow use a single fixed graph structure based on location. This structure does not consider possible correlations and cannot fully capture long-term temporal relationships among traffic flow data, thereby limiting the system ability to ensure safety and reliability. To address this challenge, we propose a novel traffic prediction framework called Attention-based Spatio-temporal Multi-scale Graph Convolutional Recurrent Network (ASTMGCNet). This study introduces a novel framework designed to improve prediction accuracy in dynamic urban traffic systems by effectively capturing complex spatio-temporal correlations through multi-scale feature extraction and attention mechanisms. ASTMGCNet records changing features of space and time by combining Gated Recurrent Units (GRU) and Graph Convolutional Networks (GCN). Its design incorporates multi-scale feature extraction and dual attention mechanisms, effectively capturing informative patterns at different levels of detail. This strategic design allows ASTMGCNet to effectively capture complex spatio-temporal correlations within traffic sequences, enhancing prediction accuracy. We have tested this method on two different real-world datasets and found that ASTMGCNet predicts significantly better than other methods, demonstrating its potential to advance traffic flow prediction and improve safety and reliability in T-CPS applications.

25 July 2025 in Chaos, Solitons & Fractals
Verified
Journal Article
Closed access
Ahmad AliAhmad Ali
Ahmad Ali
HNH.M. Yasir Naeem
H.M. Yasir Naeem
ASAmin Sharafian
Amin Sharafian
LQLi Qiu
Li Qiu
ZWZongze Wu
Zongze Wu
XBXiaoshan Bai
Xiaoshan Bai

29 May 2019 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
XBXiaoshan Bai
Xiaoshan Bai
MCMing Cao
Ming Cao
WYWeisheng Yan
Weisheng Yan
SGShuzhi Ge
Shuzhi Ge
This paper studies the precedence-constrained task assignment problem for a team of heterogeneous vehicles to deliver packages to a set of dispersed customers subject to precedence constraints that specify which customers need to be visited before which other customers. A truck and a micro drone with complementary capabilities are employed where the truck is restricted to travel in a street network and the micro drone, restricted by its loading capacity and operation range, can fly from the truck to perform the last-mile package deliveries. The objective is to minimize the time to serve all the customers respecting every precedence constraint. The problem is shown to be NP-hard, and a lower bound on the optimal time to serve all the customers is constructed by using tools from graph theory. Then, integrating with a topological sorting technique, several heuristic task assignment algorithms are proposed to solve the task assignment problem. Numerical simulations show the superior performances of the proposed algorithms compared with popular genetic algorithms.