Evolving EFSMs solving a path-planning problem by genetic programming
Maxim Buzdalov, Andrey Sokolov · 2012
In this paper, we present an approach to evolving of an algorithm encoded as an extended finite-state machine that solves a simple path-planning problem - finding a path in an unknown area filled with obstacles using a constant amount of memory - by means of genetic programming. Experiments show that in 100% of cases a reasonably correct EFSM with behavior similar to one of the BUG algorithms is evolved.