The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Towards automatic personalised content creation for racing games
Abstract
Evolutionary algorithms are commonly used to create high-performing strategies or agents for computer games. In this paper, we instead choose to evolve the racing tracks in a car racing game. An evolvable track representation is devised, and a multiobjective evolutionary algorithm maximises the entertainment value of the track relative to a particular human player. This requires a way to create accurate models of players' driving styles, as well as a tentative definition of when a racing track is fun, both of which are provided. We believe this approach opens up interesting new research questions and is potentially applicable to commercial racing games.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Theory of Fun for Game Design
Koster, R., & Wright, W. (2004) · Cited by 1,110
What makes things fun to learn? heuristics for designing instructional computer games
Malone, T. W. (1980) · Proceedings of the 3rd ACM SIGSMALL symposium and the first SIGPC symposium on Small systems - SIGSMALL '80 · doi:10.1145/800088.802839 · Cited by 758
Texturing and modeling: a procedural approach
(1995) · Choice Reviews Online · doi:10.5860/choice.32-5129 · Cited by 659
Adaptive game AI with dynamic scripting
Spronck, P., Ponsen, M., Sprinkhuizen-Kuyper, I., & Postma, E. (2006) · Machine Learning · doi:10.1007/s10994-006-6205-6 · Cited by 262
Real-time procedural generation of `pseudo infinite' cities
Greuter, S., Parker, J., Stewart, N., & Leach, G. (2003) · International Conference on Computer Graphics and Interactive Techniques in Australasia and South East Asia (GRAPHITE) · doi:10.1145/604471.604490 · Cited by 122
Neural Network Vision for Robot Driving
Pomerleau, D. (1997) · Springer eBooks · doi:10.1007/978-1-4615-6325-9_4 · Cited by 103
Making Racing Fun Through Player Modeling and Track Evolution
Togelius, J., Nardi, R. D., & Lucas, S. M. (2006) · CogPrints (University of Southampton) · Cited by 98
Self-citationCoevolution of active vision and feature selection
Floreano, D., Kato, T., Marocco, D., & Sauser, E. (2004) · Biological Cybernetics · doi:10.1007/s00422-004-0467-5 · Cited by 97
Computational Neuroethology: A Provisional Manifesto
Cliff, D. (1991) · The MIT Press eBooks · doi:10.7551/mitpress/3115.003.0006 · Cited by 90
Player Modeling Impact on Player’s Entertainment in Computer Games
Yannakakis, G. N., & Μaragoudakis, M. (2005) · Lecture notes in computer science · doi:10.1007/11527886_11 · Cited by 76
Cited by
Imitation Learning: A Survey of Learning Methods
Hussein, A., Gaber, M. M., Elyan, E., & Jayne, C. (2018) · ACM Computing Surveys · doi:10.1145/3054912 · Cited by 1,060
“Togelius et al. [2007] also used evolutionary algorithms to optimize multiple objectives in a racing game.”
BackgroundMethodSearch-Based Procedural Content Generation: A Taxonomy and Survey
Togelius, J., Yannakakis, G. N., Stanley, K. O., & Browne, C. (2011) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2011.2148116 · Cited by 706
Self-citationExperience-Driven Procedural Content Generation
Yannakakis, G. N., & Togelius, J. (2011) · IEEE Transactions on Affective Computing · doi:10.1109/t-affc.2011.6 · Cited by 470
Self-citationAnalyzing the expressive range of a level generator
Smith, G., & Whitehead, J. (2010) · Proceedings of the 2010 Workshop on Procedural Content Generation in Games · doi:10.1145/1814256.1814260 · Cited by 204
“For example, showing different racetracks generated according to personalized fitness functions [5] or weapons that support different play styles [1].”
Yannakakis, G. N. (2012) · Proceedings of the 9th conference on Computing Frontiers · doi:10.1145/2212908.2212954 · Cited by 179
Tanagra: Reactive Planning and Constraint Solving for Mixed-Initiative Level Design
Smith, G., Whitehead, J., & Mateas, M. (2011) · IEEE Transactions on Computational Intelligence and AI in Games · doi:10.1109/tciaig.2011.2159716 · Cited by 156
Automated Playtesting With Procedural Personas Through MCTS With Evolved Heuristics
Holmgard, C., Green, M. C., Liapis, A., & Togelius, J. (2019) · IEEE Transactions on Games · doi:10.1109/tg.2018.2808198 · Cited by 125
“Perhaps the most obvious approach is to use some form of supervised learning to derive a model from play traces [18], [19].”
BackgroundSelf-citationControllable procedural map generation via multiobjective evolution
Togelius, J., Preuss, M., Beume, N., Wessing, S., Hagelbäck, J., Yannakakis, G. N., & Grappiolo, C. (2013) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-012-9174-5 · Cited by 48
Self-citation(2013) · doi:10.1109/cig.2014.6932873 · Cited by 33
Self-citationEvolving maps for match balancing in first person shooters
Lanzi, P. L., Loiacono, D., & Stucchi, R. (2014) · 2014 IEEE Conference on Computational Intelligence and Games · doi:10.1109/cig.2014.6932901 · Cited by 28
Combining Gameplay Data with Monte Carlo Tree Search to Emulate Human Play
Devlin, S., Anspoka, A., Sephton, N., Cowling, P., & Rollason, J. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment · doi:10.1609/aiide.v12i1.12858 · Cited by 28
“Another problem was found by Togelius et al. (2007) when they used direct modeling to develop an AI agent for a racing game: whenever the controller was in a state that it had not seen before, it was not able to react in a sensible way, leading to a car crash that it could not recover from.”
BackgroundHRLB⌃2: A Reinforcement Learning Based Framework for Believable Bots
Arzate Cruz, C., & Ramirez Uresti, J. A. (2018) · Applied Sciences · doi:10.3390/app8122453 · Cited by 21
Metadata
- Authors
- Togelius, J., De Nardi, R., & Lucas, S. M.
- Venue
- 2007 IEEE Symposium on Computational Intelligence and Games
- Publisher
- IEEE
- Published
- 2007
- Pages
- 252-259
- OpenAlex
- W2170567160
- Cited by
- 283
- References
- 15
- FWCI
- 9.98
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.