A Pure Finite State Baseline for Tartarus

@inproceedings{AshlockAPF,
  title={A Pure Finite State Baseline for Tartarus},
  author={Dan Ashlock and Jennifer L Freeman}
}
Tartarus is a standard test problem used to evaluate evolutionary computation techniques for solving problems in artificial intelligence. A gap in the Tartarus literature is a lack of systematic baseline studies for standard types of chromosomes in broad use in evolutionary computation. In this paper we adapt plain finite state automata to serve as controllers for virtual robots in the Tartarus environment. We overcome the bandwidth limitations on finite state automata that have prevented their… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

A preliminary investigation into evolving modular finite state machines

  • Chellapilla, Czarnecki, K. 1999 Chellapilla, D. Czarnecki
  • In Proceedings of the 1999 Congress on…
  • 1999

Effects of tree size and state number on gp-automata bidding strategies

  • Richter et al, C. 1998 Richter, D. Ashlock, G. Sheble
  • In GP
  • 1998

ISAc lists, a different representation for program induction

  • Ashlock, Joenks, D. 1998 Ashlock, M. Joenks
  • 1998

A GP-Automata reprise of Astro Teller’s bulldozer experiment

  • Ashlock, McRoberts, D. 1997 Ashlock, M. McRoberts
  • ISU Mathematics Technical Report AM97-17
  • 1997

The effect of splitting populations on bidding strategies

  • Ashlock, Richter, D. 1997 Ashlock, C. Richter
  • In GP
  • 1997

Evolution of a theme in artificial life: the Gensys/Tracker system

  • Jefferson et al, D. 1992 Jefferson, +6 authors A. Wang
  • 1992

Artificial intellegence through simulated evolution

  • Fogel et al, L. J. 1965 Fogel, A. Owens, M. Walsh
  • In Biophysics and Cybernetic Systems: Proceedings…
  • 1965

Similar Papers

Loading similar papers…