Using UAV-Based Systems to Monitor Air Pollution in Areas with Poor Accessibility

Air pollution monitoring has recently become an issue of utmost importance in our society. Despite the fact that crowdsensing approaches could be an adequate solution for urban areas, they cannot be implemented in rural environments. Instead, deploying a fleet of UAVs could be considered an acceptab...

Full description

Saved in:
Bibliographic Details
Main Authors: Oscar Alvear, Nicola Roberto Zema, Enrico Natalizio, Carlos T. Calafate
Format: Article
Language:English
Published: Wiley 2017-01-01
Series:Journal of Advanced Transportation
Online Access:http://dx.doi.org/10.1155/2017/8204353
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Air pollution monitoring has recently become an issue of utmost importance in our society. Despite the fact that crowdsensing approaches could be an adequate solution for urban areas, they cannot be implemented in rural environments. Instead, deploying a fleet of UAVs could be considered an acceptable alternative. Embracing this approach, this paper proposes the use of UAVs equipped with off-the-shelf sensors to perform air pollution monitoring tasks. These UAVs are guided by our proposed Pollution-driven UAV Control (PdUC) algorithm, which is based on a chemotaxis metaheuristic and a local particle swarm optimization strategy. Together, they allow automatically performing the monitoring of a specified area using UAVs. Experimental results show that, when using PdUC, an implicit priority guides the construction of pollution maps by focusing on areas where the pollutants’ concentration is higher. This way, accurate maps can be constructed in a faster manner when compared to other strategies. The PdUC scheme is compared against various standard mobility models through simulation, showing that it achieves better performance. In particular, it is able to find the most polluted areas with more accuracy and provides a higher coverage within the time bounds defined by the UAV flight time.
ISSN:0197-6729
2042-3195