H IERARCHICAL VISUOMOTOR CONTROL OF HUMANOIDS
A BSTRACT
We aim to build complex humanoid agents that integrate perception, motor control, and memory.
In this work, we partly factor this problem into low-level motor control from proprioception and high-level coordination of the low-level skills informed by vision.
We develop an architecture capable of surprisingly ﬂexible, task-directed motor control of a relatively high-DoF humanoid body by combining pre-training of low-level motor controllers with a high-level, task-focused controller that switches among low-level sub-policies.
The resulting system is able to control a physically-simulated humanoid body to solve tasks that require coupling visual perception from an unstabilized egocentric RGB camera during locomotion in the environment.
Supplementary video link
I NTRODUCTION
In reinforcement learning (RL), a major challenge is to simultaneously cope with high-dimensional input and high-dimensional action spaces.
As techniques have matured, it is now possible to train high-dimensional vision-based policies from scratch to generate a range of interesting behaviors ranging from game-playing to navigation (Jaderberg et al., 2018; OpenAI, 2018; Wayne et al., 2018).
Likewise, for controlling bodies with a large number of degrees of freedom (DoFs), in simulation, reinforcement learning methods are beginning to surpass optimal control techniques.
Here, we try to synthesize this progress and tackle high-dimensional input and output at the same time.
We evaluate the feasibility of full-body visuomotor control by comparing several strategies for humanoid control from vision.
Both to simplify the engineering of a visuomotor system and to reduce the complexity of taskdirected exploration, we construct modular agents in which a high-level system possessing egocentric vision and memory is coupled to a low-level, reactive motor control system.
We build on recent advances in imitation learning to make ﬂexible low-level motor controllers for high-DoF humanoids.
The motor skills embodied by the low-level controllers are coordinated and sequenced by the high-level system, which is trained to maximize sparse task reward.
Our approach is inspired by themes from neuroscience as well as ideas developed and made concrete algorithmically in the animation and robotics literatures.
In motor neuroscience, studies of spinal reﬂexes in animals ranging from frogs to cats have led to the view that locomotion and reaching are highly prestructured, enabling subcortical structures such as the basal ganglia to coordinate a motor repertoire; and cortical systems with access to visual input can send low complexity signals to motor systems in order to evoke elaborate movements (Flash & Hochner, 2005;
Bizzi et al., 2008; Grillner et al., 2005).
The study of “movement primitives” for robotics descends from the work of Ijspeert et al.
Subsequent research has focused on innovations for learning or constructing primitives for control of movments (Ijspeert et al., 2003; Kober & Peters, 2009), deploying and sequencing them to solve tasks (Sentis & Khatib, 2005; Kober & Peters, 2014; Konidaris et al., 2012), and increasing the complexity of the control inputs to the primitives (Neumann et al., 2014).
Particularly relevant to our cause is the work of Kober et al.
(2008) in which primitives were coupled by reinforcement learning to external perceptual inputs.
Research in the animation literature has also sought to produce physically simulated characters capable of distinct movements that can be ﬂexibly sequenced.
This ambition can be traced to the virtual stuntman (Faloutsos et al., 2001b;a) and has been advanced markedly in the work of Liu (Liu et al., 2012).
Further recent work has relied on reinforcement learning to schedule control policies known as “control fragments”, each one able to carry out only a specialized short movement segment (Liu & Hodgins, 2017; 2018).
In work to date, such control fragments have yet to be coupled to visual input as we will pursue here.
From the perspective of the RL literature (Sutton et al., 1999), motor primitives and control fragments may be considered specialized instantiations of “option” sub-policies.
Our work aims to contribute to this multi-disciplinary literature by demonstrating concretely how control-fragment-like low-level movements can be coupled to and controlled by a vision and memory-based high-level controller to solve tasks.
Furthermore, we demonstrate the scalability of the approach to greater number of control fragments than previous works.
Taken together, we demonstrate progress towards the goal of integrated agents with vision, memory, and motor control.
A PPROACH
We present a system capable of solving tasks from vision by switching among low-level motor controllers for the humanoid body.
This scheme involves a general separation of control where a low-level controller handles motor coordination and a high-level controller signals/selects low-level behavior based on task context (see also ?? ).
In the present work, the low-level motor controllers operate using proprioceptive observations, and the high-level controller operate using proprioception along with ﬁrst-person/egocentric vision.
We ﬁrst describe the procedure for creating low-level controllers from motion capture data, then describe and contrast multiple approaches for interfacing the high- and low-level controllers.
2. T RACKING MOTION CAPTURE CLIPS
For simulated character control, there has been a line of research extracting humanoid behavior from motion capture (“mocap”) data.
The SAMCON algorithm is a forward sampling approach that converts a possibly noisy, kinematic pose sequence into a physical trajectory.
It relies on a beamsearch-like planning algorithm
(Liu et al., 2010; 2015) that infers an action sequence corresponding to the pose sequence.
In subsequent work, these behaviors have been adapted into policies (Liu et al., 2012; Ding et al., 2015).
More recently, RL has also been used to produce time-indexed policies which serve as robust tracking controllers (Peng et al., 2018).
While the resulting time-indexed policies are somewhat less general as a result, time-indexing or phase-variables are common in the animation literature and also employed in kinematic control of characters (Holden et al., 2017).
We likewise use mocap trajectories as reference data, from which we derive policies that are single purpose – that is, each policy robustly tracks a short motion capture reference motion (2-6 sec), but that is all each policy is capable of.
Humanoid body We use a 56 degree-of-freedom (DoF) humanoid body that was developed in previous work (Merel et al., 2017), a version of which is available with motion-capture playback in the DeepMind control suite (Tassa et al., 2018).
Here, we actuate the joints with position-control: each joint is given an actuation range in [ − 1 , 1] , and this is mapped to the angular range of that joint.
Single-clip tracking policies For each clip
, we train a policy π θ ( a | s, t ) with parameters θ such that it maximizes a discounted sum of rewards, r t , where the reward at each step comes from a custom scoring function (see eqns.
1, 2 deﬁned immediately below).
This tracking approach most closely follows Peng et al.
Note that here the state optionally includes a normalized time t that goes from 0 at the beginning of the clip to 1 at the end of the clip.
For cyclical behaviors like locomotion, a gait cycle can be isolated manually and kinematically blended circularly by weighted Training iteratively reﬁnes a policy to robustly track the reference trajectory as well as physically feasible. linear interpolation of the poses to produce a repeating walk.
The time input is reset each gaitcycle (i.e. it follows a sawtooth function).
As proposed in Merel et al.
; Peng et al.
, episodes are initialized along the motion capture trajectory; and episodes can be terminated when it is determined that the behavior has failed signiﬁcantly or irrecoverably.
Our speciﬁc termination condition triggers if parts of the body other than hands or feet make contact with the ground.
See
Fig.
1 for a schematic.
We ﬁrst deﬁne an energy function most similar to SAMCON’s
(Liu et al., 2010):
[Equation]
where E qpos is a energy deﬁned on all joint angles, E qvel on joint velocities, E ori on the body root (global-space) quaternion, E ee on egocentric vectors between the root and the end-effectors (see
Merel et al.
, E vel on the (global-space) translational velocities, and E gyro on the body root rotational velocities.
More speciﬁcally:
[Equation]
where (cid:126)q represents the pose and (cid:126)q (cid:63) represents the reference pose.
In this work, we used coefﬁcients w qpos = 5 , w qvel = 1 , w ori = 20 , w gyro = 1 , w vel = 1 , w ee = 2 .
We tuned these by sweeping over parameters in a custom implementation of SAMCON (not detailed here), and we have found these coefﬁcients tend to work fairly well across a wide range of movements for this body.
From the energy, we write the reward function:
[Equation]
where w total is the sum of the per energy-term weights and β is a sharpness parameter ( β =throughout).
Since all terms in the energy are non-negative, the reward is normalized r t ∈ (0 , 1] with perfect tracking giving a reward of 1 and large deviations tending toward 0.
Acquiring reference data features for some quantities required setting the body to the pose speciﬁed by the joint angles: e.g., setting (cid:126)x pos , (cid:126)q pos , and (cid:126)q ori to compute the end-effector vectors (cid:126)q ee .
Joint angle velocities, root rotational velocities, and translational velocities ( (cid:126)q vel , (cid:126)q gyro , (cid:126)x vel ) were derived from the motion capture data by ﬁnite difference calculations on the corresponding positions.
Note that the reward function here was not restricted to egocentric features – indeed, the velocity and quaternion were non-egocentric.
Importantly, however, the policy received exclusively egocentric observations, so that, for example, rotating the initial pose of the humanoid would not affect the policy’s ability to execute the behavior.
The full set of proprioceptive features we provided the policy consists of joint angles ( (cid:126)q pos ) and velocities ( (cid:126)q vel ), root-to-end-effector vectors ( (cid:126)q ee ), rootframe velocimeter ( (cid:126)q veloc ), rotational velocity ( (cid:126)q gyro ), root-frame accelerometers ( (cid:126)q accel ), and 3D orientation relative to the z-axis ( (cid:126)r z : functionally a gravity sensor).
Low-level controller reinforcement learning details Because the body is position-controlled, ( a t has the same dimension and semantics as a subset of the body pose), we can pre-train the policy to produce target poses by supervised learning max θ (cid:80) t log π ( q ∗ pos,t +1 | s ∗ t , t ) .
This produces very poor control but facilitates the subsequent stage of RL-based imitation learning.
We generally found that training with some pretraining considerably shortened the time the training took to converge and improved the resulting policies.
For RL, we performed off-policy training using a distributed actor-critic implementation, closest to that used in (Hausman et al., 2018).
This implementation used a replay buffer and target networks as done in previous work (Lillicrap et al., 2015; Heess et al., 2015).
The Q-function was learned off-policy using TD-learning using importance-weighted Retrace (Munos et al., 2016), and the actor was learned off-policy using SVG(0)
(Heess et al., 2015).
This is to say that we learned the policy by taking gradients with respect to the Q function (target networks were updated every 500 learning steps).
Gradient updates to the policy were performed using short time windows, { s τ , a τ } [Equation] , sampled from replay: [Equation]
[Equation]
where η was ﬁxed in our experiments.
While the general details of the RL algorithm are not pertinent to the success of this approach (e.g. Peng et al.
(2018) used on-policy RL), we found two details to be critical, and both were consistent with the results reported in Peng et al.
Policy updates needed to be performed conservatively with the update including a term which restricts
D KL [ π new ||
π old ]
(Heess et al., 2015; Schulman et al., 2017).
Secondly, we found that attempting to learn the variance of the policy actions tended to result in premature convergence, so best results were obtained using a stochastic policy with ﬁxed noise (we used noise with σ = . 1 ).
2. V ARIETIES OF LOW - LEVEL MOTOR CONTROL
We next consider how to design low-level motor controllers derived from motion capture trajectories.
Broadly, existing approaches fall into two categories: structured and cold-switching controllers.
In structured controllers, there is a hand-designed relationship between “skill-selection” variables and the generated behavior.
Recent work by Peng et al.
(2018) explored speciﬁc handdesigned, structured controllers.
While parameterized skill-selection coupled with manual curation and preprocessing of motion capture data can produce artistically satisfying results, the range of behavior has been limited and implementation requires considerable expertise and animation skill.
By contrast, an approach in which behaviors are combined by a more automatic procedure promises to ultimately scale to a wider range of behaviors.
Below, we describe some speciﬁc choices for both structured and cold-switching controllers.
For structured control schemes, we consider: (1) a steerable controller that produces running behavior with a controllable turning radius, and (2) a switching controller that is a single policy that can switch between the behaviors learned from multiple mocap clips, with switch points allowed at the end of gait cycles.
The allowed transitions were deﬁned by a transition graph.
For cold switching, we will not explicitly train transitions between behaviors.
Steerable controller Following up on the ability to track a single cyclical behavior like locomotion described above, we can introduce the ability to parametrically turn.
To do this we distorted the reference trajectory accordingly and trained the policy to track the reference with the turning radius as additional input.
Each gait cycle we picked a random turning radius parameter and in that gaitcyle we rotate the reference clip heading ( (cid:126)q ori ) at that constant rate (with appropriate bookkeeping for other positions and velocities).
The result was a policy that, using only one gait cycle clip as input, could turn with a speciﬁed rate of turning.
Switching controller An alternative to a single behavior with a single continuously controllable parameter is a single policy that is capable of switching among a discrete set of behaviors based on a 1-of- k input.
Training consisted of randomly starting in a pose sampled from a random mocap clip and transitioning among clips according to a graph of permitted transitions.
Given a small, discrete set of clips that were manually “cut” to begin and end at similar points in a gait cycle, we initialized a discrete Markov process among clips with some initial distribution over clips and transitioned between clips that were compatible (walk forward to turn left, etc.)
(Fig. 2).
Cold-switching of behaviors and control fragments We can also leave the task of sequencing behaviors to the high-level controller, instead of building structured low-level policies with explicit, designed transitions.
Here, we did not attempt to combine the clips into a single policy; instead, we cut behaviors into short micro-behaviors of roughly 0.1 to 0.3 seconds, which we refer to as control fragments (Liu & Hodgins, 2017).
Compared to switching using the complete behaviors, the micro-behaviors, or control fragments, allow for better transitions and more ﬂexible locomotion.
Additionally, we can easily scale to many clips without manual intervention.
For example, clip 1 would generate a list of fragments: π 11 ( a | s t , τ ) , π 12 ( a | s t , τ ) , . . .
, π 110 ( a | s t , τ ) .
When fragment 1 was chosen, τ the time-indexing variable was set to τ = 0 initially and ticked until, say, τ = 0 .
Choosing fragment 2, π 12 , would likewise send a signal to the clip 1 policy starting from τ = 0 .
1 , etc.
Whereas we have to specify a small set of consistent behaviors for the other lowlevel controller models, we could easily construct hundreds (or possibly more) control fragments cheaply and without signiﬁcant curatorial attention.
Since the control fragments were not trained with switching behavior, we refer to the random access switching among fragments by the highlevel controller as “cold-switching” (Fig. 3).
2. T RAINING HL- POLICIES TO SOLVE TASKS USING LL- CONTROLLERS
We integrated the low-level controllers into an agent architecture with vision and and an LSTM memory in order to apply it to tasks including directed movements to target locations, a running course with wall or gap obstacles, a foraging task for “balls”, and a simple memory task involving detecting and memorizing the reward value of the balls.
The interface between the high-level controller and the low-level depends on the type of low-level controller: for the steerable controller, the high-level produces a one-dimensional output; for the switching and control fragment controllers, the high-level produces a 1-of-K index to select the lowlevel policies.
The high-level policies are trained off-policy using data from a replay buffer.
The replay buffer contains data generated from distributed actors, and in general the learner processes the same replay data multiple times.
The high-level controller senses inputs from proprioceptive data and, for visual tasks, an egocentric camera mounted at the root of the body (Fig. 4).
A noteworthy challenge arises due to the movement of the camera itself during locomotion.
The proprioceptive inputs are encoded by a single linear layer, and the image is encoded by a ResNet (see Appendix A).
The separate inputs streams are then ﬂattened, concatenated, and passed to an LSTM, enabling temporally integrated decisions, with a stochastic policy and a value function head.
The high-level controller receives inputs at each time step even though it may only act when the previous behavior (gait cycle or control fragment) has terminated.
Importantly, while the low-level skills used exclusively egocentric proprioceptive input, the highlevel controller used vision to select from or modulate them, enabling the system as a whole to effect visuomotor computations.
High-level controller reinforcement learning details For the steerable controller
, the policy was a parameterized Gaussian distribution that produces the steering angle a s ∈ [ − 1 . 5 , 1 . 5] .
The mean of Gaussian was constrained via a tanh and sampled actions were clipped to the steering angle range.
The steering angle was held constant for a full gait cycle.
The policy was trained as previously described by learning a state-action value function off-policy using TD-learning with Retrace (Munos et al., 2016) with the policy trained using SVG(0)
(Heess et al., 2015).
For the switching controller and the discrete control fragments approach, the policy was a multinomial over the discrete set of behaviors.
In either case, the high-level controller would trigger the behavior for its period T (a gait cycle or a fragment length).
To train these discrete controllers, we ﬁt the state-value baseline V -function using V-Trace and update the policy according to the method in Espeholt et al.
While we provided a target for the value function loss at each time step, the policy gradient loss for the high-level was non-zero only when a new action was sampled (every
T steps
Query-based control fragment selection We considered an alternative family of ideas to interface with control fragments based on producing a Gaussian policy search query to be compared against a feature-key for each control fragment.
We then selected the control fragment whose key was nearest the query-action.
Our method was based on the Wolpertinger approach introduced in (Dulac-Arnold et al., 2015).
Here, the Q-function was evaluated for each of k nearest neighbors to the query-action, and the control fragment were selected with Boltzmann exploration, i.e. p ( a HLi | h ) ∝ exp( 1 T Q ( h, a HLi )) , where h is the output of the LSTM.
See Appendix A.3.3 for more details.
The intuition was that this would allow the high-level policy to be less precise as the Qfunction could assist it in selecting good actions.
However, this approach under-performed relative to discrete action selection as we show in our results.
E XPERIMENTS 3. R ESULTS ON CORE TASKS
We compared the various approaches on a variety of tasks implemented in MuJoCo (Todorov et al., 2012).
The core tasks we considered for the main comparisons were Go-to-target, wall navigation (Walls), running on gapped platforms (Gaps), foraging for colored ball rewards (Forage), and a foraging task requiring the agent to remember the reward value of the different colored balls (Heterogeneous Forage) (see Fig. 5).
In Go-to-target, the agent received a sparse reward of 1 for each time step it was within a proximity radius of the target.
For Walls and Gaps, adapted from Heess et al.
(2017) to operate from vision, the agent received a reward proportional to its forward velocity.
Forage was broadly similar to explore object locations in the DeepMind Lab task suite (Beattie et al., 2016)
(with a humanoid body) while Heterogeneous Forage was a simpliﬁed version of explore object rewards .
In all tasks, the body was initialized to a random pose from a subset of the reference motion capture data.
For all tasks, other than Go-to-target, the high-level agent received a 64x64 image from the camera attached to the root of the body, in addition to the proprioceptive information.
We compared the agents on our core set of tasks.
Our overall best results were achieved using control fragments with discrete selection (Fig. 6).
Additional training details are provided in Appendix A.
For comparison, we also include the control experiment of training a policy to control the humanoid from scratch (without low-level controllers) as well as training a simple rolling ball body.
The performance of the rolling ball is not directly comparable because its velocity differs from that of the humanoid, but isolates the task complexity from the challenge of motor control of the humanoid body.
The switching controllers selected between a base set of four policies: stand, run, left and right turn.
For the control fragments approach we were able to augment this set as described in
Table 2.
The end-to-end approach (described in Appendix A.4) succeeded at only Go-to-target, however the resulting visual appearance was jarring.
In the more complex Forage task, the end-to-end approach failed entirely.
The steering controller was also able to perform the Go-to-target task, but a ﬁxed turning radius meant that it was unable to make a direct approach the target, resulting in a long travel time to the target and lower score.
Both the steering controller and switching controller were able to reach the end of the course in the Walls task, but only the control fragments approach allowed for sharper turns and quicker adjustments for agent to achieve a higher velocity.
Generally, the switching controller with transitions started to learn faster and appeared the most graceful because of its predeﬁned, smooth transitions, but its comparative lack of ﬂexibility meant that its asymptotic task performance was relatively low.
In the Forage task, where a score of > 150 means the agent is able to move around the maze and 600 is maximum collection of reward, the switching controller with transitions was able to traverse the maze but unable to adjust to the layout of the maze to make sharper turns to collect all objects.
The control fragments approach was able to construct rotations and abrupt turns to collect the objects in each room.
In the Gaps task, we were able to use the control fragments approach with 12 single-clip policies, where it would be laborious to pretrain transitions for each of these.
In this task, the high-level controller selected between the 4 original stand, run and turn policies as well as 8 additional jumps, resulting in 359 fragments, and was able to synthesize them to move forward along the separated platforms.
In the ﬁnal Heterogeneous Forage task, we conﬁrmed that the agent, equipped with an LSTM in the high-level controller, was capable of memory-dependent control behavior.
See our Extended Video 2 for a comprehensive presentation of the controllers.
All control fragment comparisons above used control fragments of 3 time steps (0.09s).
To further understand the performance of the control fragment approach, we did a more exhaustive comparison of performance on Go-to-target of the effect of fragment length, number of fragments, as well as introduction of redundant clips (see appendix B).
We saw beneﬁts in early exploration due to using fragments for more than one time step but lower ultimate performance.
Adding more fragments was helpful when those fragments were functionally similar to the standard set and the high-level controller was able to robustly handle those that involved extraneous movements unrelated to locomotion.
3. A NALYSIS OF TRAINED HIGH - LEVEL POLICIES
While the query-based approaches did not outperform the discrete control fragment selection (Fig.
6), we include a representative visualization in Appendix A.3 to help clarify why this approach may not have worked well.
In the present setting, it appears that the proposal distribution over queries generated by the high-level policy was high variance and did not learn to index the fragments precisely.
On Forage, the high-level controller with discrete selection of control fragments generated structured transitions between fragments (Appendix C).
Largely, movements remained within clip or behavior type.
The high-level controller ignored some fragments involving transitions from standing to running and left-right turns to use fast-walk-and-turn movements.
To assess the visual features that drove movements, we computed saliency maps (Simonyan et al., 2013) showing the intensity of the gradient of the selected action’s log-probability with respect to each pixel: S t ; x,y = 1 Z min( g, 13 (cid:80)
c
|∇ I x,y,c log π ( a HLt | h t ) | ) with normalization Z and clipping g (Fig. 7).
Consistently, action selection was sensitive to the borders of the balls as well as to the walls.
The visual features that this analysis identiﬁes correspond roughly to sensorimotor affordances (Gibson, 2014); the agent’s perceptual representations were shaped by goals and action.
D ISCUSSION
In this work we explored the problem of learning to reuse motor skills to solve whole body humanoid tasks from egocentric camera observations.
We compared a range of approaches for reusing lowlevel motor skills that were obtained from motion capture data, including variations related to those presented in Liu & Hodgins (2017); Peng et al.
To date, there is limited learning-based work on humanoids in simulation reusing motor skills to solve new tasks, and much of what does exist is in the animation literature.
A technical contribution of the present work was to move past hand-designed observation features (as used in Heess et al.
; Peng et al.
towards a more ecological observation setting: using a front-facing camera is more similar to the kinds of observations a real-world, embodied agent would have.
We also show that hierarchical motor skill reuse allowed us to solve tasks that we could not with a ﬂat policy.
For the walls and go-to-target tasks, learning from scratch was slower and produced less robust behavior.
For the forage tasks, learning from scratch failed completely.
Finally, the heterogeneous forage is an example of task that integrates memory and perception.
There are some other very clear continuities between what we present here and previous work.
For learning low-level tracking policies from motion capture data, we employed a manually speciﬁed similarity measure against motion capture reference trajectories, consistent with previous work (Liu et al., 2010; 2015; Peng et al., 2018).
Additionally, the low-level policies were time-indexed: they operated over only a certain temporal duration and received time or phase as input.
Considerably less research has focused on learning imitation policies either without a pre-speciﬁed scoring function or without time-indexing (but see e.g. Merel et al.
Compared to previous work using control fragments (Liu & Hodgins, 2017), our low-level controllers were built without a sampling-based planner and were parameterized as neural networks rather than linear-feedback policies.
We also want to make clear that the graph-transition and steerable structured low-level control approaches require signiﬁcant manual curation and design: motion capture clips must be segmented by hand, possibly manipulated by blending/smoothing clips from the end of one clip to the beginning of another.
This labor intensive process requires considerable skill as an animator; in some sense this almost treats humanoid control as a computer-aided animation problem, whereas we aim to treat humanoid motor control as an automated and data-driven machine learning problem.
We acknowledge that relative to previous work aimed at graphics and animation, our controllers are less graceful.
Each approach involving motion capture data can suffer from distinct artifacts, especially without detailed manual editing – the hand-designed controllers have artifacts at transitions due to imprecise kinematic blending but are smooth within a behavior, whereas the control fragments have a lesser but consistent level of jitter throughout due to frequent switching.
Methods to automatically (i.e. without human labor) reduce movement artifacts when dealing with large movement repertoires would be interesting to pursue.
Moreover, we wish to emphasize that due to the human-intensive components of training structured low-level controllers, fully objective algorithm comparison with previous work can be somewhat difﬁcult.
This will remain an issue so long as human editing is a signiﬁcant component of the dominant solutions. Here, we focused on building movement behaviors with minimal curation, at scale, that can be recruited to solve tasks.
Speciﬁcally, we presented two methods that do not require curation and can re-use low-level skills with cold-switching.
Additionally, these methods can scale to a large number of different behaviors without further intervention.
We view this work as an important step toward the ﬂexible use of motor skills in an integrated visuomotor agent that is able to cope with tasks that pose simultaneous perceptual, memory, and motor challenges to the agent.
Future work will necessarily involve reﬁning the naturalness of the motor skills to enable more general environment interactions and to subserve more complicated, compositional tasks.
A CKNOWLEDGMENTS
We thank Yuval Tassa for helpful comments.
The data used in this project was obtained from mocap.cs.cmu.edu.
The database was created with funding from NSF EIA-019621.
A PPENDICES A A DDITIONAL TRAINING DETAILS
Following Espeholt et al.
(2018), all training was done using a distributed actor-learner architecture.
Many asynchronous actors interact with the environment to produce trajectories of ( s t , a t , r t , s t +1 ) tuples of a ﬁxed rollout length, N .
In contrast to Espeholt et al.
(2018), each trajectory was stored in a replay buffer.
The learner sampled trajectories of length N at random and performed updates.
Each actor retrieved parameters from the learner at a ﬁxed time interval.
The learner ran on a single
Pascal 100 or Volta 100 GPU.
The plots presented use the steps processed by the learner on the x-axis.
This is the number of transition retrieved from the replay buffer, which is equivalent to the number of gradient updates x batch size x rollout length.
We performed all optimization with Adam (Kingma & Ba, 2014) and used hyperparameter sweeps to select learning rates and batch sizes.
[Table]
Go To Target
[Table]
Walls / Gaps
[Table]
Forage
[Table]
Heterogeneous
[Table]
A. S ELECTED LOW - LEVEL POLICIES TRAINED FROM MOTION CAPTURE
For the switching controller and control fragments approach we used a standard set of four policies trained from motion capture which imitated stand, run, left and right turn behaviors.
In the switching controller, pretrained transitions were created in the reference data.
For the control fragments approach, we were able to augment the set without any additional work and the selected policies are described in Table 2.
[Table]
Go To Target stand, run, left turn, right turn
Walls stand, run, left turn
[Table]
A. H ETEROGENEOUS F ORAGE T ASK
In the heterogeneous forage task, the humanoid is spawned in a room with 6 balls, 3 colored red and 3 colored green.
Each episode, one color is selected at random and assigned a positive value (+30) or a negative value (-10) and the agent must sample a ball and then only collect the positive ones [Table]
A. H IGH - LEVEL CONTROLLER TRAINING DETAILS
The architecture of the high-level controller consisted of proprioceptive encoder and an optional image encoder which, along with prior reward and action, were passed to an LSTM.
This encoding core was shared with both the actor and critic.
The details of the encoder are depicted in Fig.
A.1.
A.3. S TEERING CONTROLLER TRAINING DETAILS
The steering controller policy head took as input the outputs of the LSTM in Fig.
A.1.
The policy head was an LSTM, with a state size of 128, followed by a linear layer.
The linear layer produced the parameters for a 1-D Gaussian.
The µ parameters were constrained by a tanh and the σ parameters were clipped between [0 . 1 , 1] .
The policy was trained with a SVG(0) update (Heess et al., 2015).
A state-action value / Q function was implemented as an MLP with dimensions in Table 1 and trained with a Retrace target.
Target networks were used for Q and updated every 100 training iterations.
The policy was also updated by an additional entropy cost at each time step, which was added to the policy update with a weight of 1 e − 5 .
A.3. S WITCHING CONTROLLER TRAINING DETAILS
The switching controller policy head took as input the outputs of the LSTM in Fig.
A.1.
The policy head was an LSTM, with a state size of 128, followed by a linear layer to produce the logits of the multinomial distribution.
The policy was updated with a policy gradient using N -step empirical returns with bootstrapping to compute an advantage, where N was equivalent to the rollout length in Table 1.
The value-function (trained via V-Trace) was used as a baseline.
The policy was also updated by an additional entropy cost at each time step, which was added to the policy update with a weight of .01.
A.3. D ETAILS OF QUERY - BASED ACTION SELECTION APPROACH
We train a policy to produce a continuous feature vector (i.e. the query-action), so the selector is parameterized by a diagonal multivariate Gaussian action model.
The semantics of the query-action will correspond to the features in the control fragment feature-key vectors, which were partial state observations (velocity, orientation, and end-effector relative positions) of the control fragment’s nominal start or end pose.
In this approach, the Q function was trained with returns. So, for samples ( s t , a t , r t , s t +1 ) from replay:
[Equation]
The total loss is summed across minibatches sampled from replay.
Note that for the query-based approach we have query actions which are in the same space as but generally distinct from the reference keys of the control fragments which are selected after the sampling procedure.
The high-level policy emits query actions, which are rectiﬁed to reference keys by a nearest lookup (i.e. the selected actions).
This leads to two, slightly different high-level actions in the same space.
This leads to the question of what is the appropriate action on which to perform both policy updates and value function updates.
To handle this, it proved most stable to compute targets and loss terms for both the query-actions and selected actions for each state from replay.
In this way, a single Q function represented the value of query-actions and selected actions.
This was technically an approximation as the training of the
Q-function pools these two kinds of action input.
Finally, the policy update used the SVG(0)-style update (Heess et al., 2015):
[Equation]
actions are the continuous actions generated by the policy. Reference keys are the feature vectors associated with the control fragments (here, features of the ﬁnal state of the nominal trajectory of the fragment). Selected actions are the actions produced by the sampling mechanism and they are overlain to emphasize the control reference keys actually selected. The most prominent feature of this visualization is the lack of precision in the query actions.
Note that 45/105 control fragments were selected by the trained policy.
We hypothesize that the limited success of this approach is perhaps partly due to the impreciseness in their selectivity (see Fig A.3).
After ﬁnding these approaches were not working very well, an additional analysis of a trained discrete-selection agent, not shown here, found that the second most preferred control fragment (in a given state) was not usually the control fragment with the most similar reference key.
This implies that the premise of the query-based approach, namely that similar fragments should be preferentially confused/explored may not be as well-justiﬁed in this case as we speculated, when we initially conceived of trying it.
That analysis notwithstanding, we remain optimistic this approach may end up being more useful than we found it to be here.
A. E ND - TO - END CONTROLLER TRAINING DETAILS
End-to-end training on each task was performed in a similar fashion to training the low-level controllers.
Using the same architecture as in A.1, the policy was trained to output the 56-dimensional action for the position-controlled humanoid.
As in the low-level training, the policy was trained with a SVG(0) update (Heess et al., 2015) and Q was trained with a Retrace target.
The episode was terminated when the humanoid was in an irrecoverable state and when the head fell below a ﬁxed height.
B S CALING AND FRAGMENT LENGTH
We compared performance as a function of the number of fragments as a well as the length of fragments.
If using a ﬁxed number of behaviors and cutting them into control fragments of various lengths, two features are coupled: the length of the fragments vs. how many fragments there are.
One can imagine a trade-off – more fragments might make exploration harder, but shorter temporal commitment to a fragment may ultimately lead to more precise control.
To partially decouple the number of fragments from their length, we also compared performance with functionally redundant but larger sets of control fragments.
Ultimately, it appears that from a strict task-performance perspective, shorter control fragments tend to perform best as they allow greatest responsiveness.
That being said, the visual appearance of the behavior tends to be smoother for longer control fragments.
Control fragments of length 3 (.09 sec) seemed to trade-off behavioral coherence against performance favorably.
Hypothetically, longer control fragments might also shape the action-space and exploration distribution favorably.
We see a suggestion of this with longer-fragment curves ascending earlier.
C T RANSITION ANALYSES OF AN EXAMPLE POLICY