Evolving EFSMs solving a path-planning problem by genetic programming

Created by W.Langdon from gp-bibliography.bib Revision:1.4216

  author =       "Maxim Buzdalov and Andrey Sokolov",
  title =        "Evolving EFSMs solving a path-planning problem by
                 genetic programming",
  booktitle =    "GECCO 2012 Graduate Students Workshop",
  year =         "2012",
  editor =       "Alison Motsinger-Reif",
  isbn13 =       "978-1-4503-1178-6",
  keywords =     "genetic algorithms, genetic programming",
  pages =        "591--594",
  month =        "7-11 " # jul,
  organisation = "SIGEVO",
  address =      "Philadelphia, Pennsylvania, USA",
  DOI =          "doi:10.1145/2330784.2330880",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  abstract =     "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 100percent of
                 cases a reasonably correct EFSM with behavior similar
                 to one of the BUG algorithms is evolved.",
  notes =        "Also known as \cite{2330880} Distributed at

                 ACM Order Number 910122.",

Genetic Programming entries for Maxim Buzdalov Andrey Sokolov