Jianping Huang

Jianping Huang

Auto-generated profile, based on publicly available information

Jianping Huang

School of Computer Science and Engineering, Southeast University, Nanjing, China

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
22 July 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YWYiqian Wang
Yiqian Wang
JHJianping Huang
Jianping Huang
FSFeng Shan
Feng Shan
YGYuming Gao
Yuming Gao
RXRunqun Xiong
Runqun Xiong
JLJunzhou Luo
Junzhou Luo
Low-altitude airspace in major cities across the world is increasingly congested with uncrewed aerial vehicles (UAVs) and other aircraft. Emerging technologies, innovative business models, and supportive government policies are driving the growth of the low-altitude economy, where UAVs play a crucial role. Given the limited on-board energy of UAVs, this paper investigates the Joint UAV Speed and Altitude Scheduling (JUSAS) problem for data collection from sensors deployed along power transmission lines, bridges, highways, railways, water/gas/oil pipelines, or rivers/coasts. Distinct from existing work, the paper focuses on jointly optimizing UAV speed and altitude scheduling while determining the wireless sensor collection order. It accounts for the altitude-specific sensor transmission range model and the complexities of overlapping range relationships. We first propose the Slowest Segment First (SSF) policy to obtain an optimal UAV speed scheduling for fixed-altitude scenarios. Building upon this, we then reformulate JUSAS as a shortest-path-type problem using our novel flight scheduling graph, solved efficiently through the SSF-based Ant Colony Optimization (SSF-ACO) algorithm. To handle practical scenarios without prior sensor information along the path, we develop SSF-ACO-Online for real-time scheduling. Extensive simulations demonstrate that SSF-ACO significantly outperforms four other algorithms (i.e., SSF-Only, SSF-GA, SSF-PSO, and SSF-SA) in energy efficiency, and reduces 13.11% energy consumption on average. SSF-ACO-Online achieves comparable performance with energy consumption 1.24% higher than offline counterpart in average.

23 June 2025 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JHJianping Huang
Jianping Huang
FSFeng Shan
Feng Shan
JLJunzhou Luo
Junzhou Luo
RXRunqun Xiong
Runqun Xiong
WWWenjia Wu
Wenjia Wu
Unmanned aerial vehicles (UAVs) are being widely employed in wireless communication applications, e.g., collecting data from ground nodes (GNs). Minimizing UAV energy in these applications is crucial due to the limited energy supply onboard. Unlike previous studies that assume UAVs fly at a fixed altitude and simplify the energy consumption model of UAVs, we consider the impact of varying UAV altitudes on the ground-to-air communication and utilize a general communication model for GN. Furthermore, we conduct real-world flight tests and introduce a practical speed-related flight energy consumption model of UAVs. This paper focuses on the UAV altitude-speed scheduling and GN transmission switching (UASS-GTS) problem, specifically in scenarios where the UAV flies straight for monitoring applications such as power transmission lines, roads, and water/oil/gas pipes. However, minimizing energy consumption presents challenges due to the tight coupling of altitude scheduling and speed scheduling. To tackle this, first, we develop the looking before crossing algorithm for speed scheduling. We then extend this algorithm by integrating altitude scheduling to propose the Altitude-Speed Scheduling of UAV for Minimizing Energy (ASSUME) algorithm, using a dynamic programming method. The ASSUME algorithm is theoretically proven to be optimal. Additionally, based on ASSUME, we propose an offline-inspired online heuristic algorithm to handle agnostic situations where GN information is not available unless flies close. Simulations indicate that the ASSUME algorithm saves an average of 26.1%–62.7% energy compared to the baseline methods, and the performance gap between the online algorithm and the offline optimal algorithm ASSUME is 22.8%.

6 May 2026 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
JHJianping Huang
Jianping Huang
FSFeng Shan
Feng Shan
JLJunzhou Luo
Junzhou Luo
Unmanned Aerial Vehicles (UAVs) are crucial for deadline-driven tasks but face dual bottlenecks: limited flight endurance and constrained onboard processing for data-intensive tasks. Edge Intelligent Vehicles (EIVs) can effectively serve as mobile logistical and computational hubs to alleviate these issues. However, existing research on such air-ground collaboration often assumes predetermined EIV locations and a fixed UAV fleet. This inflexibility leads to costly resource over-provisioning or mission failures under tight deadlines. Motivated by this, this paper studies the SLIM+ problem, which focuses on jointly optimizing proactive EIV placements and UAV fleet sizing to minimize total deployment cost. This problem is challenging due to the deep coupling between strategic EIV placement, which shapes the mission structure, and the resulting operational cost of the UAV fleet. Therefore, we propose a novel two-level algorithm, where the outer layer employs dynamic programming to strategically place EIVs to partition the mission into independent route segments, while the inner layer consists of two complementary algorithms to determine the minimum UAV fleet size and optimal speeds for each segment: an optimal DP-based method and an approximation algorithm with a theoretical guarantee. Extensive simulations show that our integrated solution reduces total deployment cost by an average of 21.9% compared to baseline solutions, highlighting the benefits of a fully optimized co-deployment strategy.