Enhancements to constrained novelty search two-population novelty search for generating game content

GECCO 2013 - Proceedings of the 2013 Genetic and Evolutionary Computation Conference

Volumn , Issue , 2013, Pages 343-350

  Liapis, Antonios ^a   Yannakakis, Georgios N ^b   Togelius, Julian ^a  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b UNIVERSITY OF MALTA   (Malta)

Author keywords

Constrained novelty search; Feasible Infeasible two population GA; Level design; Procedural content generation

Indexed keywords

CONSTRAINED NOVELTY SEARCH; CONSTRAINED SPACE; GAME CONTENTS; GENETIC OPERATORS; LEVEL DESIGN; MULTIPLE CONSTRAINT; PROCEDURAL CONTENT GENERATIONS; STRATEGY GAMES;

EVOLUTIONARY ALGORITHMS;

GENETIC ALGORITHMS;

EID: 84883056025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2463372.2463416     Document Type: Conference Paper

References (22)

1. D. Ashlock, C. Lee, and C. McGuinness. Search-based procedural generation of maze-like levels. IEEE Transactions on Computational Intelligence and AI in Games, 3(3):260-273, 2011.
2. C. Browne and F. Maire. Evolutionary game design. IEEE Transactions on Computational Intelligence and AI in Games, 2(1):1-16, 2010.
3. L. Cardamone, D. Loiacono, and P. L. Lanzi. Interactive evolution for the procedural generation of tracks in a high-end racing game. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 395-402, 2011.
4. C. A. Coello Coello. Constraint-handling techniques used with evolutionary algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 2603-2624. ACM, 2010.
5. O. Dunn. Multiple comparisons among means. Journal of the American Statistical Association, 56:52-64, 2012.
6. E. J. Hastings, R. K. Guha, and K. O. Stanley. Evolving content in the galactic arms race video game. In Proceedings of IEEE Conference on Computational Intelligence and Games, pages 241-248, 2009.
7. S. O. Kimbrough, G. J. Koehler, M. Lu, and D. H. Wood. On a feasible-infeasible two-population (fi-2pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch. European Journal of Operational Research, 190(2):310-327, 2008.
8. O. Kramer and H.-P. Schwefel. On three new approaches to handle constraints within evolution strategies. Natural Computing: an international journal, 5(4):363-385, 2006.
9. J. Lehman and K. O. Stanley. Revising the evolutionary computation abstraction: Minimal criteria novelty search. In Proceedings of the Genetic and Evolutionary Computation Conference, 2010.
10. J. Lehman and K. O. Stanley. Abandoning objectives: Evolution through the search for novelty alone. Evolutionary Computation, 19(2):189-223, 2011.
11. A. Liapis, G. Yannakakis, and J. Togelius. Generating map sketches for strategy games. In Proceedings of Applications of Evolutionary Computation, 2013.
12. A. Liapis, G. Yannakakis, and J. Togelius. Sentient sketchbook: Computer-aided game level authoring. In Proceedings of ACM Conference on Foundations of Digital Games, 2013. In Print.
13. A. Liapis, G. N. Yannakakis, and J. Togelius. Neuroevolutionary constrained optimization for content creation. In Proceedings of IEEE Conference on Computational Intelligence and Games, pages 71-78, 2011.
14. A. Liapis, G. N. Yannakakis, and J. Togelius. Adapting models of visual aesthetics for personalized content creation. IEEE Transactions on Computational Intelligence and AI in Games, 4(3):213-228, 2012.
15. Z. Michalewicz. Do not kill unfeasible individuals. In Proceedings of the Fourth Intel ligent Information Systems Workshop, pages 110-123, 1995.
16. Z. Michalewicz. A survey of constraint handling techniques in evolutionary computation methods. In Proceedings of the 4th Annual Conference on Evolutionary Programming, pages 135-155, 1995.
17. Z. Michalewicz, D. Dasgupta, R. Le Riche, and M. Schoenauer. Evolutionary algorithms for constrained engineering problems. Computers & Industrial Engineering Journal, 30:851-870, 1996.
18. M. Schoenauer and Z. Michalewicz. Evolutionary computation at the edge of feasibility. In PPSN IV: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, pages 245-254. Springer-Verlag, 1996.
19. A. M. Smith and M. Mateas. Answer set programming for procedural content generation: A design space approach. IEEE Transactions on Computational Intelligence and AI in Games, 3(3):187-200, 2011.
20. N. Sorenson, P. Pasquier, and S. DiPaola. A generic approach to challenge modeling for the procedural creation of video game levels. IEEE Transactions on Computational Intelligence and AI in Games, 3(3):229-244, 2011.
21. J. Togelius, G. Yannakakis, K. Stanley, and C. Browne. Search-based procedural content generation: A taxonomy and survey. IEEE Transactions on Computational Intelligence and AI in Games, (99), 2011.
22. G. N. Yannakakis. Game AI revisited. In Proceedings of ACM Computing Frontiers Conference, 2012.