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

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

Title

Aerial coverage optimization in precision agriculture management: A musical harmony inspired approach

AuthorsValente, João; Cerro, Jaime del ; Barrientos, Antonio ; Sanz Muñoz, David
KeywordsPrecision agriculture
Harmony search
Coverage path planning
Quadrotor
Mini unmanned aerial vehicles
Issue DateNov-2013
PublisherElsevier
CitationComputers and Electronics in Agriculture 99: 153-159 (2013)
AbstractThe coverage path planning (CPP) problem belongs to a sub-field of motion planning where the goal is to compute a complete coverage trajectory from initial to final position, within the robot workspace subjected to a set of restrictions. This problem has a complexity NP-complete, and has no general solution. Moreover, there are very few studies addressing this problem applied to aerial vehicles. Previous studies point out that the variable of interest to be optimized is the number of turns. Thus, by minimizing the number of turns, it can be ensured that the mission time is likewise minimized. In this paper, an approach to optimize this cost variable is proposed. This approach uses a quite novel algorithm called Harmony Search (HS). HS is a meta-heuristic algorithm based on jazz musician's improvisation through a pleasant harmony. Finally, the results achieved with this technique are compared with the results obtained with the previous approach found in the literature.
DescriptionPreprint submitted to Computers and Electronics in Agriculture
Publisher version (URL)http://dx.doi.org/10.1016/j.compag.2013.09.008
URIhttp://hdl.handle.net/10261/91329
DOI10.1016/j.compag.2013.09.008
ISSN0168-1699
Appears in Collections:(CAR) Artículos
Show full item record
Review this work
 

Related articles:


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