Francis C. M. Lau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Francis C. M. Lau has a total of 125 co-authors. Here are the top co-authors by number of shared publications:
- Cho-Li Wang
Department of Computer Science, The University of Hong Kong, Hong Kong, China
7 shared publications - Haisheng Tan
School of Computer Science and Technology, University of Science and Technology of China, Hefei, China
7 shared publications - Yupeng Li
Department of Interactive Media, Hong Kong Baptist University, Hong Kong, China
6 shared publications Chuan Wu
Department of Computer Science The University of Hong Kong
5 shared publications- Dacheng Wen
Department of Interactive Media, Hong Kong Baptist University, Hong Kong, China and School of Computing and Data Science, The University of Hong Kong, Hong Kong, China
5 shared publications - Dongxiao Yu
Shandong University
5 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2922-2930
Novel Claim or Déjà Vu? Rethinking 'Contamination-Free' Dynamic Evaluation for Multimodal Automated Fact-Checking
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 2922-2930
Open AccessNovel Claim or Déjà Vu? Rethinking 'Contamination-Free' Dynamic Evaluation for Multimodal Automated Fact-Checking
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8851-8861
Debating Truth: Debate-driven Claim Verification with Multiple Large Language Model Agents
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 8851-8861
Open AccessDebating Truth: Debate-driven Claim Verification with Multiple Large Language Model Agents
- 11 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4345-4360
Fairness-Aware Online Pricing for Profit Maximization in Ride-Sharing
Ride-sharing represents a sustainable transportation paradigm that is beneficial to human, society, and environment. Common ride-sharing pricing approaches determine prices for riders through optimizing one or more figures of merit, e.g., the profit or revenue. However, they overlook an important issue— fairness—which, when perceived by the riders, can critically affect their degree of satisfaction. In this work, we take the initiative to consider an intuitive and appropriate notion of individual fairness called fairness-in-hindsight for riders in ride-sharing pricing. We study the problem of online fair pricing of shared rides (which allow multiple riders to share one ride) with an aim to maximize the profit of the ride-sharing operator/platform. We design an online fair ride-sharing pricing algorithm called OnFairRP, which comprises phases of learning, transition, and exploitation. We prove that OnFairRP has a sub-linear regret bound and can guarantee the fairness between riders. Our extensive performance evaluations using real-world data traces of ride-sharing demonstrate the advantages of OnFairRP over benchmarking schemes including commonly used methods with or without fairness guarantee.
- 11 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 4345-4360
Fairness-Aware Online Pricing for Profit Maximization in Ride-Sharing
Ride-sharing represents a sustainable transportation paradigm that is beneficial to human, society, and environment. Common ride-sharing pricing approaches determine prices for riders through optimizing one or more figures of merit, e.g., the profit or revenue. However, they overlook an important issue— fairness—which, when perceived by the riders, can critically affect their degree of satisfaction. In this work, we take the initiative to consider an intuitive and appropriate notion of individual fairness called fairness-in-hindsight for riders in ride-sharing pricing. We study the problem of online fair pricing of shared rides (which allow multiple riders to share one ride) with an aim to maximize the profit of the ride-sharing operator/platform. We design an online fair ride-sharing pricing algorithm called OnFairRP, which comprises phases of learning, transition, and exploitation. We prove that OnFairRP has a sub-linear regret bound and can guarantee the fairness between riders. Our extensive performance evaluations using real-world data traces of ride-sharing demonstrate the advantages of OnFairRP over benchmarking schemes including commonly used methods with or without fairness guarantee.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 7678-7693
Online Linear Optimization With Possibly Arbitrary Machine-Learned Predictions Across All and Sub-Linear Rounds
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Networking
- Vol. 34, 7678-7693
Online Linear Optimization With Possibly Arbitrary Machine-Learned Predictions Across All and Sub-Linear Rounds
- Open Access
- 7 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 3779-3794
An Experimental Study of Passive UAV Tracking With Digital Arrays and Cellular Downlink Signals
Given the prospects of the low-altitude economy (LAE) and the popularity of unmanned aerial vehicles (UAVs), there are increasing demands on monitoring flying objects at low altitude in wide urban areas. In this work, the widely deployed long-term evolution (LTE) base station (BS) is exploited to illuminate UAVs in bistatic trajectory tracking. Specifically, a passive sensing receiver with two digital antenna arrays is proposed and developed to capture both the line-of-sight (LoS) signal and the scattered signal off a target UAV. From their cross ambiguity function, the bistatic range, Doppler shift and angle-of-arrival (AoA) of the target UAV can be detected in a sequence of time slots. In order to address missed detections and false alarms of passive sensing, a target tracking framework is adopted to track the trajectory of the target UAV. It is demonstrated by experiments that the proposed UAV tracking system can achieve a meter-level accuracy.
- 7 April 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 6, 3779-3794
Open AccessAn Experimental Study of Passive UAV Tracking With Digital Arrays and Cellular Downlink Signals
Given the prospects of the low-altitude economy (LAE) and the popularity of unmanned aerial vehicles (UAVs), there are increasing demands on monitoring flying objects at low altitude in wide urban areas. In this work, the widely deployed long-term evolution (LTE) base station (BS) is exploited to illuminate UAVs in bistatic trajectory tracking. Specifically, a passive sensing receiver with two digital antenna arrays is proposed and developed to capture both the line-of-sight (LoS) signal and the scattered signal off a target UAV. From their cross ambiguity function, the bistatic range, Doppler shift and angle-of-arrival (AoA) of the target UAV can be detected in a sequence of time slots. In order to address missed detections and false alarms of passive sensing, a target tracking framework is adopted to track the trajectory of the target UAV. It is demonstrated by experiments that the proposed UAV tracking system can achieve a meter-level accuracy.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (5) , 7997-8011
FedCars: An Efficient Scheduling Framework for In-Vehicle Federated Learning Integrated With CARLA-Cosimulation
Federated learning on vehicles has been widely considered in autonomous driving. The model uploading of federated learning is time-consuming, which motivates the transmission optimization that exploits the mobility of vehicles. In this paper, an optimization framework integrated with the high-fidelity traffic simulator CARLA, namely FedCars, is proposed for the scheduling of model uploading in a Vehicle-to-Infrastructure (V2I) network. Specifically, a group of data collection vehicles (DCVs) move along their planned routes with random velocities to collect sensor data and train a model via federated learning, where the uplink model transmission of multiple DCVs in one learning iteration is jointly optimized. We first develop the FedCars simulator from CARLA, to obtain a high-fidelity trajectory dataset of DCVs in the considered traffic scenario, and train the transition probabilities of the DCVs' locations. Hence, the uplink transmission time and power of all DCVs in all the time slots can be formulated as a finite-horizon Markov Decision Process (MDP), where the prediction of DCVs' future locations is exploited to minimize a weighted sum of the average model uploading time and the average energy consumption. A low-complexity FedCars optimizer with a non-trivial performance bound is then proposed, where the optimization consists of global transmission time allocation and local power allocation. The former periodically allocates the transmission time for the remaining time slots according to an average trajectory. Hence, the power allocation of all DCVs can be decoupled to local finite-horizon MDPs in the latter. They can be solved by one-step policy improvement with low computational complexity. The simulation results show that the proposed solution framework can achieve both a significant performance gain over the baselines and a flexible trade-off between performance and complexity.
- 30 December 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 74 (5) , 7997-8011
FedCars: An Efficient Scheduling Framework for In-Vehicle Federated Learning Integrated With CARLA-Cosimulation
Federated learning on vehicles has been widely considered in autonomous driving. The model uploading of federated learning is time-consuming, which motivates the transmission optimization that exploits the mobility of vehicles. In this paper, an optimization framework integrated with the high-fidelity traffic simulator CARLA, namely FedCars, is proposed for the scheduling of model uploading in a Vehicle-to-Infrastructure (V2I) network. Specifically, a group of data collection vehicles (DCVs) move along their planned routes with random velocities to collect sensor data and train a model via federated learning, where the uplink model transmission of multiple DCVs in one learning iteration is jointly optimized. We first develop the FedCars simulator from CARLA, to obtain a high-fidelity trajectory dataset of DCVs in the considered traffic scenario, and train the transition probabilities of the DCVs' locations. Hence, the uplink transmission time and power of all DCVs in all the time slots can be formulated as a finite-horizon Markov Decision Process (MDP), where the prediction of DCVs' future locations is exploited to minimize a weighted sum of the average model uploading time and the average energy consumption. A low-complexity FedCars optimizer with a non-trivial performance bound is then proposed, where the optimization consists of global transmission time allocation and local power allocation. The former periodically allocates the transmission time for the remaining time slots according to an average trajectory. Hence, the power allocation of all DCVs can be decoupled to local finite-horizon MDPs in the latter. They can be solved by one-step policy improvement with low computational complexity. The simulation results show that the proposed solution framework can achieve both a significant performance gain over the baselines and a flexible trade-off between performance and complexity.
- Open Access
- 22 November 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 20 (6) , 1-27
COSMO: Dynamic Uploading Scheduling in mmWave-Based Sensor Networks with Mobile Blockers
Wireless sensor networks (WSNs) leveraging millimeter wave (mmWave) communication for bandwidth-demanding applications is considered in this article. Despite the large bandwidth, the delivery of delay-sensitive information collected by sensors may still face significant latency due to the vulnerability to intermittent link blockage. Hence, the guarantee of low age of information (AoI) in mmWave WSNs is not straightforward. In this article, the wireless sensing and dynamic programming techniques are jointly exploited to relieve the above issue. The former tracks the human blockers and predicts the chance of link blockage; the latter optimizes the transmission of multiple sensors based on the prediction. Particularly, the long-term optimization of sampling, uplink time and power allocation policies in a sensor network can be formulated as an infinite-horizon Markov decision process (MDP) with discounted cost, where the state transition probabilities can be predicted via wireless sensing. A novel low-complexity solution framework, namely COSMO, with a guaranteed performance in the worst case, is proposed. Simulations show that compared with heuristic benchmarks, benefiting from the prediction of the link blockage, COSMO can significantly suppress the average system cost, which consists of both AoI and energy consumption.
- 22 November 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Sensor Networks
- Vol. 20 (6) , 1-27
Open AccessCOSMO: Dynamic Uploading Scheduling in mmWave-Based Sensor Networks with Mobile Blockers
Wireless sensor networks (WSNs) leveraging millimeter wave (mmWave) communication for bandwidth-demanding applications is considered in this article. Despite the large bandwidth, the delivery of delay-sensitive information collected by sensors may still face significant latency due to the vulnerability to intermittent link blockage. Hence, the guarantee of low age of information (AoI) in mmWave WSNs is not straightforward. In this article, the wireless sensing and dynamic programming techniques are jointly exploited to relieve the above issue. The former tracks the human blockers and predicts the chance of link blockage; the latter optimizes the transmission of multiple sensors based on the prediction. Particularly, the long-term optimization of sampling, uplink time and power allocation policies in a sensor network can be formulated as an infinite-horizon Markov decision process (MDP) with discounted cost, where the state transition probabilities can be predicted via wireless sensing. A novel low-complexity solution framework, namely COSMO, with a guaranteed performance in the worst case, is proposed. Simulations show that compared with heuristic benchmarks, benefiting from the prediction of the link blockage, COSMO can significantly suppress the average system cost, which consists of both AoI and energy consumption.
- 24 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (10) , 13219-13234
Predictive Delay-Aware Scheduling With Receiver Rotation Detection and mmWave Channel Learning
In this paper, the joint downlink delay-aware scheduling in a large time span, where the rotation of User Equipments (UEs) may lead to significant channel variation, is investigated via a novel approximate Markov Decision Process (MDP) method. Specifically, we consider the joint downlink power allocation and receiving UE selection of a number of successive frames in a millimeter Wave (mmWave) system with quasi-static scattering clusters in the channel and rotating UEs. The propagation statistics of scattering clusters can be tracked via a learning method. Since the rotation of UEs can be detected, future channel statistics can be forecast via embedded motion sensors. Hence, the overall scheduling is formulated as a finite-horizon MDP with non-stationary predictable state transition probabilities, where the average queuing delay and probability of transmission buffer overflow are considered in the objective of scheduling optimization. A novel low-complexity solution framework with an analytical performance bound is proposed to save the efforts of value iteration. Benefiting from the forecast of system statistics, superior performance to the benchmarks is shown by numerical simulations, particularly in the suppression of buffer overflow rate. Preliminary experiments via an mmWave testbed are conducted to demonstrate the feasibility of the sensor-assisted mmWave beam alignment.
- 24 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 23 (10) , 13219-13234
Predictive Delay-Aware Scheduling With Receiver Rotation Detection and mmWave Channel Learning
In this paper, the joint downlink delay-aware scheduling in a large time span, where the rotation of User Equipments (UEs) may lead to significant channel variation, is investigated via a novel approximate Markov Decision Process (MDP) method. Specifically, we consider the joint downlink power allocation and receiving UE selection of a number of successive frames in a millimeter Wave (mmWave) system with quasi-static scattering clusters in the channel and rotating UEs. The propagation statistics of scattering clusters can be tracked via a learning method. Since the rotation of UEs can be detected, future channel statistics can be forecast via embedded motion sensors. Hence, the overall scheduling is formulated as a finite-horizon MDP with non-stationary predictable state transition probabilities, where the average queuing delay and probability of transmission buffer overflow are considered in the objective of scheduling optimization. A novel low-complexity solution framework with an analytical performance bound is proposed to save the efforts of value iteration. Benefiting from the forecast of system statistics, superior performance to the benchmarks is shown by numerical simulations, particularly in the suppression of buffer overflow rate. Preliminary experiments via an mmWave testbed are conducted to demonstrate the feasibility of the sensor-assisted mmWave beam alignment.
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (6) , 4734-4753
A Survey of Machine Learning-Based Ride-Hailing Planning
Ride-hailing is a sustainable transportation paradigm where riders access door-to-door traveling services through a mobile phone application, which has attracted a colossal amount of usage. There are two major planning tasks in a ride-hailing system: 1) matching, i.e., assigning available vehicles to pick up the riders; and 2) repositioning, i.e., proactively relocating vehicles to certain locations to balance the supply and demand of ride-hailing services. Recently, many studies of ride-hailing planning that leverage machine learning techniques have emerged. In this article, we present a comprehensive overview on latest developments of machine learning-based ride-hailing planning. To offer a clear and structured review, we introduce a taxonomy into which we carefully fit the different categories of related works according to the types of their planning tasks and solution schemes, which include collective matching, distributed matching, collective repositioning, distributed repositioning, and joint matching and repositioning. We further shed light on many real-world data sets and simulators that are indispensable for empirical studies on machine learning-based ride-hailing planning strategies. At last, we propose several promising research directions for this rapidly growing research and practical field.
- 10 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (6) , 4734-4753
A Survey of Machine Learning-Based Ride-Hailing Planning
Ride-hailing is a sustainable transportation paradigm where riders access door-to-door traveling services through a mobile phone application, which has attracted a colossal amount of usage. There are two major planning tasks in a ride-hailing system: 1) matching, i.e., assigning available vehicles to pick up the riders; and 2) repositioning, i.e., proactively relocating vehicles to certain locations to balance the supply and demand of ride-hailing services. Recently, many studies of ride-hailing planning that leverage machine learning techniques have emerged. In this article, we present a comprehensive overview on latest developments of machine learning-based ride-hailing planning. To offer a clear and structured review, we introduce a taxonomy into which we carefully fit the different categories of related works according to the types of their planning tasks and solution schemes, which include collective matching, distributed matching, collective repositioning, distributed repositioning, and joint matching and repositioning. We further shed light on many real-world data sets and simulators that are indispensable for empirical studies on machine learning-based ride-hailing planning strategies. At last, we propose several promising research directions for this rapidly growing research and practical field.
- Open Access
A Survey of Machine Learning-Based Ride-Hailing Planning
Ride-hailing is a sustainable transportation paradigm where riders access door-to-door traveling services through a mobile phone application, which has attracted a colossal amount of usage. There are two major planning tasks in a ride-hailing system: (1) matching, i.e., assigning available vehicles to pick up the riders, and (2) repositioning, i.e., proactively relocating vehicles to certain locations to balance the supply and demand of ride-hailing services. Recently, many studies of ride-hailing planning that leverage machine learning techniques have emerged. In this article, we present a comprehensive overview on latest developments of machine learning-based ride-hailing planning. To offer a clear and structured review, we introduce a taxonomy into which we carefully fit the different categories of related works according to the types of their planning tasks and solution schemes, which include collective matching, distributed matching, collective repositioning, distributed repositioning, and joint matching and repositioning. We further shed light on many real-world datasets and simulators that are indispensable for empirical studies on machine learning-based ride-hailing planning strategies. At last, we propose several promising research directions for this rapidly growing research and practical field.
Open AccessA Survey of Machine Learning-Based Ride-Hailing Planning
Ride-hailing is a sustainable transportation paradigm where riders access door-to-door traveling services through a mobile phone application, which has attracted a colossal amount of usage. There are two major planning tasks in a ride-hailing system: (1) matching, i.e., assigning available vehicles to pick up the riders, and (2) repositioning, i.e., proactively relocating vehicles to certain locations to balance the supply and demand of ride-hailing services. Recently, many studies of ride-hailing planning that leverage machine learning techniques have emerged. In this article, we present a comprehensive overview on latest developments of machine learning-based ride-hailing planning. To offer a clear and structured review, we introduce a taxonomy into which we carefully fit the different categories of related works according to the types of their planning tasks and solution schemes, which include collective matching, distributed matching, collective repositioning, distributed repositioning, and joint matching and repositioning. We further shed light on many real-world datasets and simulators that are indispensable for empirical studies on machine learning-based ride-hailing planning strategies. At last, we propose several promising research directions for this rapidly growing research and practical field.