A memetic multi-agent collaboration search for space trajectory optimization

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

This paper presents the hybridisation of the fundamental heuristics underneath monotonic basin hopping within the general scheme of multi-agent collaborative search. The basic idea is that the local search performed by each individual agent in multi-agent collaborative search can be substituted with an iteration of basin hopping. Moreover, the local minima that are found during the search process are stored in an archive and at each iteration, the solution vector associated to each agent is extracted from the archive. The new hybrid algorithm is tested on some typical problems in space trajectory design and compared to monotonic basin hopping, a previous implementation of multi-agent collaborative search and to some standard evolutionary algorithms.
LanguageEnglish
Pages186-197
JournalInternational Journal of Bio-inspired Computation
Volume1
Issue number3
DOIs
Publication statusPublished - 2009

Fingerprint

Trajectory Optimization
Trajectories
Evolutionary algorithms
Monotonic
Iteration
Hybrid Algorithm
Local Minima
Local Search
Evolutionary Algorithms
Heuristics
Trajectory
Collaboration
Archives

Keywords

  • global trajectory optimisation
  • memetic algorithms
  • multi-agent systems
  • space mission design
  • collaborative search
  • motoric basin hopping
  • hybrid algorithms
  • evolutionary algorithms
  • bio-inspired computation

Cite this

@article{b0e255561ed4467ba13cb9677ccf410c,
title = "A memetic multi-agent collaboration search for space trajectory optimization",
abstract = "This paper presents the hybridisation of the fundamental heuristics underneath monotonic basin hopping within the general scheme of multi-agent collaborative search. The basic idea is that the local search performed by each individual agent in multi-agent collaborative search can be substituted with an iteration of basin hopping. Moreover, the local minima that are found during the search process are stored in an archive and at each iteration, the solution vector associated to each agent is extracted from the archive. The new hybrid algorithm is tested on some typical problems in space trajectory design and compared to monotonic basin hopping, a previous implementation of multi-agent collaborative search and to some standard evolutionary algorithms.",
keywords = "global trajectory optimisation, memetic algorithms, multi-agent systems, space mission design, collaborative search, motoric basin hopping, hybrid algorithms, evolutionary algorithms, bio-inspired computation",
author = "Massimiliano Vasile",
year = "2009",
doi = "10.1504/IJBIC.2009.023814",
language = "English",
volume = "1",
pages = "186--197",
journal = "International Journal of Bio-inspired Computation",
issn = "1758-0366",
number = "3",

}

TY - JOUR

T1 - A memetic multi-agent collaboration search for space trajectory optimization

AU - Vasile, Massimiliano

PY - 2009

Y1 - 2009

N2 - This paper presents the hybridisation of the fundamental heuristics underneath monotonic basin hopping within the general scheme of multi-agent collaborative search. The basic idea is that the local search performed by each individual agent in multi-agent collaborative search can be substituted with an iteration of basin hopping. Moreover, the local minima that are found during the search process are stored in an archive and at each iteration, the solution vector associated to each agent is extracted from the archive. The new hybrid algorithm is tested on some typical problems in space trajectory design and compared to monotonic basin hopping, a previous implementation of multi-agent collaborative search and to some standard evolutionary algorithms.

AB - This paper presents the hybridisation of the fundamental heuristics underneath monotonic basin hopping within the general scheme of multi-agent collaborative search. The basic idea is that the local search performed by each individual agent in multi-agent collaborative search can be substituted with an iteration of basin hopping. Moreover, the local minima that are found during the search process are stored in an archive and at each iteration, the solution vector associated to each agent is extracted from the archive. The new hybrid algorithm is tested on some typical problems in space trajectory design and compared to monotonic basin hopping, a previous implementation of multi-agent collaborative search and to some standard evolutionary algorithms.

KW - global trajectory optimisation

KW - memetic algorithms

KW - multi-agent systems

KW - space mission design

KW - collaborative search

KW - motoric basin hopping

KW - hybrid algorithms

KW - evolutionary algorithms

KW - bio-inspired computation

U2 - 10.1504/IJBIC.2009.023814

DO - 10.1504/IJBIC.2009.023814

M3 - Article

VL - 1

SP - 186

EP - 197

JO - International Journal of Bio-inspired Computation

T2 - International Journal of Bio-inspired Computation

JF - International Journal of Bio-inspired Computation

SN - 1758-0366

IS - 3

ER -