Sign in

MEng student in Computer Science - Secure Software.

CODEX

Optimal algorithm for region partitioning (implementation available in Haskell and Python).

Example of partitioning for three drones (subregions to fly over have the same area)
Example of partitioning for three drones (subregions to fly over have the same area)

Introduction

Cooperative UAVs’ or drones’ systems are proving increasingly beneficial for aerial tracking missions. They are, for example, used during disasters such as wildfires, floods, and disappearances. In this article, we present an optimal partitioning algorithm that improves mission handling through a divide-and-conquer strategy. Please, note that this article is part of a collection of articles on optimized flight planning algorithms that promote rapid and efficient mission planning. A forthcoming paper will discuss another algorithm that generates flight plans exhaustively covering assigned areas with the shortest paths, thus ensuring optimized maximal information gathering (cf. Figure below).

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store