AI summary · arXiv: 2207.14140v1 · cs.LG

Playing a 2D Game Indefinitely using NEAT and Reinforcement Learning

Jerin Paul Selvan, Pravin S. Game

Original paper · DOI Submitted to arXiv on 28 Jul. 2022 5 pages, 7 figures, 3 tables License: CC BY-SA 4.0

The essentials

  • Robotics and artificial agents are increasingly common in recent years
  • Artificial environments with artificial agents have been created to test new path finding or search space optimization algorithms
  • Games like "Flappy Bird" provide an effective way to test these algorithms compared to simulations
  • Two algorithms enforced on artificial agents in "Flappy Bird" are NEAT and Reinforcement Learning
  • NEAT considers an objective function, crossover, mutation, and augmenting topologies while Reinforcement learning remembers the state, action taken at that state, and reward received for the action taken using a single agent and a Deep Q-learning Network
  • Researchers found that changing the initial population size in "Flappy Bird" increased the average score gained by the agent
  • The use of NEAT and Reinforcement Learning algorithms has shown promising results in improving agent performance
  • Further research could explore other potential algorithms involving multi-dimensional image problems or hidden layers.

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: Robotics Artificial Agents Path Finding Reinforcement Learning NEAT

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
In recent years, the use of robotics and artificial agents has become increasingly common. To address the challenge of testing the performance of new path finding or search space optimization algorithms, artificial environments with artificial agents have been created. Games such as "Flappy Bird" provide an effective way to test these algorithms by allowing for more efficient determination of algorithm performance compared to simulations. Two algorithms that have been enforced on artificial agents in "Flappy Bird" are NeuroEvolution of Augmenting Topologies (NEAT) and Reinforcement Learning. The NEAT algorithm follows genetic algorithms by considering an objective function, crossover, mutation, and augmenting topologies. Reinforcement learning remembers the state, action taken at that state, and reward received for the action taken using a single agent and a Deep Q-learning Network. Through various iterations by changing the initial population size in "Flappy Bird," researchers found that the average score gained by the agent increased. In conclusion, games like "Flappy Bird" provide an effective way to test path finding or search space optimization algorithms through artificial environments with artificial agents. The use of NEAT and Reinforcement Learning algorithms has shown promising results in improving agent performance; further research could explore the potential of other algorithms such as those involving multi-dimensional image problems or hidden layers.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts
Journal club Slides to present it
For journalists Press kit and hype check

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.