Zhu Wang

Dr. Zhu Wang


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
1 February 2018 in Chinese Journal of Aeronautics
Verified
Journal Article
Open access
ZWZhu Wang
Zhu Wang
LLLi Liu
Li Liu
TLTeng Long
Teng Long
YWYonglu Wen
Yonglu Wen

1 November 2017 in Journal of Guidance, Control, and Dynamics
Verified
Journal Article
Closed access
ZWZhu Wang
Zhu Wang
LLLi Liu
Li Liu
TLTeng Long
Teng Long

1 September 2022 in ISA Transactions
Verified
Journal Article
Closed access
GXGuangtong Xu
Guangtong Xu
TLTeng Long
Teng Long
ZWZhu Wang
Zhu Wang
JSJingliang Sun
Jingliang Sun

11 October 2018 in Engineering Optimization
Verified
Journal Article
Closed access
ZWZhu Wang
Zhu Wang
LLLi Liu
Li Liu
TLTeng Long
Teng Long
GXGuangtong Xu
Guangtong Xu
Trajectory planning of formation rendezvous of multiple unmanned aerial vehicles (UAVs) is formulated as a mixed-integer optimal control problem, and an efficient hierarchical planning approach based on the Dubins path and sequential convex programming is proposed. The proposed method includes the assignment of rendezvous points (high level) and generation of cooperative trajectories (low level). At the high level, the assignment of rendezvous points to UAVs is optimized to minimize the total length of Dubins-path-based approximate trajectories. The assignment results determine the geometric relations between the UAVs’ goals, which are used as equality constraints for generating trajectories. At the low level, trajectory generation is treated as a non-convex optimal control problem, which is transformed to a non-convex parameter optimization and then solved via sequentially performing convex optimization. Numerical experiments demonstrate that the proposed method can generate feasible trajectories and can outperform a typical nonlinear programming method in terms of efficiency.

17 July 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YCYan Cao
Yan Cao
TLTeng Long
Teng Long
JSJingliang Sun
Jingliang Sun
ZWZhu Wang
Zhu Wang
GXGuangtong Xu
Guangtong Xu
This letter comprehensively investigates the performance of six state-of-art distributed task allocation algorithms (i.e., CBAA, CBBA, HIPC, PI, DHBA, and DGA) subject to non-ideal communication factors. The package loss, bit error, and time delay factors are considered in the distributed task allocation process. The performance of the algorithms for multi-UAV collaborative visit missions is compared under pre-allocation and dynamic allocation scenarios. The synchronous and asynchronous communication modes are separately utilized in different allocation scenarios for analyzing the effects of non-ideal communication factors. Comparison results show that bit error factors cause conflicted allocations. For the pre-allocation scenario, CBBA outperforms the competitors in terms of reliability, communication overhead, and efficiency. For the dynamic scenario, CBBA performs best optimality, while DHBA exhibits better reliability and lower overhead in harsh communication conditions.

1 July 2014
Verified
Conference Paper
Closed access
ZWZhu Wang
Zhu Wang
LLLi Liu
Li Liu
TLTeng Long
Teng Long
CYChenglong Yu
Chenglong Yu
JKJiaxun Kou
Jiaxun Kou
Sparse A* search (SAS) approach has been widely used in robot motion planning and flight vehicle path planning. However, considering the kinematics constraint of UAV, the estimated cost of SAS based on the straight line distance is not accurate which probably gives rise to abundant useless search. Dubins path is the shortest one to connect two poses under the kinematics constraint, thus the estimated cost using Dubins path is guaranteed to satisfy the admissible condition and it is beneficial to resolving accurate cost for the path planning objective. Therefore, the search efficiency of SAS is expected to be improved by introducing the Dubins path. Meanwhile, SAS employs the error of straight line distance from the current node to the terminal as the stopping criterion, which cannot guarantee the direct flyability of terminal path and leads to a farther real flight path. In this paper, the Dubins length is also used in the length evaluation for termination condition to ensure the final planned path could be flied and to increase the the accuracy of the result. Simulations are conducted to test the proposed algorithm, and the results show that the number of expanded nodes for exploring the optimal path is dramatically decreased and the planning time is reduced.