Distributed approach for coverage and patrolling missions with a team of heterogeneous aerial robots under communication constraints

64Citations
Citations of this article
73Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Using aerial robots in area coverage applications is an emerging topic. These applications need a coverage path planning algorithm and a coordinated patrolling plan. This paper proposes a distributed approach to coordinate a team of heterogeneous UAVs cooperating efficiently in patrolling missions around irregular areas, with low communication ranges and memory storage requirements. Hence it can be used with small-scale UAVs with limited and different capabilities. The presented system uses a modular architecture and solves the problem by dividing the area between all the robots according to their capabilities. Each aerial robot performs a decomposition based algorithm to create covering paths and a 'one' to 'one' coordination strategy to decide the path segment to patrol. The system is decentralized and fault-tolerant. It ensures a finite time to share information between all the robots and guarantees convergence to the desired steady state, based on the maximal minimum frequency criteria. A set of simulations with a team of quad-rotors is used to validate the approach. www.intechopen.com © 2013 Acevedo et al.; licensee InTech.

Author supplied keywords

Cite

CITATION STYLE

APA

Acevedo, J. J., Arrue, B. C., Maza, I., & Ollero, A. (2013). Distributed approach for coverage and patrolling missions with a team of heterogeneous aerial robots under communication constraints. International Journal of Advanced Robotic Systems, 10. https://doi.org/10.5772/52765

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