2016 IEEE International Conference on Robotics and Automation (ICRA) 2016
DOI: 10.1109/icra.2016.7487289
|View full text |Cite
|
Sign up to set email alerts
|

Informative soaring with drifting thermals

Abstract: The informative soaring (IFS) problem involves a gliding unmanned aerial vehicle (UAV) exploiting energy from thermals to extend its information gathering capability. In this paper, we address the realistic situation of detecting new thermals drifting with the wind in the search environment. We consider complex target-search scenarios characterised by information clusters and propose a new set of algorithms designed to both explore for and exploit high-value thermals to maximise information gain. Our algorithm… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Path planning is one of the most essential issues for UAVs to calculate an optimal trajectory between the starting point and destination (Aggarwal and Kumar, 2020). Different tree search methods have been developed to detect drift thermals to extend the information-gathering capability of the UAV (Nguyen et al, 2013(Nguyen et al, , 2016. Schermann et al (2019) studied an optimal manner soaring problem and achieved as many rounds as possible within a predetermined time (Schermann et al, 2019).…”
Section: Introductionmentioning
confidence: 99%
“…Path planning is one of the most essential issues for UAVs to calculate an optimal trajectory between the starting point and destination (Aggarwal and Kumar, 2020). Different tree search methods have been developed to detect drift thermals to extend the information-gathering capability of the UAV (Nguyen et al, 2013(Nguyen et al, , 2016. Schermann et al (2019) studied an optimal manner soaring problem and achieved as many rounds as possible within a predetermined time (Schermann et al, 2019).…”
Section: Introductionmentioning
confidence: 99%