20 research outputs found

    Learning emergence: adaptive cellular automata façade trained by artificial neural networks

    Get PDF
    This thesis looks into the possibilities of controlling the emergent behaviour of Cellular Automata (CA) to achieve specific architectural goals. More explicitly, the objective is to develop a performing, adaptive building facade, which is fed with the history of its achievements and errors, to provide optimum light conditions in buildings’ interiors. To achieve that, an artificial Neural Network (NN) is implemented. However, can an artificial NN cope with the complexity of such an emergent system? Moreover, can such a system be trained to compute and yield patterns with specific regional optima, using simple inputs deriving from its environment? Both Backpropagation and optimisation using Genetic Algorithms (GA) are tested to reassign the weights of the network and several experiments are conducted regarding the structure and complexity of both CA and NN. Here it is argued that in fact, it is possible to train such a system although the level of success is strongly dependent on the degree of complexity and the level of resolution and accuracy. By taking advantage of the structural attributes of certain CA that go beyond just a higher order stability, this dissertation suggests that such an evolutionary, computational approach can lead to adaptive and performative architectural spaces of high aesthetic value

    Structuring Cellular Automata Rule Space with Attractor Basins

    Full text link
    Complex systems such as Cellular Automata (CA) produce global behaviour based on the interactions of simple units (cells). Their evolution is specified by local interaction rules that generate some form of ordered, complex or chaotic behaviour. This wide variety of behaviour represents an important generative tool for the artist. Chaotic behaviour dominates rule space, which has serious implications for the serendipitous use of these systems in artistic endeavour. A fresh insight into a recognised key problem, the structure of rule space, is presented based on empirical evidence. This provides a method for creating groups of rules with a broad range of behaviour for application within generative arts practice and will also be of interest to scientific practitioners

    Optimal Rules Identification for a Random Number Generator Using Cellular Learning Automata

    Get PDF
    The cryptography is known as one of most essential ways for protecting information against threats. Among all encryption algorithms, stream ciphering can be indicated as a sample of swift ways for this purpose, in which, a generator is applied to produce a sequence of bits as the key stream. Although this sequence is seems to be random, severely, it contains a pattern that repeats periodically. Linear Feedback Shift Registers and cellular automata have been used as pseudo-random number generator. Some challenges such as error propagation and pattern dependability have motivated the designers to use CA for this purpose. The most important issue in using cellular automata includes determining an optimal set of rules for cells. This paper focuses on selecting optimal rules set for such this generator with using an open cellular learning automata, which is a cellular automata with learning capability and interacts with local and global environments

    The prevalence of complexity in flammable ecosystems and the application of complex systems theory to the simulation of fire spread

    Full text link
    Les forêts sont une ressource naturelle importante sur le plan écologique, culturel et économique, et sont confrontées à des défis croissants en raison des changements climatiques. Ces défis sont difficiles à prédire en raison de la nature complexe des interactions entre le climat et la végétation, dont une le feu. Compte tenu de l’importance des écosystèmes forestiers, des dangers potentiels des feux de forêt et de la complexité de leurs interactions, il est primordial d'acquérir une compréhension de ces systèmes à travers le prisme de la science des systèmes complexes. La science des systèmes complexes et ses techniques de modélisation associées peuvent fournir des informations sur de tels systèmes que les techniques de modélisation traditionnelles ne peuvent pas. Là où les techniques statistiques et basées sur équations cherchent à contourner la dynamique non-linéaire, auto-organisée et émergente des systèmes complexes, les approches de modélisation telles que les automates cellulaires et les modèles à base d'agents (MBA) embrassent cette complexité en cherchant à reproduire les interactions clés de ces systèmes. Bien qu'il existe de nombreux modèles de comportement du feu qui tiennent compte de la complexité, les MBA offrent un terrain d'entente entre les modèles de simulation empiriques et physiques qui peut fournir de nouvelles informations sur le comportement et la simulation du feu. Cette étude vise à améliorer notre compréhension du feu dans le contexte de la science des systèmes complexes en développant un tel MBA de propagation du feu. Le modèle utilise des données de type de carburant, de terrain et de météo pour créer l'environnement des agents. Le modèle est évalué à l'aide d’une étude de cas d'un incendie naturel qui s'est produit en 2001 dans le sud-ouest de l'Alberta, au Canada. Les résultats de cette étude confirment la valeur de la prise en compte de la complexité lors de la simulation d'incendies de forêt et démontrent l'utilité de la modélisation à base d'agents pour une telle tâche.Forests are an ecologically, culturally, and economically important natural resource that face growing challenges due to climate change. These challenges are difficult to predict due to the complex nature of the interactions between climate and vegetation. Furthermore, fire is intrinsically linked to both climate and vegetation and is, itself, complex. Given the importance of forest ecosystems, the potential dangers of forest fires, and the complexity of their interactions, it is paramount to gain an understanding of these systems through the lens of complex systems science. Complex systems science and its attendant modeling techniques can provide insights on such systems that traditional modelling techniques cannot. Where statistical and equation-based techniques seek to work around the non-linear, self-organized, and emergent dynamics of complex systems, modelling approaches such as Cellular Automata and Agent-Based Models (ABM) embrace this complexity by seeking to reproduce the key interactions of these systems. While there exist numerous models of fire behaviour that account for complexity, ABM offers a middle ground between empirical and physical simulation models that may provide new insights into fire behaviour and simulation. This study seeks to add to our understanding of fire within the context of complex systems science by developing such an ABM of fire spread. The model uses fuel-type, terrain, and weather data to create the agent environment. The model is evaluated with a case study of a natural fire that occurred in 2001 in southwestern Alberta, Canada. Results of this study support the value of considering complexity when simulating forest fires and demonstrate the utility of ABM for such a task

    An algorithmic approach to system architecting using shape grammar-cellular automata

    Get PDF
    Thesis (Ph. D.)--Massachusetts Institute of Technology, Engineering Systems Division, 2008.Includes bibliographical references (p. 404-417).This thesis expands upon the understanding of the fundamentals of system architecting in order to more effectively apply this process to engineering systems. The universal concern about the system architecting process is that the needs and wants of the stakeholders are not being fully satisfied, primarily because too few design alternatives are created and ambiguity exists in the information required. At the same time, it is noted that nature offers a superb example of system architecting and therefore should be considered as a guide for the engineering of systems. Key features of nature's architecting processes include self-generation, diversity, emergence, least action (balance of kinetic and potential energy), system-of-systems organization, and selection for stability. Currently, no human-friendly method appears to exist that addresses the problems in the field of system architecture while at the same time emulating nature's processes. By adapting nature's self-generative approach, a systematic means is offered to more rigorously conduct system architecting and better satisfy stakeholders. After reviewing generative design methods, an algorithmic methodology is developed to generate a space of architectural solutions satisfying a given specification, local constraints, and physical laws. This approach combines a visually oriented human design interface (shape grammar) that provides an intuitive design language with a machine (cellular automata) to execute the system architecture's production set (algorithm). The manual output of the flexible shape grammar, the set of design rules, is transcribed into cellular automata neighborhoods as a sequenced production set that may include other simple programs (such as combinatoric instructions).(cont.) The resulting catalog of system architectures can be unmanageably large, so selection criteria (e.g., stability, matching interfaces, least action) are defined by the architect to narrow the solution space for stakeholder review. The shape grammar-cellular automata algorithmic approach was demonstrated across several domains of study. This methodology improves on the design's clarification and the number of design alternatives produced, which should result in greater stakeholder satisfaction. Of additional significance, this approach has shown value both in the study of the system architecting process, leading to the proposal of normative principles for system architecture, and in the modeling of systems for better understanding.by Thomas H. Speller, Jr.Ph.D

    Genetic programming and cellular automata for fast flood modelling on multi-core CPU and many-core GPU computers

    Get PDF
    Many complex systems in nature are governed by simple local interactions, although a number are also described by global interactions. For example, within the field of hydraulics the Navier-Stokes equations describe free-surface water flow, through means of the global preservation of water volume, momentum and energy. However, solving such partial differential equations (PDEs) is computationally expensive when applied to large 2D flow problems. An alternative which reduces the computational complexity, is to use a local derivative to approximate the PDEs, such as finite difference methods, or Cellular Automata (CA). The high speed processing of such simulations is important to modern scientific investigation especially within urban flood modelling, as urban expansion continues to increase the number of impervious areas that need to be modelled. Large numbers of model runs or large spatial or temporal resolution simulations are required in order to investigate, for example, climate change, early warning systems, and sewer design optimisation. The recent introduction of the Graphics Processor Unit (GPU) as a general purpose computing device (General Purpose Graphical Processor Unit, GPGPU) allows this hardware to be used for the accelerated processing of such locally driven simulations. A novel CA transformation for use with GPUs is proposed here to make maximum use of the GPU hardware. CA models are defined by the local state transition rules, which are used in every cell in parallel, and provide an excellent platform for a comparative study of possible alternative state transition rules. Writing local state transition rules for CA systems is a difficult task for humans due to the number and complexity of possible interactions, and is known as the ‘inverse problem’ for CA. Therefore, the use of Genetic Programming (GP) algorithms for the automatic development of state transition rules from example data is also investigated in this thesis. GP is investigated as it is capable of searching the intractably large areas of possible state transition rules, and producing near optimal solutions. However, such population-based optimisation algorithms are limited by the cost of many repeated evaluations of the fitness function, which in this case requires the comparison of a CA simulation to given target data. Therefore, the use of GPGPU hardware for the accelerated learning of local rules is also developed. Speed-up factors of up to 50 times over serial Central Processing Unit (CPU) processing are achieved on simple CA, up to 5-10 times speedup over the fully parallel CPU for the learning of urban flood modelling rules. Furthermore, it is shown GP can generate rules which perform competitively when compared with human formulated rules. This is achieved with generalisation to unseen terrains using similar input conditions and different spatial/temporal resolutions in this important application domain
    corecore