Reaktor race-condition: Difference between revisions
From wikiluntti
| Line 32: | Line 32: | ||
* Generation 1: Population of 100. | * Generation 1: Population of 100. | ||
* Generation n: crossovers of best individuals + random mutations | * Generation n: crossovers of best individuals + random mutations | ||
* Q-learning, | * Q-learning, | ||
https://www.youtube.com/results?search_query=neat+algorithm+game | |||
=== Soft Actor-Critic Algorithm === | === Soft Actor-Critic Algorithm === | ||
Revision as of 15:21, 12 May 2023
Introduction
https://race-condition.reaktor.com/play
Input data
- FPV view
- speed?
- best lap time, last lap time?
Output
- throttle
- steering
Theory
Rules
PID algorithm
PID to stay in the blue area.
NEAT algorithm
Input
- Distance to some black; about 15.
A.I. teaches itself to drive in Trackmania: https://www.youtube.com/watch?v=a8Bo2DHrrow
- The neat algorithm: https://neat-python.readthedocs.io/en/latest/neat_overview.html
- Input: Wall distances and speed (shown at t=1.01; 7 or 15 distances)
- 8 inputs (distances and speed) -> 3 outputs (left, right, throttle)
- Fitness function: distance traveled by the car in a given time
- Generation 1: Population of 100.
- Generation n: crossovers of best individuals + random mutations
- Q-learning,
https://www.youtube.com/results?search_query=neat+algorithm+game
Soft Actor-Critic Algorithm
https://github.com/trackmania-rl/tmrl
- Soft Actor-Critic: a beginner-friendly introduction https://www.youtube.com/watch?v=LN29DDlHp1U
https://www.youtube.com/results?search_query=neat+algorithm+game
