June 2020
Beginner to intermediate
394 pages
7h 17m
English
Genetic algorithms are often presented as a way to solve a difficult algorithmic problem. This chapter applies a genetic algorithm to help a small robot find an exit. It formulates a simple situation (a robot looking for the exit) as an optimization problem (minimizing the distance between the robot and the exit). This chapter builds a small robot that lives in a randomly generated maze. The robot’s objective is to exit the maze.
We will model the maze as a two-dimensional map, in which the maze entrance and exit are fixed positions. The entrance ...
Read now
Unlock full access