Fetching the paper…
Reading the bibliography…
The recently introduced Multi-dimensional Archive of Phenotypic Elites (MAP-Elites) is an evolutionary algorithm capable of producing a large archive of diverse, high-performing solutions in a single run.
J. MacQueen, “Some methods for classification and analysis of multivariate observations,” in Proc. 5th Berkeley Symp. on Math. Statist. and Prob. , vol. 1. Berkeley, CA: Univ. of Calif. Press, 1967, pp. 281–297
1967
Earlier work this paper cites.
J. L. Bentley, “Multidimensional binary search trees used for associative searching,” Communications of the ACM , vol. 18, pp. 509–517, 1975
1975
Earlier work this paper cites.
S. Lloyd, “Least squares quantization in PCM,” IEEE Trans. Inf. Theory , vol. 28, no. 2, pp. 129–137, 1982
1982
Earlier work this paper cites.
S. Mahfoud, “Niching methods for genetic algorithms,” Ph.D. dissertation, University of Illinois at Urbana-Champaign, Urbana, IL, 1995
1995
Earlier work this paper cites.
G. R. Harik, “Finding multimodal solutions using restricted tournament selection,” in Proc. of the 6th International Conf. on Genetic Algorithms . San Francisco, CA: Morgan Kaufmann, 1995, pp. 24–31
1995
Earlier work this paper cites.
B. Sareni and L. Krahenbuhl, “Fitness sharing and niching methods revisited,” IEEE Trans. Evol. Comput. , vol. 2, pp. 97–106, 1998
1998
Earlier work this paper cites.
Q. Du, V. Faber, and M. Gunzburger, “Centroidal Voronoi tessellations: applications and algorithms,” SIAM review , vol. 41, pp. 637–676, 1999
1999
Earlier work this paper cites.
F. Aurenhammer and R. Klein, “Voronoi diagrams,” in Handbook of Computational Geometry . Elsevier, 2000, pp. 201–290
2000
Earlier work this paper cites.
N. Hansen and A. Ostermeier, “Completely derandomized self-adaptation in evolution strategies,” Evol. Comp. , vol. 9, pp. 159–195, 2001
2001
Earlier work this paper cites.
C. C. Aggarwal, A. Hinneburg, and D. A. Keim, “On the surprising behavior of distance metrics in high dimensional space,” in International Conference on Database Theory . Springer, 2001, pp. 420–434
2001
Earlier work this paper cites.
L. Ju, Q. Du, and M. Gunzburger, “Probabilistic methods for centroidal Voronoi tessellations and their parallel implementations,” Parallel Computing , vol. 28, no. 10, pp. 1477–1500, 2002
2002
Earlier work this paper cites.
R. E. Lenski, C. Ofria, R. T. Pennock, and C. Adami, “The evolutionary origin of complex features,” Nature , vol. 423, pp. 139–144, 2003
2003
Earlier work this paper cites.
J. Lehman and K. O. Stanley, “Exploiting open-endedness to solve problems through the search for novelty,” in Artificial Life XI . Cambridge, MA: MIT Press, 2008, pp. 329–336
2008
Earlier work this paper cites.
D. L. Theobald, “A formal test of the theory of universal common ancestry,” Nature , vol. 465, no. 7295, pp. 219–222, 2010
2010
Earlier work this paper cites.
S. Doncieux and J.-B. Mouret, “Behavioral diversity measures for evolutionary robotics,” in CEC . IEEE, 2010
2010
Earlier work this paper cites.
M. Sharifzadeh and C. Shahabi, “Vor-tree: R-trees with Voronoi diagrams for efficient processing of spatial nearest neighbor queries,” Proceedings of the VLDB Endowment , vol. 3, pp. 1231–1242, 2010
2010
Cited alongside, same era.
J. Lehman and K. O. Stanley, “Evolving a diversity of virtual creatures through novelty search and local competition,” in GECCO . New York, NY: ACM, 2011, pp. 211–218
2011
Cited alongside, same era.
S. Das, S. Maity, B.-Y. Qu, and P. N. Suganthan, “Real-parameter evolutionary multimodal optimization — a survey of the state-of-the-art,” Swarm and Evolutionary Computation , vol. 1, pp. 71–88, 2011
2011
Cited alongside, same era.
——, “Abandoning objectives: Evolution through the search for novelty alone,” Evol. Comp. , vol. 19, pp. 189–223, 2011
2011
Cited alongside, same era.
J.-B. Mouret, “Novelty-based multiobjectivization,” in New Horizons in Evolutionary Robotics . Springer, 2011, pp. 139–154
J. C. Hateley, H. Wei, and L. Chen, “Fast methods for computing centroidal Voronoi tessellations,” Journal of Scientific Computing , vol. 63, no. 1, pp. 185–212, 2015
2015
Later among the works it cites.
S. Xia, Z. Xiong, Y. Luo, W. Xu, and G. Zhang, “Effectiveness of the Euclidean distance in high dimensional spaces,” Optik , vol. 126, pp. 5614–5619, 2015
2015
Later among the works it cites.
K. J. Locey and J. T. Lennon, “Scaling laws predict global microbial diversity,” Proc. Natl. Acad. Sci. U.S.A. , p. 201521291, 2016
2016
Closest in time.
J. K. Pugh, L. B. Soros, and K. O. Stanley, “Quality diversity: A new frontier for evolutionary computation,” Frontiers in Robotics and AI , vol. 3, p. 40, 2016, doi: 10.3389/frobt.2016.00040
2016
Closest in time.
A. Cully and J.-B. Mouret, “Evolving a behavioral repertoire for a walking robot,” Evol. Comp. , vol. 24, pp. 59–88, 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2011
Cited alongside, same era.
J.-B. Mouret and S. Doncieux, “Encouraging behavioral diversity in evolutionary robotics: An empirical study,” Evol. Comp. , vol. 20, pp. 91–133, 2012
2012
Cited alongside, same era.
A. Cully and J.-B. Mouret, “Behavioral repertoire learning in robotics,” in GECCO . New York, NY: ACM, 2013, pp. 175–182
2013
Cited alongside, same era.
J. Clune, J.-B. Mouret, and H. Lipson, “The evolutionary origins of modularity,” in Proc. R. Soc. B , vol. 280. The Royal Society, 2013, p. 20122863
2013
Cited alongside, same era.
S. Doncieux and J.-B. Mouret, “Beyond black-box optimization: a review of selective pressures for evolutionary robotics,” Evolutionary Intelligence , vol. 7, no. 2, pp. 71–93, 2014
2014
Cited alongside, same era.
2015
Cited alongside, same era.
J. K. Pugh, L. B. Soros, P. A. Szerlip, and K. O. Stanley, “Confronting the challenge of quality diversity,” in GECCO , 2015, pp. 967–974
2015
Cited alongside, same era.
A. Eiben and J. Smith, Introduction to Evolutionary Computing , ser. Natural Computing Series. Berlin, Heidelberg: Springer, 2015
2015
Cited alongside, same era.
2016
Closest in time.
D. Smith, L. Tokarchuk, and G. Wiggins, “Rapid Phenotypic Landscape Exploration Through Hierarchical Spatial Partitioning,” in PPSN . Springer, 2016, pp. 911–920
2016
Closest in time.
D. Tarapore, J. Clune, A. Cully, and J.-B. Mouret, “How do different encodings influence the performance of the MAP-Elites algorithm?” in GECCO . New York, NY: ACM, 2016, pp. 173–180
2016
Closest in time.
M. Duarte, J. Gomes, S. M. Oliveira, and A. L. Christensen, “EvoRBC: Evolutionary Repertoire-based Control for Robots with Arbitrary Locomotion Complexity,” in GECCO , 2016, pp. 93–100
2016
Closest in time.
K. Chatzilygeroudis, A. Cully, and J.-B. Mouret, “Towards semi-episodic learning for robot damage recovery,” in IEEE ICRA Workshop on AI for Long-Term Autonomy , Stockholm, Sweden, 2016
2016
Closest in time.
2016
Closest in time.
——, “Understanding Innovation Engines: Automated Creativity and Improved Stochastic Optimization via Deep Learning,” Evol. Comp. , vol. 24, pp. 545–572, 2016
2016
Closest in time.
J. Lehman, S. Risi, and J. Clune, “Creative generation of 3D objects with deep learning and innovation engines,” in Proc. of the 7th Intern. Conf. on Comput. Creativity . Paris, France: Sony CSL, 2016, pp. 180–187
2016
Closest in time.
A. Cully and Y. Demiris, “Quality and diversity optimization: A unifying modular framework,” IEEE Trans. Evolut. Comput. , 2017
2017
Closest in time.
V. Vassiliades, K. Chatzilygeroudis, and J.-B. Mouret, “A comparison of illumination algorithms in unbounded spaces,” in Proc. of GECCO’17 Companion , Berlin, Germany, July 15-19, 2017, DOI: http://dx.doi.org/10.1145/3067695.3082531
2017
Closest in time.
——, “Comparing multimodal optimization and illumination,” in Proc. of GECCO’17 Companion , Berlin, Germany, July 15-19, 2017, DOI: http://dx.doi.org/10.1145/3067695.3075610
2017
Closest in time.