1,284 research outputs found

    Artificial life meets computational creativity?

    Get PDF
    I review the history of work in Artificial Life on the problem of the open-ended evolutionary growth of complexity in computational worlds. This is then put into the context of evolutionary epistemology and human creativity

    Spatio-Temporal Patterns act as Computational Mechanisms governing Emergent behavior in Robotic Swarms

    Get PDF
    open access articleOur goal is to control a robotic swarm without removing its swarm-like nature. In other words, we aim to intrinsically control a robotic swarm emergent behavior. Past attempts at governing robotic swarms or their selfcoordinating emergent behavior, has proven ineffective, largely due to the swarm’s inherent randomness (making it difficult to predict) and utter simplicity (they lack a leader, any kind of centralized control, long-range communication, global knowledge, complex internal models and only operate on a couple of basic, reactive rules). The main problem is that emergent phenomena itself is not fully understood, despite being at the forefront of current research. Research into 1D and 2D Cellular Automata has uncovered a hidden computational layer which bridges the micromacro gap (i.e., how individual behaviors at the micro-level influence the global behaviors on the macro-level). We hypothesize that there also lie embedded computational mechanisms at the heart of a robotic swarm’s emergent behavior. To test this theory, we proceeded to simulate robotic swarms (represented as both particles and dynamic networks) and then designed local rules to induce various types of intelligent, emergent behaviors (as well as designing genetic algorithms to evolve robotic swarms with emergent behaviors). Finally, we analysed these robotic swarms and successfully confirmed our hypothesis; analyzing their developments and interactions over time revealed various forms of embedded spatiotemporal patterns which store, propagate and parallel process information across the swarm according to some internal, collision-based logic (solving the mystery of how simple robots are able to self-coordinate and allow global behaviors to emerge across the swarm)

    Non-determinism in the narrative structure of video games

    Get PDF
    PhD ThesisAt the present time, computer games represent a finite interactive system. Even in their more experimental forms, the number of possible interactions between player and NPCs (non-player characters) and among NPCs and the game world has a finite number and is led by a deterministic system in which events can therefore be predicted. This implies that the story itself, seen as the series of events that will unfold during gameplay, is a closed system that can be predicted a priori. This study looks beyond this limitation, and identifies the elements needed for the emergence of a non-finite, emergent narrative structure. Two major contributions are offered through this research. The first contribution comes in the form of a clear categorization of the narrative structures embracing all video game production since the inception of the medium. In order to look for ways to generate a non-deterministic narrative in games, it is necessary to first gain a clear understanding of the current narrative structures implemented and how their impact on users’ experiencing of the story. While many studies have observed the storytelling aspect, no attempt has been made to systematically distinguish among the different ways designers decide how stories are told in games. The second contribution is guided by the following research question: Is it possible to incorporate non-determinism into the narrative structure of computer games? The hypothesis offered is that non-determinism can be incorporated by means of nonlinear dynamical systems in general and Cellular Automata in particular

    Application of Swarm Intelligence in Disaster Management: A Review

    Get PDF
    The efficient use of Swarm Intelligence in Disaster management is discussed in this paper. Many lives are lost in Disaster affected area, the rescue team cannot reach everyone to rescue them this where Swarm Intelligence can be used. The Swarm Intelligence is a collective behavior to perform multiple task. SI can be used in searching and rescue operation in the disaster affected area, the swarm of Drones and bots deployed to locate the lives and give their exact location so that they can be rescued. The drones can analyze the area a give instruction to the ground bots. Obstacle avoidance can be used for clearing path for the rescue team to reach the location of the stuck person. Bots can combine together and work as one which increases their strength and may clear path. Swarm Intelligence is effective in many areas in Disaster Management

    Multi-Agent Fitness Functions For Evolutionary Architecture

    Get PDF
    The dynamics of crowd movements are self-organising and often involve complex pattern formations. Although computational models have recently been developed, it is unclear how well their underlying methods capture local dynamics and longer-range aspects, such as evacuation. A major part of this thesis is devoted to an investigation of current methods, and where required, the development of alternatives. The main purpose is to utilise realistic models of pedestrian crowds in the design of fitness functions for an evolutionary approach to architectural design. We critically review the state-of-the-art in pedestrian and evacuation dynamics. The concept of 'Multi-Agent System' embraces a number of approaches, which together encompass important local and longer-range aspects. Early investigations focus on methods-cellular automata and attractor fields-designed to capture these respective levels. The assumption that pattern formations in crowds result from local processes is reflected in two dimensional cellular automata models, where mathematical rules operate in local neighbourhoods. We investigate an established cellular automata and show that lane-formation patterns are stable only in a low-valued density range. Above this range, such patterns suddenly randomise. By identifying and then constraining the source of this randomness, we are only able to achieve a small degree of improvement. Moreover, when we try to integrate the model with attractor fields, no useful behaviour is achieved, and much of the randomness persists. Investigations indicate that the unwanted randomness is associated with 2-lattice phase transitions, where local dynamics get invaded by giant-component clusters during the onset of lattice percolation. Through this in-depth investigation, the general limits to cellular automata are ascertained-these methods are not designed with lattice percolation properties in mind and resulting models depend, often critically, on arbitrarily chosen neighbourhoods. We embark on the development of new and more flexible methodologies. Rather than treating local and global dynamics as separate entities, we combine them. Our methods are responsive to percolation, and are designed around the following principles: 1) Inclusive search provides an optimal path between a pedestrian origin and destination. 2) Dynamic boundaries protect search and are based on percolation probabilities, calculated from local density regimes. In this way, more robust dynamics are achieved. Simultaneously, longer-range behaviours are also specified. 3) Network-level dynamics further relax the constraints of lattice percolation and allow a wider range of pedestrian interactions. Having defined our methods, we demonstrate their usefulness by applying them to lane-formation and evacuation scenarios. Results reproduce the general patterns found in real crowds. We then turn to evolution. This preliminary work is intended to motivate future research in the field of Evolutionary Architecture. We develop a genotype-phenotype mapping, which produces complex architectures, and demonstrate the use of a crowd-flow model in a phenotype-fitness mapping. We discuss results from evolutionary simulations, which suggest that obstacles may have some beneficial effect on crowd evacuation. We conclude with a summary, discussion of methodological limitations, and suggestions for future research

    Annotated Bibliography: Anticipation

    Get PDF

    Inductive Pattern Formation

    Get PDF
    With the extended computational limits of algorithmic recursion, scientific investigation is transitioning away from computationally decidable problems and beginning to address computationally undecidable complexity. The analysis of deductive inference in structure-property models are yielding to the synthesis of inductive inference in process-structure simulations. Process-structure modeling has examined external order parameters of inductive pattern formation, but investigation of the internal order parameters of self-organization have been hampered by the lack of a mathematical formalism with the ability to quantitatively define a specific configuration of points. This investigation addressed this issue of quantitative synthesis. Local space was developed by the Poincare inflation of a set of points to construct neighborhood intersections, defining topological distance and introducing situated Boolean topology as a local replacement for point-set topology. Parallel development of the local semi-metric topological space, the local semi-metric probability space, and the local metric space of a set of points provides a triangulation of connectivity measures to define the quantitative architectural identity of a configuration and structure independent axes of a structural configuration space. The recursive sequence of intersections constructs a probabilistic discrete spacetime model of interacting fields to define the internal order parameters of self-organization, with order parameters external to the configuration modeled by adjusting the morphological parameters of individual neighborhoods and the interplay of excitatory and inhibitory point sets. The evolutionary trajectory of a configuration maps the development of specific hierarchical structure that is emergent from a specific set of initial conditions, with nested boundaries signaling the nonlinear properties of local causative configurations. This exploration of architectural configuration space concluded with initial process-structure-property models of deductive and inductive inference spaces. In the computationally undecidable problem of human niche construction, an adaptive-inductive pattern formation model with predictive control organized the bipartite recursion between an information structure and its physical expression as hierarchical ensembles of artificial neural network-like structures. The union of architectural identity and bipartite recursion generates a predictive structural model of an evolutionary design process, offering an alternative to the limitations of cognitive descriptive modeling. The low computational complexity of these models enable them to be embedded in physical constructions to create the artificial life forms of a real-time autonomously adaptive human habitat

    Making sense of sensory input

    Get PDF
    This paper attempts to answer a central question in unsupervised learning: what does it mean to "make sense" of a sensory sequence? In our formalization, making sense involves constructing a symbolic causal theory that both explains the sensory sequence and also satisfies a set of unity conditions. The unity conditions insist that the constituents of the causal theory -- objects, properties, and laws -- must be integrated into a coherent whole. On our account, making sense of sensory input is a type of program synthesis, but it is unsupervised program synthesis. Our second contribution is a computer implementation, the Apperception Engine, that was designed to satisfy the above requirements. Our system is able to produce interpretable human-readable causal theories from very small amounts of data, because of the strong inductive bias provided by the unity conditions. A causal theory produced by our system is able to predict future sensor readings, as well as retrodict earlier readings, and impute (fill in the blanks of) missing sensory readings, in any combination. We tested the engine in a diverse variety of domains, including cellular automata, rhythms and simple nursery tunes, multi-modal binding problems, occlusion tasks, and sequence induction intelligence tests. In each domain, we test our engine's ability to predict future sensor values, retrodict earlier sensor values, and impute missing sensory data. The engine performs well in all these domains, significantly out-performing neural net baselines. We note in particular that in the sequence induction intelligence tests, our system achieved human-level performance. This is notable because our system is not a bespoke system designed specifically to solve intelligence tests, but a general-purpose system that was designed to make sense of any sensory sequence
    corecore