Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912243135807488 |
|---|---|
| author | Badenbroek, Riley Jurrius, Relinde Verlinde, Lander |
| author_facet | Badenbroek, Riley Jurrius, Relinde Verlinde, Lander |
| contents | We consider an autonomous reconnaissance mission where an Unmanned Aerial Vehicle (UAV) has to visit several points of interest and communicate the intel back to the base. At every point of interest, the UAV has the option to either send back all available info, or continue to the next point of interest and communicate at a later stage. Both choices have a chance of detection, meaning the mission fails. We wish to maximize the expected amount of information gathered by the mission. This is modelled by a routing problem in a weighted graph. We show that the problem is NP-complete, discuss an ILP formulation, and use a genetic algorithm to find good solutions for up to ten points of interest. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_19001 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats Badenbroek, Riley Jurrius, Relinde Verlinde, Lander Optimization and Control 90C90 (Primary) 90C59 (Secondary) We consider an autonomous reconnaissance mission where an Unmanned Aerial Vehicle (UAV) has to visit several points of interest and communicate the intel back to the base. At every point of interest, the UAV has the option to either send back all available info, or continue to the next point of interest and communicate at a later stage. Both choices have a chance of detection, meaning the mission fails. We wish to maximize the expected amount of information gathered by the mission. This is modelled by a routing problem in a weighted graph. We show that the problem is NP-complete, discuss an ILP formulation, and use a genetic algorithm to find good solutions for up to ten points of interest. |
| title | Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats |
| topic | Optimization and Control 90C90 (Primary) 90C59 (Secondary) |
| url | https://arxiv.org/abs/2406.19001 |