A local search approach to observation planning with multiple UAVs

5Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

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 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.

Cite

CITATION STYLE

APA

Bit-Monnot, A., Bailon-Ruiz, R., & Lacroix, S. (2018). A local search approach to observation planning with multiple UAVs. In Proceedings International Conference on Automated Planning and Scheduling, ICAPS (Vol. 2018-June, pp. 437–445). AAAI press. https://doi.org/10.1609/icaps.v28i1.13924

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free