Enabling dynamic generation of levels for RTS serious games

Abstract This paper proposes a new family of Real Time Strategy (RTS) serious games that exploit a dynamic insertion of aerial/satellite images in games, in order to allow covering any target geographic area on user demand and automatically implementing several different gaming sessions. The approach intends to combine the possibility for the user of practicing decision strategies with the development of knowledge about specific geographical areas, which is important in particular to enhance the training of field operation personnel. This target requires that the system correctly interprets the terrain features – in particular roads – in order to build a semantic correspondence between the game’s logic and the background image. RealPath, a new solution for automatic definition of paths on aerial and satellite images, which reduces the cost for the creation of new game maps. The algorithm exploits the image’s pixel values and extracts information on the terrain in order to identify possible paths in the area. A parallel version of the algorithm has been implemented, exploiting multi-resolution pyramidal image processing, in order to allow better exploiting the power of current multicore processing architectures (CPUs and GPUs). The algorithm has been successfully tested on several real-world images, in real-time. As a proof of concept, we present a RealPath-based RTS serious game that we are developing for training military and civil protection personnel in field operations. Exploitation of the algorithm in 3D virtual environments is also shown.

[1]  Peter Yap,et al.  Grid-Based Path-Finding , 2002, Canadian Conference on AI.

[2]  S. Dragan,et al.  Intelligent control of an autonomous vehicle: image processing and pathfinding problem , 2004, Proceedings World Automation Congress, 2004..

[3]  Lars Lid Using Nodes to Develop Strategies For Combat with Multiple Enemies , 2001 .

[4]  Nathan R. Sturtevant,et al.  Improving Collaborative Pathfinding Using Map Abstraction , 2006, AIIDE.

[5]  Marcus Gallagher,et al.  Learning to be a Bot: Reinforcement Learning in Shooter Games , 2008, AIIDE.

[6]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[7]  Ian Millington,et al.  Artificial Intelligence for Games, Second Edition , 2009 .

[8]  Alexander Nareyek,et al.  AI in Computer Games , 2004, ACM Queue.

[9]  Steve Rabin,et al.  AI Game Programming Wisdom , 2002 .

[10]  Yngvi Björnsson,et al.  Improved Heuristics for Optimal Path-finding on Game Maps , 2006, AIIDE.

[11]  Mark. Deloura,et al.  Game Programming Gems , 2000 .

[12]  Natalya Tatarchuk,et al.  March of the Froblins: simulation and rendering massive crowds of intelligent and detailed creatures on GPU , 2008, SIGGRAPH '08.

[13]  Roberto Brunelli,et al.  Template Matching Techniques in Computer Vision: Theory and Practice , 2009 .

[14]  Ross Graham,et al.  Pathfinding in Computer Games , 2003 .

[15]  M. Pauline Baker,et al.  Computer Graphics, C Version , 1996 .

[16]  Ian Millington,et al.  Artificial Intelligence for Games , 2006, The Morgan Kaufmann series in interactive 3D technology.

[17]  Jing Li Wang,et al.  Color image segmentation: advances and prospects , 2001, Pattern Recognit..

[18]  Nathan R. Sturtevant,et al.  Partial Pathfinding Using Map Abstraction and Refinement , 2005, AAAI.

[19]  J. Doran,et al.  Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[20]  Richard E. Korf,et al.  Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..