Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bremermann, H.J.: Optimization through evolution and recombination. In: Yovits, M.C. et al. (eds.) Self-Organizing Systems. Spartan, Washington, DC (1962)
Box, G.E.P.: Evolutionary operation: a method for increasing industrial productivity. Appl. Stat. VI(2), 81–101 (1957)
Rechenberg, I.: Cybernetic solution path of an experimental problem. Royal Aircraft Establishment, Library translation No. 1122, Farnborough
Fogel, L.J.: Autonomous automata. Ind. Res. 4, 14–19 (1962)
Burgin, G.H.: On playing two-person zero-sum games against nonminimax players. IEEE Trans. Syst. Sci. Cybern. SSC-5(4), 369–370 (1969)
Holland, J.H.: Outline for a logical theory of adaptive systems. J. Assoc. Comput. Mach. 3, 297–314 (1962)
Neema, M.N., Maniruzzaman, K.M., Ohgai, A.: New genetic algorithms based approaches to continuous p-median problem. Springer Science (2008)
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)
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)
Ghosh, D.: A Diversification Operator for Genetic Algorithms. In: OPSEARCH. Springer (2012)
Marsili Libelli, S., Alba, P.: Adaptive mutations in genetic algorithms. Soft Comput. (2000)
Dawkins, R.: The Selfish Gene, new edn. Oxford University Press, London (1989)
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)
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)
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)
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)
Yuen, S.Y., Chow, C.K.: A non-revisiting simulated annealing algorithm. Proceedings of IEEE Congress on Evolutionary Computation, pp. 1886–1892 (2008)
Teodoro, P.D.D.: Humanoid robot: development of a simulation environment of an entertainment humanoid robot. Master Thesis, Instituto Superior Técnico (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Tighzert, L., Mendil, B. (2016). Realization of Gymnastic Movements on the Bar by Humanoid Robot Using a New Selfish Gene Algorithm. In: Chikhi, S., Amine, A., Chaoui, A., Kholladi, M., Saidouni, D. (eds) Modelling and Implementation of Complex Systems. Lecture Notes in Networks and Systems, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-319-33410-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-33410-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33409-7
Online ISBN: 978-3-319-33410-3
eBook Packages: EngineeringEngineering (R0)