10 June 2022 in IEEE Internet of Things Journal
This article investigates an unmanned-aerial-vehicle (UAV)-assisted Internet of Things system, where multiple UAVs take off from a data center (DC), collect data from multiple ground sensor nodes (SNs), distribute data for multiple users, and finally return to DC. A centralized information-sharing mechanism is designed among UAVs before data distribution, such that UAVs’ repeatedly visiting the same user can be avoided to save energy and time. A nonconvex Age-of-Information (AoI) minimization problem is formulated, where the task assignment, selection of interaction point (IPT), and UAVs’ trajectories are optimized jointly. It is decomposed into two subproblems: one is a joint task assignment and UAV trajectory optimization problem, which is solved by a multipopulation-based genetic algorithm (MPGA), as well as a hybrid algorithm combining dynamic programming (DP) with an improved $K$ -means clustering; and the other is an IPT selection problem, which is modeled as a Fermat–Weber location problem and is solved by the convex optimization technique. Simulation results show that the MPGA performs better than the hybrid algorithm as well as several benchmark algorithms.
2 December 2020 in IEEE Wireless Communications Letters
Due to the overlap of different users’ information requirements for reconnaissance targets, when unmanned aerial vehicles (UAVs), serving multiple users, perform field reconnaissance missions, it is likely to cause repetitive visit to the same targets. To deal with this problem, a reasonable cooperative mission assignment algorithm is needed. By introducing information sharing mechanism with air communication among UAVs, this letter models the mission assignment problem as a vehicle routing problem with air information sharing (VRPAIS), which can efficiently avoid the repetitive visit of targets. An improved piecewise genetic algorithm with integer splitting is proposed to solve VRPAIS in polynomial time. Simulation results show that in the case of high overlap (about 80%) of information requirements, the proposed method is much more energy efficient compared with the traditional Multiple Traveling Salesman Problem (MTSP) based method without information sharing, with an average energy savings rate of 34.2%.
11 October 2021 in International Journal of Aerospace Engineering
This paper considers a reconnaissance scenario where multiple unmanned aerial vehicles (UAVs) provide services cooperatively for multiple users with different priorities. Although users all expect to acquire their needed information in a short time, the degree of urgency to meet their demands is different when taking their diverse priorities into account. A priority-driven multiuser satisfaction model is designed, where users’ satisfaction is quantified based on their different priorities, information acquisition demands, and the time they obtain their desired information. To ensure high priority users’ fast information acquisition while avoiding excessive delay in low priority users’ information acquisition, a batchwise information backhaul strategy is adopted. In each batch, a UAV is selected as the data ferry through a consultative mechanism to carry information back to users. This reconnaissance process is formulated as a cooperative path planning problem, where the optimization objective is maximizing users’ total satisfaction, while an intelligent algorithm is proposed to solve this problem effectively. The simulation results show that compared with traditional path planning algorithms without considering user satisfaction, our proposed algorithm can guarantee faster information acquisition for users with higher priorities, which leads to higher satisfaction. In addition, the applicability of our proposed reconnaissance strategy and path planning algorithm in different situations is also analyzed.