In a typical dextrous manipulation task, a goal configuration is reached through a sequence of continuous motions. Most often, a motion plan is computed offline and subsequently...
The reinforcement learning problem can be decomposed into two parallel types of inference: (i) estimating the parameters of a model for the underlying process; (ii) determining be...
This paper presents a sparse state saving scheme for Time Warp parallel discrete event simulation. The scheme bases the selection of the states to be recorded on the event history...
We present a simple approach for planning the motion of nonholonomic robots among obstacles. Existing methods lead to open-loop solutions which are either obtained in two stages, ...
is an important optimization for programs that use procedural abstraction. Because inlining trades code size for execution speed, the effectiveness of an inlining algorithm is det...