Smooth Conditional Transition Paths in Dynamical Gaussian Networks

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.