Binbin Wu

Dr. Binbin Wu


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
13 April 2023 in Electronics
Verified
Journal Article
Open access
PDF file
BWBinbin Wu
Binbin Wu
BZBangning Zhang
Bangning Zhang
WMWenfeng Ma
Wenfeng Ma
CXChen Xie
Chen Xie
DGDaoxing Guo
Daoxing Guo
Hao JiangHao Jiang
Hao Jiang
Unmanned-aerial-vehicle (UAV)-aided data collection for Internet of Things applications has attracted increasing attention. This paper investigates motion planning for UAV collecting low-power ground sensor node (SN) data in a dynamic jamming environment. We targeted minimizing the flight energy consumption via optimization of the UAV trajectory while considering the indispensable constraints which cover the collection data demodulation threshold, obstacle avoidance, data collection volume, and motion principle. Firstly, we formulate the UAV-aided data collection problem as an energy consumption minimization problem. To solve this nonconvex optimization problem, we rewrite the original problem by introducing relaxation variables and constructing equivalence constraints to obtain a new relaxation convex problem, which can be solved iteratively using the successive convex approximation (SCA) method. However, SCA is susceptible to initial values, especially in dynamic environments where fixed initial values may lead to a wide range of results, making it difficult to obtain a truly optimal solution to the optimization problem. To solve the initial value problem in dynamic environments, we further propose a communication-flight-corridor(CFC)-based initial path generation method to improve the reliability and convergence speed of the SCA method by constructing reliable communication regions and resilient secure paths in real time. Finally, simulation results validate the performance of the proposed algorithm compared to the benchmark algorithms under different parameter configurations.

3 April 2024 in Electronics
Verified
Journal Article
Open access
PDF file
CXChen Xie
Chen Xie
BWBinbin Wu
Binbin Wu
DGDaoxing Guo
Daoxing Guo
XCXiao Chen
Xiao Chen
The demand for autonomous navigation UAVs in reconnaissance is steadily increasing. One crucial aspect of these missions is the freshness of reconnaissance information, which serves as a vital indicator of mission effectiveness. However, there is a lack of targeted investigation in the research on autonomous single/multi-UAV missions and joint path planning. Furthermore, the use of visual–inertial odometry (VIO) in rotary-wing UAVs can lead to significant positional drift during flight, which may result in the loss of the UAV and mission failure. This paper investigates joint planning problems in single/multi-UAV reconnaissance missions under both GPS-available and GPS-unavailable scenarios and proposes an integrated data collection and beacon-assisted localization approach. Finally, the numerical results demonstrate the effectiveness of the proposed scheme in enhancing the freshness of reconnaissance information.

23 April 2025 in Electronics
Verified
Journal Article
Open access
PDF file
CXChen Xie
Chen Xie
CGChuan Gu
Chuan Gu
BWBinbin Wu
Binbin Wu
DGDaoxing Guo
Daoxing Guo
While UAV-aided reconnaissance data collection grows rapidly, its path optimization is severely hindered by environmental dynamics, node mobility, and overlapping security/interference risks. This paper addresses the problem of data collection from mobile reconnaissance nodes in interference environments, incorporating safety flight constraints and dynamic constraints. We propose an integrated path optimization framework combining initial path guidance with dynamic replanning capabilities. The system first predicts reconnaissance node and interference source positions while analyzing channel conditions to generate an optimal initial path within the designated communication flight corridor. Subsequently, the framework addresses non-convex path planning challenges using slack variables and equivalent constraints, with the successive convex approximation algorithm providing efficient iterative solutions. Numerical results show that in dynamically changing scenarios, the proposed method achieves high reliability and planning efficiency for real-time, data-collection-oriented path optimization.