The Lawnmower Problem Revisited: Stack-Based Genetic Programming and Automatically Defined Functions   [LP] [SGP] [GP] [ADF]

by

Bruce, W., S.

Literature search on Evolutionary ComputationBBase ©1999-2013, Rasmus K. Ursem
     Home · Search · Adv. search · Authors · Login · Add entries   Webmaster
Note to authors: Please submit your bibliography and contact information - online papers are more frequently cited.

Info: Genetic Programming 1997: Proceedings of the Second Annual Conference (Conference proceedings), 1997, p. 52-57
Keywords:Genetic Programming, Genetic Algorithms
Notes:
GP-97 Zero fitness if attempts to pop empty stack. LEFT primitive removed from population. ARG0 never in best best of run. "SBGP required significantly more search than tree-based GP" "comparisons ... may be problem dependant". "In both systems [GP and SBGP] the use of ADFs appreciably improved the ability of the GP system to quickly find a solution to the [lawn mower] problem." failure of SBGP without ADFs to solve 8x12 "is most probably due to our limit of a maximium of 256 elements in a solution".
URL(s):Postscript
(G)zipped postscript

Review item:

Mark as doublet (will be reviewed)

Print entry



BibTex:
@InProceedings{bruce:1997:lprsbGPADF,
  author =       "Wilker Shane Bruce",
  title =        "The Lawnmower Problem Revisited: Stack-Based Genetic
                 Programming and Automatically Defined Functions",
  booktitle =    "Genetic Programming 1997: Proceedings of the Second
                 Annual Conference",
  editor =       "John R. Koza and Kalyanmoy Deb and Marco Dorigo and
                 David B. Fogel and Max Garzon and Hitoshi Iba and Rick
                 L. Riolo",
  year =         "1997",
  month =        "13-16 " # jul,
  keywords =     "Genetic Programming, Genetic Algorithms",
  pages =        "52--57",
  address =      "Stanford University, CA, USA",
  publisher_address = "San Francisco, CA, USA",
  publisher =    "Morgan Kaufmann",
  URL =          "http://www.scis.nova.edu/~brucews/PUBLICATIONS/gp-97.ps",
  size =         "6 pages",
  notes =        "GP-97 Zero fitness if attempts to pop empty stack.
                 LEFT primitive removed from population. ARG0 never in
                 best best of run. {"}SBGP required significantly more
                 search than tree-based GP{"} {"}comparisons ... may be
                 problem dependant{"}. {"}In both systems [GP and SBGP]
                 the use of ADFs appreciably improved the ability of the
                 GP system to quickly find a solution to the [lawn
                 mower] problem.{"} failure of SBGP without ADFs to
                 solve 8x12 {"}is most probably due to our limit of a
                 maximium of 256 elements in a solution{"}.",
}