106 research outputs found

    An Overview of Redirected Walking Approaches and Techniques in Virtual Reality

    Get PDF
    One major obstacle to the ideal of virtual reality is the physical constraints of the user’s location, primarily its limited size. A commonly proposed solution is using redirected walking, defined as manipulation of the user’s experience to alter their walking path, to keep the user within a confined physical space without causing any perceivable sensory distortion for the user. This paper discusses various redirected walking approaches which have been proposed, including predictions of user movement via navigation meshes and simulated users, and subtle redirection techniques using blink-induced change blindness and avatar manipulation

    Optimized Graph Extraction and Locomotion Prediction for Redirected Walking

    Get PDF

    Monte-Carlo Redirected Walking: Gain Selection Through Simulated Walks

    Get PDF
    We present Monte-Carlo Redirected Walking (MCRDW), a gain selection algorithm for redirected walking. MCRDW applies the Monte-Carlo method to redirected walking by simulating a large number of simple virtual walks, then inversely applying redirection to the virtual paths. Different gain levels and directions are applied, producing differing physical paths. Each physical path is scored and the results used to select the best gain level and direction. We provide a simple example implementation and a simulation-based study for validation. In our study, when compared with the next best technique, MCRDW reduced incidence of boundary collisions by over 50% while reducing total rotation and position gain

    Performance Evaluation of Pathfinding Algorithms

    Get PDF
    Pathfinding is the search for an optimal path from a start location to a goal location in a given environment. In Artificial Intelligence pathfinding algorithms are typically designed as a kind of graph search. These algorithms are applicable in a wide variety of applications such as computer games, robotics, networks, and navigation systems. The performance of these algorithms is affected by several factors such as the problem size, path length, the number and distribution of obstacles, data structures and heuristics. When new pathfinding algorithms are proposed in the literature, their performance is often investigated empirically (if at all). Proper experimental design and analysis is crucial to provide an informative and non- misleading evaluation. In this research, we survey many papers and classify them according to their methodology, experimental design, and analytical techniques. We identify some weaknesses in these areas that are all too frequently found in reported approaches. We first found the pitfalls in pathfinding research and then provide solutions by creating example problems. Our research shows that spurious effects, control conditions provide solutions to avoid these pitfalls

    Proceedings, MSVSCC 2014

    Get PDF
    Proceedings of the 8th Annual Modeling, Simulation & Visualization Student Capstone Conference held on April 17, 2014 at VMASC in Suffolk, Virginia
    • …
    corecore