Fetching the paper…
Reading the bibliography…
Quality-Diversity (QD) algorithms are powerful exploration algorithms that allow robots to discover large repertoires of diverse and high-performing skills.
J. Lehman and K. O. Stanley, “Evolving a diversity of virtual creatures through novelty search and local competition,” in Proceedings of the 13th annual conference on Genetic and evolutionary computation , 2011, pp. 211–218
2011
Earlier work this paper cites.
M. Deisenroth and C. E. Rasmussen, “Pilco: A model-based and data-efficient approach to policy search,” in Proceedings of the 28th International Conference on machine learning (ICML-11) . Citeseer, 2011, pp. 465–472
2011
Earlier work this paper cites.
A. Cully and J.-B. Mouret, “Behavioral repertoire learning in robotics,” in Proceedings of the 15th annual conference on Genetic and evolutionary computation , 2013, pp. 175–182
2013
Earlier work this paper cites.
A. Cully, J. Clune, D. Tarapore, and J.-B. Mouret, “Robots that can adapt like animals,” Nature , vol. 521, no. 7553, pp. 503–507, 2015
2015
Earlier work this paper cites.
2015
Earlier work this paper cites.
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
2016
Earlier work this paper cites.
A. Nguyen, J. Yosinski, and J. Clune, “Understanding innovation engines: Automated creativity and improved stochastic optimization via deep learning,” Evolutionary computation , vol. 24, no. 3, pp. 545–572, 2016
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
2016
Earlier work this paper cites.
R. Calandra, J. Peters, C. E. Rasmussen, and M. P. Deisenroth, “Manifold gaussian processes for regression,” in 2016 International Joint Conference on Neural Networks (IJCNN) . IEEE, 2016, pp. 3338–3345
2016
Earlier work this paper cites.
A. Cully and Y. Demiris, “Quality and diversity optimization: A unifying modular framework,” IEEE Transactions on Evolutionary Computation , vol. 22, no. 2, pp. 245–259, 2017
2017
Earlier work this paper cites.
K. Chatzilygeroudis, V. Vassiliades, and J.-B. Mouret, “Reset-free trial-and-error learning for robot damage recovery,” Robotics and Autonomous Systems , vol. 100, pp. 236–250, 2018
2018
Earlier work this paper cites.
2018
Earlier work this paper cites.
T. Kurutach, I. Clavera, Y. Duan, A. Tamar, and P. Abbeel, “Model-ensemble trust-region policy optimization,” in International Conference on Learning Representations , 2018
2018
Earlier work this paper cites.
I. Clavera, J. Rothfuss, J. Schulman, Y. Fujita, T. Asfour, and P. Abbeel, “Model-based reinforcement learning via meta-policy optimization,” in Conference on Robot Learning . PMLR, 2018, pp. 617–629
2018
Cited alongside, same era.
D. Ha and J. Schmidhuber, “World models,” arXiv preprint arXiv:1803.10122 , 2018
2018
Cited alongside, same era.
V. Vassiliades and J.-B. Mouret, “Discovering the elite hypervolume by leveraging interspecies correlation,” Proceedings of the Genetic and Evolutionary Computation Conference , 2018
2018
Cited alongside, same era.
2018
Cited alongside, same era.
2019
Later among the works it cites.
2020
Later among the works it cites.
R. Sekar, O. Rybkin, K. Daniilidis, P. Abbeel, D. Hafner, and D. Pathak, “Planning to explore via self-supervised world models,” in International Conference on Machine Learning . PMLR, 2020, pp. 8583–8592
2020
Later among the works it cites.
A. Nagabandi, K. Konolige, S. Levine, and V. Kumar, “Deep dynamics models for learning dexterous manipulation,” in Conference on Robot Learning . PMLR, 2020, pp. 1101–1112
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Gaier, A. Asteroth, and J.-B. Mouret, “Data-efficient design exploration through surrogate-assisted illumination,” Evolutionary computation , vol. 26, no. 3, pp. 381–410, 2018
2018
Cited alongside, same era.
A. Péré, S. Forestier, O. Sigaud, and P.-Y. Oudeyer, “Unsupervised learning of goal spaces for intrinsically motivated goal exploration,” in ICLR2018-6th International Conference on Learning Representations , 2018
2018
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2019
Cited alongside, same era.
D. Hafner, T. Lillicrap, I. Fischer, R. Villegas, D. Ha, H. Lee, and J. Davidson, “Learning latent dynamics for planning from pixels,” in International Conference on Machine Learning . PMLR, 2019, pp. 2555–2565
2019
Cited alongside, same era.
D. Hafner, T. Lillicrap, J. Ba, and M. Norouzi, “Dream to control: Learning behaviors by latent imagination,” in International Conference on Learning Representations , 2019
2019
Cited alongside, same era.
M. C. Fontaine, S. Lee, L. B. Soros, F. de Mesentier Silva, J. Togelius, and A. K. Hoover, “Mapping hearthstone deck spaces through map-elites with sliding boundaries,” in Proceedings of The Genetic and Evolutionary Computation Conference , 2019, pp. 161–169
2019
Cited alongside, same era.
C. Colas, V. Madhavan, J. Huizinga, and J. Clune, “Scaling map-elites to deep neuroevolution,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference , 2020, pp. 67–75
2020
Later among the works it cites.
R. Kaushik, P. Desreumaux, and J.-B. Mouret, “Adaptive prior selection for repertoire-based online adaptation in robotics,” Frontiers in Robotics and AI , vol. 6, p. 151, 2020
2020
Later among the works it cites.
S. Kumar, A. Kumar, S. Levine, and C. Finn, “One solution is not all you need: Few-shot extrapolation via structured maxent rl,” Advances in Neural Information Processing Systems , vol. 33, 2020
2020
Later among the works it cites.
2020
Later among the works it cites.
M. C. Fontaine, J. Togelius, S. Nikolaidis, and A. K. Hoover, “Covariance matrix adaptation for the rapid illumination of behavior space,” in Proceedings of the 2020 genetic and evolutionary computation conference , 2020, pp. 94–102
2020
Later among the works it cites.
2020
Later among the works it cites.
A. Rajeswaran, I. Mordatch, and V. Kumar, “A game theoretic framework for model based reinforcement learning,” in International Conference on Machine Learning . PMLR, 2020, pp. 7953–7963
2020
Later among the works it cites.
G. Paolo, A. Laflaquiere, A. Coninx, and S. Doncieux, “Unsupervised learning and exploration of reachable outcome space,” in 2020 IEEE International Conference on Robotics and Automation (ICRA) . IEEE, 2020, pp. 2379–2385
2020
Later among the works it cites.
A. Ecoffet, J. Huizinga, J. Lehman, K. O. Stanley, and J. Clune, “First return, then explore,” Nature , vol. 590, no. 7847, pp. 580–586, 2021
2021
Closest in time.
O. Nilsson and A. Cully, “Policy Gradient Assisted MAP-Elites,” in The Genetic and Evolutionary Computation Conference , Lille, France, Jul. 2021. [Online]. Available: https://hal.archives-ouvertes.fr/hal-03135723
2021
Closest in time.