Evolutionary Design of Rule Changing Cellular Automata
Evolutionary Design of Rule Changing Cellular Automata
复制标题
规则改变元胞自动机的进化设计
DOI：
10.1007/978-3-540-45224-9_37
复制
发表时间：
2003
期刊：
影响因子：
--
通讯作者：
Yun Wu
中科院分区：
文献类型：
--
作者：
H. Kanoh;Yun Wu
设计元胞自动机的转换规则来执行特定问题的难度严重限制了它们的应用。本文提出了一种新的基于遗传算法的蜂窝计算机编程方法。我们将一对规则和规则迭代的次数视为计算机程序中的一个步骤。本方法旨在通过将问题分成较小的问题并为每个问题分配不同的规则来降低给定问题的复杂性。使用密度分类和同步问题的实验结果证明，该方法比传统的方法更有效。
The difficulty of designing cellular automatons’ transition rules to perform a particular problem has severely limited their applications. In this paper we propose a new programming method of cellular computers using genetic algorithms. We consider a pair of rules and the number of rule iterations as a step in the computer program. The present method is meant to reduce the complexity of a given problem by dividing the problem into smaller ones and assigning a distinct rule to each. Experimental results using density classification and synchronization problems prove that our method is more efficient than a conventional one.