We focus on the problem of optimally managing a set of unmanned aerial vehicles performing given missions that require to land on an automatic platform, unmount the currently-carried payload, and take off with another payload to complete mission objectives. Such a problem often arises when swarms of drones cooperate to complete monitoring applications or other tasks requiring an efficient schedule of landings and payload switches in a resource-constrained environment. First, the problem is formulated as a mixed-integer linear programming one, which, however, may be complex to be solved for a large number of drones. Thus, we also propose a heuristic algorithm able to find suboptimal solutions with a reduced computational effort. Preliminary simulation results are reported and discussed.

Scheduling Landing and Payload Switch of Unmanned Aerial Vehicles on a Single Automatic Platform

Ausonio E.;Bagnerini P.;
2022-01-01

Abstract

We focus on the problem of optimally managing a set of unmanned aerial vehicles performing given missions that require to land on an automatic platform, unmount the currently-carried payload, and take off with another payload to complete mission objectives. Such a problem often arises when swarms of drones cooperate to complete monitoring applications or other tasks requiring an efficient schedule of landings and payload switches in a resource-constrained environment. First, the problem is formulated as a mixed-integer linear programming one, which, however, may be complex to be solved for a large number of drones. Thus, we also propose a heuristic algorithm able to find suboptimal solutions with a reduced computational effort. Preliminary simulation results are reported and discussed.
2022
978-1-6654-9042-9
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11567/1103433
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact