Joint Deployment Optimization and Flight Trajectory Planning for UAV Assisted IoT Data Collection: A Bilevel Optimization Approach
Saved in:
| Title: | Joint Deployment Optimization and Flight Trajectory Planning for UAV Assisted IoT Data Collection: A Bilevel Optimization Approach |
|---|---|
| Authors: | Han, Shoufei, Zhu, Kun, Zhou, Mengchu, Liu, Xiaojing |
| Source: | Faculty Publications |
| Publisher Information: | Digital Commons @ NJIT |
| Publication Year: | 2022 |
| Collection: | Digital Commons @ New Jersey Institute of Technology (NJIT) |
| Subject Terms: | Bilevel optimization, dandelion algorithm, deployment optimization, flight trajectory planning, iterated greedy algorithm, machine learning, UAV |
| Description: | This work investigates an unmanned aerial vehicle (UAV) assisted IoT system, where a UAV flies to each foothold to collect data from IoT devices, and then return to its start point. For such a system, we aim to minimize the energy consumption by jointly optimizing the deployment and flight trajectory of UAV. It is a mixed-integer non-convex and NP-hard problem. In order to address it, a bilevel optimization approach is proposed, where an upper-level method aims to optimize the deployment of UAV and a lower-level one aims to plan UAV flight trajectory. Specifically, the former optimizes the number and locations of footholds of UAV. This work proposes an improved dandelion algorithm with a novel encoding strategy, in which each dandelion represents a foothold of UAV and the entire dandelion population is seen as an entire deployment. Then, two mutation strategies are designed to adjust the number and locations of footholds. Based on the footholds of the UAV provided by the former, the latter transforms flight trajectory planning into a traveling salesman problem (TSP). This work proposes an iterated greedy algorithm to solve it efficiently. The effectiveness of the proposed bilevel optimization approach is verified on ten instances, and the experimental results show that it significantly outperforms other benchmark approaches. |
| Document Type: | text |
| Language: | unknown |
| Relation: | https://digitalcommons.njit.edu/fac_pubs/2558 |
| DOI: | 10.1109/TITS.2022.3180288 |
| Availability: | https://digitalcommons.njit.edu/fac_pubs/2558 https://doi.org/10.1109/TITS.2022.3180288 |
| Accession Number: | edsbas.5E3A592F |
| Database: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | This work investigates an unmanned aerial vehicle (UAV) assisted IoT system, where a UAV flies to each foothold to collect data from IoT devices, and then return to its start point. For such a system, we aim to minimize the energy consumption by jointly optimizing the deployment and flight trajectory of UAV. It is a mixed-integer non-convex and NP-hard problem. In order to address it, a bilevel optimization approach is proposed, where an upper-level method aims to optimize the deployment of UAV and a lower-level one aims to plan UAV flight trajectory. Specifically, the former optimizes the number and locations of footholds of UAV. This work proposes an improved dandelion algorithm with a novel encoding strategy, in which each dandelion represents a foothold of UAV and the entire dandelion population is seen as an entire deployment. Then, two mutation strategies are designed to adjust the number and locations of footholds. Based on the footholds of the UAV provided by the former, the latter transforms flight trajectory planning into a traveling salesman problem (TSP). This work proposes an iterated greedy algorithm to solve it efficiently. The effectiveness of the proposed bilevel optimization approach is verified on ten instances, and the experimental results show that it significantly outperforms other benchmark approaches. |
|---|---|
| DOI: | 10.1109/TITS.2022.3180288 |