{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:49:27Z","timestamp":1750308567465,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:00:00Z","timestamp":1558396800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100009077","name":"ITEA3","doi-asserted-by":"publisher","award":["01IS18060C"],"award-info":[{"award-number":["01IS18060C"]}],"id":[{"id":"10.13039\/501100009077","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Bundesministerium f\u00fcr Bildung und Forschung","award":["01IS16026A,01IW17003"],"award-info":[{"award-number":["01IS16026A,01IW17003"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,21]]},"DOI":"10.1145\/3306131.3317027","type":"proceedings-article","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T12:58:31Z","timestamp":1558357111000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptive gaussian mixture trajectory model for physical model control using motion capture data"],"prefix":"10.1145","author":[{"given":"Erik","family":"Herrmann","sequence":"first","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Han","family":"Du","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Noshaba","family":"Cheema","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Janis","family":"Sprenger","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Somayeh","family":"Hosseini","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Klaus","family":"Fischer","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]},{"given":"Philipp","family":"Slusallek","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,5,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/DevLrn.2012.6400808"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1781156"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1781157"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786784.2786802"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2012.03189.x"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/253284.253321"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2601097.2601218"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767002"},{"volume-title":"Towards a new evolutionary computation","author":"Hansen Nikolaus","key":"e_1_3_2_2_9_1","unstructured":"Nikolaus Hansen . 2006. The CMA evolution strategy: a comparing review . In Towards a new evolutionary computation . Springer , 75--102. Nikolaus Hansen. 2006. The CMA evolution strategy: a comparing review. In Towards a new evolutionary computation. Springer, 75--102."},{"key":"e_1_3_2_2_10_1","unstructured":"Jonathan Ho and Stefano Ermon. 2016. Generative adversarial imitation learning. In Advances in Neural Information Processing Systems. 4565--4573.   Jonathan Ho and Stefano Ermon. 2016. Generative adversarial imitation learning. In Advances in Neural Information Processing Systems. 4565--4573."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1781155"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2893476"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12571"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1778765.1778865"},{"volume-title":"Computer Graphics Forum","author":"Monzani Jean-S\u00e9bastien","key":"e_1_3_2_2_15_1","unstructured":"Jean-S\u00e9bastien Monzani , Paolo Baerlocher , Ronan Boulic , and Daniel Thalmann . 2000. Using an intermediate skeleton and inverse kinematics for motion retargeting . In Computer Graphics Forum , Vol. 19 . Wiley Online Library , 11--19. Jean-S\u00e9bastien Monzani, Paolo Baerlocher, Ronan Boulic, and Daniel Thalmann. 2000. Using an intermediate skeleton and inverse kinematics for motion retargeting. In Computer Graphics Forum, Vol. 19. Wiley Online Library, 11--19."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1531326.1531387"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073707"},{"key":"e_1_3_2_2_18_1","first-page":"727","article-title":"X-means: Extending k-means with efficient estimation of the number of clusters","volume":"1","author":"Pelleg Dan","year":"2000","unstructured":"Dan Pelleg , Andrew W Moore , 2000 . X-means: Extending k-means with efficient estimation of the number of clusters .. In Icml , Vol. 1. 727 -- 734 . Dan Pelleg, Andrew W Moore, et al. 2000. X-means: Extending k-means with efficient estimation of the number of clusters.. In Icml, Vol. 1. 727--734.","journal-title":"Icml"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3197517.3201311"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3072959.3073602"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3272127.3275014"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/311535.311536"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3099564.3099579"},{"key":"e_1_3_2_2_24_1","volume-title":"Continuous control monte carlo tree search informed by multiple experts","author":"Rajam\u00e4ki Joose Julius","year":"2018","unstructured":"Joose Julius Rajam\u00e4ki and Perttu H\u00e4m\u00e4l\u00e4inen . 2018. Continuous control monte carlo tree search informed by multiple experts . IEEE transactions on visualization and computer graphics ( 2018 ). Joose Julius Rajam\u00e4ki and Perttu H\u00e4m\u00e4l\u00e4inen. 2018. Continuous control monte carlo tree search informed by multiple experts. IEEE transactions on visualization and computer graphics (2018)."},{"key":"e_1_3_2_2_25_1","volume-title":"Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347","author":"Schulman John","year":"2017","unstructured":"John Schulman , Filip Wolski , Prafulla Dhariwal , Alec Radford , and Oleg Klimov . 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 ( 2017 ). John Schulman, Filip Wolski, Prafulla Dhariwal, Alec Radford, and Oleg Klimov. 2017. Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347 (2017)."},{"key":"e_1_3_2_2_26_1","unstructured":"Russ Smith. 2004. The Open Dynamics Engine. http:\/\/www.ode.org\/.  Russ Smith. 2004. The Open Dynamics Engine. http:\/\/www.ode.org\/."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2009.76"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1276377.1276509"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073204.1073249"}],"event":{"name":"I3D '19: Symposium on Interactive 3D Graphics and Games","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Montreal Quebec Canada","acronym":"I3D '19"},"container-title":["Proceedings of the ACM SIGGRAPH Symposium on Interactive 3D Graphics and Games"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3306131.3317027","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3306131.3317027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:04:20Z","timestamp":1750273460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3306131.3317027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,21]]},"references-count":29,"alternative-id":["10.1145\/3306131.3317027","10.1145\/3306131"],"URL":"https:\/\/doi.org\/10.1145\/3306131.3317027","relation":{},"subject":[],"published":{"date-parts":[[2019,5,21]]},"assertion":[{"value":"2019-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}