{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T20:40:06Z","timestamp":1717274406701},"reference-count":30,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4,1]]},"abstract":"<p>Novelty search is an evolutionary approach in which the population is driven towards behavioural innovation instead of towards a fixed objective. The use of behavioural novelty to score candidate solutions precludes convergence to local optima. However, in novelty search, significant effort may be spent on exploration of novel, but unfit behaviours. We propose progressive minimal criteria novelty search (PMCNS) to overcome this issue. In PMCNS, novelty search can freely explore the behaviour space as long as the solutions meet a progressively stricter fitness criterion. We evaluate the performance of our approach by evolving neurocontrollers for swarms of robots in two distinct tasks. Our results show that PMCNS outperforms fitness-based evolution and pure novelty search, and that PMCNS is superior to linear scalarisation of novelty and fitness scores. An analysis of behaviour space exploration shows that the benefits of novelty search are conserved in PMCNS despite the evolutionary pressure towards progressively fitter behaviours.<\/p>","DOI":"10.4018\/ijncr.2014040101","type":"journal-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T15:42:30Z","timestamp":1408722150000},"page":"1-19","source":"Crossref","is-referenced-by-count":1,"title":["PMCNS"],"prefix":"10.4018","volume":"4","author":[{"given":"Jorge","family":"Gomes","sequence":"first","affiliation":[{"name":"LabMAg, Faculdade de Ci\u00eancias da Universidade de Lisboa, Lisboa, Portugal and Instituto de Telecomunica\u00e7\u00f5es, Lisboa, Portugal"}]},{"given":"Paulo","family":"Urbano","sequence":"additional","affiliation":[{"name":"LabMAg, Faculdade de Ci\u00eancias da Universidade de Lisboa, Lisboa, Portugal"}]},{"given":"Anders Lyhne","family":"Christensen","sequence":"additional","affiliation":[{"name":"Instituto Universit\u00e1rio de Lisboa (ISCTE-IUL), Lisboa, Portugal and Instituto de Telecomunica\u00e7\u00f5es, Lisboa, Portugal"}]}],"member":"2432","reference":[{"key":"ijncr.2014040101-0","unstructured":"Bahge\u00e7i, E., & \u015eahin, E. (2005). Evolving aggregation behaviors for swarm robotic systems: A systematic case study. In Proceedings of the Swarm Intelligence Symposium (pp. 333\u2013340). IEEE Press."},{"key":"ijncr.2014040101-1","doi-asserted-by":"publisher","DOI":"10.1162\/106454603322392460"},{"key":"ijncr.2014040101-2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008855018923"},{"key":"ijncr.2014040101-3"},{"key":"ijncr.2014040101-4","doi-asserted-by":"crossref","unstructured":"Cuccu, G., Gomez, F. J., & Glasmachers, T. (2011). Novelty-based restarts for evolution strategies. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 158\u2013163). IEEE Press.","DOI":"10.1109\/CEC.2011.5949613"},{"key":"ijncr.2014040101-5","author":"K.Deb","year":"2001","journal-title":"Multi-objective optimization using evolutionary algorithms"},{"issue":"1-4","key":"ijncr.2014040101-6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/FI-1998-35123403","article-title":"On evolutionary exploration and exploitation.","volume":"35","author":"A. E.Eiben","year":"1998","journal-title":"Fundamenta Informaticae"},{"key":"ijncr.2014040101-7","unstructured":"Goldberg, D. E. (1987). Simple genetic algorithms and the minimal, deceptive problem. In Proceedings of the Genetic Algorithms and Simulated Annealing (Research Notes in Artificial Intelligence, pp. 74\u201388). Pitman Publishing."},{"key":"ijncr.2014040101-8"},{"key":"ijncr.2014040101-9","doi-asserted-by":"publisher","DOI":"10.1007\/s11721-013-0081-z"},{"key":"ijncr.2014040101-10"},{"key":"ijncr.2014040101-11","unstructured":"Jones, T., & Forrest, S. (1995). Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In Proceedings of the International Conference on Genetic Algorithms (pp. 184\u2013192). Morgan Kaufmann."},{"key":"ijncr.2014040101-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2011.08.001"},{"key":"ijncr.2014040101-13","unstructured":"Kirkpatrick, D. A. (2012). Novelty search in competitive coevolution using normalized compression distance. Master thesis, College of Engineering, Florida Institute of Technology."},{"key":"ijncr.2014040101-14","unstructured":"Krcah, P., & Toropila, D. (2010). Combination of novelty search and fitness-based search applied to robot body-brain co-evolution. In Czech-Japan Seminar on Data Analysis and Decision Making in Service Science (pp. 1\u20136)."},{"key":"ijncr.2014040101-15"},{"key":"ijncr.2014040101-16","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00025"},{"key":"ijncr.2014040101-17"},{"key":"ijncr.2014040101-18"},{"key":"ijncr.2014040101-19","unstructured":"Mitchell, M., Forrest, S., & Holland, J. H. (1992). The royal road for genetic algorithms: Fitness landscapes and ga performance. In Proceedings of the European Conference on Artificial Life (pp. 245\u2013254). MIT Press."},{"key":"ijncr.2014040101-20","doi-asserted-by":"crossref","unstructured":"Mouret, J.-B. (2011). Novelty-based multiobjectivization. In New horizons in evolutionary robotics (vol. 341 of Studies in Computational Intelligence, pp. 139\u2013154). Springer Verlag.","DOI":"10.1007\/978-3-642-18272-3_10"},{"key":"ijncr.2014040101-21","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00048"},{"key":"ijncr.2014040101-22","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz-Mel\u00e9ndez, A., Semp\u00e9, F., & Drogoul, A. (2002). Sharing a charging station without explicit communication in collective robotics. In Proceedings of the International Conference on Simulation of Adaptive Behavior (pp. 383\u2013384). MIT Press.","DOI":"10.7551\/mitpress\/3121.003.0065"},{"key":"ijncr.2014040101-23","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2008.09.009"},{"key":"ijncr.2014040101-24"},{"key":"ijncr.2014040101-25"},{"key":"ijncr.2014040101-26","doi-asserted-by":"publisher","DOI":"10.1162\/106365602320169811"},{"key":"ijncr.2014040101-27"},{"key":"ijncr.2014040101-28","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-050684-5.50017-3"},{"key":"ijncr.2014040101-29","doi-asserted-by":"crossref","unstructured":"Zaera, N., Cliff, D., & Bruten, J. (1996). (Not) Evolving collective behaviours in synthetic fish. In Proceedings of the International Conference on Simulation of Adaptive Behavior (pp. 635\u2013644). MIT Press.","DOI":"10.7551\/mitpress\/3118.003.0076"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=113293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T20:24:00Z","timestamp":1717273440000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijncr.2014040101"}},"subtitle":["Using a Progressively Stricter Fitness Criterion to Guide Novelty Search"],"short-title":[],"issued":{"date-parts":[[2014,4,1]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"URL":"https:\/\/doi.org\/10.4018\/ijncr.2014040101","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,1]]}}}