English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/170749
Share/Impact:
Statistics
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE
Exportar a otros formatos:

Title

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

AuthorsGarcia-Aunon, Pablo; Barrientos, Antonio
Keywordssurveillance
comparison
patterns
behaviors
swarm robotics
search
Issue Date2018
PublisherMultidisciplinary Digital Publishing Institute
CitationApplied Sciences (Switzerland) 8 (2018)
AbstractThe 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
DOIhttp://dx.doi.org/10.3390/app8050711
ISSN2076-3417
Appears in Collections:(CAR) Artículos
Files in This Item:
File Description SizeFormat 
Garcia_Aunon_Comparison_applsci-08-00711.pdf1 MBAdobe PDFThumbnail
View/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.