Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/54796
Title: Underwater glider path planning and population size reduction in differential evolution
Authors: Zamuda, Aleš
Hernández-Sosa, José Daniel 
UNESCO Clasification: 120304 Inteligencia artificial
331913 Vehículos submarinos
Keywords: Vehicles
Optimization
Issue Date: 2015
Publisher: Springer 
Journal: Lecture Notes in Computer Science 
Conference: 15th International Conference on Computer Aided Systems Theory, (EUROCAST 2015) 
Abstract: This paper presents an approach to underwater glider path planning (UGPP), where the population size reduction mechanism is introduced into the differential evolution (DE) meta-heuristic and two types of DE strategies (DE/best and DE/rand) are applied interchangeably. The newly proposed DE instance algorithms using population size reduction on the best and rand DE strategies are assessed and compared on 12 test scenarios using the proposed approach. A Bonferroni-Dunns statistical hypothesis testing is conducted to confirm out-performance of the favoured DE/best strategy over the DE/rand strategy for the 12 UGGP scenarios utilized. The analysis suggests that the approach can benefit from gradually reducing the population size and also tuning the DE parameters. Thereby, this contributes to extend the operational capabilities of the glider vehicle and to improve its value as a marine sensor, facilitating the implementation of flexible sampling schemes.
URI: http://hdl.handle.net/10553/54796
ISBN: 978-3-319-27339-6
ISSN: 0302-9743
DOI: 10.1007/978-3-319-27340-2_104
Source: Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science, v. 9520 LNCS, p. 853-860
Appears in Collections:Capítulo de libro
Show full item record

SCOPUSTM   
Citations

4
checked on Nov 17, 2024

WEB OF SCIENCETM
Citations

4
checked on Nov 17, 2024

Page view(s)

131
checked on Nov 2, 2024

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.