scholarly journals E2PP: An Energy-Efficient Path Planning Method for UAV-Assisted Data Collection

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Xiang Ji ◽  
Xianjia Meng ◽  
Anwen Wang ◽  
Qingyi Hua ◽  
Fuwei Wang ◽  
...  

Using an unmanned aerial vehicle (UAV) to collect data from wireless sensor networks deployed in the field, one of the key tasks is to plan the path for the collection so as to minimize the energy consumption of the UAV. At present, most of the existing methods generally take the shortest flight distance as the optimal objective to plan the optimal path. They simply believe that the shortest path means the least energy consumption of the UAV and ignore the fact that changing direction (heading) can also consume the UAV’s energy in its flight. If the path can be planned based on the UAV’s energy consumption closer to the real situation, the energy consumption of the UAV can be really reduced and its working energy efficiency can be improved. Therefore, this paper proposes a path planning method for UAV-assisted data collection, which can plan an energy-efficient flight path. Firstly, by analyzing the experiment data, we, respectively, model the relationship between the angle of heading change and the energy consumption of the UAV and the relationship between the distance of straight flight and the energy consumption of the UAV. Then, an energy consumption estimation model based on distance and the angle of heading change (ECEMBDA) is put up. By using this model, we can estimate or predict the energy consumption of a UAV to fly from one point (or node) to another (including the start point). Finally, the greedy algorithm is used to plan the path for UAV-assisted data collection according to the above estimated energy consumption. Through simulation and experiments, we compare our proposed method with the conventional method based on pure distance index and greedy algorithm. The results show that this method can obtain data collection path with lower energy consumption and smoother path trajectory, which is more suitable for actual flight.

Author(s):  
Zhe Zhang ◽  
Jian Wu ◽  
Jiyang Dai ◽  
Cheng He

For stealth unmanned aerial vehicles (UAVs), path security and search efficiency of penetration paths are the two most important factors in performing missions. This article investigates an optimal penetration path planning method that simultaneously considers the principles of kinematics, the dynamic radar cross-section of stealth UAVs, and the network radar system. By introducing the radar threat estimation function and a 3D bidirectional sector multilayer variable step search strategy into the conventional A-Star algorithm, a modified A-Star algorithm was proposed which aims to satisfy waypoint accuracy and the algorithm searching efficiency. Next, using the proposed penetration path planning method, new waypoints were selected simultaneously which satisfy the attitude angle constraints and rank-K fusion criterion of the radar system. Furthermore, for comparative analysis of different algorithms, the conventional A-Star algorithm, bidirectional multilayer A-Star algorithm, and modified A-Star algorithm were utilized to settle the penetration path problem that UAVs experience under various threat scenarios. Finally, the simulation results indicate that the paths obtained by employing the modified algorithm have optimal path costs and higher safety in a 3D complex network radar environment, which show the effectiveness of the proposed path planning scheme.


2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Zhangjie Fu ◽  
Jingnan Yu ◽  
Guowu Xie ◽  
Yiming Chen ◽  
Yuanhang Mao

With the rapid development of the network and the informatization of society, how to improve the accuracy of information is an urgent problem to be solved. The existing method is to use an intelligent robot to carry sensors to collect data and transmit the data to the server in real time. Many intelligent robots have emerged in life; the UAV (unmanned aerial vehicle) is one of them. With the popularization of UAV applications, the security of UAV has also been exposed. In addition to some human factors, there is a major factor in the UAV’s endurance. UAVs will face a problem of short battery life when performing flying missions. In order to solve this problem, the existing method is to plan the path of UAV flight. In order to find the optimal path for a UAV flight, we propose three cost functions: path security cost, length cost, and smoothness cost. The path security cost is used to determine whether the path is feasible; the length cost and smoothness cost of the path directly affect the cost of the energy consumption of the UAV flight. We proposed a heuristic evolutionary algorithm that designed several evolutionary operations: substitution operations, crossover operations, mutation operations, length operations, and smoothness operations. Through these operations to enhance our build path effect. Under the analysis of experimental results, we proved that our solution is feasible.


2014 ◽  
Vol 1030-1032 ◽  
pp. 1588-1591 ◽  
Author(s):  
Zong Sheng Wu ◽  
Wei Ping Fu

The ability of a mobile robot to plan its path is the key task in the field of robotics, which is to find a shortest, collision free, optimal path in the various scenes. In this paper, different existing path planning methods are presented, and classified as: geometric construction method, artificial intelligent path planning method, grid method, and artificial potential field method. This paper briefly introduces the basic ideas of the four methods and compares them. Some challenging topics are presented based on the reviewed papers.


Sign in / Sign up

Export Citation Format

Share Document