Abstract
Particle Swarm Optimization (PSO) is a well-known population-based optimization algorithm. Most often it is applied to optimize objective-based fitness functions that reward progress towards a desired objective or behavior. As a result, search increasingly focuses on higher-fitness areas. However, in problems with many local optima, such focus often leads to premature convergence that precludes reaching the intended objective. To remedy this problem in certain types of domains, this paper introduces Novelty-driven Particle Swarm Optimization (NdPSO), which is motivated by the novelty search algorithm in evolutionary computation. In this method particles are driven only towards instances significantly different from those found before. By ignoring the objective this way, NdPSO can circumvent the problem of deceptive local optima. Because novelty search has previously shown potential for solving tasks in genetic programming, this paper implements NdPSO as an extension of the grammatical swarm method, which combines PSO with genetic programming. The resulting NdPSO implementation is tested in three different domains representative of those in which it might provide advantage over objective-driven PSO. That is, deceptive domains in which it is easy to derive a meaningful high-level description of novel behavior. In each of the tested domains NdPSO outperforms both objective-based PSO and random-search, demonstrating its promise as a tool for solving deceptive problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4, IEEE (1995)
Peer, E.S., Van den Bergh, F., Engelbrecht, A.P.: Using neighbourhoods with the guaranteed convergence PSO. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium, SIS 2003, pp. 235–242. IEEE (2003)
Ratnaweera, A., Halgamuge, S.K., Watson, H.C.: Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Trans. Evol. Comput. 8(3), 240–255 (2004)
Vesterstrom, J., Thomsen, R.: A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In: Congress on Evolutionary Computation, CEC2004, vol. 2. IEEE (2004)
Kennedy, J.: Bare bones particle swarms. In: Proceedings of the 2003 IEEE Swarm Intelligence Symposium, SIS03, pp. 80–87. IEEE (2003)
Lehman, J., Stanley, K.O.: Exploiting open-endedness to solve problems through the search for novelty. In: Proceedings of the Eleventh International Conference on Artificial Life (ALIFE XI). MIT Press, Cambridge (2008)
Lehman, J., Stanley, K.O., Miikkulainen, R.: Effective diversity maintenance in deceptive domains. In: Proceeding of the Fifteenth Annual Conference on Genetic and Evolutionary Computation Conference, pp. 215–222. ACM (2013)
Lehman, J., Stanley, K.O.: Efficiently evolving programs through the search for novelty. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation, pp. 837–844. ACM (2010)
Lehman, J., Stanley, K.O.: Novelty search and the problem with objectives. In: Riolo, R., Vladislavleva, E., Moore, J.H. (eds.) Genetic Programming Theory and Practice IX, pp. 37–56. Springer, New York (2011)
Urbano, P., Georgiou, L.: Improving grammatical evolution in santa fe trail using novelty search. In: Advances in Artificial Life, ECAL, vol. 12 (2013)
ONeill, M., Brabazon, A.: Grammatical swarm: The generation of programs by social programming. Natural Comput. 5(4), 443–462 (2006)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol. 4 (1995)
Ozcan, E., Mohan, C.K.: Analysis of a simple particle swarm optimization system. Intell. Eng. Syst. Through Artif. Neural Netw. 8, 253–258 (1998)
Medina, A.J.R., Pulido, G.T., Ramrez-Torres, J.G.: A comparative study of neighborhood topologies for particle swarm optimizers. In: IJCCI, pp. 152–159 (2009)
Ali, M., Kaelo, P.: Improved particle swarm algorithms for global optimization. Appl. Math. Comput. 196, 578–593 (2008)
Omran, M., Al-Sharhan, S.: Barebones particle swarm methods for unsupervised image classification. In: IEEE Congress on Evolutionary Computation, CEC 2007, IEEE (2007)
Yao, J., Han, D.: Improved barebones particle swarm optimization with neighborhood search and its application on ship design. Math. Prob. Eng. 2013 (2013)
Ryan, C., Collins, J.J., Neill, M.O.: Grammatical evolution: evolving programs for an arbitrary language. In: Banzhaf, W., Poli, R., Schoenauer, M., Fogarty, T.C. (eds.) EuroGP 1998. LNCS, vol. 1391, p. 83. Springer, Heidelberg (1998)
Georgiou, L., Teahan, W.J.: jGE-A Java implementation of Grammatical Evolution. In: Proceedings of the 10th WSEAS International Conference on SYSTEMS, Vouliagmeni. Athens: WSEAS (2006)
Georgiou, L., Teahan, W.J.: Grammatical evolution and the santa fe trail problem. In: Evolutionary Computation (ICEC 2010) (2010)
Koza, J.R.: Genetic evolution and co-evolution of computer programs. In: Langton, C.T.C., Farmer, J.D., Ras-mussen, S. (eds.) Artificial Life II. SFI Studies in the Sciences of Complexity, vol. X, pp. 603–629. Addison-Wesley, Santa Fe (1991)
Lehman, J., Stanley, K.O.: Efficiently evolving programs through the search for novelty. In: Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation. ACM (2010)
Acknowledgments
This work was funded by FCT project EXPL/EEI-SI/1861/2013.
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
Galvao, D.F., Lehman, J., Urbano, P. (2016). Novelty-Driven Particle Swarm Optimization. In: Bonnevay, S., Legrand, P., Monmarché, N., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2015. Lecture Notes in Computer Science(), vol 9554. Springer, Cham. https://doi.org/10.1007/978-3-319-31471-6_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-31471-6_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31470-9
Online ISBN: 978-3-319-31471-6
eBook Packages: Computer ScienceComputer Science (R0)