Addressing the Return Visit Challenge in Autonomous Flying Ad Hoc Networks Linked to a Central Station
Ercan Erkalkan, Vedat Topuz, Ali Buldu · 2024
Read Addressing the Return Visit Challenge in Autonomous Flying Ad Hoc Networks Linked to a Central Station by Ercan Erkalkan, Vedat Topuz, Ali Buldu (2024) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-11644874.txt.
Description
Ercan Erkalkan, Vedat Topuz, and Ali Buldu route fleets of drones that must keep revisiting targets while never losing their link to base. Such flying networks serve inspection and delivery, yet no good routing rule existed for the revisit problem under a constant connection demand. Their heuristic scores each target with a blended value function and assigns visits through a mathematical model that can also park drones as relays. A drone may gain or pay for each detour it takes.
All testing ran in simulation, where layouts shifted often. The algorithm held up under the churn and beat existing methods on revisit time and connection keeping. The authors use the results to explain how heuristic rules can sharpen the management of drone fleets. They present the work as a step toward dependable autonomous patrols.
Catalog record
| CREATOR | Ercan Erkalkan, Vedat Topuz, Ali Buldu |
|---|---|
| YEAR | 2024 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 114 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |