• DocumentCode
    2063500
  • Title

    Efficient representation of Recurrent Neural Networks for markovian/non-markovian non-linear control problems

  • Author

    Khan, Maryam Mahsal ; Khan, Gul Muhammad ; Miller, Julian F.

  • Author_Institution
    Dept. of Comput. Syst. Eng., Univ. of Eng. & Technol., Peshawar, Pakistan
  • fYear
    2010
  • fDate
    Nov. 29 2010-Dec. 1 2010
  • Firstpage
    615
  • Lastpage
    620
  • Abstract
    A novel representation of Recurrent Artificial neural network is proposed for non-linear markovian and non-markovian control problems. The network architecture is inspired by Cartesian Genetic Programming. The neural network attributes namely weights, topology and functions are encoded using Cartesian Genetic Programming. The proposed algorithm is applied on the standard benchmark control problem: double pole balancing for both markovian and non-markovian cases. Results demonstrate that the network has the ability to generate neural architecture and parameters that can solve these problems in substantially fewer number of evaluations in comparison to earlier neuroevolutionary techniques. The power of Recurrent Cartesian Genetic Programming Artificial Neural Network (RCGPANN) is its representation which leads to a thorough evolutionary search producing generalized networks.
  • Keywords
    Markov processes; genetic algorithms; neurocontrollers; nonlinear control systems; recurrent neural nets; Markovian-nonMarkovian nonlinear control problems; cartesian genetic programming; evolutionary search; generalized networks; neural architecture; neuroevolutionary techniques; recurrent artificial neural network; recurrent neural networks; standard benchmark control problem; Artificial Neural Network; NeuroEvolution; NonLinear Control Problems; Pole Balancing; Recurrent Networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Intelligent Systems Design and Applications (ISDA), 2010 10th International Conference on
  • Conference_Location
    Cairo
  • Print_ISBN
    978-1-4244-8134-7
  • Type

    conf

  • DOI
    10.1109/ISDA.2010.5687197
  • Filename
    5687197