2021
DOI: 10.1126/scirobotics.abg1188
|View full text |Cite
|
Sign up to set email alerts
|

An autonomous drone for search and rescue in forests using airborne optical sectioning

Abstract: Autonomous drones will play an essential role in human-machine teaming in future search and rescue (SAR) missions. We present a prototype that finds people fully autonomously in densely occluded forests. In the course of 17 field experiments conducted over various forest types and under different flying conditions, our drone found, in total, 38 of 42 hidden persons. For experiments with predefined flight paths, the average precision was 86%, and we found 30 of 34 cases. For adaptive sampling experiments (where… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
79
0
1

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 75 publications
(88 citation statements)
references
References 65 publications
0
79
0
1
Order By: Relevance
“…This type of problem is well studied in literature and is termed as a minimum time search problem (MTS) [2][3][4][5][6][7][8][9][10][11][12][13][14]. The most prominent objective in these approaches is to optimize the expected time of target detection [3][4][5][6]; however, other alternative approaches involve optimizing the probability of target detection [7][8][9]15], minimizing its counterpart, i.e., probability of nondetection [10,11] or maximizing the information gain [12,13,16]. Various sub-optimal and heuristics-based algorithms such as gradient-based approaches [7,[10][11][12]15], cross-entropy optimization [2,5], Bayesian optimization algorithms [4], ant colony optimization [6], or genetic algorithms [3] have been proposed to address the NP-hard complex problem [13].…”
Section: Introductionmentioning
confidence: 99%
See 4 more Smart Citations
“…This type of problem is well studied in literature and is termed as a minimum time search problem (MTS) [2][3][4][5][6][7][8][9][10][11][12][13][14]. The most prominent objective in these approaches is to optimize the expected time of target detection [3][4][5][6]; however, other alternative approaches involve optimizing the probability of target detection [7][8][9]15], minimizing its counterpart, i.e., probability of nondetection [10,11] or maximizing the information gain [12,13,16]. Various sub-optimal and heuristics-based algorithms such as gradient-based approaches [7,[10][11][12]15], cross-entropy optimization [2,5], Bayesian optimization algorithms [4], ant colony optimization [6], or genetic algorithms [3] have been proposed to address the NP-hard complex problem [13].…”
Section: Introductionmentioning
confidence: 99%
“…The most prominent objective in these approaches is to optimize the expected time of target detection [3][4][5][6]; however, other alternative approaches involve optimizing the probability of target detection [7][8][9]15], minimizing its counterpart, i.e., probability of nondetection [10,11] or maximizing the information gain [12,13,16]. Various sub-optimal and heuristics-based algorithms such as gradient-based approaches [7,[10][11][12]15], cross-entropy optimization [2,5], Bayesian optimization algorithms [4], ant colony optimization [6], or genetic algorithms [3] have been proposed to address the NP-hard complex problem [13]. These approaches can also be differentiated based on the considered UAV dynamics models, where they either do not consider velocity at all [2,[4][5][6][7][8][9]15], or only consider simple linear velocity models [3,10,11] but not acceleration or deceleration.…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations