Bidirectional Search for Interactive Motion Synthesis

We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads to the most intuitive result. However, finding such a path can be computationally expensive. Our main contribution is a bidirectional search algorithm. We dynamically divide the search space evenly and merge two search trees to obtain the final solution. This cuts the maximum search depth almost in half and leads to significant speedup. To illustrate the benefits of our approach, we present an interactive sketching interface that allows users to specify complex motions quickly and intuitively. Categories and Subject Descriptors (according to ACM CCS): I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism—Animation

• Type: Conference
• Year: 2010
• Where: EUROGRAPHICS
• Authors: Wan-Yen Lo and Matthias Zwicker
• Keywords: Bidirectional Search Algorithm, Computer Graphics, EUROGRAPHICS 2010, Motion Graph, Near-optimal Motion Synthesis