A Local Search Approach to Observation Planning with Multiple UAVs - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

A Local Search Approach to Observation Planning with Multiple UAVs


Observation planning for Unmanned Aerial Vehicles (UAVs) is a challenging task as it requires planning trajectories over a large continuous space and with motion models that can not be directly encoded into current planners. Furthermore, realistic problems often require complex objective functions that complicate problem decomposition. In this paper, we propose a local search approach to plan the trajectories of a fleet of UAVs on an observation mission. The strength of the approach lies in its loose coupling with domain specific requirements such as the UAV model or the objective function that are both used as black boxes. Furthermore, the Variable Neighborhood Search (VNS) procedure considered facilitates the adaptation of the algorithm to specific requirements through the addition of new neighborhoods. We demonstrate the feasibility and convenience of the method on a large joint observation task in which a fleet of fixed-wing UAVs maps wildfires over areas of a hundred square kilometers. The approach allows generating plans over tens of minutes for a handful of UAVs in matter of seconds, even when considering very short primitive maneuvers.
Fichier principal
Vignette du fichier
icaps-2018.pdf (3.36 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01730655 , version 1 (13-03-2018)


  • HAL Id : hal-01730655 , version 1


Arthur Bit-Monnot, Rafael Bailon-Ruiz, Simon Lacroix. A Local Search Approach to Observation Planning with Multiple UAVs. International Conference on Automated Planning and Scheduling (ICAPS), Jun 2018, Delft, Netherlands. 9p. ⟨hal-01730655⟩
170 View
193 Download


Gmail Facebook X LinkedIn More