Tomasz Schreiber

Publications (2)0 Total impact

• Chapter: Smooth Conditional Transition Paths in Dynamical Gaussian Networks

  Michał Matuszak, Jacek Miȩkisz, Tomasz Schreiber
  [show abstract] [hide abstract]
  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. KeywordsFormation Redeployment–Animation Blending–Transition Path–Reconfiguration–CUDA
  09/2011: pages 204-215;
• Source

  Available from: ssdnm.mimuw.edu.pl

  Chapter: A New Stochastic Algorithm for Strategy Optimisation in Bayesian Influence Diagrams

  Michał Matuszak, Tomasz Schreiber
  [show abstract] [hide abstract]
  ABSTRACT: The problem of solving general Bayesian influence diagrams is well known to be NP-complete, whence looking for efficient approximate stochastic techniques yielding suboptimal solutions in reasonable time is well justified. The purpose of this paper is to propose a new stochastic algorithm for strategy optimisation in Bayesian influence diagrams. The underlying idea is an extension of that presented in by Chen who developed a self-annealing algorithm for optimal tour generation in traveling salesman problems (TSP). Our algorithm generates optimal decision strategies by iterative self-annealing reinforced search procedure, gradually acquiring new information while driven by information already acquired. The effectiveness of our method has been tested on computer-generated examples.
  06/2010: pages 574-581;