A Memory Efficient Deep Reinforcement Learning Approach For Snake Game Autonomous Agents
To perform well, Deep Reinforcement Learning (DRL) methods require significant memory resources and computational time. Also, sometimes these systems need additional environment information to achieve a good reward. However, it is more important for many applications and devices to reduce memory usage and computational times than to achieve the maximum reward. This paper presents a modified DRL method that performs reasonably well with compressed imagery data without requiring additional environment information and also uses less memory and time. We have designed a lightweight Convolutional Neural Network (CNN) with a variant of the Q-network that efficiently takes preprocessed image data as input and uses less memory. Furthermore, we use a simple reward mechanism and small experience replay memory so as to provide only the minimum necessary information. Our modified DRL method enables our autonomous agent to play Snake, a classical control game. The results show our model can achieve similar performance as other DRL methods.
Code (0)
등록된 구현이 없습니다.
Tasks
Deep Reinforcement Learningreinforcement-learningReinforcement Learning (RL)Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
AlphaSnake: Policy Iteration on a Nondeterministic NP-hard Markov Decision Process
Reinforcement learning has recently been used to approach well-known NP-hard combinatorial problems in graph theory. Among these problems, Hamiltonian cycle problems are exceptionally difficult to analyze, even when rest…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Battlesnake Challenge: A Multi-agent Reinforcement Learning Playground with Human-in-the-loop
We present the Battlesnake Challenge, a framework for multi-agent reinforcement learning with Human-In-the-Loop Learning (HILL). It is developed upon Battlesnake, a multiplayer extension of the traditional Snake game in …
Multi-agent Reinforcement Learningreinforcement-learningReinforcement Learning (RL)Emergence of Addictive Behaviors in Reinforcement Learning Agents
This paper presents a novel approach to the technical analysis of wireheading in intelligent agents. Inspired by the natural analogues of wireheading and their prevalent manifestations, we propose the modeling of such ph…
Q-Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)Polymatrix Competitive Gradient Descent
Many economic games and machine learning approaches can be cast as competitive optimization problems where multiple agents are minimizing their respective objective function, which depends on all agents' actions. While g…
Multi-agent Reinforcement LearningTrain a snake with reinforcement learning algorithms
Snake is a typical video game where the player maneuvers a line which grows in length, with the line itself being a primary obstacle.Our goal is to train a more efficient agent than human for Snake.To approoach this goal…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)