DocumentCode
3256783
Title
Discovery of self-replicating structures using a genetic algorithm
Author
Lohn, Jason D. ; Reggia, James A.
Author_Institution
Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA
Volume
2
fYear
1995
fDate
29 Nov-1 Dec 1995
Firstpage
678
Abstract
Previous computational models of self-replication in cellular spaces have been manually designed, a very difficult and time-consuming process. This paper introduces the use of genetic algorithms to discover automata rules that govern emergent self-replicating processes. Given dynamically evolving automata, identification of effective fitness functions for self-replicating structures is a difficult task, and we give one solution to this problem. A model consisting of movable automata embedded in a cellular space is introduced and discussed in this context. A genetic algorithm using two fitness criteria was applied to automate rule discovery. After parameter tuning, 6 self-replicating structures consisting of 2, 3 and 4 automata were discovered over a course of 75 genetic algorithm runs. These results indicate that the fitness functions employed are effective and that genetic algorithms can be used to successfully discover rules for self-replicating structures
Keywords
artificial intelligence; cellular automata; genetic algorithms; self-reproducing automata; artificial life; automata rules; cellular automata; cellular spaces; computational models; dynamically evolving automata; fitness criteria; fitness functions; genetic algorithm; movable automata; parameter tuning; rule discovery; self-replicating structures; time-consuming; Automata; Computational modeling; Computer errors; Computer science; Content addressable storage; Context modeling; Educational institutions; Genetic algorithms; NASA;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 1995., IEEE International Conference on
Conference_Location
Perth, WA
Print_ISBN
0-7803-2759-4
Type
conf
DOI
10.1109/ICEC.1995.487466
Filename
487466
Link To Document