2017 Global Information Infrastructure and Networking Symposium (GIIS) 2017
DOI: 10.1109/giis.2017.8169803
|View full text |Cite
|
Sign up to set email alerts
|

Efficient deployment of connected unmanned aerial vehicles for optimal target coverage

Abstract: Anytime and anywhere network access can be provided by Unmanned Aerial Vehicles (UAV) with air-to-ground and air-to-air communications using directional antennas for targets located on the ground. Deploying these Unmanned Aerial Vehicles to cover targets is a complex problem since each target should be covered, while minimizing (i) the deployment cost and (ii) the UAV altitudes to ensure good communication quality. We also consider connectivity between the UAVs and a base station in order to collect and send i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
40
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
2
1

Relationship

2
7

Authors

Journals

citations
Cited by 30 publications
(40 citation statements)
references
References 10 publications
0
40
0
Order By: Relevance
“…The UAV to send to the new computed location is chosen by using a metric that minimizes the total travel distance of UAVs. Caillouet et al [26] tackle the more challenging problem of optimally positioning the minimum number of UAVs, taken from the set of all available UAVs, in order to cover a set of targets on the ground, while maintaining the connectivity of the aerial mesh to a ground base station. An evaluation of the model performed by the authors proves that the algorithm always finds an optimal solution in a reasonable amount of time (1000 s).…”
Section: Related Workmentioning
confidence: 99%
“…The UAV to send to the new computed location is chosen by using a metric that minimizes the total travel distance of UAVs. Caillouet et al [26] tackle the more challenging problem of optimally positioning the minimum number of UAVs, taken from the set of all available UAVs, in order to cover a set of targets on the ground, while maintaining the connectivity of the aerial mesh to a ground base station. An evaluation of the model performed by the authors proves that the algorithm always finds an optimal solution in a reasonable amount of time (1000 s).…”
Section: Related Workmentioning
confidence: 99%
“…This approach typically produces close to optimal results when the location information is timely and reliable, but suffers from the single point of failure problem and, if the dimension of the problem is big enough, location information dissemination and the amount of computations can generate substantial delays. Mixed integer programming [5], evolutionary algorithms [6,7] or potential fields [8] are typically used. On the other hand, distributed algorithms provide less optimal solutions, but computations are typically simpler, based on local information distributed among the nodes, thus making the network more responsive and resilient in case of unexpected changes.…”
Section: Related Workmentioning
confidence: 99%
“…However, it leads to more deployed UAVs, since the coverage area is smaller. The trade-off between these two antagonistic objectives has been studied in [38] for static targets.…”
Section: Adcp Objectivementioning
confidence: 99%
“…Thus, a minimum weighted connected subset generation either gives a good candidate to add to the set of variables of the master problem, or proves that no such column exists. If the cost computed by the pricing problem is smaller than β (9) , the generated CS is added to the set of considered connected sets S, and the corresponding variables z t S are added for all t. Constraints of this sub-problem define the structure of the CS of UAVs, fulfilling Definition 3.…”
Section: Pricing Programmentioning
confidence: 99%