Por favor, use este identificador para citar o enlazar a este item: http://hdl.handle.net/10261/170749
COMPARTIR / EXPORTAR:
logo share SHARE logo core CORE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Invitar a revisión por pares abierta
Título

Comparison of heuristic algorithms in discrete search and surveillance tasks using aerial swarms

AutorGarcía-Aunon, Pablo; Barrientos, Antonio CSIC ORCID
Palabras clavesurveillance
Comparison
patterns
Behaviour
swarm robotics
Search
Fecha de publicación2018
EditorMultidisciplinary Digital Publishing Institute
CitaciónApplied Sciences (Switzerland) 8 (2018)
ResumenThe search of a given area is one of the most studied tasks in swarm robotics. Different heuristic methods have been studied in the past taking into account the peculiarities of these systems (number of robots, limited communications and sensing and computational capacities). In this work, we introduce a behavioral network made up of different well-known behaviors that act together to achieve a good performance, while adapting to different scenarios. The algorithm is compared with six strategies based on movement patterns in terms of three performance models. For the comparison, four scenario types are considered: plain, with obstacles, with the target location probability distribution and a combination of obstacles and the target location probability distribution. For each scenario type, different variations are considered, such as the number of agents and area size. Results show that although simplistic solutions may be convenient for the simplest scenario type, for the more complex ones, the proposed algorithm achieves better results.
URIhttp://hdl.handle.net/10261/170749
DOI10.3390/app8050711
ISSN2076-3417
Aparece en las colecciones: (CAR) Artículos




Ficheros en este ítem:
Fichero Descripción Tamaño Formato
Garcia_Aunon_Comparison_applsci-08-00711.pdf1 MBAdobe PDFVista previa
Visualizar/Abrir
Mostrar el registro completo

CORE Recommender

SCOPUSTM   
Citations

13
checked on 17-mar-2024

WEB OF SCIENCETM
Citations

14
checked on 22-feb-2024

Page view(s)

279
checked on 28-mar-2024

Download(s)

242
checked on 28-mar-2024

Google ScholarTM

Check

Altmetric

Altmetric


Este item está licenciado bajo una Licencia Creative Commons Creative Commons