Surveillance of unmanned aerial vehicles using probability collectives

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A rising deployment of unmanned aerial vehicles in complex environment operations requires advanced coordination and planning methods. We address the problem of multi-UAV-based area surveillance and collision avoidance. The surveillance problem contains non-linear components and non-linear constraints which makes the optimization problem a hard one. We propose discretization of the problem based on the definition of the points of interest and time steps to reduce its complexity. The objective function integrates both the area surveillance and collision avoidance sub-problems. The optimization task is solved using a probability collection solver that allows to distribute computation of the optimization. We have implemented the probability collective solver as a multi-agent simulation. The results show the approach can be used for this problem. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Volf, P., Šišlák, D., Pavlíček, D., & Pěchouček, M. (2011). Surveillance of unmanned aerial vehicles using probability collectives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6867 LNAI, pp. 235–245). https://doi.org/10.1007/978-3-642-23181-0_23

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