Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Robot Motion Planning
Planning biped locomotion using motion capture data and probabilistic roadmaps
ACM Transactions on Graphics (TOG)
Goal-Directed Navigation for Animated Characters Using Real-Time Path Planning and Control
CAPTECH '98 Proceedings of the International Workshop on Modelling and Motion Capture Techniques for Virtual Environments
Behavior planning for character animation
Proceedings of the 2005 ACM SIGGRAPH/Eurographics symposium on Computer animation
Planning Algorithms
Construction and optimal search of interpolated motion graphs
ACM SIGGRAPH 2007 papers
Real-time navigation of independent agents using adaptive roadmaps
Proceedings of the 2007 ACM symposium on Virtual reality software and technology
Complexity of the mover's problem and generalizations
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Leaving Flatland: Efficient real-time three-dimensional perception and motion planning
Journal of Field Robotics - Three-Dimensional Mapping, Part 1
Space-time planning with parameterized locomotion controllers
ACM Transactions on Graphics (TOG)
Multi-domain real-time planning in dynamic environments
Proceedings of the 12th ACM SIGGRAPH/Eurographics Symposium on Computer Animation
| Hi-index | 0.00 |
Navigation is a critical task for agents populating virtual worlds. In the last years, numerous solutions have been proposed to solve the path planning problem in order to enhance the autonomy of virtual agents. Those solutions mainly focused on static environments, eventually populated with dynamic obstacles. However, dynamic objects are usually more than just obstacles as they can be used by an agent to reach new locations. In this paper, we propose an online path planning algorithm in dynamically changing environments with unknown evolution such as physically based-environments. Our method represents objects in terms of obstacles but also in terms of navigable surfaces. This representation allows our algorithm to find temporal paths through disconnected and moving platforms. We will also show that the proposed method also enables several kinds of adaptations such as avoiding moving obstacles or adapting the agent postures to environmental constraints. Copyright © 2012 John Wiley & Sons, Ltd.