Spacetime constraints revisited
Spacetime constraints revisited
复制标题
重新审视时空约束
DOI：
10.1145/166117.166160
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
J. Marks
中科院分区：
文献类型：
--
作者：
J. Ngo;J. Marks
时空约束（SC）范式，即动画师指定动画人物应该做什么，而不是如何做，是一个非常有吸引力的动画方法。然而，可用于实现SC方法的算法是有限的。目前的技术本质上是局部的：它们都使用某种扰动分析来细化初始轨迹。我们提出了一个全局搜索算法，能够从头开始产生多个新的轨迹SC问题。我们的搜索策略的关键要素是一种方法，用于编码轨迹的行为，并选择行为参数，目前在大规模并行计算机上实现的遗传搜索算法。我们描述的算法，并显示计算解决方案SC问题的二维铰接的数字。CR Categories：I.2.6 [人工智能]：学习-参数学习。I.2.6 [人工智能]：问题解决、控制方法和搜索启发式方法。I.3.7 [计算机图形学]：三维图形和现实主义-动画。I.6.3 [模拟和建模]：应用。额外
The Spacetime Constraints (SC) paradigm, whereby the animator specifies what an animated figure should do but not how to do it, is a very appealing approach to animation. However, the algorithms available for realizing the SC approach are limited. Current techniques are local in nature: they all use some kind of perturbational analysis to refine an initial trajectory. We propose a global search algorithm that is capable of generating multiple novel trajectories for SC problems from scratch. The key elements of our search strategy are a method for encoding trajectories as behaviors, and a genetic search algorithm for choosing behavior parameters that is currently implemented on a massively parallel computer. We describe the algorithm and show computed solutions to SC problems for 2D articulated figures. CR Categories: I.2.6 [Artificial Intelligence]: Learning— parameter learning. I.2.6 [Artificial Intelligence]: Problem Solving, Control Methods and Search—heuristic methods. I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism— animation. I.6.3 [Simulation and Modeling]: Applications. Additional