By Topic

Automatic Track Generation for High-End Racing Games Using Evolutionary Computation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Daniele Loiacono ; Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano, Italy ; Luigi Cardamone ; Pier Luca Lanzi

In this paper, we investigate the application of evolutionary computation to the automatic generation of tracks for high-end racing games. The idea underlying our approach is that diversity is a major source of challenge/interest for racing tracks and, eventually, might play a key role in contributing to the player's fun. In particular, we focus on the diversity of a track in terms of its shape (i.e., the number and the assortment of turns and straights it contains), and in terms of driving experience it provides (i.e., the range of speeds achievable while driving on the track). We define two fitness functions that capture our idea of diversity as the entropy of the track's curvature and speed profiles. We apply both a single-objective and a multiobjective real-coded genetic algorithm (GA) to evolve tracks involving both a wide variety of turns and straights and also a large range of driving speeds. The results we report show that both single-objective and multiobjective approaches can successfully evolve tracks with a high degree of diversity both in terms of shape and achievable speeds.

Published in:

IEEE Transactions on Computational Intelligence and AI in Games  (Volume:3 ,  Issue: 3 )