Smooth conditional transition paths in dynamical gaussian networks

  • Authors:
  • Michal Matuszak;Jacek Miekisz;Tomasz Schreiber

  • Affiliations:
  • Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Torun, Poland;Institute of Applied Mathematics and Mechanics, University of Warsaw, Warsaw, Poland;Faculty of Mathematics and Computer Science, Nicolaus Copernicus University, Torun, Poland

  • Venue:
  • KI'11 Proceedings of the 34th Annual German conference on Advances in artificial intelligence
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose an algorithm for determining optimal transition paths between given configurations of systems consisting of many objects. It is based on the Principle of Least Action and variational equations for Freidlin-Wentzell action functionals in Gaussian networks set-up.We use our method to construct a system controlling motion and redeployment between unit's formations. Another application of the algorithm allows a realistic transformation between two sequences of character animations in a virtual environment. The efficiency of the algorithm has been evaluated in a simple sandbox environment implemented with the use of the NVIDIA CUDA technology.