In this paper, a motion planning mission is considered for a swarm of Unmanned Aerial Vehicles. In particular, a Mixed-Integer Linear Programming optimization problem is formulated to maximize the number of visited targets and minimize the total control effort, while avoiding obstacles and inter-agent collisions. A Line-Of-Sight constraint is enforced in the optimization procedure to ensure visibility-based inter-agent connectivity for the whole mission duration. Different from similar approaches in the literature, the present work extends the treatment to a 3D configuration and exploits a different graph topology constraint based on a multi-commodity flow model. This graph formulation allows more versatility in the feasible topologies. A bridge inspection mission is selected to frame the algorithm in a real-world scenario. The results show that the proposed algorithm consistently generates feasible multi-agent trajectories with steady connectivity, whereas the baseline approach may fail due to the stronger limitations in the graph formulation.

A 3D Mixed-Integer Linear Optimization Problem for Bridge Inspection by a UAV Swarm with LOS Connectivity Constraints / Sarvadon, Jean-Luc; Bertuccio, Pierantonio; Ricioppo, Petre; Giacalone, Giorgia; Enrico, Riccardo; Lizzio, Fausto Francesco. - (2026). ( CEAS EuroGNC 2026 Madrid (Spain) 5th-7th May 2026) [10.82124/CEAS-GNC-2026-058].

A 3D Mixed-Integer Linear Optimization Problem for Bridge Inspection by a UAV Swarm with LOS Connectivity Constraints

Sarvadon,Jean-Luc;Bertuccio,Pierantonio;Ricioppo,Petre;Giacalone,Giorgia;Enrico,Riccardo;Lizzio,Fausto Francesco
2026

Abstract

In this paper, a motion planning mission is considered for a swarm of Unmanned Aerial Vehicles. In particular, a Mixed-Integer Linear Programming optimization problem is formulated to maximize the number of visited targets and minimize the total control effort, while avoiding obstacles and inter-agent collisions. A Line-Of-Sight constraint is enforced in the optimization procedure to ensure visibility-based inter-agent connectivity for the whole mission duration. Different from similar approaches in the literature, the present work extends the treatment to a 3D configuration and exploits a different graph topology constraint based on a multi-commodity flow model. This graph formulation allows more versatility in the feasible topologies. A bridge inspection mission is selected to frame the algorithm in a real-world scenario. The results show that the proposed algorithm consistently generates feasible multi-agent trajectories with steady connectivity, whereas the baseline approach may fail due to the stronger limitations in the graph formulation.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

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/11583/3010989
 Attenzione

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