• DocumentCode
    1642427
  • Title

    Memory-enhanced Evolutionary Robotics: The Echo State Network Approach

  • Author

    Hartland, Cedric ; Bredeche, Nicolas ; Sebag, Michèle

  • Author_Institution
    TAO - CNRS - INRIA, Univ. Paris-Sud, Orsay
  • fYear
    2009
  • Firstpage
    2788
  • Lastpage
    2795
  • Abstract
    Interested in Evolutionary Robotics, this paper focuses on the acquisition and exploitation of memory skills. The targeted task is a well-studied benchmark problem, the Tolman maze, requiring in principle the robotic controller to feature some (limited) counting abilities. An elaborate experimental setting is used to enforce the controller generality and prevent opportunistic evolution from mimicking deliberative skills through smart reactive heuristics. The paper compares the prominent NEAT approach, achieving the non-parametric optimization of Neural Nets, with the evolutionary optimization of Echo State Networks, pertaining to the recent field of Reservoir Computing. While both search spaces offer a sufficient expressivity and enable the modelling of complex dynamic systems, the latter one is amenable to robust parametric, linear optimization with Covariance Matrix Adaptation-Evolution Strategies.
  • Keywords
    covariance matrices; evolutionary computation; mobile robots; neurocontrollers; optimisation; recurrent neural nets; robust control; topology; Tolman maze; autonomous robotics; covariance matrix adaptation; echo state network approach; linear optimization; memory-enhanced evolutionary robotics; neuro-evolution-of-augmenting topology; nonparametric neural net optimization; recurrent neural net; robust parametric; smart reactive heuristics; Computer networks; Covariance matrix; Erbium; Neural networks; Neurons; Orbital robotics; Reservoirs; Robot control; Robot sensing systems; Robustness;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2009. CEC '09. IEEE Congress on
  • Conference_Location
    Trondheim
  • Print_ISBN
    978-1-4244-2958-5
  • Electronic_ISBN
    978-1-4244-2959-2
  • Type

    conf

  • DOI
    10.1109/CEC.2009.4983292
  • Filename
    4983292