POET: Open-Ended Coevolution of Environments and their Optimized Solutions

被引:31
|
作者
Wang, Rui [1 ]
Lehman, Joel [1 ]
Clune, Jeff [1 ]
Stanley, Kenneth O. [1 ]
机构
[1] Uber AI, San Francisco, CA 94103 USA
关键词
Open-ended evolution; coevolution; evolution strategies; novelty search; artificial life; EVOLUTION;
D O I
10.1145/3321707.3321799
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
How can progress in machine learning and reinforcement learning be automated to generate its own never-ending curriculum of challenges without human intervention? The recent emergence of quality diversity (QD) algorithms offers a glimpse of the potential for such continual open-ended invention. For example, novelty search showcases the benefits of explicit novelty pressure, MAP-Elites and Innovation Engines highlight the advantage of explicit elitism within niches in an otherwise divergent process, and minimal criterion coevolution (MCC) reveals that problems and solutions can coevolve divergently. The Paired Open-Ended Trailblazer (POET) algorithm introduced in this paper combines these principles to produce a practical approach to generating an endless progression of diverse and increasingly challenging environments while at the same time explicitly optimizing their solutions. An intriguing implication is the opportunity to transfer solutions among environments, reflecting the view that innovation is a circuitous and unpredictable process. POET is tested in a 2-D obstacles course domain, where it generates diverse and sophisticated behaviors that create and solve a wide range of environmental challenges, many of which cannot be solved by direct optimization, or by a direct-path curriculum-building control algorithm. We hope that POET will inspire a new push towards open-ended discovery across many domains.
引用
收藏
页码:142 / 151
页数:10
相关论文
共 50 条
  • [1] Investigating Open-Ended Coevolution in Digital Organisms
    Zaman, Luis
    2018 CONFERENCE ON ARTIFICIAL LIFE (ALIFE 2018), 2018, : 258 - 259
  • [2] Minimal Criterion Coevolution: A New Approach to Open-Ended Search
    Brant, Jonathan C.
    Stanley, Kenneth O.
    PROCEEDINGS OF THE 2017 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO'17), 2017, : 67 - 74
  • [3] Learning in open-ended dynamic distributed environments
    Caragea, D
    EIGHTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE (AAAI-02)/FOURTEENTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE (IAAI-02), PROCEEDINGS, 2002, : 980 - 980
  • [4] Cognitive requirements for learning with open-ended learning environments
    Susan M. Land
    Educational Technology Research and Development, 2000, 48 : 61 - 78
  • [5] Cognitive requirements for learning with open-ended learning environments
    Land, SM
    ETR&D-EDUCATIONAL TECHNOLOGY RESEARCH AND DEVELOPMENT, 2000, 48 (03): : 61 - 78
  • [6] Designing for Social Interaction in Open-Ended Play Environments
    de Valk, Linda
    Bekker, Tilde
    Eggen, Berry
    INTERNATIONAL JOURNAL OF DESIGN, 2015, 9 (01): : 107 - 120
  • [7] Open-Ended
    Tague, Suzanne
    NEW YORK TIMES BOOK REVIEW, 2010, : 6 - 6
  • [8] ChemGrid: An Open-Ended Benchmark Domain for an Open-Ended Learner
    Kepes, Miklos
    Guttenberg, Nicholas
    Soros, L. B.
    2022 IEEE CONFERENCE ON GAMES, COG, 2022, : 221 - 228
  • [9] A Planning Algorithm to Support Learning in Open-ended, Unstructured Environments
    Frost, Stephanie
    McCalla, Gord
    INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION, 2021, 31 (04) : 847 - 877
  • [10] Modeling and Analyzing Inquiry Strategies in Open-Ended Learning Environments
    Kaeser, Tanja
    Schwartz, Daniel L.
    INTERNATIONAL JOURNAL OF ARTIFICIAL INTELLIGENCE IN EDUCATION, 2020, 30 (03) : 504 - 535