The Chef's Hat Simulation Environment for Reinforcement-Learning-Based Agents

03/12/2020 ∙ by Pablo Barros, et al. ∙ Istituto Italiano di Tecnologia 0

To achieve social interactions within Human-Robot Interaction (HRI) environments is a very challenging task. Most of the current research focuses on Wizard-of-Oz approaches, which neglect the recent development of intelligent robots. On the other hand, real-world scenarios usually do not provide the necessary control and reproducibility which are needed for learning algorithms. In this paper, we propose a virtual simulation environment that implements the Chef's Hat card game, designed to be used in HRI scenarios, to provide a controllable and reproducible scenario for reinforcement-learning algorithms.



There are no comments yet.


page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Modeling the action-perception cycle within social robots, as a continuous adaptation mechanism, is one of the most important, and challenging, goals of human-robot interaction [5]. Most of the social tasks robots are expected to perform in the near future demand not only the perception of human traits but also the understanding of such traits in a given context through the modulation of decision-making [15].

In particular, the development of recent cognitive architectures to deal with social interactions became of great interest in recent years [7, 18]. As affect is present in most human-human and also human-robot interactions, most of the social cognitive architectures involve or take into consideration affective content. To assess how others feel while we interact with them gives us important context on the situation we are in, but also on the appropriateness of our own actions [12]. Taking this information as part of our decision-making, allow us to adapt properly to perceiving and understanding others, to improve the engagement and effectiveness of the interaction, and to guarantee that a certain message is passed through our actions. Such characteristics are extremely important when designing and developing robots for health-care, tutoring and even as specific companions.

A common problem, however, arises when developing intelligent social robots based on human interaction. To design, evaluate and to validate such systems is a computationally expensive task. You need different persons, behaving in a different manner and in different situations, and usually, this scenario is not reproducible which increases the number of variables a researcher has to validate in order to derive grounded claims. Due to this limitation, most of the current solutions for social cognitive architectures in robots are based on interaction strategies focused on contagion [21]

, by repeating what was perceived or relied upon simple decision trees for generating behavior


Such solutions are suited for the simple interaction scenarios in which they were deployed. The limitation on designing, implementing and deploying realistic interaction scenarios, in particular where affect plays a role, is one of the problems that must be solved before the deployment of such robots in real life. In a previous attempt without using a robot, a game specially designed to provoke to favor one and disfavor another player in a multiplayer interaction was shown to provoke emotions [1], which lasted during the repetitive games between the same players [8]. Adding a robot to such a scenario, however, would demand an incredible powerful simulation environment, or several rounds of real-life experiments in order to collect enough real-world data to adapt learning algorithms.

A common solution for such cases is the use of simulated environments [4]. With the recent development of reinforcement learning algorithms, the construction and design of complex simulation environments flourished. Such environments allow fast-paced simulations of different tasks, the calculation of specific step-reward functions and are the basis for the recent groundbreaking applications of deep reinforcement learning. Most of these scenarios, however, are not developed with HRI in mind. Most of them simulate situations which are based on single agents [17], classic reinforcement learning problems [6], robotic simulations [23], or, more recently, playing video games [19].

To address the problem of providing a standard and easily reproducible affective interaction scenario for HRI, we recently developed and validated a novel card game [2]. The game, named Chef’s Hat, was designed with specific HRI requirements in mind, which allows it to be followed and modeled by artificial agents with ease. Also, the game mechanics were designed to evoke different affective interactions within the game, which can be easily perceived and displayed by a robot. Furthermore, the game elements were design to facilitate the extraction of the game state through the use of QR-codes and specific turn taking actions, which do not break the game flow.

To continue our efforts to facilitate the development of a reproducible affective action-perception cycle, we propose here a novel simulation environment, based on the OpenAI Gym toolkit [4], for the Chef’s Hat card game. The simulation environment encapsulates all the complex rules and mechanics of the game and allows the training of multiple artificial agents as players. With it, we can simulate group dynamics with easy by the implementation of specific types of agents.

The entire environment is portable and is freely available, to facilitate its dissemination. Besides training and evaluating artificial agents, the environment also can store different gameplays, to generate learning datasets used by the agents. It also can load specific gameplays and customize different agents with real-world experiences so as to have a controlled environment for focused experiments. It can also render played games, providing the necessary information for human-level analysis.

In this paper we formally describe the functioning of the environment, following all the game mechanics. We also present a set of baseline experiments to both demonstrate the environment but also to validate the capability of the environment to simulate the Chef’s Hat card game. Our experiments involve the development and training of virtual agents, based on Deep Q-learning [22], and the analysis of how these agents behave while learning how to play the game.

Ii Chef’s Hat Simulation Environment

Our HRI scenario is based on a card game played by four players. The card game scenario was chosen as our action-perception cycle development environment as it is a controllable situation, where each player has its turn to take specific actions, and yet provides the ground for natural interaction between the players. Within this scope, we needed a game that allowed the players to develop strategies while playing, and that, within the game mechanics, evoke the display of different affective states. Also, the evolution of the affective behavior of the players through the game should influence their strategy and decisions.

Fig. 1: Illustration of the Chefs Hat card game been played by three humans and a robot.

In this regard, we recently developed and validate the Chef’s Hat card game [2], illustrated in Figure 1. It includes complex game mechanics that were modeled in its entirety in our Gym environment [4]. Below, we describe the game mechanics and the details of the environment functionalities.

Ii-a Embedded Chef’s Hat Mechanics

The development of the Chef’s Hat mechanics followed two main principles: 1) To provide restricted, but natural interaction, where affective behavior naturally arises; 2) to provide turn-taking, i.e. an organized structure, in which a robot, such as the iCub [14], has a supportive infrastructure and capacity to process incoming information and generate behavior without breaking the fluidity of the interaction.

The game simulates a kitchen, and it has a role-based hierarchy: each player can either be a Chef, a Sous-Chef, a Waiter, or a Dishwasher. The players try to be the first to get rid of their ingredient cards and become the Chef. This happens for multiple rounds (or Shifts, each of them detailed in Algorithm 1) until the first player reaches 15 points.

Shuffle the deck;
Deal an equal amount of cards per player;
Exchange roles;
Exchange cards;
if special action is evoked then
       Do special action;
end if
First player discard cards.
while not end of the shift do
       for  each player do
             if player can, and want, to discard then
                   discard cards;
             end if
            if All players passed then
                   Clean the board;
             end if
            if All players finished then
                   End of shift.
             end if
       end for
end while
Algorithm 1 The playing flow of one Shift of the Chef’s hat card game.

As exhibited above, during every Shift there are three phases: Start of the Shift, Making Pizzas, End of the Shift.

At the start of the Shift, the cards are shuffled and dealt with the players. Then, the exchange of roles starts based on the previous Shift end positions. Who finished first becomes the Chef, who finishes second become the Sous-Chef, third the Waiter and fourth the Dishwasher. Once the roles are exchanged, the exchange of the cards starts. The Dishwasher has to give the two cards with the highest values to the Chef, who in return gives back two cards of their liking. The Waiter has to give their lowest valued card to the Sous-Chef, who in return gives one card of their liking. The change of roles is extremely necessary to change the game balance, rewarding the players who finished first in the last Shift and encouraging them to win the next one.

Once all the roles are finished, the players have the chance to do a special action. If a player has two jokers at the start of the Shift in its hand, they can choose to play their special action: in case of the Dishwasher this is ”Food Fight” (the hierarchy is inverted), in case of the other roles it is ”Dinner is served” (there will be no card exchange during that the Shift).

Then, the making of the pizzas starts. The person who possesses a Golden 11 card may start making the first pizza of the Shift. A pizza is prepared when ingredient cards are played on the pizza base on the playing field. A pizza is done when no one can (or wants to) put on any ingredients anymore. The rarest cards have the lowest numbers. A player can play cards by laying down their ingredient cards on the pizza base. To play cards, they need to be rarer (i.e. lowest face values) than the previously played cards. The ingredients are played from highest to the lowest number, so from 11 to 1. Players can play multiple copies of an ingredient at once, but always have to play an equal or greater amount of copies than the previous player did. If a player cannot (or does not want) to play, they pass until the next pizza starts. A joke card is also available and when played together with other cards, it assume their value. When played alone, the joker has the highest face value (12).

At the end of the Shift, the new roles are distributed among the players according to the order of finishing, and every player gets the number of points related to their role. The Chef gets 5 points, the Sous-Chef gets 3 points, the Waiter gets 1 point and the Dishwasher gets 0 points. The game continues until one of the players reaches 15 points.

The ingredient cards, illustrated in Figure 2, needed to be easily recognizable, by the players and the robot, both when played on the playing field and when exchanged among players at the start of the Shift. For this, QR- codes were chosen, as they are hard for humans to recognize or memorize, but easy for the robot to read. Also, the QR-codes allow that a camera placed on top of the playing field capture the game-state and save it. This is extremely important when creating a learning database to be used together with the virtual environment.

Fig. 2: Ingredient cards, and the Joker, with their corresponding face number. The lower the number, the rarer the card.

The cards are to be placed on the playing field, illustrated in Figure 3. To guarantee that the players lay down the cards without stacking them, and hindering them to be recognized by automatic systems, we redesigned the playing field to have 11 different marked places in which players could place their cards on the pizza.

Fig. 3: Playing field where the cards are placed, representing a pizza board.

Ii-B OpenAI Gym Environment

OpenAI Gym [4] is a very popular toolkit that facilitates the development and the dissemination of simulation environments for training reinforcement learning agents. It enables the creation of standardized environments that allow the establishment of a set of specific rules for a simulation, the calculation of varied types of rewards and the logging and visualization of training artificial agents. Recently, several simulation environments were released using the OpenAI gym, which facilitates its reproducible and evaluation with different reinforcement learning algorithms.

We ported the Chef’s Hat game into the OpenAI Gym and implemented all the complex game rules and mechanics. The environment is freely available111, and we hope that it helps us to standardize the learning of game strategies within our card game, but also to collect and share data for different learning algorithms.

Our environment is composed of a game handler, that deals with all the game mechanics. The game handler initiates the game, deal the cards, maintain all the stateful representations of the deck, the players’ hands, the game field, and the score. It controls the Shifts and the turns, but most importantly the environment controls the actions each player performs.

The environment calculates the current game state by aggregating the current player’s hand and the current cards on the board. Using this standard state representation we can give the learning agents the possibility to learn specific strategies purely based on the cards it holds and the cards which were displayed. Of course, as the environment is fully customizable, the current game state can be composed of any other variable which might help the agent to success in its task.

Each action taken by an agent is validated based on a look-up-table, created on the fly based on the player’s hand and the cards in the current playing field, to guarantee that a taken action is allowed given the game context. The look-up-table is extremely important as it guarantees that the game rules are maintained.

The actions are calculated based on the number of possibilities of the look-up table. The standard game, with a deck of 121 cards, has a total of 200 possible actions, which encapsulate all the possible moves a player can do: to discard one card of face value 1 represents one move or to discard 3 cards of face value 1 and a joker is another move, while passing is considered another move. Figure 4 illustrates an example of calculated possible actions given a game state. The blue areas mark all the possible action states, while the gray areas mark actions that are not allowed due to the game’s mechanics. We observed that, given this particular game state, this player would only be allowed to perform one of three actions (marked in green), while any other action (marked in red) would be considered as invalid and not carried on.

Fig. 4: Example of possible actions given a certain game state. The columns represent the card face values, and the rows represent the number of cards to be discarded. The letter ”j” represents the presence of a joker. The look-up table is created on the fly, and it marks all the actions which are allowed based on the game mechanics (blue regions) and the ones which are not allowed (the gray regions). For this given game state, the player would be allowed only to perform the actions marked with the green dots.

The environment allows the customization of the game itself. We can easily choose how many players will be playing the game, how many cards a deck can have and how many of the playing agents are to be trained. The agents are also customized and follows a standard implementation protocol. This allows the implementation and deployment of a large variety of agents, from complex learning agents that might take external factors to learn the game strategy (e.g. from an external camera reading a real-game) to naive agents that do specific actions following simple rules.

For each action that an agent performs, the game environment calculates a specific reward. Again, as the environment is fully customizable, the reward calculation can be updated accordingly to the needs of the training agents. For example, giving the highest reward for an agent that performs a valid action - that means, an action which follows the game rules - can be used to train an agent to learn the rules of the game. Later on, this reward can be updated to make the agent learn how to win the game.

Another aspect of our environment is the logging of actions and states. It allows us to create snapshots of each played game, that can be used to create playing datasets which are extremely helpful for further training intelligent agents. Each step of the game play is recorded in a different set of files and can be retrieved later on with ease.

The stored games can be used by the environment as modulation for specific agents to behave in a particular manner. That allows information obtained from real-world games, collected while real persons are playing it, to be easily inserted in the environment as primitives for the training the agents. The game status of the real games can be obtained via a single camera facing the playing field, and when saved in the same format as the one used by the environment, can be imported and used during the game.

Our environment also allows the rendering of played games. This function creates short videos of each played game, reproducing the actions of all players and the playing field. It is also an important function for a high-level analysis of the strategies taken by the learning agents, and also a simple and effective way to disseminate the learning of the agents. Figure 5 illustrates the rendering of a game 222Full simulation available here:

Fig. 5: Example of the render function of the simulation environment.

Iii Validating the Chef’s Hat Simulation Environment

To validate how our environment implements the entire Chef’s Hat game, and to demonstrate how useful it can be for training artificial agents, and as well to set the initial standardization for future research, we realized two types of experiments: first, we focus on teaching an agent the rules of the game, validating our implementation of the complex game mechanics of the Chef’s Hat card game. Second, we simulate the learning of an agent and teach it how to play the game. This experiment will serve as a demonstration of how to extract important information and agent’s behavior from our environment.

Iii-a Implementing the Artificial Players

We used two different types of agents in our experiments. The first agent runs completely random, without any learning at all. Every time it has to do an action, it chooses a random action which is them validated by the game environment. The random agent allows us to measure the baseline probabilities of the game itself and serves as a naive benchmark when playing against our learning agents.

The second agent presents a learning architecture based on the recent deep Q-learning algorithm [16]

. Q-learning is an off-policy algorithm that learns to optimize a certain set of actions, which are outside the model’s world, based on the quality of a taken action. The quality, Q, represents how useful the taken action is towards the end-goal of the algorithm. Deep Q-learning is an evolution of the standard Q-learning method and introduces two novel aspects: a target model and the experience replay. The target model helps to stabilize the learning of Q by providing a stable Q-estimation over the training. The experience replay stores the agent’s own experience, by saving important steps taken by the agent, to increase the available data for learning state/action pairs. Deep Q-learning was recently applied to teach agents to play complex video games with great success

[10, 11, 13]. In our scenario, Q-learning has an advantage of updating the agent towards winning the game, and not only towards taking single-stepped actions.

The learning agent was optimized using a TPE optimization implemented by the Hyperopt [3]

library. Each of the learning agents implemented a single optimization routine for minimizing its learning loss. We implemented the agent using Keras library

[9], and Table I describes the agent final configuration and parameters.

Layer Neurons Activation Function
Dense layer 128 ReLU
Dense layer 256 ReLU
Dense layer 200 Tanh (output layer)
Training Parameter Value
Batch Size 32
Memory size 2000
discount rate 0.95
exploration decay 0.995
TABLE I: Parameters of the Deep Q-Learning agent used in our experiments.

Iii-B Validation Procedures

Our Experiment 1 focuses on obtaining the fundamental principles of the simulator. We run this experiment only with random players. We are interested on evaluating the impact that each of the game mechanics has on the chances of each random agent winning the game. We run specific games with and without the following mechanics: the presence of the joker, the exchange of cards in the beginning of each round and the presence of the special actions.

Experiment 2 focuses on validating the simulation environment by teaching an agent how to learn the rules of the game. This experiment will demonstrate if the implemented rules allow the agent to reduce the number of invalid actions it takes while playing the game - and thus, learning the rules. This will be done by setting a reward system based on weather a taken action is valid or not. If the taken action is valid, the agent will receive maximal reward, whereas if the taken action is invalid, the agent will receive maximal punishment. We will use one Deep Q-Learning-based agent playing against three random agents, as this will allow us to properly evaluate if the agent is learning anything.

In Experiment 3, we will simulate a full-learning environment to demonstrate how we can collect and evaluate data from our simulation environment. We will use the trained agent from the first experiment an initial step, and we will train them to win the game. In this regard, the rewards will be updated to reflect the finishing position of each player and the number of cards each player has in its hand. By minimizing the number of cards in its hand, the agent learns that discarding cards is important, and combining this with the finishing position will direct the agent to win the game. Table II illustrates the rewards chosen for each action. In this experiment we run the two extreme conditions: one learning agent against three random agents, and four learning agents against each other. This way we can evaluate the effect that an agent has on the learning of another one.

Action Reward
Experiment 2
Valid action 1.0
Invalid action -1
Experiment 3
Valid Action
Finish Game
Invalid action -1
TABLE II: Reward calculation for specific actions taken by the agents in our experiments.

Iii-C Metrics

For each of our experiments, we run 250 games. We then calculate specific metrics for each experiment.

In Experiment 1 we calculate the chances of the player starting the Shift to win that shift, in order to evaluate the impact of each of the observed mechanics. We also calculate the average number of rounds each game takes, to measure how these mechanics affect the games’ length.

For Experiments 2 and 3, in each game, we train the agents and we measure the average reward, the number of wrong actions (actions which are not allowed based on the game rules) per round, and the number of victories for each of the agents. The average reward will indicate us if each agent is learning how to optimize the actions through the game, while the number of wrong actions will indicate if the agent learns how to follow the rules of the game. The number of victories, finally, will indicate us if the agent is learning how to win the games. By measuring these three variables we can clearly see the effectiveness of each of the agents towards specific goals.

Also to evaluate the importance of the game mechanics towards winning the game, we calculated the relationship between starting a Shift and winning that same shift. This indicates how the game mechanics direct the learning of an agent and help us to validate if the chosen rewards allow the agent to win the game.

Iv Validation Results

Iv-a Experiment 1: How each specific game mechanics impact the gameplay?

Running the 250 games allowed us to calculate the impact of each of the observed mechanics. Table III report the final results. We observed that the initial condition, with all the mechanics, has the chance of a player winning the round if it starts the shift at 28%. That means the original game mechanics favor slightly the player starting the round. When removing the joker, and with a stronger effect, the exchange of cards at the beginning of each Shift, we see an increase in the chances of the player starting the round. These results corroborate with what we observed from the real-game [2] and demonstrate the importance of these mechanics. The special actions, although not contributing to the game’s balance, introduced the affective factor within the players’ interaction which is the basis of Chef’s Hat game design.

The absence of the Joker also affected the number of rounds, but this is expected because without the Joker we have less cards in the deck. Removing the exchange cards, however, reduced the amount of rounds, which is mostly connected to the increase of chances of the player starting the Shift to win it. If the starting player always win, the number of rounds necessary to this happen dropped.

Mechanic Start/Winning Shift Rounds
All 28% 35
Without Joker 35% 33
Without Exchange cards 60 % 31
Without Special actions 28% 35
TABLE III: Results of the average chances of a player starting the shift wins the game and number of rounds when removing each of the specific mechanics.

Iv-B Experiment 2: Can an agent learn the rules of the game?

After training one agent for 250 games against three other random agents, we observed an increase on the average reward and a decrease in the absolute number of wrong actions. Figure 6 illustrates the result of training Player 1 with the Deep Q-Learning agent while playing against three other random agents. The absolute wrong actions was almost half of the random agents, while the average reward was 0.5 while the best random agent had an average reward of -0.82. Also, observing the average reward of Player 1, we can see that it has a very high variation when compared to the random agents. This is probably due to Deep Q-Learning exploration mechanism. We observed the reward steadily changing between minimum and maximum over time.

Fig. 6: Wrong actions and average rewards per player for our first experiment, focusing on learning the rules of the game. A learning agent, Player 1, playing the game against three random agents.

While our simulation shows that the agent trained with Deep Q-Learning was able to learn the game rules, it did not improve the amount of victories for Player 1. In our 100 simulations, Player one won 65 of them, while Player 2 won 62, Player 3 won 63 and Player 4 won 60 simulations.

Iv-C Experiment 3: Can an agent learn how to win the game?

We run our third experiment based on two conditions: first, we take the trained agent, Player 1, from Experiment 2 and put it to play against three other random agents. Figure 8 illustrates our results. We observe that the average reward increased drastically and fast for Player 1, which indicates that it learned how to play the game in a fast-pace. Our final victories count show that Player 1 won a total of 215 games, in fact after the 50th game, player one won all the simulations. The reward pattern of Player one over the games display that it took some rounds to learn a winning strategy. Once it learned, around the 50th game, Player one achieve a much higher and steady reward than the other players.

Fig. 7: Average rewards per player for our second experiment, focusing on winning the game. A learning agent, Player 1, playing the game against three random agents.

Our second condition had four trained agents playing against each other. This experiment illustrates how the Deep Q-Learning algorithm can deal with an extremely changing environment. In this experiment we observed that the reward differences between the players was much smaller. Player 1 ended up winning 117 games, while Player 2 won 45, Player 3 won 55 and Player 4 won 33 of the simulations.

Fig. 8: Average rewards per player for our second experiment, focusing on winning the game. Four learning agents playing the game against each other.

Observing the reward plot we can see that Player 1 started with much higher rewards than the others, while Player 2 took more than 100 games to start receiving a higher reward. We observe that Player 1 won more games probably due to his ability to create an early strategy to win, while the others had to adapt their game-style to beat Player one strategy.

We also calculate the correspondence between starting a Shift and winning that same Shift. For the fully random agents, this value was around 30%.

V Discussions

Our experiments serve first as a validation for our Chef’s Hat simulation environment, but also to illustrates the capability of our environment to provide a rich set up for such agents to learn a competitive task. We envision that these results serve as inspiration for developing and applying other learning strategies to our environment. They also helped to respond to our main research question, on how to provide an environment that allows the simulation of a complex group-based competitive action following a real-world task with the same mechanics and rules.

Our first experiment demonstrates that the game mechanics do affect the behavior of the agents. We calculated how the specific mechanics affect the chances of an agent to win the game, which helps to validate that our environment do model the real-world dynamics we found when playing the game with real-persons. Also, our second and third experiment help us to validate how different learning agents can learn the game mechanics, and can learn how to win a game when playing with agents performing random moves. This is important to both confirm that indeed the environment can be used to train such agents, but also to provide initial research on how learning agents behave in our environment.

Although our second experiment showed that the learning agent was not able to produce a full-autonomous behavior without making any invalid action, the third experiment demonstrates that the agent still can learn how to win the game. We expect that a deeper study on the development of the reward function used to train the agents can help us to mitigate this behavior, as an agent that is trained to simulate a real-world robot playing the game cannot make mistake while playing, otherwise it can disrupt the game while playing with other humans.

So far we focused on the game strategy, with the initial aim of enabling an agent to autonomously learn to play and win, purely basing its decisions on the game status. However, the social card game considered was purportedly designed to generate also affective feedback from the players, which is expected to play a relevant role in decision making. The simulation environment has been designed with the possibility to deal with the affective dimension too. For example, combining the game status with affective representation or time taken to do an action, can allow the agent to take into consideration these characteristics when deciding for an action.

As the entire gameplay can be recorded, and easily re-played or incorporated into the agents’ behavior, our environment allows for teaching physical robots to play the game through the run of endless virtual simulations. By having the robot to act as an agent in the simulator will allow it to integrate its real-world sensing capabilities with the environment’s simulations. It can use it to create mental states of a current game or to evaluate novel strategies based on what the robot is currently perceiving. This way, the robot will be able to interact in the social game with human partners, enacting the decisions derived from the simulations and updating them as a function of the responses recorded by the human opponents. This will allow the robot to autonomously select the most appropriate action during the game, potentially both in terms of strategy and movement expressivity.

Vi Conclusion

In this paper, we presented the first version of the novel Chef’s Hat simulation environment. Our environment implements, using the OpenAI Gym toolkit, all the rules and game mechanics of the Chef’s Hat HRI game. The game was designed to allow affective-aware interactions between humans and robots, and our simulation environment is a fundamental step towards allowing the development, evaluation, and dissemination of artificial agents to support social robots.

Our next steps include the inclusion of different learning agents into the environment, as well as the necessary tools to use the environment with human agents. We also envision the adaptation of the environment to receive live-feed data from a robot that is playing the game, such as audio and visual information, to run simulations while it plays the game with other humans.

Already in the current status, our contribution guarantees that the game simulation environment, being openly accessible, could serve as a shared tool for the community to investigate and model affect- and strategy- based human-robot interaction in groups.


  • [1] E. I. Barakova, R. Gorbunov, and M. Rauterberg (2015) Automatic interpretation of affective facial expressions in the context of interpersonal interaction. IEEE transactions on human-machine systems 45 (4), pp. 409–418. Cited by: §I.
  • [2] P. Barros, A. Sciutti, I. M. Hootsmans, L. M. Opheij, R. H. A. Toebosch, and E. Barakova (2020) It’s food fight! introducing the chef’s hat card game for affective-aware hri. External Links: 2002.11458 Cited by: §I, §II, §IV-A.
  • [3] J. Bergstra, D. Yamins, and D. D. Cox (2013)

    Hyperopt: a python library for optimizing the hyperparameters of machine learning algorithms

    In Proceedings of the 12th Python in Science Conference, pp. 13–20. Cited by: §III-A.
  • [4] G. Brockman, V. Cheung, L. Pettersson, J. Schneider, J. Schulman, J. Tang, and W. Zaremba (2016) Openai gym. arXiv preprint arXiv:1606.01540. Cited by: §I, §I, §II-B, §II.
  • [5] M. K. Crossman, A. E. Kazdin, and E. R. Kitt (2018) The influence of a socially assistive robot on mood, anxiety, and arousal in children.. Professional Psychology: Research and Practice 49 (1), pp. 48. Cited by: §I.
  • [6] M. Cullen, B. Davey, K. J. Friston, and R. J. Moran (2018) Active inference in openai gym: a paradigm for computational investigations into psychiatric illness. Biological psychiatry: cognitive neuroscience and neuroimaging 3 (9), pp. 809–818. Cited by: §I.
  • [7] S. Franklin, T. Madl, S. D’mello, and J. Snaider (2013) LIDA: a systems-level architecture for cognition, emotion, and learning. IEEE Transactions on Autonomous Mental Development 6 (1), pp. 19–41. Cited by: §I.
  • [8] R. Gorbunov, E. I. Barakova, and M. Rauterberg (2017) Memory effect in expressed emotions during long term group interactions. In International Work-Conference on the Interplay Between Natural and Artificial Computation, pp. 254–264. Cited by: §I.
  • [9] A. Gulli and S. Pal (2017) Deep learning with keras. Packt Publishing Ltd. Cited by: §III-A.
  • [10] M. Hausknecht and P. Stone (2015) Deep recurrent q-learning for partially observable mdps. In 2015 AAAI Fall Symposium Series, Cited by: §III-A.
  • [11] T. Hester, M. Vecerik, O. Pietquin, M. Lanctot, T. Schaul, B. Piot, D. Horgan, J. Quan, A. Sendonaris, I. Osband, et al. (2018) Deep q-learning from demonstrations. In

    Thirty-Second AAAI Conference on Artificial Intelligence

    Cited by: §III-A.
  • [12] M. Hirokawa, A. Funahashi, Y. Itoh, and K. Suzuki (2018) Adaptive behavior acquisition of a robot based on affective feedback and improvised teleoperation. IEEE Transactions on Cognitive and Developmental Systems. Cited by: §I.
  • [13] W. Meng, Q. Zheng, L. Yang, P. Li, and G. Pan (2019) Qualitative measurements of policy discrepancy for return-based deep q-network.

    IEEE transactions on neural networks and learning systems

    Cited by: §III-A.
  • [14] G. Metta, G. Sandini, D. Vernon, L. Natale, and F. Nori (2008) The icub humanoid robot: an open platform for research in embodied cognition. In Proceedings of the 8th workshop on performance metrics for intelligent systems, pp. 50–56. Cited by: §II-A.
  • [15] G. Sandini, V. Mohan, A. Sciutti, and P. Morasso (2018) Social cognition for human-robot symbiosis—challenges and building blocks. Frontiers in neurorobotics 12, pp. 34. Cited by: §I.
  • [16] J. Schulman, F. Wolski, P. Dhariwal, A. Radford, and O. Klimov (2017) Proximal policy optimization algorithms. arXiv preprint arXiv:1707.06347. Cited by: §III-A.
  • [17] B. Shi, M. G. Ozsoy, N. Hurley, B. Smyth, E. Z. Tragos, J. Geraci, and A. Lawlor (2019) PyRecGym: a reinforcement learning gym for recommender systems. In Proceedings of the 13th ACM Conference on Recommender Systems, pp. 491–495. Cited by: §I.
  • [18] A. Tanevska, F. Rea, G. Sandini, and A. Sciutti (2018) Designing an affective cognitive architecture for human-humanoid interaction. In Companion of the 2018 ACM/IEEE International Conference on Human-Robot Interaction, pp. 253–254. Cited by: §I.
  • [19] R. R. Torrado, P. Bontrager, J. Togelius, J. Liu, and D. Perez-Liebana (2018) Deep reinforcement learning for general video game ai. In 2018 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1–8. Cited by: §I.
  • [20] N. T. V. Tuyen, S. Jeong, and N. Y. Chong (2018) Emotional bodily expressions for culturally competent robots through long term human-robot interaction. In 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 2008–2013. Cited by: §I.
  • [21] G. Van de Perre, H. Cao, A. De Beir, P. G. Esteban, D. Lefeber, and B. Vanderborght (2018) Generic method for generating blended gestures and affective functional behaviors for social robots. Autonomous Robots 42 (3), pp. 569–580. Cited by: §I.
  • [22] H. Van Hasselt, A. Guez, and D. Silver (2016) Deep reinforcement learning with double q-learning. In Thirtieth AAAI conference on artificial intelligence, Cited by: §I.
  • [23] I. Zamora, N. G. Lopez, V. M. Vilches, and A. H. Cordero (2016) Extending the openai gym for robotics: a toolkit for reinforcement learning using ros and gazebo. arXiv preprint arXiv:1608.05742. Cited by: §I.