Realization of Gymnastic Movements on the Bar by Humanoid Robot Using a New Selfish Gene Algorithm

  • Lyes TighzertEmail author
  • Boubekeur Mendil
Conference paper
Part of the Lecture Notes in Networks and Systems book series (LNNS, volume 1)


This paper proposes a new selfish gene algorithm called the Replaces and Never Penalizes Selfish Gene Algorithm (RNPSGA). This new variant of selfish gene algorithm replaces the alleles of the less fit individual by the alleles of the fittest rather than penalizing them. The intensification of the search is then increased. The proposed algorithm is tested under some famous benchmark functions and compared to the standard selfish gene algorithm. We analyzes also the quality of convergence, the accuracy, the stability and the processing time of the proposed algorithm. We design by Solidwork a new virtual model of the humanoid robot hanging on the bar. The model is controlled using Simscape/Matlab. The proposed algorithm is then applied to the designed humanoid robot. The objective is to realize the gymnastic movements on the bar. An intelligent LQR controller is proposed to stabilize the swing-up of the robot.


Selfish gene Computational intelligence Humanoid Robots Gymnastic Solidworks/Simmechanic LQR Optimal control 


  1. 1.
    Bremermann, H.J.: Optimization through evolution and recombination. In: Yovits, M.C. et al. (eds.) Self-Organizing Systems. Spartan, Washington, DC (1962)Google Scholar
  2. 2.
    Box, G.E.P.: Evolutionary operation: a method for increasing industrial productivity. Appl. Stat. VI(2), 81–101 (1957)Google Scholar
  3. 3.
    Rechenberg, I.: Cybernetic solution path of an experimental problem. Royal Aircraft Establishment, Library translation No. 1122, FarnboroughGoogle Scholar
  4. 4.
    Fogel, L.J.: Autonomous automata. Ind. Res. 4, 14–19 (1962)Google Scholar
  5. 5.
    Burgin, G.H.: On playing two-person zero-sum games against nonminimax players. IEEE Trans. Syst. Sci. Cybern. SSC-5(4), 369–370 (1969)Google Scholar
  6. 6.
    Holland, J.H.: Outline for a logical theory of adaptive systems. J. Assoc. Comput. Mach. 3, 297–314 (1962)CrossRefzbMATHGoogle Scholar
  7. 7.
    Neema, M.N., Maniruzzaman, K.M., Ohgai, A.: New genetic algorithms based approaches to continuous p-median problem. Springer Science (2008)Google Scholar
  8. 8.
    Chow, C.K., Yuen, S.Y.: An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans. Evol. Comput. 15(6), 741–768 (2011)Google Scholar
  9. 9.
    Yuen, S.Y., Devr, C.K.C.: A genetic algorithm that adaptively mutates and never revisits. IEEE Trans. Evol. Comput. 13(2), 454–472 (2009)Google Scholar
  10. 10.
    Ghosh, D.: A Diversification Operator for Genetic Algorithms. In: OPSEARCH. Springer (2012)Google Scholar
  11. 11.
    Marsili Libelli, S., Alba, P.: Adaptive mutations in genetic algorithms. Soft Comput. (2000)Google Scholar
  12. 12.
    Dawkins, R.: The Selfish Gene, new edn. Oxford University Press, London (1989)Google Scholar
  13. 13.
    Corno, F., Reorda, M.S., Squillero, G.: The selfish gene algorithm: a new evolutionary optimization strategy. In: ACM Symposium on Applied Computing SAC’98, Atlanta (1998)Google Scholar
  14. 14.
    Xin, Xin, Kaneda, Masahiro: Swing-up control for a 3-DOF gymnastic robot with passive first joint: design and analysis. IEEE Trans. Robot. 23(6), 1277–1285 (2007)CrossRefGoogle Scholar
  15. 15.
    Liang, J.J., Suganthan, P.N., Deb, K.: Novel composition test functions for numerical global optimization. In: Swarm Intelligence Symposium, 2005. SIS 2005. Proceedings 2005, pp. 68–75. IEEE (2005)Google Scholar
  16. 16.
    Chow, C.K., Yuen, S.Y.: An evolutionary algorithm that makes decision based on the entire previous search history. IEEE Trans. Evol. Comput. 15(6), 741–769 (2011)CrossRefGoogle Scholar
  17. 17.
    Yuen, S.Y., Chow, C.K.: A non-revisiting simulated annealing algorithm. Proceedings of IEEE Congress on Evolutionary Computation, pp. 1886–1892 (2008)Google Scholar
  18. 18.
    Teodoro, P.D.D.: Humanoid robot: development of a simulation environment of an entertainment humanoid robot. Master Thesis, Instituto Superior Técnico (2007)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Laboratoire de Technologie Industrielle et de l’Information (LTII), Faculté de TechnologieUniversité de BejaiaBejaiaAlgeria

Personalised recommendations