2019
DOI: 10.1109/access.2018.2885321
|View full text |Cite
|
Sign up to set email alerts
|

A Generic Spatiotemporal UAV Scheduling Framework for Multi-Event Applications

Abstract: In this paper, a generic scheduling framework to manage a fleet of micro unmanned aerial vehicles (UAVs) is proposed. The objective is to employ multiple UAVs in sequential and parallel ways to cover spatially and temporally distributed events in a geographical area of interest over a long period of time. The proactive scheduling framework considers several constraints and challenges, including the technical specifications of the UAVs and the limited battery capacities. In addition, the platform considers the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
1

Relationship

4
2

Authors

Journals

citations
Cited by 25 publications
(12 citation statements)
references
References 30 publications
0
12
0
Order By: Relevance
“…We notice that, after increasing the battery capacity level higher than 5000 mAh, the UAV is enable to exceed a certain coverage percentage, around 40% for the optimal solution, and this is explained by the fact that in scenario D, several events are overlapping which makes it impossible for a solo UAV to successfully cover the whole events. The figure also compares the performance of the QL approach with an optimal MILP based solution proposed in [17]. The QL solution achieves satisfactory results known that the proposed solution is compromising the efficiency in order to gain speed, which is a crucial factor that optimal solution can not provide.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…We notice that, after increasing the battery capacity level higher than 5000 mAh, the UAV is enable to exceed a certain coverage percentage, around 40% for the optimal solution, and this is explained by the fact that in scenario D, several events are overlapping which makes it impossible for a solo UAV to successfully cover the whole events. The figure also compares the performance of the QL approach with an optimal MILP based solution proposed in [17]. The QL solution achieves satisfactory results known that the proposed solution is compromising the efficiency in order to gain speed, which is a crucial factor that optimal solution can not provide.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…The objective was to find a path for a single UAV with minimum fuel consumption such that each target is visited at least once by the vehicle without violating the fuel constraint. In [17] and [18], the authors solved MILP problem implementing a generic scheduling framework to manage a fleet of micro-UAVs to cover spatially and temporally distributed events. An extension of the later work, using low complexity algorithms, is presented in [19].…”
Section: A Related Workmentioning
confidence: 99%
“…In this section, we study the behavior of the autonomous scheduling framework for selected scenarios. Also, a comparison between the performance of the QL-based approach and an optimal MILP-based solution is provided [45]. For the sake of clarity and to be able to visualize the behavior of the UAV, we assume that K = 5 sensing nodes are randomly generated locations within 5 Ă— 5 km 2 area.…”
Section: B Autonomous Schedulingmentioning
confidence: 99%
“…Supposing pre-known trajectories and splitting them into multiple sub-missions simplify the problem formulation and leads to suboptimal solutions since the instants of decision making are neither time flexible nor optimized. In our previous work [28], we have designed a scheduling framework for UAVs where only one docking station is used to reload all the flying units.…”
Section: A Related Workmentioning
confidence: 99%
“…However, it is possible to convert it to a linear one by adopting some linearization techniques such as the use of multiple linear constraints to model the products of decision variables, the big-M linearization technique, and the introduction of some slack variables to linearize some of the constraints. More details about the linearize techniques that are adopted can be found in [28].…”
Section: ) Time Interval Constraintmentioning
confidence: 99%