To enable automated software testing, the ability to automatically navigate to a state of interest and to explore all, or at least sufficient number of, instances of such a state is fundamental. When test- ing a computer game the problem has an extra dimension, namely the virtual world where the game is played on. This world often plays a dominant role in constraining which logical states are reach- able, and how to reach them. So, any automated testing algorithm for computer games will inevitably need a layer that deals with navigation on a virtual world. Unlike e.g. navigating through the GUI of a typical web-based application, navigating over a virtual world is much more challenging. This paper discusses how concepts from geometry and graph-based path finding can be applied in the context of game testing to solve the problem of automated navigation and exploration. As a proof of concept, the paper also briefly discusses the implementation of the proposed approach.


    Access

    Download


    Export, share and cite



    Title :

    Navigation and Exploration in 3D-Game Automated Play Testing


    Contributors:

    Publication date :

    2020-11-02



    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629




    Mars exploration rovers navigation results

    D’Amario, Louis A. | Online Contents | 2006


    Mars Exploration Rovers navigation results

    D'Amario, Louis A. | NTRS | 2004


    Mars Exploration Rovers Navigation Results

    D'Amario, Louis A. | Online Contents | 2006


    Mars exploration rovers navigation results

    D’Amario, Louis A. | Springer Verlag | 2006


    AUTOMATED MARINE NAVIGATION

    JOHNSON MICHAEL GORDON / LAMM LAUREN ANNE | European Patent Office | 2022

    Free access