Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Dynamic Quality-Diversity Search (2404.05769v1)

Published 7 Apr 2024 in cs.NE and cs.AI

Abstract: Evolutionary search via the quality-diversity (QD) paradigm can discover highly performing solutions in different behavioural niches, showing considerable potential in complex real-world scenarios such as evolutionary robotics. Yet most QD methods only tackle static tasks that are fixed over time, which is rarely the case in the real world. Unlike noisy environments, where the fitness of an individual changes slightly at every evaluation, dynamic environments simulate tasks where external factors at unknown and irregular intervals alter the performance of the individual with a severity that is unknown a priori. Literature on optimisation in dynamic environments is extensive, yet such environments have not been explored in the context of QD search. This paper introduces a novel and generalisable Dynamic QD methodology that aims to keep the archive of past solutions updated in the case of environment changes. Secondly, we present a novel characterisation of dynamic environments that can be easily applied to well-known benchmarks, with minor interventions to move them from a static task to a dynamic one. Our Dynamic QD intervention is applied on MAP-Elites and CMA-ME, two powerful QD algorithms, and we test the dynamic variants on different dynamic tasks.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (55)
  1. An adaptive approach for solving dynamic scheduling with time-varying number of tasks — part I. In IEEE Congress of Evolutionary Computation, 2011.
  2. Cosine similarity entropy: Self-correlation-based complexity analysis of dynamical systems. Entropy, 19(12), 2017.
  3. Helen G. Cobb. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments, 1990.
  4. Genetic algorithms for tracking changing environments. In Proceedings of the International Conference on Genetic Algorithms, 1993.
  5. Memory based differential evolution algorithms for dynamic constrained optimization problems. In International Conference on Computational Intelligence and Security, 2015.
  6. Antoine Cully. Multi-emitter MAP-elites: improving quality, diversity and data efficiency with heterogeneous sets of emitters. In Proceedings of the Genetic and Evolutionary Computation Conference, 2021.
  7. Quality and diversity optimization: A unifying modular framework. IEEE Transactions on Evolutionary Computation, 22(2), 2018.
  8. Oliver Dunn. Multiple comparisons among means. Journal of the American Statistical Association, 56(293), 2012.
  9. Fast and stable MAP-Elites in noisy domains using deep grids. volume Proceedings of the Artificial Life Conference, 2020.
  10. Mapping Hearthstone deck spaces through MAP-elites with sliding boundaries. In Proceedings of the Genetic and Evolutionary Computation Conference, 2019.
  11. Illuminating Mario scenes in the latent space of a generative adversarial network. Proceedings of the AAAI Conference on Artificial Intelligence, 35(7), 2021.
  12. Covariance matrix adaptation for the rapid illumination of behavior space. In Proceedings of the Genetic and Evolutionary Computation Conference, 2020.
  13. The compact genetic algorithm is efficient under extreme gaussian noise. IEEE Transactions on Evolutionary Computation, 21(3), 2017.
  14. Data-efficient exploration, optimization, and modeling of diverse designs through surrogate-assisted illumination. In Proceedings of the Genetic and Evolutionary Computation Conference, 2017.
  15. Preference-learning emitters for mixed-initiative quality-diversity algorithms. IEEE Transactions on Games, 2023.
  16. Robustness of populations in stochastic environments. Algorithmica, 75(3), 2016.
  17. Procedural content generation through quality diversity. In IEEE Conference on Games, 2019.
  18. J.J. Grefenstette. Evolvability in dynamic fitness landscapes: a genetic algorithm approach. In Proceedings of the Congress on Evolutionary Computation, volume 3, 1999.
  19. N. Hansen and A. Ostermeier. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2), 2001.
  20. Nikolaus Hansen. The cma evolution strategy: A tutorial. arXiv preprint arXiv:1604.00772, 2023.
  21. Adaptive particle swarm optimization: detection and response to dynamic systems. In Proceedings of the Congress on Evolutionary Computation, 2002.
  22. Shahin Jalili. Introduction to Stochastic Optimisation. Springer Nature Singapore, 2022.
  23. On evolutionary optimization of large problems using small populations. In Lipo Wang, Ke Chen, and Yew Soon Ong, editors, Advances in Natural Computation, 2005.
  24. MAP-Elites for noisy domains by adaptive sampling. In Proceedings of the Genetic and Evolutionary Computation Conference, 2019.
  25. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary Computation, 19(2), 2011.
  26. Mixed-initiative content creation. In Noor Shaker, Julian Togelius, and Mark J. Nelson, editors, Procedural Content Generation in Games: A Textbook and an Overview of Current Research, pages 195–214. Springer, 2016.
  27. Designer modeling for personalized game content creation tools. In Proceedings of the AIIDE Workshop on Artificial Intelligence & Game Aesthetics, 2013.
  28. Surrogate-assisted particle swarm optimization algorithm with pareto active learning for expensive multi-objective optimization. IEEE/CAA Journal of Automatica Sinica, 6(3), 2019.
  29. Ronald W. Morrison. Diversity Measurement. 2004.
  30. I. Moser and T. Hendtlass. A simple and efficient multi-component algorithm for solving dynamic function optimisation problems. In IEEE Congress on Evolutionary Computation, 2007.
  31. Illuminating search spaces by mapping elites. arXiv preprint arXiv:1504.04909, 2015.
  32. Analysis of Evolutionary Algorithms in Dynamic and Stochastic Environments. Springer International Publishing, 2019.
  33. Solving dynamic constrained optimisation problems using stochastic ranking and repair methods, 2010.
  34. Trung Thanh Nguyen. Continuous dynamic optimisation using evolutionary algorithms. PhD thesis, University of Birmingham, 2011.
  35. Evolutionary dynamic optimization: A survey of the state of the art. Swarm and Evolutionary Computation, 6, 2012.
  36. Evolutionary Dynamic Optimization: Methodologies. 2013.
  37. Benchmarking and solving dynamic constrained problems. In IEEE Congress on Evolutionary Computation, 2009.
  38. Dynamic time-linkage problems revisited. In Mario Giacobini, Anthony Brabazon, Stefano Cagnoni, Gianni A. Di Caro, Anikó Ekárt, Anna Isabel Esparcia-Alcázar, Muddassar Farooq, Andreas Fink, and Penousal Machado, editors, Applications of Evolutionary Computing, 2009.
  39. Continuous dynamic constrained optimization—the challenges. IEEE Transactions on Evolutionary Computation, 16(6), 2012.
  40. Multi-objective quality diversity optimization. In Proceedings of the Genetic and Evolutionary Computation Conference, 2022.
  41. Quality diversity: A new frontier for evolutionary computation. Frontiers in Robotics and AI, 3, 2016.
  42. Hendrik Richter. Detecting change in dynamic fitness landscapes. In IEEE Congress on Evolutionary Computation, 2009.
  43. Hendrik Richter. Memory Design for Constrained Dynamic Optimization Problems. 2010.
  44. Learning behavior in abstract memory schemes for dynamic optimization problems. Soft Computing, 13(12), 2009.
  45. Adaptive genetic programming for dynamic classification problems. In IEEE Congress on Evolutionary Computation, 2009.
  46. Design space exploration of shell structures using quality diversity algorithms. In Proceedings of the International Association for Shell and Spatial Structures Symposium, 2023.
  47. Monte carlo elites: quality-diversity selection as a multi-armed bandit problem. In Proceedings of the Genetic and Evolutionary Computation Conference, 2021.
  48. Pyribs: A bare-bones python library for quality diversity optimization. In Proceedings of the Genetic and Evolutionary Computation Conference, 2023.
  49. Gymnasium, 2023.
  50. Dynamic particle swarm optimization to solve multi-objective optimization problem. Procedia Technology, 6, 2012.
  51. Learning the local search range for genetic optimisation in nonstationary environments. In Proceedings of IEEE International Conference on Evolutionary Computation, 1997.
  52. Adaptive estimation distribution distributed differential evolution for multimodal optimization problems. IEEE Transactions on Cybernetics, 52(7), 2022.
  53. Emerging cooperation with minimal effort: Rewarding over mimicking. IEEE Transactions on Evolutionary Computation, 11(3), 2007.
  54. Abdunnaser Younes. Adapting Evolutionary Approaches for Optimization in Dynamic Environments. PhD thesis, University of Waterloo, 2006.
  55. Evolutionary optimization based on chaotic sequence in dynamic environments. In IEEE International Conference on Networking, Sensing and Control, 2004.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (3)
  1. Roberto Gallotta (8 papers)
  2. Antonios Liapis (55 papers)
  3. Georgios N. Yannakakis (59 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets