<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Combining Learning From Human Feedback and Knowledge Engineering to Solve Hierarchical Tasks in Minecraft</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Vinicius G. Goecks</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Nicholas Waytowich</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>David Watkins-Valls</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bharat Prakash</string-name>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Columbia University</institution>
          ,
          <addr-line>New York City, New York</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>DEVCOM Army Research Laboratory</institution>
          ,
          <addr-line>Aberdeen Proving Ground, Maryland</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>University of Maryland</institution>
          ,
          <addr-line>Baltimore, Maryland</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Real-world tasks of interest are generally poorly defined by human-readable descriptions and have no pre-defined reward signals unless it is defined by a human designer. Conversely, data-driven algorithms are often designed to solve a specific, narrowly defined, task with performance metrics that drives the agent's learning. In this work, we present the solution that won first place and was awarded the most human-like agent in the 2021 NeurIPS Competition MineRL BASALT Challenge: Learning from Human Feedback in Minecraft, which challenged participants to use human data to solve four tasks defined only by a natural language description and no reward function. Our approach uses the available human demonstration data to train an imitation learning policy for navigation and additional human feedback to train an image classifier. These modules, combined with an estimated odometry map, become a powerful state-machine designed to utilize human knowledge in a natural hierarchical paradigm. We compare this hybrid intelligence approach to both end-to-end machine learning and pure engineered solutions, which are then judged by human evaluators. Codebase is available at https://github.com/ viniciusguigo/kairos_minerl_basalt.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Hybrid Intelligence</kwd>
        <kwd>Human-in-the-Loop Learning</kwd>
        <kwd>Machine Learning</kwd>
        <kwd>Artificial Intelligence</kwd>
        <kwd>Knowledge Engineering</kwd>
        <kwd>Minecraft</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In this paper, we present the solution that won first place and was awarded the most human-like
agent in the 2021 Neural Information Processing Systems (NeurIPS) MineRL Benchmark for
Agents that Solve Almost-Lifelike Tasks (BASALT) competition1. Most artificial intelligence (AI)
and reinforcement learning (RL) challenges involve solving tasks that have a reward function
to optimize over. Real-world tasks, however, do not automatically come with a reward function,
and defining one from scratch can be quite challenging. Therefore, teaching AI agents to
solve complex tasks and learn dificult behaviors without any reward function remains a major
challenge for modern AI research. The MineRL BASALT competition is aimed to address
this challenge by developing AI agents that can solve complex, almost-lifelike, tasks in the
challenging Minecraft environment [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] using only human feedback data and no reward function.
      </p>
      <p>
        The MineRL BASALT competition tasks do not contain any reward functions for the four
tasks. We propose a human-centered machine learning approach instead of using traditional
RL algorithms [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. However, learning complex tasks with high-dimensional state-spaces (i.e.
from images) using only end-to-end machine learning algorithms requires large amounts of
high-quality data [
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. When learning from human feedback, this translates to large amounts of
either human-collected or human-labeled data. To circumvent this data requirement, we opted
to combine machine learning with knowledge engineering, also known as hybrid intelligence
[
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. Our approach uses human knowledge of the task to break them down in a natural
hierarchy of subtasks. Subtask selection is controlled by an engineered state-machine, which
relies on estimated agent odometry and the outputs of a learned state classifier. We also use the
competition-provided human demonstration dataset to train a navigation policy subtask via
imitation learning to replicate how humans traverse the environment.
      </p>
      <p>In this paper, we give a detailed overview of our approach and perform an ablation study to
investigate how well our hybrid intelligence approach works compared to using either learning
from human demonstrations or engineered solutions alone. Our two main contributions are:
• An architecture that combines engineered knowledge of the tasks to be solved together
with machine learning modules to solve complex hierarchical tasks in Minecraft.
• Empirical results on how hybrid intelligence compares to both end-to-end machine
learning and pure engineered approaches when solving complex, real-world-like tasks,
as judged by real human evaluators.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background and Related Work</title>
      <p>
        End-to-end machine learning: in this work we use the term “end-to-end machine learning”
for algorithms that learn purely from data with minimal bias or constraints added by human
designers, besides the ones that are already inherently built-in the learning algorithm. For
example, deep reinforcement learning algorithms learning directly from raw pixels [
        <xref ref-type="bibr" rid="ref7 ref8">7, 8</xref>
        ] and
algorithms that automatically decompose tasks in hierarchies with diferent time scales [
        <xref ref-type="bibr" rid="ref10 ref9">9, 10</xref>
        ].
This often includes massive parallelization and distributed computation [
        <xref ref-type="bibr" rid="ref11 ref12">11, 12</xref>
        ] to fulfill the data
requirement of these algorithms. Other works train robotic agents to navigate through their
environment using RGB-D (visible spectrum imagery, plus depth) information to determine
optimal discrete steps to navigate to a visual goal [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Despite all advances made in this field,
these techniques have not been demonstrated to scale to tasks with the complexity presented in
the MineRL BASALT competition.
      </p>
      <p>
        Human-in-the-loop machine learning: Learning from human feedback can take diferent
forms depending on how human interaction is used in the learning-loop [
        <xref ref-type="bibr" rid="ref14 ref15">14, 15</xref>
        ]. A learning
agent can be trained based on human demonstrations of a task [
        <xref ref-type="bibr" rid="ref16 ref17 ref3">16, 17, 3</xref>
        ]. Agents can learn from
suboptimal demonstrations [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ], end goals [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ], or directly from successful examples instead
of a reward function [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ]. Human operators can augment the human demonstrations with
online interventions [
        <xref ref-type="bibr" rid="ref21 ref22 ref23 ref24">21, 22, 23, 24</xref>
        ] or ofline labeling [
        <xref ref-type="bibr" rid="ref25 ref26">25, 26</xref>
        ] while still maintaining success.
Agents can learn the reward or cost function used by the demonstrator [
        <xref ref-type="bibr" rid="ref27 ref28">27, 28</xref>
        ] through sparse
interactions in the form of evaluative feedback [
        <xref ref-type="bibr" rid="ref29 ref30 ref31">29, 30, 31</xref>
        ] or human preferences given a pair
of trajectories [
        <xref ref-type="bibr" rid="ref32">32</xref>
        ]. Additionally, agents can learn from natural language-defined goals [
        <xref ref-type="bibr" rid="ref33">33</xref>
        ].
Finally, agents can learn from combining human data with reinforcement learning [
        <xref ref-type="bibr" rid="ref34 ref35 ref36">34, 35, 36</xref>
        ].
However, these techniques have not scaled to tasks with the complexity presented in the MineRL
BASALT competition.
      </p>
      <p>
        The Minecraft learning environment: Minecraft is a procedurally-generated, 3D
openworld game, where the agent observes the environment from a first-person perspective, collects
resources, modifies the environment’s terrain, crafts tools that augment the agent’s capabilities,
and possibly interacts with other agents in the same environment. Given the open-world nature
of this environment, there are no predefined tasks or built-in reward signals, giving the task
designer flexibility to define tasks with virtually any level of complexity. The release of Malmo
[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a platform that enabled AI experimentation in the game of Minecraft, gave researchers the
capability to develop learning agents to solve tasks similar or analogous to the ones seen in the
real world.
      </p>
      <p>
        The Minecraft environment also served as a platform to collect large human demonstration
datasets such as the MineRL-v0 dataset [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ] and experiment with large scale imitation learning
algorithms [
        <xref ref-type="bibr" rid="ref38">38</xref>
        ] as a world generator for realistic terrain rendering [
        <xref ref-type="bibr" rid="ref39">39</xref>
        ], a sample-eficient
reinforcement learning competition environment using human priors (MineRL DIAMOND
challenge) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]; and now as a platform for a competition on solving human-judged tasks defined
by a human-readable description and no pre-defined reward function, the MineRL BASALT
competition [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ].
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Problem Formulation</title>
      <p>
        The 2021 NeurIPS MineRL BASALT competition, “Learning from Human Feedback in Minecraft”,
challenged participants to come up with creative solutions to solve four diferent tasks in
Minecraft [
        <xref ref-type="bibr" rid="ref40">40</xref>
        ] using the “MineRL: Towards AI in Minecraft”2 simulator [
        <xref ref-type="bibr" rid="ref37">37</xref>
        ]. These tasks aimed
to mimic real-world tasks, being defined only by a human-readable description and no reward
signal returned by the environment. The oficial task descriptions for the MineRL BASALT
competition3 were the following:
• FindCave: The agent should search for a cave and terminate the episode when it is inside
one.
• MakeWaterfall: After spawning in a mountainous area, the agent should build a beautiful
waterfall and then reposition itself to take a scenic picture of the same waterfall.
• CreateVillageAnimalPen: After spawning in a village, the agent should build an animal
pen containing two of the same kind of animal next to one of the houses in a village.
2MineRL webpage: https://minerl.io/.
3MineRL BASALT documentation: https://minerl.io/basalt/.
• BuildVillageHouse: Using items in its starting inventory, the agent should build a new
house in the style of the village, in an appropriate location (e.g ṅext to the path through
the village) without harming the village in the process.
      </p>
      <p>The competition organizers also provided each participant team with a dataset of 40 to 80
human demonstrations for each task, not all completing the task, and the starter codebase to
train a behavior cloning baseline. Additionally, the training time for all four tasks together
was limited to four days and participants were allowed to collect up to 10 hours of additional
human-in-the-loop feedback.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Methods</title>
      <p>
        Since no reward signal was given by the competition organizers and compute time was
limited, direct deep reinforcement learning approaches were not feasible [
        <xref ref-type="bibr" rid="ref41 ref7 ref8">7, 41, 8</xref>
        ]. With the
limited human demonstration dataset, end-to-end behavior cloning also did not result in
highperforming policies, because imitation learning requires large amounts of high-quality data
[
        <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
        ]. We also attempted to solve the tasks using adversarial imitation learning approaches
such as Generative Adversarial Imitation Learning (GAIL) [
        <xref ref-type="bibr" rid="ref42">42</xref>
        ], however, the large-observation
space and limited compute time also made this approach infeasible.
      </p>
      <p>
        Hence, to solve the four tasks of the MineRL BASALT competition, we opted to combine
machine learning with knowledge engineering, also known as hybrid intelligence [
        <xref ref-type="bibr" rid="ref5 ref6">5, 6</xref>
        ]. As
seen in the main diagram of our approach shown in Figure 1, the machine learning part of
our method is seen in two diferent modules: first, we learn a state classifier using additional
human feedback to identify relevant states in the environment; second, we learn a navigation
subtask separately for each task via imitation learning using the human demonstration dataset
provided by the competition. The knowledge engineering part is seen in three diferent modules:
ifrst, given the relevant states classified by the machine learning model and knowledge of the
tasks, we designed a state-machine that defines a hierarchy of subtasks and controls which one
should be executed at every time-step; second, we engineered solutions for the more challenging
subtasks that we were not able to learn directly from data; and third, we engineered an estimated
odometry module that provides additional information to the state-machine and enables the
execution of the more complex engineered subtasks.
4.1. State Classification
(a) has_cave
(b) inside_cave
(c) danger_ahead
(d) has_mountain
(e) facing_wall
(f) at_the_top
      </p>
      <p>(g) good_waterfall_view (h) good_pen_view
(i) good_house_view
(j) has_animals
(k) has_open_space
(l)
animals_inside_pen</p>
      <p>
        Our approach relies on a state machine that changes the high-level goals depending on the
task to be solved. Without having information about the environment’s voxel data, we opted
to use the visual RGB information from the simulator to determine the agent’s current state.
Due to the low resolution of the simulator of 64 × 64 × 3, we decided to use a classifier that
labels the whole image rather than parts of the image, such as You Only Look Once (YOLO) [
        <xref ref-type="bibr" rid="ref43">43</xref>
        ].
Multiple labels can be present on the same image as there were cases with multiple objects or
scenes of interest at the same time in the field of view of the agent. These labels are used by the
state-machine to decide which subtask should be followed at any time-step.
      </p>
      <p>There are 13 possible labels for an RGB frame, as illustrated in Figure 2 and described below:
• none: frame contains no relevant states (54.47 % of the labels).
• has_cave: agent is looking at a cave (1.39 % of the labels).
• inside_cave: agent is inside a cave (1.29 % of the labels).
• danger_ahead: agent is looking at a large body of water (3.83 % of the labels).
• has_mountain: agent has a complete view of a mountain (usually, from far away) (4.38 %
of the labels).
• facing_wall: agent is facing a wall that cannot be traversed by jumping only (4.55 % of
the labels).
• at_the_top: agent is at the top of a mountain and looking at a clif (3.97 % of the labels).
• good_waterfall_view: agent see water in view (3.16 % of the labels).
• good_pen_view: agent has framed a pen with animals in view (4.12 % of the labels).
• good_house_view: agent has framed a house in view (2.58 % of the labels).
• has_animals: frame contains animals (pig, horse, cow, sheep, or chicken) (9.38 % of the
labels).
• has_open_space: agent is looking at an open-space of about 6x6 blocks with no small clifs
or obstacles (flat area to build a small house or pen) (7.33 % of the labels).
• animals_inside_pen: agent is inside the pen after luring all animals and has them in view
(0.81 % of the labels).</p>
      <p>The possible labels were defined by a human designer with knowledge of the relevant states
to be identified and given to the state-machine to solve all tasks. These labels were also
designed to be relevant to all tasks to ease data collection and labelling eforts. For example,
the “has_open_space” label identifies flat areas that are ideal to build pens or houses for both
CreateVillageAnimalPen and BuildVillageHouse tasks. Unknown and other non-relevant states
were attached the label “none” to indicate that no important states were in view.</p>
      <p>
        To train this system, we labeled 81, 888 images using a custom graphical user interface (GUI),
as showed in Appendix A. Once the data was labeled, 80% of images were used for training,
10% were used for validation, and 10% for testing. The model is a convolutional classifier with
a 64 × 64 × 3 input and 13 × 1 output. Our autoencoder is modeled after the Deep TAMER
(Training Agents Manually via Evaluative Reinforcement) [
        <xref ref-type="bibr" rid="ref31">31</xref>
        ] model. The problem of training
with an uneven number of labels for each class was mitigated by implementing a weighted
sampling scheme that sampled more often classes with lower representation with probability:
 () = 1 −  , (1)
where  () is the probability of sampling class  that contains  number of labels out of the
total  labels for all classes.
      </p>
      <sec id="sec-4-1">
        <title>4.2. Estimated Odometry</title>
        <p>Some of the engineered subtasks required basic localization of the agent and relevant states of
the environment. For example, the agent needs to know the location of previously seen animals
to guide them to a pen in the CreateVillageAnimalPen task. However, under the rules of the
competition, we were not allowed to use any additional information from the simulator besides
the current view of the agent and the player’s inventory. Which means there is no information
about the ground truth location of the agent, camera pose, or any explicit terrain information
available.</p>
        <p>Given these constraints, we opted to implement a custom odometry method that took into
consideration only the actions from the agent and basic characteristics of the Minecraft simulator.
It is known that the simulator runs at 20 frames per second, which means there is a 0.05 second
interval between each frame. According to the Minecraft Wiki4, walking speed is approximately
4.317 m/s, 5.612 m/s while sprinting, or 7.127 m/s when sprinting and jumping at the same
time, which translates to approximately 0.216, 0.281, or 0.356 meters per frame when walking,
sprinting, or sprinting and jumping, respectively. If we assume the agent is operating in a flat
world, starting at position (0, 0) in map coordinates facing north, when the agent executes a
move forward action its position is moved 0.216 meters north to position (0, 0.216). The agent
does not have acceleration in MineRL and their velocity is immediately updated upon keypress.
Another limitation is that we were not able to reliably detect when the agent is stuck behind an
obstacle, which causes the estimated location to drift even though the agent is not moving in
the simulator.</p>
        <p>Since the agent already commands camera angles in degrees, the heading angle  is simply
updated by accumulating the horizontal camera angles commanded by the agent. More generally,
this odometric estimation assumes the agent follows point-mass kinematics:
˙ =  ( )
4Minecraft Wiki - Walking: https://minecraft.fandom.com/wiki/Walking.</p>
        <p>˙ =  ( ),
where  is the velocity of the agent, which takes into consideration if the agent is walking,
sprinting, or sprinting and jumping.</p>
        <p>Using this estimated odometry and the learned state classifier, it is possible to attach a
coordinate to each classified state and map important features of the environment so they can be
used later by diferent subtasks and the state-machine. For example, it is possible to keep track
of where the agent found water, caves, animals, and areas of open space that can be used to
build a pen or a house. Figure 3 shows a sample of the resulting map overlaid with the classified
states’ location and current odometry readings.</p>
      </sec>
      <sec id="sec-4-2">
        <title>4.3. Learning and Engineering Subtasks and the State-Machine</title>
        <p>One of the main complexities in solving the proposed four tasks is that most required the
agent to have certain levels of perception capabilities, memory, and reasoning over long-term
dependencies in a hierarchical manner. For example, the CreateVillageAnimalPen task required
the agent to first build a pen nearby an existing village, which requires identifying what a
village is, then indicating a good location to build a pen such as a flat terrain. Once the pen was
built, the agent had to search for at least two of the same animal type in the nearby vicinity
using 64 × 64 resolution images as input. Return animals to the pen required coordination
to combine diferent blocks and place them adjacently to each other in a closed shape. After
the animals were found, the agent had to lure them with the specific food type they eat, walk
them back to the pen the agent initially built, leave the pen, lock the animals inside, then take a
picture of the pen with the animals inside.</p>
        <p>
          Reasoning over these long-term dependencies in hierarchical tasks is one of the main
challenges of end-to-end learning-based approaches [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Conversely, reactive policies such as the
one required to navigate with certain boundaries and avoid obstacles have been learned directly
from demonstration data or agent-generated trajectories [
          <xref ref-type="bibr" rid="ref3 ref44">44, 3</xref>
          ]. In this work, we use human
knowledge of the tasks to decompose these complex tasks in multiple subtasks, which are either
reactive policies learned from data or directly engineered, and a state-machine that selects the
most appropriate one to be followed at every time-step. The subtask that performs task-specific
navigation is learned from the provided human demonstration dataset. For example, searching
for the best spot to place a waterfall in the MakeWaterfall task requires navigation. Subtasks
with little demonstration data available are engineered in combination with the learned state
classifier. Throwing a snowball while inside the cave to signal the end of the episode can be
engineered using human demonstration data.
        </p>
        <p>Once the complex tasks are decomposed into multiple small subtasks, we engineered a
statemachine in combination with the learned state classifier to select the best subtask to be followed
at every time-step. Each of these engineered subtasks was implemented by a human designer
who hard-coded a sequence of actions to be taken using the same interface available to the
agent. In addition to these subtasks, the human designer also implemented a safety-critical
subtask allowing the agent to escape a body of water whenever the state classifier detects that
the agent is swimming. Appendix B describes in detail the sequence of substasks followed by
the state-machine for each task.</p>
      </sec>
      <sec id="sec-4-3">
        <title>4.4. Evaluation Methods</title>
        <p>In this work, we compared four diferent approaches to solve the four tasks proposed in the
Minecraft competition:
• Hybrid: the main proposed agent in this work, that combines both learned and
engineered modules. The learned modules are the navigation subtask policy (learns how to
navigate using the human demonstration data provided by the competition) and the state
classifier (learns how to identify relevant states using additional human-labeled data). The
engineered modules are the multiple subtasks, hand-designed to solve subtasks that were
not able to be learned from data. These engineered modules are the estimated odometry
and the state-machine, which uses the output of the state classifier and engineered task
structure to select which subtask should be followed at each time-step.
• Engineered: almost identical to the Hybrid agent described above, however, the
navigation subtask policy that was learned from human demonstrations is now replaced
by a hand-designed module that randomly selects movement and camera commands to
explore the environment.
• Behavior Cloning: end-to-end imitation learning agent that learns solely from the
human demonstration data provided during the competition. This agent does not use any
other learned or engineered module, which includes the state classifier, the estimated
odometry, and the state-machine.
• Human: human-generated trajectories provided by the competition. They are neither
guaranteed to solve the task nor solve it optimally because they depend on the level of
expertise of each human controlling the agent.</p>
        <p>To collect human evaluations for each of the four baselines in a head-to-head comparison we
set up a web application5 similar to how the teams were evaluated during the oficial MineRL
BASALT competition, as seen in Appendix C. In our case, each participant was asked to see
two videos of diferent agents performing the same task then to answer three questions:
1. Which agent best completed the task?
2. Which agent was the fastest completing the task?
3. Which agent had a more human-like behavior?
For each question, the participants were given three possible answers: “Agent 1”, “Agent 2”, or
“None”.</p>
        <p>Our database had videos of all four types of agents (Behavior Cloning, Engineered, Hybrid,
and Human) performing all four tasks (FindCave, MakeWaterfall, CreateVillageAnimalPen,
and BuildVillageHouse). There were 10 videos of each agent type solving all four tasks, for a
total of 160 videos in the database. Task, agent type, and videos were uniformly sampled from
the database at each time a new evaluation form was generated and presented to the human
evaluator.</p>
        <p>We collected a total of 268 evaluation forms (pairwise comparison where a human evaluator
judged which agent was the best, fastest, and more human-like performing the tasks) from 7
diferent human evaluators.</p>
        <p>5Custom MineRL BASALT evaluation webpage: https://kairosminerl.herokuapp.com/.</p>
        <p>All agent-generated videos were scaled from the original 64 × 64 image resolution returned
by the environment to 512 × 512 image resolution in an attempt to make the videos clearer for
the human evaluators. The videos of the ”Human” agent type were randomly selected from the
video demonstrations provided by the MineRL BASALT competition and scaled to 512 × 512
image resolution to match the agent-generated videos. All videos were generated and saved
at 20 frames per second to match the sampling rate of the Minecraft simulator used by both
agents and humans.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results and Discussion</title>
      <p>
        Each combination of condition (behavior cloning, engineered, hybrid, human) and performance
metric (best performer, fastest performer, most human-like performer) is treated as a
separate participant of a one-versus-one competition where skill rating is computed using the
TrueSkillTM6 Bayesian ranking system [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ]. In this Bayesian ranking system, the skill of each
participant is characterized by a Gaussian distribution with a mean value  , representing the
average skill of a participant and standard deviation  representing the degree of uncertainty in
the participant’s skill. There are three possible outcomes after each comparison: the first agent
wins the comparison, the second agent the comparison, or there is a draw (human evaluator
selects ”None” when asked which participant performed better in a given metric). Given this
outcome, the TrueSkillTM ranking system updates the belief distribution of each participant
using Bayes’ Theorem [
        <xref ref-type="bibr" rid="ref45">45</xref>
        ], similar to how scores were computed in the oficial 2021 NeurIPS
MineRL BASALT competition. We used the open-source TrueSkill Python package7.
      </p>
      <p>The final mean and standard deviation of the TrueSkillTM scores computed for each
performance metric and agent type are shown in Table 1. The scores were computed after collecting
268 evaluations from 7 diferent human evaluators. Our main proposed “Hybrid” agent, which
combines engineered and learned modules, outperforms both pure hand-designed (“Engineered”)
6Microsoft’s TrueSkillTM Ranking System:
trueskill-ranking-system
7TrueSkill Python package: https://github.com/sublee/trueskill and https://trueskill.org/.
https://www.microsoft.com/en-us/research/project/
and pure learned (“Behavior Cloning”) agents in the “Best Performer” category, achieving 5.3%
and 25.6% higher mean skill rating when compared to the “Engineered” and “Behavior Cloning”
baselines, respectively. However, when compared to the “Human” scores, our main proposed
agent achieves 21.7% lower mean skill rating, illustrating that even our best approach is still
not able to outperform a human player with respect to best performing the task.</p>
      <p>When looking at the “Fastest Performer” metric, our “Hybrid” agent outperforms both
“Engineered” and “Behavior Cloning” baselines, respectively, scoring only 2.7% lower than
the human players. As expected, in the “More Human-like Behavior” performance metric the
“Human” baseline wins by a large margin, however, the “Hybrid” still outperforms all other
baselines, including the “Behavior Cloning” agent, which is purely learned from human data.
We attribute this to the fact that the pure learned agent did not make use of the safety-critical
engineered subtask, which allowed the agent to escape bodies of water and other obstacles
around the environment. Plots showing how the TrueSkillTM scores evolved after each match
(one-to-one comparison between diferent agent types) are shown in Appendix D.</p>
      <p>Table 2 breaks down the results presented in Table 1 for each separate task. Similar to what
was discussed for Table 1, excluding the “Human” baseline, the “Hybrid” approach outperforms
both “Behavior Cloning” and “Engineered” baselines in terms of mean skill rating in 8 out of
the 12 performance metrics, or in 66.6% of the comparisons. Similarly, hybrid intelligence
approaches, which include both “Hybrid” and “Engineered” baselines, outperform the pure
learning “Behavior Cloning” approach in all 12 performance metrics, not taking into account
the “Human” baseline. The “Hybrid” approach only outperforms the “Human” baseline in 4 out
of the 12 performance metrics, or in 33.3% of the comparisons.</p>
      <p>Particularly for the MakeWaterfall task, the proposed hybrid approach outperforms human
players for all performance metrics. The largest margin observed is for the “Fastest Performer”
metric; the hybrid approach scores 53.2% higher than the human players. This large margin
comes from human players taking more time to find the best spot to place the waterfall and
signal the end of the episode when compared to the engineered subtasks. Plots showing all
results for each individual pairwise comparison are shown in Appendix E.</p>
      <p>We now consider qualtitative evaluation of our agents. When solving the FindCave task8, the
agent spawns in the plains biome and uses the learned navigation policy to search for caves
while avoiding water while simultaneously building the map of its environment. Once the agent
ifnds the cave, it throws the snowball to signal the end of the episode. In the MakeWaterfall
task9, the hybrid agent spawns in a mountainous area, uses the learned navigation policy to
climb the mountains, detects a good location to build the waterfall, builds it, then moves to
the picture location using engineered subtasks, and throws the snowball to signal the end
of the episode. For the CreateVillageAnimalPen task10, the agent uses the learned navigation
policy and the state classifier to search for an open location to build a pen, builds the pen using
an engineered building subtask that repeats the actions taken by the human demonstrators,
uses the state classifier and odometry map to go to previously seen animal locations, and then
attempts to lure them back to the pen and throws the snowball to signal the end of the episode.
8Sample trajectory of hybrid agent solving the FindCave task: https://youtu.be/MR8q3Xre_XY.
9Sample trajectory of hybrid agent solving the MakeWaterfall task: https://youtu.be/eXp1urKXIPQ.
10Sample trajectory of hybrid agent solving the CreateVillageAnimalPen task: https://youtu.be/b8xDMxEZmAE.
Finally, when solving the BuildVillageHouse task11, our hybrid agent spawns nearby a village
and uses the learned navigation policy and the state classifier to search for an open location
to build a house, builds a house using an engineered building subtask that repeats the actions
taken by the human demonstrators, tours the house, and throws the snowball to signal the end
of the episode. Each of the described subtasks are shown in Appendix F as a sequence of frames.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In this paper, we presented the solution that won first place and was awarded the most
humanlike agent in the 2021 NeurIPS MineRL BASALT competition, “Learning from Human Feedback
11Sample trajectory of hybrid agent solving the BuildVillageHouse task: https://youtu.be/_uKO-ZqBMWQ.
in Minecraft.” Our approach used the available human demonstration data and additional human
feedback to train machine learning modules that were combined with engineered ones to solve
hierarchical tasks in Minecraft.</p>
      <p>The proposed method was compared to both end-to-end machine learning and pure
engineered solutions by collecting human evaluations that judged agents in head-to-head matches
to answer which agent best solved the task, which agent was the fastest, and which one had the
most human-like behavior. These human evaluations were converted to a skill rating score for
each question, similar to how players are ranked in multiplayer online games.</p>
      <p>After collecting 268 human evaluations, we showed that hybrid intelligence approaches
outperformed end-to-end machine learning approaches in all 12 performance metrics computed,
even outperforming human players in 4 of them. Our results also showed that incorporating
machine learning modules for navigation as opposed to engineering navigation policies led to
higher scores in 8 out of 12 performance metrics.</p>
      <p>Overall, we demonstrated that hybrid intelligence approaches are viable solutions to solve
hierarchical tasks when the subcomponents of the task are understood by human experts and
limited human feedback data is available.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>Research was sponsored by the Army Research Laboratory and was accomplished partly under
Cooperative Agreement Number W911NF-20-2-0114. The views and conclusions contained in
this document are those of the authors and should not be interpreted as representing the oficial
policies, either expressed or implied, of the Army Research Laboratory or the U.S. Government.
The U.S. Government is authorized to reproduce and distribute reprints for Government purposes
notwithstanding any copyright notation herein.</p>
    </sec>
    <sec id="sec-8">
      <title>A. State Classifier Labeling GUI</title>
      <p>The labeling process of relevant states to the state-machine uses both mouse clicks and
keyboard presses and takes place in a custom GUI, as seen in Figure 4. On the top left of the
GUI, users can double-check which dataset and frame number they are labeling. Below that,
the GUI displays the RGB frame to be labeled (center left) and the options for labels (center
right, same labels for all tasks). To label a frame, the user can simply press the keyboard key
corresponding to the desired label (shown in brackets, for example, [] for ℎ_), or click
in the white circles in front of the label, which will then turn green, indicating that the label
was selected. Frames will automatically advance when a key is pressed. If the users only use
the mouse to select the labels, they will istill need to press the keyboard key to advance to the
next frame (any key for a label that was already selected clicking).</p>
    </sec>
    <sec id="sec-9">
      <title>B. State-Machine Definition for each Task</title>
      <p>The sequence of subtasks used by the state-machine for each task is defined as follows:
• FindCave:
• MakeWaterfall:
1. Use navigation policy to traverse the environment and search for caves;
2. If the state classifier detects the agent is inside a cave, throw a snowball to signal
that the task was completed (end of episode).
1. Use navigation policy to traverse the environment and search for a place in the
mountains to make a waterfall;
2. If the state classifier detects the agent is at the top of a mountain, build additional
blocks to give additional height to the waterfall;
3. Once additional blocks are built, look down and place the waterfall by equipping
and using the bucket item filled with water;
4. After the waterfall is built, keep moving forward to move away from it;
5. Once the agent has moved away from the waterfall, turn around and throw a
snowball to signal that a picture was taken, and the task was completed (end of
episode).
• CreateVillageAnimalPen:
• BuildVillageHouse:
1. Use navigation policy to traverse the environment and search for a place to build a
house;
2. If the state classifier detects an open-space, build the house. The subtask to build
the house directly repeats the actions taken by a human while building the house,
as observed in provided demonstration dataset;
3. Once the house is built, move away from it, turn around and throw a snowball to
signal that the task was completed (end of episode).</p>
    </sec>
    <sec id="sec-10">
      <title>C. Human Evaluation Interface</title>
      <p>Figure 5 shows a sample of the web evaluation form available at https://kairosminerl.
herokuapp.com/ that was used to collect human evaluations for each of the four baselines
in a head-to-head comparison, similar to how the teams were evaluated during the oficial
MineRL BASALT competition. Each participant was asked to see two videos of diferent agents
performing the same task then answer three questions with respect to the agent’s performance.
D. TrueSkillTM Score per Match
(c) More Human-like Behavior</p>
      <p>(a) Best Performer
(b) Fastest Performer
(c) More Human-like Behavior</p>
    </sec>
    <sec id="sec-11">
      <title>E. Pairwise Comparison per Performance Metric and Task</title>
      <p>Figures 10, 11, 12, and 13 show bar plots with the individual pairwise comparisons compiled
from the human evaluations for the FindCave, MakeWaterfall, CreateVillageAnimalPen, and</p>
      <p>(a) Best Performer
(b) Fastest Performer
(c) More Human-like Behavior</p>
      <p>BuildVillageHouse tasks, respectively. Each bar represents the percentage of the time a given
condition was selected as a winner for each performance metric by the human evaluator when
they were presented with a video of the agent performance solving the task for each analysed
condition. For example, when analyzing Figure 10(a), we can see that the human evaluator was
presented with a video of the “Behavior Cloning” agent and another from the “Engineered” agent,
they selected the “Engineered” agent as the best performer 33.3% and the “Behavior Cloning”
agent 22.2% of the time. The remaining accounts for the “None” answer to the questionnaire
selected when none of the agents were judged to have solved the task.</p>
      <p>When directly comparing the “Behavior Cloning” baseline to the main proposed “Hybrid”
method for all tasks, as shown in Figures 10, 11, 12, and 13 (c) plots, we observe that the
proposed hybrid intelligence agent always match or outperforms the pure learned baseline.
This is similar to the case we compare the “Engineered” agent to the “Hybrid” agent, where
the proposed hybrid method outperforms the fully engineered approach in all tasks except
the BuildVillageHouse task, as seen in Figure 13. The human players always outperform the
hybrid agent with exception to the MakeWaterfall task, where the “Hybrid” agent is judged to
better solve the task 70% of the time, to solve it faster 90% of the time, and even present a more
human-like behavior 60% of the time. The “Hybrid” agent performing better can be attributed
to the fact that the human players were not always able or willing to solve the task as described
(d) Engineered vs Hybrid
(e) Human vs Engineered
(f) Human vs Hybrid</p>
    </sec>
    <sec id="sec-12">
      <title>F. Samples of Hybrid Agent Solving the Tasks</title>
      <p>In terms of qualitative results, Figures 14, 15, 16, and 17 show a sample episode illustrated by a
sequence of frames of our hybrid agent solving the FindCave, MakeWaterfall,
CreateVillageAnimalPen, and BuildVillageHouse tasks, respectively. Each figure shows the image frames received
by the agent (left panel) overlaid with the actions taken (top), output of the state classifier
(center), and the subtask currently being followed (bottom). The right panel shows the estimated
odometry map overlaid with the location of the relevant states identified by the state classifier.
Link to the videos are provided in the figure captions.
(d) Engineered vs Hybrid
(e) Human vs Engineered
(f) Human vs Hybrid</p>
      <p>(a) BC vs Engineered
(b) BC vs Human
(c) BC vs Hybrid
(d) Engineered vs Hybrid
(e) Human vs Engineered
(f) Human vs Hybrid
(d) Engineered vs Hybrid
(e) Human vs Engineered
(f) Human vs Hybrid</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Johnson</surname>
          </string-name>
          , K. Hofmann,
          <string-name>
            <given-names>T.</given-names>
            <surname>Hutton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bignell</surname>
          </string-name>
          ,
          <article-title>The Malmo platform for artificial intelligence experimentation</article-title>
          ,
          <source>in: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI'16</source>
          , AAAI Press,
          <year>2016</year>
          , p.
          <fpage>4246</fpage>
          -
          <lpage>4247</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>W. H.</given-names>
            <surname>Guss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Codel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Hofmann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Houghton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kuno</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Milani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mohanty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. P.</given-names>
            <surname>Liebana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Topin</surname>
          </string-name>
          , et al.,
          <article-title>The MineRL competition on sample eficient reinforcement learning using human priors</article-title>
          ,
          <source>NeurIPS Competition Track</source>
          (
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bojarski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. D.</given-names>
            <surname>Testa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dworakowski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Firner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Flepp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L. D.</given-names>
            <surname>Jackel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Monfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            <surname>Muller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Zieba</surname>
          </string-name>
          ,
          <article-title>End to end learning for self-driving cars</article-title>
          ,
          <source>CoRR abs/1604</source>
          .07316 (
          <year>2016</year>
          ). arXiv:
          <volume>1604</volume>
          .
          <fpage>07316</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>A.</given-names>
            <surname>Nair</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Agrawal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Isola</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Abbeel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Malik</surname>
          </string-name>
          , S. Levine,
          <article-title>Combining selfsupervised learning and imitation for vision-based rope manipulation</article-title>
          ,
          <source>in: 2017 IEEE International Conference on Robotics and Automation (ICRA)</source>
          , IEEE,
          <year>2017</year>
          , pp.
          <fpage>2146</fpage>
          -
          <lpage>2153</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Kamar</surname>
          </string-name>
          ,
          <article-title>Directions in hybrid intelligence: Complementing AI systems with human intelligence</article-title>
          ., in: IJCAI,
          <year>2016</year>
          , pp.
          <fpage>4070</fpage>
          -
          <lpage>4073</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>D.</given-names>
            <surname>Dellermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Ebel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Söllner</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Leimeister</surname>
          </string-name>
          , Hybrid intelligence,
          <source>Business &amp; Information Systems Engineering</source>
          <volume>61</volume>
          (
          <year>2019</year>
          )
          <fpage>637</fpage>
          -
          <lpage>643</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mnih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Graves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I.</given-names>
            <surname>Antonoglou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wierstra</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. A.</given-names>
            <surname>Riedmiller</surname>
          </string-name>
          ,
          <article-title>Playing Atari with deep reinforcement learning</article-title>
          ,
          <source>CoRR abs/1312</source>
          .5602 (
          <year>2013</year>
          ). arXiv:
          <volume>1312</volume>
          .
          <fpage>5602</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Mnih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. P.</given-names>
            <surname>Badia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Mirza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Graves</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Harley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T. P.</given-names>
            <surname>Lillicrap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <article-title>Asynchronous methods for deep reinforcement learning</article-title>
          ,
          <source>in: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML'16</source>
          , JMLR.org,
          <year>2016</year>
          , p.
          <fpage>1928</fpage>
          -
          <lpage>1937</lpage>
          . doi:
          <volume>10</volume>
          .5555/3045390.3045594.
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>P.</given-names>
            <surname>Dayan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. E.</given-names>
            <surname>Hinton</surname>
          </string-name>
          ,
          <article-title>Feudal reinforcement learning</article-title>
          , in: S. Hanson, J. Cowan,
          <string-name>
            <surname>C.</surname>
          </string-name>
          Giles (Eds.),
          <source>Advances in Neural Information Processing Systems</source>
          , volume
          <volume>5</volume>
          , Morgan-Kaufmann,
          <year>1993</year>
          . URL: https://proceedings.neurips.cc/paper/1992/file/ d14220ee66aeec73c49038385428ec4c-Paper.pdf.
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>A. S.</given-names>
            <surname>Vezhnevets</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Osindero</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Schaul</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Heess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jaderberg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <article-title>Feudal networks for hierarchical reinforcement learning</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2017</year>
          , pp.
          <fpage>3540</fpage>
          -
          <lpage>3549</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Espeholt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Soyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Munos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Simonyan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mnih</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Ward</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Doron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Firoiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Harley</surname>
          </string-name>
          , I. Dunning,
          <string-name>
            <given-names>S.</given-names>
            <surname>Legg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kavukcuoglu</surname>
          </string-name>
          ,
          <article-title>IMPALA: Scalable Distributed DeepRL with Importance Weighted Actor-Learner Architectures</article-title>
          , volume
          <volume>80</volume>
          <source>of Proceedings of Machine Learning Research</source>
          , PMLR, Stockholmsmässan, Stockholm Sweden,
          <year>2018</year>
          , pp.
          <fpage>1407</fpage>
          -
          <lpage>1416</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>N.</given-names>
            <surname>Rudin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Hoeller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Reist</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hutter</surname>
          </string-name>
          ,
          <article-title>Learning to walk in minutes using massively parallel deep reinforcement learning</article-title>
          ,
          <source>arXiv preprint arXiv:2109.11978</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>D.</given-names>
            <surname>Watkins-Valls</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Xu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Waytowich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Allen</surname>
          </string-name>
          ,
          <article-title>Learning your way without map or compass: Panoramic target driven visual navigation</article-title>
          ,
          <year>2020</year>
          , pp.
          <fpage>5816</fpage>
          -
          <lpage>5823</lpage>
          . doi:
          <volume>10</volume>
          .1109/ IROS45743.
          <year>2020</year>
          .
          <volume>9341511</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Waytowich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. G.</given-names>
            <surname>Goecks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. J.</given-names>
            <surname>Lawhern</surname>
          </string-name>
          ,
          <article-title>Cycle-of-learning for autonomous systems from human interaction</article-title>
          , CoRR abs/
          <year>1808</year>
          .09572 (
          <year>2018</year>
          ). arXiv:
          <year>1808</year>
          .09572.
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>V. G.</given-names>
            <surname>Goecks</surname>
          </string-name>
          ,
          <article-title>Human-in-the-loop methods for data-driven and reinforcement learning systems</article-title>
          , arXiv preprint arXiv:
          <year>2008</year>
          .
          <volume>13221</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>D. A.</given-names>
            <surname>Pomerleau</surname>
          </string-name>
          ,
          <string-name>
            <surname>ALVINN:</surname>
          </string-name>
          <article-title>An Autonomous Land Vehicle in a Neural Network</article-title>
          ,
          <source>in: Advances in Neural Information Processing Systems</source>
          <volume>1</volume>
          , Morgan Kaufmann Publishers Inc., San Francisco, CA, USA,
          <year>1989</year>
          , p.
          <fpage>305</fpage>
          -
          <lpage>313</lpage>
          . doi:
          <volume>10</volume>
          .5555/89851.89891.
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Argall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Chernova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Veloso</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Browning</surname>
          </string-name>
          ,
          <article-title>A survey of robot learning from demonstration</article-title>
          ,
          <source>Robot. Auton. Syst</source>
          .
          <volume>57</volume>
          (
          <year>2009</year>
          )
          <fpage>469</fpage>
          -
          <lpage>483</lpage>
          . doi:
          <volume>10</volume>
          .1016/j.robot.
          <year>2008</year>
          .
          <volume>10</volume>
          . 024.
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>D.</given-names>
            <surname>Brown</surname>
          </string-name>
          , W. Goo,
          <string-name>
            <given-names>P.</given-names>
            <surname>Nagarajan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Niekum</surname>
          </string-name>
          ,
          <article-title>Extrapolating beyond suboptimal demonstrations via inverse reinforcement learning from observations</article-title>
          ,
          <source>in: International Conference on Machine Learning, PMLR</source>
          ,
          <year>2019</year>
          , pp.
          <fpage>783</fpage>
          -
          <lpage>792</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>R.</given-names>
            <surname>Rahmatizadeh</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Abolghasemi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Bölöni</surname>
          </string-name>
          ,
          <article-title>Learning manipulation trajectories using recurrent neural networks</article-title>
          ,
          <source>CoRR abs/1603</source>
          .03833 (
          <year>2016</year>
          ). arXiv:
          <volume>1603</volume>
          .
          <fpage>03833</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <given-names>B.</given-names>
            <surname>Eysenbach</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Levine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Salakhutdinov</surname>
          </string-name>
          ,
          <article-title>Replacing rewards with examples: Examplebased policy search via recursive classification</article-title>
          ,
          <source>arXiv preprint arXiv:2103.12656</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>B.</given-names>
            <surname>Akgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cakmak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Thomaz</surname>
          </string-name>
          ,
          <article-title>Keyframe-based learning from demonstration</article-title>
          ,
          <source>International Journal of Social Robotics</source>
          <volume>4</volume>
          (
          <year>2012</year>
          )
          <fpage>343</fpage>
          -
          <lpage>355</lpage>
          . doi:
          <volume>10</volume>
          .1007/ s12369-012-0160-0.
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>B.</given-names>
            <surname>Akgun</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Cakmak</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. W.</given-names>
            <surname>Yoo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. L.</given-names>
            <surname>Thomaz</surname>
          </string-name>
          ,
          <article-title>Trajectories and keyframes for kinesthetic teaching: A human-robot interaction perspective</article-title>
          ,
          <source>in: 2012 7th ACM/IEEE International Conference on Human-Robot Interaction (HRI)</source>
          ,
          <year>2012</year>
          , pp.
          <fpage>391</fpage>
          -
          <lpage>398</lpage>
          . doi:
          <volume>10</volume>
          .1145/2157689. 2157815.
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>W.</given-names>
            <surname>Saunders</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sastry</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Stuhlmüller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Evans</surname>
          </string-name>
          ,
          <article-title>Trial without error: Towards safe reinforcement learning via human intervention</article-title>
          ,
          <source>in: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems</source>
          , AAMAS '18,
          <string-name>
            <surname>International</surname>
            <given-names>Foundation</given-names>
          </string-name>
          <source>for Autonomous Agents and Multiagent Systems</source>
          , Richland,
          <string-name>
            <surname>SC</surname>
          </string-name>
          ,
          <year>2018</year>
          , p.
          <fpage>2067</fpage>
          -
          <lpage>2069</lpage>
          . doi:
          <volume>10</volume>
          .5555/3237383.3238074.
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>V. G.</given-names>
            <surname>Goecks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Gremillion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. J.</given-names>
            <surname>Lawhern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Valasek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Waytowich</surname>
          </string-name>
          ,
          <article-title>Eficiently combining human demonstrations and interventions for safe training of autonomous systems in real-time</article-title>
          ,
          <source>in: Proceedings of the AAAI Conference on Artificial Intelligence</source>
          , AAAI Press,
          <year>2019</year>
          , pp.
          <fpage>2462</fpage>
          -
          <lpage>2470</lpage>
          . doi:
          <volume>10</volume>
          .1609/aaai.v33i01.
          <fpage>33012462</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Gordon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Bagnell</surname>
          </string-name>
          ,
          <article-title>A reduction of imitation learning and structured prediction to no-regret online learning</article-title>
          , volume
          <volume>15</volume>
          <source>of Proceedings of Machine Learning Research, JMLR Workshop and Conference Proceedings</source>
          , Fort Lauderdale, FL, USA,
          <year>2011</year>
          , pp.
          <fpage>627</fpage>
          -
          <lpage>635</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>S.</given-names>
            <surname>Ross</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Melik-Barkhudarov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K. S.</given-names>
            <surname>Shankar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Wendel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dey</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Bagnell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Hebert</surname>
          </string-name>
          ,
          <article-title>Learning monocular reactive UAV control in cluttered natural environments</article-title>
          ,
          <source>in: 2013 IEEE International Conference on Robotics and Automation</source>
          ,
          <year>2013</year>
          , pp.
          <fpage>1765</fpage>
          -
          <lpage>1772</lpage>
          . doi:
          <volume>10</volume>
          . 1109/ICRA.
          <year>2013</year>
          .
          <volume>6630809</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>A. Y.</given-names>
            <surname>Ng</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. J.</given-names>
            <surname>Russell</surname>
          </string-name>
          ,
          <article-title>Algorithms for inverse reinforcement learning</article-title>
          ,
          <source>in: Proceedings of the Seventeenth International Conference on Machine Learning</source>
          , ICML '
          <fpage>00</fpage>
          , Morgan Kaufmann Publishers Inc., San Francisco, CA, USA,
          <year>2000</year>
          , p.
          <fpage>663</fpage>
          -
          <lpage>670</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          [28]
          <string-name>
            <given-names>C.</given-names>
            <surname>Finn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Levine</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Abbeel</surname>
          </string-name>
          ,
          <article-title>Guided cost learning: Deep inverse optimal control via policy optimization</article-title>
          ,
          <source>in: Proceedings of the 33rd International Conference on International Conference on Machine Learning - Volume 48, ICML'16</source>
          , JMLR.org,
          <year>2016</year>
          , p.
          <fpage>49</fpage>
          -
          <lpage>58</lpage>
          . doi:
          <volume>10</volume>
          . 5555/3045390.3045397.
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          [29]
          <string-name>
            <given-names>W. B.</given-names>
            <surname>Knox</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <article-title>Interactively shaping agents via human reinforcement: The TAMER framework</article-title>
          ,
          <source>in: Proceedings of the Fifth International Conference on Knowledge Capture, K-CAP '09</source>
          ,
          <string-name>
            <surname>Association</surname>
          </string-name>
          for Computing Machinery, New York, NY, USA,
          <year>2009</year>
          , p.
          <fpage>9</fpage>
          -
          <lpage>16</lpage>
          . doi:
          <volume>10</volume>
          .1145/1597735.1597738.
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          [30]
          <string-name>
            <surname>J. MacGlashan</surname>
          </string-name>
          ,
          <string-name>
            <surname>M. K. Ho</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Loftin</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          <string-name>
            <surname>Peng</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>D. L.</given-names>
          </string-name>
          <string-name>
            <surname>Roberts</surname>
            ,
            <given-names>M. E.</given-names>
          </string-name>
          <string-name>
            <surname>Taylor</surname>
          </string-name>
          , M. L.
          <string-name>
            <surname>Littman</surname>
          </string-name>
          ,
          <article-title>Interactive learning from policy-dependent human feedback</article-title>
          ,
          <source>in: Proceedings of the 34th International Conference on Machine Learning - Volume 70, ICML'17</source>
          , JMLR.org,
          <year>2017</year>
          , p.
          <fpage>2285</fpage>
          -
          <lpage>2294</lpage>
          . doi:
          <volume>10</volume>
          .5555/3305890.3305917.
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          [31]
          <string-name>
            <given-names>G.</given-names>
            <surname>Warnell</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Waytowich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Lawhern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <string-name>
            <surname>Deep</surname>
            <given-names>TAMER</given-names>
          </string-name>
          :
          <article-title>Interactive agent shaping in high-dimensional state spaces, in: S. A</article-title>
          .
          <string-name>
            <surname>McIlraith</surname>
            ,
            <given-names>K. Q.</given-names>
          </string-name>
          <string-name>
            <surname>Weinberger</surname>
          </string-name>
          (Eds.),
          <source>Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence</source>
          ,
          <source>(AAAI-18)</source>
          , AAAI Press,
          <year>2018</year>
          , pp.
          <fpage>1545</fpage>
          -
          <lpage>1554</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          [32]
          <string-name>
            <given-names>P. F.</given-names>
            <surname>Christiano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Leike</surname>
          </string-name>
          , T. B.
          <string-name>
            <surname>Brown</surname>
            , M. Martic,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Legg</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Amodei</surname>
          </string-name>
          ,
          <article-title>Deep reinforcement learning from human preferences</article-title>
          ,
          <source>in: Proceedings of the 31st International Conference on Neural Information Processing Systems</source>
          , NIPS'17, Curran Associates Inc.,
          <string-name>
            <surname>Red</surname>
            <given-names>Hook</given-names>
          </string-name>
          ,
          <string-name>
            <surname>NY</surname>
          </string-name>
          , USA,
          <year>2017</year>
          , p.
          <fpage>4302</fpage>
          -
          <lpage>4310</lpage>
          . doi:
          <volume>10</volume>
          .5555/3294996.3295184.
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          [33]
          <string-name>
            <given-names>L.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Small</surname>
          </string-name>
          ,
          <article-title>Inverse reinforcement learning with natural language goals</article-title>
          ,
          <source>Proceedings of the AAAI Conference on Artificial Intelligence</source>
          <volume>35</volume>
          (
          <year>2021</year>
          )
          <fpage>11116</fpage>
          -
          <lpage>11124</lpage>
          . URL: https: //ojs.aaai.org/index.php/AAAI/article/view/17326.
        </mixed-citation>
      </ref>
      <ref id="ref34">
        <mixed-citation>
          [34]
          <string-name>
            <given-names>A.</given-names>
            <surname>Rajeswaran</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Kumar</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          , G. Vezzani,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schulman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Todorov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Levine</surname>
          </string-name>
          ,
          <article-title>Learning complex dexterous manipulation with deep reinforcement learning and demonstrations</article-title>
          ,
          <source>in: Proceedings of Robotics: Science and Systems (RSS)</source>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref35">
        <mixed-citation>
          [35]
          <string-name>
            <given-names>V. G.</given-names>
            <surname>Goecks</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. M.</given-names>
            <surname>Gremillion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V. J.</given-names>
            <surname>Lawhern</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Valasek</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N. R.</given-names>
            <surname>Waytowich</surname>
          </string-name>
          ,
          <article-title>Integrating behavior cloning and reinforcement learning for improved performance in dense and sparse reward environments</article-title>
          ,
          <source>in: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems</source>
          , AAMAS '20,
          <string-name>
            <surname>International</surname>
            <given-names>Foundation</given-names>
          </string-name>
          <source>for Autonomous Agents and Multiagent Systems</source>
          , Richland,
          <string-name>
            <surname>SC</surname>
          </string-name>
          ,
          <year>2020</year>
          , p.
          <fpage>465</fpage>
          -
          <lpage>473</lpage>
          . doi:
          <volume>10</volume>
          . 5555/3398761.3398819.
        </mixed-citation>
      </ref>
      <ref id="ref36">
        <mixed-citation>
          [36]
          <string-name>
            <given-names>S.</given-names>
            <surname>Reddy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A. D.</given-names>
            <surname>Dragan</surname>
          </string-name>
          , S. Levine,
          <article-title>SQIL: imitation learning via reinforcement learning with sparse rewards</article-title>
          ,
          <source>in: 8th International Conference on Learning Representations, ICLR</source>
          <year>2020</year>
          ,
          <string-name>
            <given-names>Addis</given-names>
            <surname>Ababa</surname>
          </string-name>
          , Ethiopia,
          <source>April 26-30</source>
          ,
          <year>2020</year>
          , OpenReview.net,
          <year>2020</year>
          . URL: https: //openreview.net/forum?id=
          <fpage>S1xKd24twB</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref37">
        <mixed-citation>
          [37]
          <string-name>
            <given-names>W. H.</given-names>
            <surname>Guss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Houghton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Topin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Codel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Veloso</surname>
          </string-name>
          , R. Salakhutdinov,
          <article-title>MineRL: A large-scale dataset of Minecraft demonstrations</article-title>
          , Twenty-Eighth
          <source>International Joint Conference on Artificial Intelligence</source>
          (
          <year>2019</year>
          ). URL: http://minerl.io.
        </mixed-citation>
      </ref>
      <ref id="ref38">
        <mixed-citation>
          [38]
          <string-name>
            <given-names>A.</given-names>
            <surname>Amiranashvili</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Dorka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Burgard</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Koltun</surname>
          </string-name>
          , T. Brox,
          <article-title>Scaling imitation learning in Minecraft</article-title>
          , arXiv preprint arXiv:
          <year>2007</year>
          .
          <volume>02701</volume>
          (
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref39">
        <mixed-citation>
          [39]
          <string-name>
            <given-names>Z.</given-names>
            <surname>Hao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Mallya</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Belongie</surname>
          </string-name>
          , M.-Y. Liu,
          <article-title>GANcraft: Unsupervised 3D neural rendering of Minecraft worlds</article-title>
          , in: ICCV,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref40">
        <mixed-citation>
          [40]
          <string-name>
            <given-names>R.</given-names>
            <surname>Shah</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Wild</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Alex</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Houghton</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Guss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Mohanty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Kanervisto</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Milani</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Topin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Abbeel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Russell</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Dragan,
          <article-title>NeurIPS 2021 competition proposal: The MineRL BASALT competition on learning from human feedback</article-title>
          ,
          <source>NeurIPS Competition Track</source>
          (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref41">
        <mixed-citation>
          [41]
          <string-name>
            <given-names>T.</given-names>
            <surname>Lillicrap</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Hunt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Pritzel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Heess</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Erez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Tassa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Silver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Wierstra</surname>
          </string-name>
          ,
          <article-title>Continuous control with deep reinforcement learning</article-title>
          ,
          <source>CoRR abs/1509</source>
          .02971 (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref42">
        <mixed-citation>
          [42]
          <string-name>
            <given-names>J.</given-names>
            <surname>Ho</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ermon</surname>
          </string-name>
          ,
          <article-title>Generative adversarial imitation learning</article-title>
          ,
          <source>Advances in neural information processing systems</source>
          <volume>29</volume>
          (
          <year>2016</year>
          )
          <fpage>4565</fpage>
          -
          <lpage>4573</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref43">
        <mixed-citation>
          [43]
          <string-name>
            <given-names>J.</given-names>
            <surname>Redmon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Divvala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Girshick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Farhadi</surname>
          </string-name>
          ,
          <article-title>You only look once: Unified, real-time object detection</article-title>
          ,
          <source>in: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)</source>
          ,
          <year>2016</year>
          , pp.
          <fpage>779</fpage>
          -
          <lpage>788</lpage>
          . doi:
          <volume>10</volume>
          .1109/CVPR.
          <year>2016</year>
          .
          <volume>91</volume>
          .
        </mixed-citation>
      </ref>
      <ref id="ref44">
        <mixed-citation>
          [44]
          <string-name>
            <given-names>A.</given-names>
            <surname>Giusti</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Guzzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. C.</given-names>
            <surname>Cireşan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.-L.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. P.</given-names>
            <surname>Rodríguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Fontana</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Faessler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Forster</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schmidhuber</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G. Di</given-names>
            <surname>Caro</surname>
          </string-name>
          , et al.,
          <article-title>A machine learning approach to visual perception of forest trails for mobile robots</article-title>
          ,
          <source>IEEE Robotics and Automation Letters</source>
          <volume>1</volume>
          (
          <year>2015</year>
          )
          <fpage>661</fpage>
          -
          <lpage>667</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref45">
        <mixed-citation>
          [45]
          <string-name>
            <given-names>R.</given-names>
            <surname>Herbrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Minka</surname>
          </string-name>
          , T. Graepel, Trueskill™:
          <article-title>A Bayesian skill rating system</article-title>
          ,
          <source>in: Proceedings of the 19th International Conference on Neural Information Processing Systems</source>
          ,
          <year>2006</year>
          , pp.
          <fpage>569</fpage>
          -
          <lpage>576</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>