Qingying He

Qingying He

Auto-generated profile, based on publicly available information

Qingying He

Department of Aeronautical and Aviation Engineering, The Hong Kong Polytechnic University, Hong Kong, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
7 November 2023 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
WSWenbo Sun
Wenbo Sun
Fangni ZhangFangni Zhang
Fangni Zhang
Wei Lucian LiuWei Lucian Liu
Wei Lucian Liu
QHQingying He
Qingying He
This paper investigates the potential of improving the overall traffic and energy efficiency by properly controlling a proportion of controllable connected and autonomous vehicles (CAVs) in a mixed traffic corridor. Specifically, we develop a control framework that optimizes controllable CAV trajectories taking into account other vehicles for simultaneously improving traffic throughput and reducing the total energy consumption of all vehicles. The property of the control framework is firstly analytically examined in a simplified and tractable scenario where a human-driven vehicle (HV) follows a CAV. We found that the optimal acceleration is larger if one emphasizes more on improving travel distance within the optimization horizon, or smaller when one emphasizes more on saving energy. The continuous-time optimization model formulation is then discretized, which is solved for real-time application in a model predictive control (MPC) fashion. In numerical studies, the proposed method is tested in various scenarios, e.g., with/without an intersection, under different proportions of controllable CAVs, possible vehicle permutations, and varying overall traffic intensities. Numerical results show that the normalized energy consumption can be reduced by up to 45% and the average travel time reduced by 65%, showing a significant improvement in the road throughput. Notably, even with a limited number of controllable CAVs, the proposed method can achieve a promising performance, e.g., about 20% controllable CAVs can achieve half the benefits of a fully controllable CAV environment.

29 July 2025 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
QHQingying He
Qingying He
Wei Lucian LiuWei Lucian Liu
Wei Lucian Liu
TLTian-Liang Liu
Tian-Liang Liu
QTQiong Tian
Qiong Tian

20 July 2025 in Transportation Research Part B: Methodological
Verified
Journal Article
Closed access
QHQingying He
Qingying He
Wei Lucian LiuWei Lucian Liu
Wei Lucian Liu
HXHaoning Xi
Haoning Xi

1 June 2026 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Open access
QHQingying He
Qingying He
Wei Lucian LiuWei Lucian Liu
Wei Lucian Liu
HYHongbo Ye
Hongbo Ye
Yong MaYong Ma
Yong Ma

2 October 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
QHQingying He
Qingying He
Wei Lucian LiuWei Lucian Liu
Wei Lucian Liu
HYHai Yang
Hai Yang
The rapid growth in demand for unmanned aerial vehicle (UAV) operations requires effective allocation of limited low-altitude airspace under dynamically arriving requests. When operating at scale, thousands of UAVs simultaneously compete for access to shared airspace resources, and capacity allocation becomes a central challenge for maintaining efficiency and safety. We study a real-time route allocation problem in which heterogeneous UAV requests compete for capacity on a spatiotemporal low-altitude airspace network, with the objective of maximizing social welfare while ensuring conflict-free operations under link-time capacity constraints. We formulate the problem as an online combinatorial allocation model and develop a pricing-based primal-dual algorithm that assigns route access using dynamically updated link-time unit price. In contrast to conventional ground and airspace traffic management rules, such as first-come-first-served and greedy admission rules, the proposed method assigns link-time unit price based on capacity usage, so the route access is granted only when the request's reported valuation exceeds the total price of the route. The method is computationally efficient and admits a provable performance guarantee relative to the offline optimum. Numerical experiments show that the proposed method achieves near-optimal system performance at scale and significantly outperforms conventional benchmark policies. Using large-scale delivery data from China, we show that coordinated UAV deployment reduces delivery times by 77.7% on average, with reductions exceeding 90.0% in first-and last-mile operations, and improves accessibility to time-sensitive services in remote and mountainous regions. These results demonstrate that capacity-aware, market-based allocation provides a tractable and effective framework for managing UAV traffic in low-altitude airspace.

23 July 2026 in SSRN Electronic Journal
Verified
Preprint
Open access
QHQingying He
Qingying He
Wei Lucian LiuWei Lucian Liu
Wei Lucian Liu
Electric mobility service platforms are increasingly expected to coordinate mobility, logistics, and energy services within the same fleet system. This integration gives rise to a stochastic fleet sizing and scheduling problem in which a platform must determine its platform-owned electric vehicle (EV) fleet while using flexible EV supply, such as temporary or part-time EV resources that can enter the system at available locations and times and leave after their service commitments, to absorb uncertain demand and travel time variation. The resulting operations require EVs to be allocated across ride-hailing, on-time delivery, and vehicle-to-grid (V2G) services under time window, capacity, battery, charging, station-capacity, rest, and fleet-availability constraints. This study develops a stochastic optimization framework for sizing and operating multi-service electric vehicle fleets. The problem is formulated on a time-expanded action network, where each arc represents a feasible vehicle action, including service fulfillment, repositioning, charging, V2G discharging, waiting, and rest. Ride-hailing, delivery, and mixed service sequences are represented by preprocessed service-pattern actions, which embed pickup-completion precedence, ride-pooling, delivery consolidation, capacity feasibility, delay, detour, and energy-consumption information. A scenario-based stochastic formulation is used to capture uncertain demand and travel times, and jointly optimizes platform-owned fleet sizing, request acceptance, flexible-supply activation, vehicle scheduling, charging, and V2G operations. To solve the resulting large-scale mixed-integer program, we develop a customized branch-and-Benders-cut algorithm and a column generation-based matheuristic. Numerical experiments demonstrate the effectiveness and computational efficiency of the proposed algorithms, and show that stochastic integrated planning improves platform profitability.