DOCSLIB.ORG

Deep Reinforcement Learning in Continuous Action Spaces: a Case Study in the Game of Simulated Curling

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Deep Reinforcement Learning in Continuous Action Spaces: a Case Study in the Game of Simulated Curling Deep Reinforcement Learning in Continuous Action Spaces: a Case Study in the Game of Simulated Curling Kyowoon Lee * 1 Sol-A Kim * 1 Jaesik Choi 1 Seong-Whan Lee 2 Abstract 1992), and othello (Buro, 1999). Recently, deep convolu- Many real-world applications of reinforcement tional neural networks (CNNs) (LeCun & Bengio, 1998) learning require an agent to select optimal actions have achieved super-human performance in deterministic from continuous spaces. Recently, deep neural games with perfect information, such as Atari games (Mnih networks have successfully been applied to games et al., 2015) and Go (Silver et al., 2016; 2017). In the latter with discrete actions spaces. However, deep neu- game, board positions are passed through the convolutional ral networks for discrete actions are not suitable layers as a 19-by-19-square image. These CNNs effectively for devising strategies for games where a very reduce the depth and breadth of the search tree by evaluat- small change in an action can dramatically affect ing the positions using a value network and by sampling the outcome. In this paper, we present a new self- actions using a policy network. However, in a continuous play reinforcement learning framework which action space, the space needs to be discretized. Determin- equips a continuous search algorithm which en- istic discretization would cause a strong bias in the policy ables to search in continuous action spaces with evaluation and the policy improvement. Thus, such deep a kernel regression method. Without any hand- CNNs for large, non-convex continuous action spaces are crafted features, our network is trained by super- not directly applicable. vised learning followed by self-play reinforce- To solve this issue, we conduct a policy search with an ef- ment learning with a high-fidelity simulator for ficient stochastic continuous action search on top of policy the Olympic sport of curling. The program trained samples generated from a deep CNN. Our deep CNN still under our framework outperforms existing pro- discretizes the state space and the action space. However, in grams equipped with several hand-crafted features the stochastic continuous action search, we lift the restric- and won an international digital curling competi- tion of the deterministic discretization and conduct a local tion. search procedure in a physical simulator with continuous action samples. In this way, the benefits of both deep neural networks (i.e., learning the global structure) and physical 1. Introduction simulators (i.e., finding precise continuous actions) can be realized. Learning good strategies from large continuous action spaces is important for many real-world problems includ- More specifically, we design a deep CNN called the policy- ing learning robotic manipulations and playing games with value network, which gives the probability distribution of physical objects. In particular, when an autonomous agent actions and expected reward given an input state. The policy- interacts with physical objects, it is often necessary to han- value network is jointly trained to find an optimal policy dle large continuous action spaces. and to estimate the reward given an input instance. During the supervised training, the policy subnetwork is directly Reinforcement learning methods have been extensively ap- learned from the moves of a reference program in each sim- plied to build intelligent agents that can play games such ulated run of games. The value subnetwork is learned using as chess (Campbell et al., 2002), checkers (Schaeffer et al., d-depth simulation and the bootstrapping of the prediction *Equal contribution 1Department of Computer Science and to handle a high variance of a reward obtained from a se- Engineering, Ulsan National Institute of Science and Technology, quence of stochastic moves. The network is then trained Ulsan, Republic of Korea 2Department of Brain and Cognitive further from the games of self-play using kernel regression Engineering, Korea University, Seoul, Republic of Korea. Corre- to precisely handle continuous spaces and actions. This spondence to: Jaesik Choi <[email protected]>. process allows actions in the continuous domain to be ex- Proceedings of the 35 th International Conference on Machine plored and adjusts the policy and the value in consideration Learning, Stockholm, Sweden, PMLR 80, 2018. Copyright 2018 of uncertainty of the execution. by the author(s). Deep Reinforcement Learning in Continuous Action Spaces Figure 1. The architecture of our policy-value network. As input, a feature map (Table2 in the supplementary material) is provided from the state information. During the convolutional operations, the layers’ width and height are fixed at 32x32 (the discretized position of the stones) without pooling. The details of the layer information are provided described in Figure2. We train the policy and the value functions in a unified network. The output of the policy head is the probability distribution of each action. The output of the value head is the probability distribution of the final scores [-8,8]. We verify our framework with the sport of curling. Curling, for the policy and value networks to train the networks often called chess on ice, has been viewed as the most faster. intellectually challenging Olympic sport due to its large In the domain of curling, several algorithms have been pro- action space and complicated strategies. Typically, curling posed. As a way of dealing with continuous action space, players put a stone in a large area of about 5m by 30m, game tree search methods (Yamamoto et al., 2015) have dis- with precise interactions which are typically less than 10 cm cretized continuous action space. The evaluation functions among stones. When discretized, the play area is divided are designed based on the domain knowledge and rules of into a 50x300 grid. Asymmetric uncertainty is added to the the game. With considering given execution uncertainty, the final location to which a stone is delivered. action value is calculated as the average of the neighboring The program trained under our framework outperforms state- values. of-the-art digital curling programs, AyumuGAT’17 (Ohto & A MCTS method called KR-UCT has been successfully Tanaka, 2017) and Jiritsukun’17 (Yamamoto et al., 2015). applied to continuous action space (Yee et al., 2016). KR- Our program also won in the Game AI Tournaments (GAT- UCT exhibits effective selection and expansion of nodes 2018) (Ito). using neighborhood information by estimating rewards with kernel regression (KR) and kernel density estimation (KDE) 2. Related Work in continuous action spaces. Given an action, the upper confidence bound (Lai & Robbins, 1985) of the reward is In the game of go, AlphaGo Lee, the successor version of estimated based on the values nearby. KR-UCT can be AlphaGo Fan (Silver et al., 2016), defeated Lee Sedol, the regarded as a specialized exploration of pseudo-count based winner of 18 international titles. Although Go has a finite, approaches (Bellemare et al., 2016). discrete action space, its depth of the play creates complex branches. Based on the moves of human experts, two neural To handle continuous action space in the bandit problem, networks in AlphaGo Lee are trained for the policy and several algorithms have been proposed. For example, hierar- value functions. AlphaGo Lee uses a Monte Carlo tree chical optimistic optimization (HOO) (Bubeck et al., 2008) search (MCTS) for policy improvement. starts by creating a cover tree and recursively divides the action space into smaller candidate ranges at each depth. A AlphaGo Zero (Silver et al., 2017), which is trained via self- node in the cover tree is considered as arms of the sequential play without any hand-crafted knowledge, has demonstrated bandit problem. The most promising node is exploited to a significant improvement in performance. AlphaGo Zero create estimates of finer granularity, and regions which have is expected to win more than 99.999% of games against not been sampled sufficiently are explored further. AlphaGo Lee.1 AlphaGo Zero uses a unified neural network 1 An analysis of the dynamics of curling is important to build Their difference in elo rating is greater than 2,000. an accurate digital curling program. For example, the fric- Deep Reinforcement Learning in Continuous Action Spaces tion coefficients between the curling stones and the ice curl- POLICY EVALUATION:LEARNING VALUE FUNCTIONS ing sheet have been analyzed (Lozowski et al., 2015), while The value function predicts the outcome from state s of pebbles, the small frozen droplets of water across the play games played using policy p for both players, sheet, have also been taken into account (Maeno, 2014). Unfortunately, modeling the changes in friction on the ice v(s) = E[r(s)jst = s; at ∼ p]: (3) surface is not yet possible. Thus, in general, digital Curling simulators assume a fixed friction coefficient with noise The value function is approximated by the value estimator generated from a predefined function (Ito & Kitasei, 2015; vθ(s) with parameters θ. The value estimator is trained Yee et al., 2016; Ahmad et al., 2016). by state-reward pairs (s; r(s)) using stochastic gradient de- The physical behavior of the stones has been modeled using scent to minimize the mean squared error (MSE) between physics simulation engines such as Box2D (Parberry, 2013), the predicted regression value vθ(s) and the corresponding Unity3D (Jackson, 2015) and Chipmunk 2D. Important pa- outcome r(s), rameters including friction coefficients and noise generation @vθ(s) functions are trained from games between professional play- ∆θ / (r(s) − vθ(s)): (4) ers (Yee et al., 2016; Ito & Kitasei, 2015; Heo & Kim, 2013). @θ In this paper, we use the same parameters used in a digital curling competition (Ito & Kitasei, 2015). 3.2. Monte Carlo Tree Search A Monte Carlo tree search (MCTS) (Browne et al., 2012; 3. Background Coulom, 2007a; Kocsis & Szepesvari´ , 2006) is a tree search algorithm for decision processes for finite-horizon tasks.
Load more

Recommended publications
  • Quantum Reinforcement Learning During Human Decision-Making
    ARTICLES https://doi.org/10.1038/s41562-019-0804-2 Quantum reinforcement learning during human decision-making Ji-An Li 1,2, Daoyi Dong 3, Zhengde Wei1,4, Ying Liu5, Yu Pan6, Franco Nori 7,8 and Xiaochu Zhang 1,9,10,11* Classical reinforcement learning (CRL) has been widely applied in neuroscience and psychology; however, quantum reinforce- ment learning (QRL), which shows superior performance in computer simulations, has never been empirically tested on human decision-making. Moreover, all current successful quantum models for human cognition lack connections to neuroscience. Here we studied whether QRL can properly explain value-based decision-making. We compared 2 QRL and 12 CRL models by using behavioural and functional magnetic resonance imaging data from healthy and cigarette-smoking subjects performing the Iowa Gambling Task. In all groups, the QRL models performed well when compared with the best CRL models and further revealed the representation of quantum-like internal-state-related variables in the medial frontal gyrus in both healthy subjects and smok- ers, suggesting that value-based decision-making can be illustrated by QRL at both the behavioural and neural levels. riginating from early behavioural psychology, reinforce- explained well by quantum probability theory9–16. For example, one ment learning is now a widely used approach in the fields work showed the superiority of a quantum random walk model over Oof machine learning1 and decision psychology2. It typi- classical Markov random walk models for a modified random-dot cally formalizes how one agent (a computer or animal) should take motion direction discrimination task and revealed quantum-like actions in unknown probabilistic environments to maximize its aspects of perceptual decisions12.
    [Show full text]
  • Latest Snapshot.” to Modify an Algo So It Does Produce Multiple Snapshots, find the Following Line (Which Is Present in All of the Algorithms)
    Spinning Up Documentation Release Joshua Achiam Feb 07, 2020 User Documentation 1 Introduction 3 1.1 What This Is...............................................3 1.2 Why We Built This............................................4 1.3 How This Serves Our Mission......................................4 1.4 Code Design Philosophy.........................................5 1.5 Long-Term Support and Support History................................5 2 Installation 7 2.1 Installing Python.............................................8 2.2 Installing OpenMPI...........................................8 2.3 Installing Spinning Up..........................................8 2.4 Check Your Install............................................9 2.5 Installing MuJoCo (Optional)......................................9 3 Algorithms 11 3.1 What’s Included............................................. 11 3.2 Why These Algorithms?......................................... 12 3.3 Code Format............................................... 12 4 Running Experiments 15 4.1 Launching from the Command Line................................... 16 4.2 Launching from Scripts......................................... 20 5 Experiment Outputs 23 5.1 Algorithm Outputs............................................ 24 5.2 Save Directory Location......................................... 26 5.3 Loading and Running Trained Policies................................. 26 6 Plotting Results 29 7 Part 1: Key Concepts in RL 31 7.1 What Can RL Do?............................................ 31 7.2
    [Show full text]
  • The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy-Based Policy Naoto Yoshida
    The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy-based Policy Naoto Yoshida To cite this version: Naoto Yoshida. The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy- based Policy. 2015. hal-01138709v2 HAL Id: hal-01138709 https://hal.archives-ouvertes.fr/hal-01138709v2 Preprint submitted on 19 Oct 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Architecture of a Multilayer Perceptron for Actor-Critic Algorithm with Energy-based Policy Naoto Yoshida School of Biomedical Engineering Tohoku University Sendai, Aramaki Aza Aoba 6-6-01 Email: [email protected] Abstract—Learning and acting in a high dimensional state- when the actions are represented by binary vector actions action space are one of the central problems in the reinforcement [4][5][6][7][8]. Energy-based RL algorithms represent a policy learning (RL) communities. The recent development of model- based on energy-based models [9]. In this approach the prob- free reinforcement learning algorithms based on an energy- based model have been shown to be effective in such domains. ability of the state-action pair is represented by the Boltzmann However, since the previous algorithms used neural networks distribution and the energy function, and the policy is a with stochastic hidden units, these algorithms required Monte conditional probability given the current state of the agent.
    [Show full text]
  • Dalle Banche Dati Bibliografiche Pag. 2 60 70 80 94 102 Segnalazioni
    Indice: Dalle banche dati bibliografiche pag. 2 Bonati M, et al. WAITING TIMES FOR DIAGNOSIS OF ATTENTION-DEFICIT HYPERACTIVITY DISORDER IN CHILDREN AND ADOLESCENTS REFERRED TO ITALIAN ADHD CENTERS MUST BE REDUCED BMC Health Serv Res. 2019 Sep;19:673 pag. 60 Fabio RA, et al. INTERACTIVE AVATAR BOOSTS THE PERFORMANCES OF CHILDREN WITH ATTENTION DEFICIT HYPERACTIVITY DISORDER IN DYNAMIC MEASURES OF INTELLIGENCE Cyberpsychol Behav Soc Netw. 2019 Sep;22:588-96 pag. 70 Capodieci A, et al. THE EFFICACY OF A TRAINING THAT COMBINES ACTIVITIES ON WORKING MEMORY AND METACOGNITION: TRANSFER AND MAINTENANCE EFFECTS IN CHILDREN WITH ADHD AND TYPICAL DEVELOPMENT J Clin Exp Neuropsychol. 2019 Dec;41:1074-87 pag. 80 Capri T, et al. MULTI-SOURCE INTERFERENCE TASK PARADIGM TO ENHANCE AUTOMATIC AND CONTROLLED PROCESSES IN ADHD. Res Dev Disabil. 2020;97 pag. 94 Faedda N, et al. INTELLECTUAL FUNCTIONING AND EXECUTIVE FUNCTIONS IN CHILDREN AND ADOLESCENTS WITH ATTENTION DEFICIT HYPERACTIVITY DISORDER (ADHD) AND SPECIFIC LEARNING DISORDER (SLD). Scand J Psychol. 2019 Oct;60:440-46 pag. 102 Segnalazioni Bonati M – Commento a: LA PILLOLA DELL’OBBEDIENZA DI JULIEN BRYGO Le Monde Diplomatique Il Manifesto; n. 12, anno XXVI, dicembre 2019 pag. 109 Newsletter – ADHD dicembre 2019 BIBLIOGRAFIA ADHD DICEMBRE 2019 Acta Med Port. 2019 Mar;32:195-201. CLINICAL VALIDATION OF THE PORTUGUESE VERSION OF THE CHILDREN'S SLEEP HABITS QUESTIONNAIRE (CSHQ- PT) IN CHILDREN WITH SLEEP DISORDER AND ADHD. Parreira AF, Martins A, Ribeiro F, et al. INTRODUCTION: The Portuguese version of the Children's Sleep Habits Questionnaire showed adequate psychometric properties in a community sample but the American cut-off seemed inadequate.
    [Show full text]
  • Macro Action Selection with Deep Reinforcement Learning in Starcraft
    Proceedings of the Fifteenth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment (AIIDE-19) Macro Action Selection with Deep Reinforcement Learning in StarCraft Sijia Xu,1 Hongyu Kuang,2 Zhuang Zhi,1 Renjie Hu,1 Yang Liu,1 Huyang Sun1 1Bilibili 2State Key Lab for Novel Software Technology, Nanjing University {xusijia, zhuangzhi, hurenjie, liuyang01, sunhuyang}@bilibili.com, [email protected] Abstract StarCraft (SC) is one of the most popular and successful Real Time Strategy (RTS) games. In recent years, SC is also widely accepted as a challenging testbed for AI research be- cause of its enormous state space, partially observed informa- tion, multi-agent collaboration, and so on. With the help of annual AIIDE and CIG competitions, a growing number of SC bots are proposed and continuously improved. However, a large gap remains between the top-level bot and the pro- fessional human player. One vital reason is that current SC bots mainly rely on predefined rules to select macro actions during their games. These rules are not scalable and efficient enough to cope with the enormous yet partially observed state space in the game. In this paper, we propose a deep reinforce- ment learning (DRL) framework to improve the selection of macro actions. Our framework is based on the combination of the Ape-X DQN and the Long-Short-Term-Memory (LSTM). We use this framework to build our bot, named as LastOrder. Figure 1: A screenshot of StarCraft: Brood War Our evaluation, based on training against all bots from the AI- IDE 2017 StarCraft AI competition set, shows that LastOrder achieves an 83% winning rate, outperforming 26 bots in total 28 entrants.
    [Show full text]
  • Application of Newton's Method to Action Selection in Continuous
    ESANN 2014 proceedings, European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning. Bruges (Belgium), 23-25 April 2014, i6doc.com publ., ISBN 978-287419095-7. Available from http://www.i6doc.com/fr/livre/?GCOI=28001100432440. Application of Newton’s Method to Action Selection in Continuous State- and Action-Space Reinforcement Learning Barry D. Nichols and Dimitris C. Dracopoulos School of Science and Technology University of Westminster, 115 New Cavendish St, London, W1W 6XH - England Abstract. An algorithm based on Newton’s Method is proposed for ac- tion selection in continuous state- and action-space reinforcement learning without a policy network or discretization. The proposed method is val- idated on two benchmark problems: Cart-Pole and double Cart-Pole on which the proposed method achieves comparable or improved performance with less parameters to tune and in less training episodes than CACLA, which has previously been shown to outperform many other continuous state- and action-space reinforcement learning algorithms. 1 Introduction When reinforcement learning (RL) [1] is applied to problems with continuous state- and action-space it is impossible to compare the values of all possible actions; thus selecting the greedy action a from the set of all actions A available from the currents state s requires solving the optimization problem: arg max Q(s, a), ∀a ∈A (1) a Although it has been stated that if ∇aQ(s, a) is available it would be possible to apply a gradient based method [2], it is often asserted that directly solving the optization problem would be prohibitively time-consuming [3, 4].
    [Show full text]
  • Quantum Inspired Algorithms for Learning and Control of Stochastic Systems
    Scholars' Mine Doctoral Dissertations Student Theses and Dissertations Summer 2015 Quantum inspired algorithms for learning and control of stochastic systems Karthikeyan Rajagopal Follow this and additional works at: https://scholarsmine.mst.edu/doctoral_dissertations Part of the Aerospace Engineering Commons, Artificial Intelligence and Robotics Commons, and the Systems Engineering Commons Department: Mechanical and Aerospace Engineering Recommended Citation Rajagopal, Karthikeyan, "Quantum inspired algorithms for learning and control of stochastic systems" (2015). Doctoral Dissertations. 2653. https://scholarsmine.mst.edu/doctoral_dissertations/2653 This thesis is brought to you by Scholars' Mine, a service of the Missouri S&T Library and Learning Resources. This work is protected by U. S. Copyright Law. Unauthorized use including reproduction for redistribution requires the permission of the copyright holder. For more information, please contact [email protected]. QUANTUM INSPIRED ALGORITHMS FOR LEARNING AND CONTROL OF STOCHASTIC SYSTEMS by KARTHIKEYAN RAJAGOPAL A DISSERTATION Presented to the Faculty of the Graduate School of the MISSOURI UNIVERSITY OF SCIENCE AND TECHNOLOGY In Partial Fulfillment of the Requirements for the Degree DOCTOR OF PHILOSOPHY in AEROSPACE ENGINEERING 2015 Approved by Dr. S.N. Balakrishnan, Advisor Dr. Jerome Busemeyer Dr. Jagannathan Sarangapani Dr. Robert G. Landers Dr. Ming Leu iii ABSTRACT Motivated by the limitations of the current reinforcement learning and optimal control techniques, this dissertation proposes quantum theory inspired algorithms for learning and control of both single-agent and multi-agent stochastic systems. A common problem encountered in traditional reinforcement learning techniques is the exploration-exploitation trade-off. To address the above issue an action selection procedure inspired by a quantum search algorithm called Grover’s iteration is developed.
    [Show full text]
  • Towards Learning in Probabilistic Action Selection: Markov Systems and Markov Decision Processes
    Towards Learning in Probabilistic Action Selection: Markov Systems and Markov Decision Processes Manuela Veloso Carnegie Mellon University Computer Science Department Planning - Fall 2001 Remember the examples on the board. 15-889 – Fall 2001 Veloso, Carnegie Mellon Different Aspects of “Machine Learning” Supervised learning • – Classification - concept learning – Learning from labeled data – Function approximation Unsupervised learning • – Data is not labeled – Data needs to be grouped, clustered – We need distance metric Control and action model learning • – Learning to select actions efficiently – Feedback: goal achievement, failure, reward – Search control learning, reinforcement learning 15-889 – Fall 2001 Veloso, Carnegie Mellon Search Control Learning Improve search efficiency, plan quality • Learn heuristics • (if (and (goal (enjoy weather)) (goal (save energy)) (state (weather fair))) (then (select action RIDE-BIKE))) 15-889 – Fall 2001 Veloso, Carnegie Mellon Learning Opportunities in Planning Learning to improve planning efficiency • Learning the domain model • Learning to improve plan quality • Learning a universal plan • Which action model, which planning algorithm, which heuristic control is the most efficient for a given task? 15-889 – Fall 2001 Veloso, Carnegie Mellon Reinforcement Learning A variety of algorithms to address: • – learning the model – converging to the optimal plan. 15-889 – Fall 2001 Veloso, Carnegie Mellon Discounted Rewards “Reward” today versus future (promised) reward • $100K + $100K + $100K + . • INFINITE!
    [Show full text]
  • Softmax Action Selection
    DISSERTATION OPTIMAL RESERVOIR OPERATIONS FOR RIVERINE WATER QUALITY IMPROVEMENT: A REINFORCEMENT LEARNING STRATEGY Submitted by Jeffrey Donald Rieker Department of Civil and Environmental Engineering In partial fulfillment of the requirements For the Degree of Doctor of Philosophy Colorado State University Fort Collins, Colorado Spring 2011 Doctoral Committee: Advisor: John W. Labadie Darrell G. Fontane Donald K. Frevert Charles W. Anderson Copyright by Jeffrey Donald Rieker 2011 All Rights Reserved ABSTRACT OPTIMAL RESERVOIR OPERATIONS FOR RIVERINE WATER QUALITY IMPROVEMENT: A REINFORCEMENT LEARNING STRATEGY Complex water resources systems often involve a wide variety of competing objectives and purposes, including the improvement of water quality downstream of reservoirs. An increased focus on downstream water quality considerations in the operating strategies for reservoirs has given impetus to the need for tools to assist water resource managers in developing strategies for release of water for downstream water quality improvement, while considering other important project purposes. This study applies an artificial intelligence methodology known as reinforcement learning to the operation of reservoir systems for water quality enhancement through augmentation of instream flow. Reinforcement learning is a methodology that employs the concepts of agent control and evaluative feedback to develop improved reservoir operating strategies through direct interaction with a simulated river and reservoir environment driven by stochastic hydrology.
    [Show full text]
  • Delay-Aware Model-Based Reinforcement Learning for Continuous Control Baiming Chen, Mengdi Xu, Liang Li, Ding Zhao*
    1 Delay-Aware Model-Based Reinforcement Learning for Continuous Control Baiming Chen, Mengdi Xu, Liang Li, Ding Zhao* Abstract—Action delays degrade the performance of reinforce- Recently, DRL has offered the potential to resolve this ment learning in many real-world systems. This paper proposes issue. The problems that DRL solves are usually modeled a formal definition of delay-aware Markov Decision Process and as Markov Decision Process (MDP). However, ignoring the proves it can be transformed into standard MDP with augmented states using the Markov reward process. We develop a delay- delay of agents violates the Markov property and results aware model-based reinforcement learning framework that can in partially observable MDPs, or POMDPs, with historical incorporate the multi-step delay into the learned system models actions as hidden states. From [26], it is shown that solving without learning effort. Experiments with the Gym and MuJoCo POMDPs without estimating hidden states can lead to arbitrarily platforms show that the proposed delay-aware model-based suboptimal policies. To retrieve the Markov property, the algorithm is more efficient in training and transferable between systems with various durations of delay compared with off-policy delayed system was reformulated as an augmented MDP model-free reinforcement learning methods. Codes available at: problem such as the work in [27], [28]. While the problem https://github.com/baimingc/dambrl. was elegantly formulated, the computational cost increases Index Terms—model-based reinforcement learning, robotic exponentially as the delay increases. Travnik et al. [29] showed control, model-predictive control, delay that the traditional MDP framework is ill-defined, but did not provide a theoretical analysis.
    [Show full text]
  • Action Selection for Composable Modular Deep Reinforcement Learning
    Main Track AAMAS 2021, May 3-7, 2021, Online Action Selection For Composable Modular Deep Reinforcement Learning Vaibhav Gupta∗ Daksh Anand∗ IIIT, Hyderabad IIIT, Hyderabad [email protected] [email protected] Praveen Paruchuri† Akshat Kumar† IIIT, Hyderabad Singapore Management University [email protected] [email protected] ABSTRACT In modular reinforcement learning (MRL), a complex decision mak- ing problem is decomposed into multiple simpler subproblems each solved by a separate module. Often, these subproblems have conflict- ing goals, and incomparable reward scales. A composable decision making architecture requires that even the modules authored sep- arately with possibly misaligned reward scales can be combined coherently. An arbitrator should consider different module’s action preferences to learn effective global action selection. We present a novel framework called GRACIAS that assigns fine-grained im- portance to the different modules based on their relevance ina Figure 1: Bunny World Domain given state, and enables composable decision making based on modern deep RL methods such as deep deterministic policy gra- dient (DDPG) and deep Q-learning. We provide insights into the convergence properties of GRACIAS and also show that previous as high sample complexity remain when scaling RL algorithms to MRL algorithms reduce to special cases of our framework. We ex- problems with large state spaces [8]. Fortunately, in several do- perimentally demonstrate on several standard MRL domains that mains, a significant structure exists that can be exploited to yield our approach works significantly better than the previous MRL scalable and sample efficient solution approaches. In hierarchical methods, and is highly robust to incomparable reward scales.
    [Show full text]
  • Reinforcement and Shaping in Learning Action Sequences with Neural Dynamics
    4th International Conference on TuDFP.4 Development and Learning and on Epigenetic Robotics October 13-16, 2014. Palazzo Ducale, Genoa, Italy Reinforcement and Shaping in Learning Action Sequences with Neural Dynamics Matthew Luciw∗, Yulia Sandamirskayay, Sohrob Kazerounian∗,Jurgen¨ Schmidhuber∗, Gregor Schoner¨ y ∗ Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Manno-Lugano, Switzerland y Institut fur¨ Neuroinformatik, Ruhr-Universitat¨ Bochum, Universitatstr,¨ Bochum, Germany Abstract—Neural dynamics offer a theoretical and compu- [3], we have introduced a concept of elementary behaviours tational framework, in which cognitive architectures may be (EBs) in DFT, which correspond to different sensorimotor developed, which are suitable both to model psychophysics of behaviours that the agent may perform [4], [5]. To the human behaviour and to control robotic behaviour. Recently, we have introduced reinforcement learning in this framework, contrary to purely reactive modules of the subsumption and which allows an agent to learn goal-directed sequences of other behavioural-robotics architectures, the EBs in DFT are behaviours based on a reward signal, perceived at the end of a endowed with representations. In particular, a representation sequence. Although stability of the dynamic neural fields and of the intention of the behaviour provides a control input to behavioural organisation allowed to demonstrate autonomous the sensorimotor system of the agent, activating the required learning in the robotic system, learning of longer sequences was taking prohibitedly long time. Here, we combine the neural coordination pattern between the perceptual and motor sys- dynamic reinforcement learning with shaping, which consists tems, and eventually triggers generation of the behaviour. in providing intermediate rewards and accelerates learning.
    [Show full text]