Evolutionary Synthesis of Cellular Automata

Zupanc, Jernej; Filipič, Bogdan
June 2011
Journal of Computing & Information Technology;Jun2011, Vol. 19 Issue 2, p105
Academic Journal
Synthesis of cellular automata is an important area of modeling and describing complex systems. Large amounts of combinations and candidate solutions render the usage of deterministic approaches impractical and thus nondeterministic optimization methods have to be employed. Two of the typical evolutionary approaches to synthesizing cellular automata are the evolution of a single automaton and a genetic algorithm that evolves a population of automata. The first approach, with addition of some heuristics, is known as the cellular programming algorithm. In this paper we address the second approach and develop a genetic algorithm that evolves a population of cellular automata. We test both approaches on the density classification task, which is one of the most widely studied computational problems in the context of evolving cellular automata. Comparison of the synthesized cellular automata demonstrates unexpected similarity of the evolved rules and comparable classification accuracy performance of both approaches.


Related Articles

  • Access Path Planning of Mobile Agent in Wireless Sensor Networks. Chaoyu Yang; Minli Song // Journal of Networks;Feb2014, Vol. 9 Issue 2, p507 

    Adopting the two-stage optimization model and hybrid optimized algorithm based on evolutionary computation, a new two-stage optimization model that more conforms to the actual demand is proposed on the basis of formal description of Mobile Agent access path planning. This new model divides the...

  • COMPARISON OF EVOLUTIONARY COMPUTATION METHODS FOR TUNING A FUZZY LOGIC CONTROLLER. Jones, Karl O.; Diebold, Sven // Proceedings of the International Conference on Information Techn;2008, Vol. 2, p125 

    Evolutionary Computation (EC) is a vibrant area of investigation, with some promising approaches being genetic Algorithms, Particle Swarm Optimisation and Bees Algorithm, all of which can be used in optimisation problems. Since the approaches are supposed to find a solution to a given objective...

  • An improvement Adaptive Genetic Algorithm. Youchan Zhu; Feng Shen // International Proceedings of Computer Science & Information Tech;2012, Vol. 43, p113 

    In order to solve the premature convergence and local optimization and improve the global optimum and fast convergence, a new adaptive genetic algorithm is presented in this paper. It is based on the evaluation of population diversity and calculation of fitness value. The experimental result...

  • Genetic Algorithm-Based Identification of Fractional-Order Systems. Shengxi Zhou; Junyi Cao; Yangquan Chen // Entropy;May2013, Vol. 15 Issue 5, p1624 

    Fractional calculus has become an increasingly popular tool for modeling the complex behaviors of physical systems from diverse domains. One of the key issues to apply fractional calculus to engineering problems is to achieve the parameter identification of fractional-order systems. A...

  • Comparing evolutionary algorithms on benchmark functions. Vladu, Ecaterina; Novac, Mihaela; Novac, Ovidiu; Mastei, Daniela; Onet, Elisa // Journal of Computer Science & Control Systems;2010, Vol. 3 Issue 1, p249 

    In this paper a comparison of the most recent evolutionary algorithms on some test functions is performed. For comparison the followings algorithms are used: Genetic Algorithms (GA), Simulated Annealing (SA) and Particle Swarm Optimization (PSO). The comparison is made by using five test functions.

  • Kinematic and Dynamic Modeling of a Multi-Fingered robot Hand. Wan Faizura Binti Wan Tarmizi; Elamvazuthi, Irraivan; Begam, Mumtaj // International Journal of Basic & Applied Sciences;Dec2009, Vol. 9 Issue 10, p89 

    Research on multi fingered robot hand (MFRH) is being carried out to accommodate a variety of tasks such as grasping and manipulation of objects in the field of industrial applications, service robots, and rehabilitation robots. The first step in realising a fully functional MFRH is mathematical...

  • SPEED UP RELIABILITY MODEL OPTIMIZATION WITH HYPERVOLUME CONTRIBUTION CALCULATING ALGORITHM. Xiuling Zhou; Ping Guo; Chen, C. L. Philip // Intelligent Automation & Soft Computing;Aug2011, Vol. 17 Issue 5, p619 

    Software dependability modelling involves simultaneous consideration of several incompatible and often conflicting objectives, while hypervolume-based multiobjective evolutionary algorithm (MOEA) has been shown to produce better results for multi-objective problem in practice. A frame of...

  • Dual-Sequenced Real Coded Genetic Algorithm for Picking Process Optimization. Liyi Zheng; Shiping Guo; Rongfu Zhang // Advanced Materials Research;2014, Vol. 1083, p207 

    Automatic monoclonal colony picking machine with 96-probe picking module were employed to improve picking efficacy. The paper proposes a modified genetic algorithm based on dual-sequenced real coded andnew crossover operator to reduce the moving distance of the picking module in picking process....

  • APPLICATION MAPPING OF MESH BASED NOC USING EVOLITIONARY ALGORITHM. JENA, R. K. // Journal of Information Systems & Communication;2012, Vol. 3 Issue 1, p203 

    This paper addresses the problem of mapping of intellectual properties (IPs) cores' on the tiles of a mesh-based NoC using Chaos-multi-objective genetic algorithms (CMGA). Optimization of the energy consumption (Computational and Communicational) and link bandwidth requirement under performance...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics