Bingke Wang Wang

Dr. Bingke Wang Wang

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
22 March 2021 in Sensors
Verified
Journal Article
Open access
PDF file
SHShaoxing Hu
Shaoxing Hu
Xu TianliangXu Tianliang
Xu Tianliang
BWBingke Wang Wang
Bingke Wang Wang
Aiming at the problem of low operating efficiency due to the poor endurance of plant protection rotor drones and the small volume of pesticide carried, this paper proposes a route-planning algorithm for convex polygon regions based on the initial heading angle. First, a series of coordinate conversion methods ranging from the Earth coordinate system to the local plane coordinate system are studied. Second, in the local plane coordinate system, a route generation method based on subregion is proposed; therefore, multiple routes can be generated with different initial heading angles. Lastly, the optimal route and the best initial heading angle can be obtained after the comparison according to the three evaluation criteria: number of turns, route distance, and pesticide waste rate. The simulation results show that, compared with the common grid method, the route generation method based on subregion reduces the route distance and pesticide waste rate by 2.27% and 13.75%, respectively. Furthermore, it also shows that, compared with the route generated by the initial heading angle of 0°, the optimal route reduces the number of turns, route distance, and pesticide waste rate by 60%, 17.65%, and 38.18%, respectively. The route was optimized in three aspects and reached the best overall result using this method, which in turn proved its feasibility.

30 June 2022 in Sensors
Verified
Journal Article
Open access
PDF file
SHShaoxing Hu
Shaoxing Hu
BWBingke Wang Wang
Bingke Wang Wang
AZAiwu Zhang
Aiwu Zhang
YDYiming Deng
Yiming Deng
The large volume and windward area of the heavy-duty semi-rigid airship (HSA) result in a large turning radius when the HSA passes through every mission point. In this study, a multi-mission-point route planning method for HSA based on the genetic algorithm and greedy strategy is proposed to direct the HSA maneuver through every mission point along the optimal route. Firstly, according to the minimum flight speed and the maximum turning slope angle of the HSA during turning, the minimum turning radius of the HSA near each mission point is determined. Secondly, the genetic algorithm is used to determine the optimal flight sequence of the HSA from the take-off point through all the mission points to the landing point. Thirdly, based on the optimal flight sequence, the shortest route between every two adjacent mission points is obtained by using the route planning method based on the greedy strategy. By determining the optimal flight sequence and the shortest route, the optimal route for the HSA to pass through all mission points can be obtained. The experimental results show that the method proposed in this study can generate the optimal route with various conditions of the mission points using simulation studies. This method reduces the total voyage distance of the optimal route by 18.60% on average and improves the flight efficiency of the HSA.

25 December 2020 in Sensors
Verified
Journal Article
Open access
PDF file
SHShaoxing Hu
Shaoxing Hu
SXShen Xiao
Shen Xiao
AZAiwu Zhang
Aiwu Zhang
YDYiming Deng
Yiming Deng
BWBingke Wang Wang
Bingke Wang Wang
To achieve the ability of associating continuous-time laser frames is of vital importance but challenging for hand-held or backpack simultaneous localization and mapping (SLAM). In this study, the complex associating and mapping problem is investigated and modeled as a multilayer optimization problem to realize low drift localization and point cloud map reconstruction without the assistance of the GNSS/INS navigation systems. 3D point clouds are aligned among consecutive frames, submaps, and closed-loop frames using the normal distributions transform (NDT) algorithm and the iterative closest point (ICP) algorithm. The ground points are extracted automatically, while the non-ground points are automatically segmented to different point clusters with some noise point clusters omitted before 3D point clouds are aligned. Through the three levels of interframe association, submap matching and closed-loop optimization, the continuous-time laser frames can be accurately associated to guarantee the consistency of 3D point cloud map. Finally, the proposed method was evaluated in different scenarios, the experimental results showed that the proposed method could not only achieve accurate mapping even in the complex scenes, but also successfully handle sparse laser frames well, which is critical for the scanners such as the new Velodyne VLP-16 scanner’s performance.