Energy-Efficient General PoI-Visiting by UAV With a Practical Flight Energy Model

Unmanned aerial vehicles (UAVs) are being widely exploited for various applications, e.g., traversing to collect data from ground sensors, patrolling to monitor key facilities, moving to aid mobile edge computing. We summarize these UAV applications and formulate a problem, namely the
general waypoint-based PoI-visiting problem
. Since energy is critical due to the limited onboard storage capacity, we aim at minimizing flight energy consumption. In our problem, we pay special attention to the energy consumption for turning and switching operations on flight planning, which are usually ignored in the literature but play an important role in practical UAV flights according to our real-world measurement experiments. We propose specially designed graph parts to model the turning and switching cost and thus transfer the problem into a classic graph problem, i.e., general traveling salesman problem, which can be efficiently solved. Theoretical analysis shows that such problem transformation has the graph redefinition approximation ratio upper bound,
$max\lbrace \Theta /\delta,2\rbrace$
, where
$\Theta$
is related to the designed graph parts and
$\delta$
is a constant. Finally, we evaluate our proposed algorithm by simulations. The results show that it costs less than 107% of the optimal minimum energy consumption for small scale problems and costs only 50% as much energy as a naive algorithm for large scale problems.