Multiple UAV cooperative searching operation using polygon area decomposition and efficient coverage algorithms

By Iván Maza, Aníbal Ollero. International Symposium on Distributed Autonomous Robotic Systems, 2004

329 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Multi-UAV Routing for Area Coverage and Remote Sensing with Minimum Time (2015, methodology): “Some researchers have focused on solutions that take into account multiple robots, such as the work in [11] that was previously mentioned.”
Aerial remote sensing in agriculture: A practical approach to area coverage and path planning for fleets of mini aerial robots (2011, background): “Maza and Ollero (2007) present a polygonal area decomposition applied to inspection with a team of aerial robots.”
Energy-Aware Coverage Path Planning of UAVs (2015, methodology): “[7] proposed an algorithm to divide the whole area taking into account UAVs relative capabilities and ini tial locations.”
Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey (2018, background): “Note that for some convex area P, the number of turns is minimized if the largest difference in -coordinates between a pair of points belonging to P, when measured along the chosen sweep direction −→ , is at its minimum [115, 168].”
Survey on Coverage Path Planning with Unmanned Aerial Vehicles (2019, methodology): “Considering the context of a simple coverage, the most common performance metrics found in the literature are: the total travelled distance or the path length [29,30], the time-to-complete a mission [31,32], the area coverage maximization [33], and the number of turning maneuvers [34,35].”