2014
DOI: 10.1145/2601097.2601218
|View full text |Cite
|
Sign up to set email alerts
|

Online motion synthesis using sequential Monte Carlo

Abstract: Figure 1: An example of the synthesized animation (downsampled from the original 30 fps). Frame 1: balancing in the user-specified ready stance. Frames 2,3: The character anticipates that the ball would hit it and dodges down. Frame 4: anticipation pose to get enough leg swing momentum. Frames 5,6,7: swinging the leg around and following with the rest of the body to end up again in the ready stance. The ready stance facing direction was not given as a goal. AbstractWe present a Model-Predictive Control (MPC) s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
60
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 52 publications
(60 citation statements)
references
References 35 publications
(37 reference statements)
0
60
0
Order By: Relevance
“…Recent work by Tassa et al [2012] and Hämäläinen et al [2014] are examples of MPC methods. The iLQG method of Tassa et al can have the character get up from arbitrary lying positions on the ground.…”
Section: Related Workmentioning
confidence: 99%
“…Recent work by Tassa et al [2012] and Hämäläinen et al [2014] are examples of MPC methods. The iLQG method of Tassa et al can have the character get up from arbitrary lying positions on the ground.…”
Section: Related Workmentioning
confidence: 99%
“…We extend the algorithm to a more general case in Chapter 9. Hämäläinen et al [2014] make use of SMC with heuristic sampling to synthesize physically valid character motion in a dynamic environment. At its core, this problem involves tracking local maxima of a sequence of target functions (f 1 , .…”
Section: Non-parametric Density Estimationmentioning
confidence: 99%
“…Action recognition based on template matching often uses the algorithm of dynamic time warping (DTW). Indexing uses lower-bounding functions to prune out the number of times DTW needs to be run for certain tasks such as clustering a set of time series or finding the time series that is most similar to a given time series [6] [7].…”
Section: Related Workmentioning
confidence: 99%