Optimal Positioning in a Digital Soccer Game

Player positioning is critical in many sport games. This study uses digital soccer as an example and contributes into digital sports games technology. In existing AI positioning methods, an artificial player agent calculates a desired position using current location of the ball and its own role in the team formation. These methods have two disadvantages: neglecting the game dynamics and leaving behind some potentially good positions without consideration; the latter being the common shortcoming of decision tree algorithms. The proposed approach is taking into account the dynamics by determining the available time horizon which limits the feasible area where the optimal position is located. To make sure that all potential alternative positions in the feasible area have been evaluated and considered, the Pareto optimality approach is used. As a result, the proposed method provides the opportunity to create an optimal dynamic formation for the whole team. The ideas of this book should be useful for AI researches and games developers.