{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T07:12:07Z","timestamp":1777360327636,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031024610","type":"print"},{"value":"9783031024627","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-02462-7_43","type":"book-chapter","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T23:02:49Z","timestamp":1649977369000},"page":"685-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Neuroevolution Trajectory Networks of the Behaviour Space"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1780-2259","authenticated-orcid":false,"given":"Stefano","family":"Sarti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0198-9095","authenticated-orcid":false,"given":"Jason","family":"Adair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7649-5669","authenticated-orcid":false,"given":"Gabriela","family":"Ochoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"key":"43_CR1","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-030-66515-9_4","volume-title":"Black Box Optimization, Machine Learning, and No-Free Lunch Theorems","author":"K Chatzilygeroudis","year":"2021","unstructured":"Chatzilygeroudis, K., Cully, A., Vassiliades, V., Mouret, J.-B.: Quality-diversity optimization: a novel branch of stochastic optimization. In: Pardalos, P.M., Rasskazova, V., Vrahatis, M.N. (eds.) Black Box Optimization, Machine Learning, and No-Free Lunch Theorems. SOIA, vol. 170, pp. 109\u2013135. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-66515-9_4"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"Costa, V., Louren\u00e7o, N., Machado, P.: Coevolution of generative adversarial networks. In: International Conference on the Applications of Evolutionary Computation (Part of EvoStar). pp. 473\u2013487. Springer (2019)","DOI":"10.1007\/978-3-030-16692-2_32"},{"key":"43_CR3","unstructured":"Csardi, G., Nepusz, T.: The iGraph software package for complex network research. Int. J. Complex Syst. 1695 (2006)"},{"issue":"2","key":"43_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TEVC.2017.2704781","volume":"22","author":"A Cully","year":"2018","unstructured":"Cully, A., Demiris, Y.: Quality and diversity optimization: a unifying modular framework. IEEE Trans. Evol. Comput. 22(2), 245\u2013259 (2018)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Doncieux, S., Laflaqui\u00e8re, A., Coninx, A.: Novelty search: a theoretical perspective. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 99\u2013106 (2019)","DOI":"10.1145\/3321707.3321752"},{"key":"43_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31, 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"43_CR7","unstructured":"Lehman, J., Stanley, K.O.: Exploiting open-endedness to solve problems through the search for novelty. In: ALIFE Xi, pp. 329\u2013336 (2008)"},{"issue":"2","key":"43_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1162\/EVCO\\_a_00025","volume":"19","author":"J Lehman","year":"2011","unstructured":"Lehman, J., Stanley, K.O.: Abandoning objectives: evolution through the search for novelty alone. Evol. Comput. 19(2), 189\u2013222 (2011). https:\/\/doi.org\/10.1162\/EVCO_a_00025","journal-title":"Evol. Comput."},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Lehman, J., Stanley, K.O.: Evolving a diversity of virtual creatures through novelty search and local comp. In: GECCO, pp. 211\u2013218 (2011)","DOI":"10.1145\/2001576.2001606"},{"key":"43_CR10","unstructured":"Lehman, J., Stanley, K.O., et al.: Exploiting open-endedness to solve problems through the search for novelty (2008)"},{"key":"43_CR11","unstructured":"McIntyre, A., Kallada, M., Miguel, C.G., da Silva, C.F.: NEAT-Python. https:\/\/github.com\/CodeReclaimers\/neat-python"},{"key":"43_CR12","doi-asserted-by":"publisher","unstructured":"Meyerson, E., Lehman, J., Miikkulainen, R.: Learning behavior characterizations for novelty search, pp. 149\u2013156 (2016). https:\/\/doi.org\/10.1145\/2908812.2908929","DOI":"10.1145\/2908812.2908929"},{"issue":"1","key":"43_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1162\/EVCO_a_00048","volume":"20","author":"JB Mouret","year":"2012","unstructured":"Mouret, J.B., Doncieux, S.: Encouraging behavioral diversity in evolutionary robotics: an empirical study. Evol. Comput. 20(1), 91\u2013133 (2012)","journal-title":"Evol. Comput."},{"key":"43_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/access.2021.3126015","volume":"9","author":"V Narvaez-Teran","year":"2021","unstructured":"Narvaez-Teran, V., Ochoa, G., Rodriguez-Tello, E.: Search trajectory networks applied to the cyclic bandwidth sum problem. IEEE Access 9, 1\u20131 (2021). https:\/\/doi.org\/10.1109\/access.2021.3126015","journal-title":"IEEE Access"},{"key":"43_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An Introduction. Oxford University Press, Oxford (2010)"},{"key":"43_CR16","doi-asserted-by":"publisher","first-page":"107492","DOI":"10.1016\/j.asoc.2021.107492","volume":"109","author":"G Ochoa","year":"2021","unstructured":"Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks: a tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput. 109, 107492 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107492","journal-title":"Appl. Soft Comput."},{"key":"43_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-030-43722-0_5","volume-title":"Applications of Evolutionary Computation","author":"G Ochoa","year":"2020","unstructured":"Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks of population-based algorithms in continuous spaces. In: Castillo, P.A., Jim\u00e9nez Laredo, J.L., Fern\u00e1ndez de Vega, F. (eds.) EvoApplications 2020. LNCS, vol. 12104, pp. 70\u201385. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-43722-0_5"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-319-55453-2_16","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2017","unstructured":"Ochoa, G., Veerapen, N., Daolio, F., Tomassini, M.: Understanding phase transitions with local optima networks: number partitioning as a case study. In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 233\u2013248. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_16"},{"key":"43_CR19","volume-title":"Hands-On Neuroevolution with Python","author":"I Omelianenko","year":"2019","unstructured":"Omelianenko, I.: Hands-On Neuroevolution with Python. Packt Publishing Limited, Birmingham (2019)"},{"key":"43_CR20","doi-asserted-by":"publisher","unstructured":"Pugh, J.K., Soros, L.B., Stanley, K.O.: Quality diversity: a new frontier for evolutionary computation. Front. Robot. AI 3(JUL), 1\u201317 (2016). https:\/\/doi.org\/10.3389\/frobt.2016.00040","DOI":"10.3389\/frobt.2016.00040"},{"key":"43_CR21","unstructured":"Real, E., et al.: Large-scale evolution of image classifiers. In: International Conference on Machine Learning, pp. 2902\u20132911. PMLR (2017)"},{"key":"43_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"714","DOI":"10.1007\/978-3-030-72699-7_45","volume-title":"Applications of Evolutionary Computation","author":"S Sarti","year":"2021","unstructured":"Sarti, S., Ochoa, G.: A NEAT visualisation of neuroevolution trajectories. In: Castillo, P.A., Jim\u00e9nez Laredo, J.L. (eds.) EvoApplications 2021. LNCS, vol. 12694, pp. 714\u2013728. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72699-7_45"},{"issue":"3","key":"43_CR23","first-page":"171","volume":"4","author":"NT Siebel","year":"2007","unstructured":"Siebel, N.T., Sommer, G.: Evolutionary reinforcement learning of artificial neural networks. Int. J. Hybrid Intell. Syst. 4(3), 171\u2013183 (2007)","journal-title":"Int. J. Hybrid Intell. Syst."},{"key":"43_CR24","doi-asserted-by":"publisher","unstructured":"Silva, F., Correia, L., Christensen, A.L.: Evolutionary online behaviour learning and adaptation in real robots. Roy. Soc. Open Sci. 4(7) (2017). https:\/\/doi.org\/10.1098\/rsos.160938","DOI":"10.1098\/rsos.160938"},{"key":"43_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1038\/s42256-018-0006-z","volume":"2","author":"KO Stanley","year":"2019","unstructured":"Stanley, K.O., Clune, J., Lehman, J., Miikkulainen, R.: Designing neural networks through neuroevolution. Nat. Mach. Intell. 2, 24\u201335 (2019)","journal-title":"Nat. Mach. Intell."},{"key":"43_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1613\/jair.1338","volume":"21","author":"KO Stanley","year":"2004","unstructured":"Stanley, K.O., Miikkulainen, R.: Competitive coevolution through evolutionary complexification. J. Artif. Intell. Res. 21, 63\u2013100 (2004)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-02462-7_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:12:14Z","timestamp":1710249134000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-02462-7_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031024610","9783031024627"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-02462-7_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.56","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}