Broadcasting Automata and Patterns on Z^2

The Broadcasting Automata model draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood se- quences and nature, employing many of the same pattern forming methods that can be seen in the superposition of waves and resonance. Algorithms for broad- casting automata model are in the same vain as those encountered in distributed algorithms using a simple notion of waves, messages passed from automata to au- tomata throughout the topology, to construct computations. The waves generated by activating processes in a digital environment can be used for designing a vari- ety of wave algorithms. In this chapter we aim to study the geometrical shapes of informational waves on integer grid generated in broadcasting automata model as well as their potential use for metric approximation in a discrete space. An explo- ration of the ability to vary the broadcasting radius of each node leads to results of categorisations of digital discs, their form, composition, encodings and gener- ation. Results pertaining to the nodal patterns generated by arbitrary transmission radii on the plane are explored with a connection to broadcasting sequences and ap- proximation of discrete metrics of which results are given for the approximation of astroids, a previously unachievable concave metric, through a novel application of the aggregation of waves via a number of explored functions

Self-stabilizing robot formations over unreliable networks

We describe how a set of mobile robots can arrange themselves on any specified curve on the plane in the presence of dynamic changes both in the underlying ad hoc network and in the set of participating robots. Our strategy is for the mobile robots to implement a self-stabilizing virtual layer consisting of mobile client nodes, stationary Virtual Nodes (VNs), and local broadcast communication. The VNs are associated with predetermined regions in the plane and coordinate among themselves to distribute the client nodes relatively uniformly among the VNs' regions. Each VN directs its local client nodes to align themselves on the local portion of the target curve. The resulting motion coordination protocol is self-stabilizing, in that each robot can begin the execution in any arbitrary state and at any arbitrary location in the plane. In addition, self-stabilization ensures that the robots can adapt to changes in the desired target formation.National Science Foundation (U.S.) (Grant No. CNS-0614993

Pattern formations with discrete waves and broadcasting sequences

This thesis defines the Broadcasting Automata model as an intuitive and complete method of distributed pattern formation, partitioning and distributed geometric computation. The system is examined within the context of Swarm Robotics whereby large numbers of minimally complex robots may be deployed in a variety of circumstances and settings with goals as diverse as from toxic spill containment to geological survey. Accomplishing these tasks with such simplistic machines is complex and has been deconstructed in to sub-problems considered to be signif- icant because, when composed, they are able to solve much more complex tasks. Sub-problems have been identified, and studied as pattern formation, leader elec- tion, aggregation, chain formation, hole avoidance, foraging, path formation, etc. The Broadcasting Automata draws inspiration from a variety of sources such as Ad-Hoc radio networks, cellular automata, neighbourhood sequences and nature, employing many of the same pattern forming methods that can be seen in the superposition of waves and resonance. To this end the thesis gives an in depth analysis of the primitive tools of the Broadcasting Automata model, nodal patterns, where waves from a variety of transmitters can in linear time construct partitions and patterns with results per- taining to the numbers of different patterns and partitions, along with the number of those that differ, are given. Using these primitives of the model a variety of algorithms are given including leader election, through the location of the centre of a discrete disc, and a solution to the Firing Squad Synchronisation problem. These problems are solved linearly.An exploration of the ability to vary the broadcasting radius of each node leads to results of categorisations of digital discs, their form, composition, encodings and generation. Results pertaining to the nodal patterns generated by arbitrary transmission radii on the plane are explored with a connection to broadcasting sequences and approximation of discrete metrics of which results are given for the approximation of astroids, a previously unachievable concave metric, through a novel application of the aggregation of waves via a number of explored functions. Broadcasting Automata aims to place itself as a robust and complete linear time and large scale system for the construction of patterns, partitions and geometric computation. Algorithms and methodologies are given for the solution of problems within Swarm Robotics and an extension to neighbourhood sequences. It is also hoped that it opens up a new area of research that can expand many older and more mature works

Model Checking Paxos in Spin

We present a formal model of a distributed consensus algorithm in the executable specification language Promela extended with a new type of guards, called counting guards, needed to implement transitions that depend on majority voting. Our formalization exploits abstractions that follow from reduction theorems applied to the specific case-study. We apply the model checker Spin to automatically validate finite instances of the model and to extract preconditions on the size of quorums used in the election phases of the protocol.Comment: In Proceedings GandALF 2014, arXiv:1408.556

Querying XML data streams from wireless sensor networks: an evaluation of query engines

As the deployment of wireless sensor networks increase and their application domain widens, the opportunity for effective use of XML filtering and streaming query engines is ever more present. XML filtering engines aim to provide efficient real-time querying of streaming XML encoded data. This paper provides a detailed analysis of several such engines, focusing on the technology involved, their capabilities, their support for XPath and their performance. Our experimental evaluation identifies which filtering engine is best suited to process a given query based on its properties. Such metrics are important in establishing the best approach to filtering XML streams on-the-fly

A Mechanism for Dynamic Coordination of Multiple Robots

In this paper, we present a mechanism for coordinating multiple robots in the execution of cooperative tasks. The basic idea in the paper is to assign to each robot in the team, a role that determines its actions during the cooperation. The robots dynamically assume and exchange roles in a synchronized manner in order to perform the task successfully, adapting to unexpected events in the environment. We model this mechanism using a hybrid systems framework and apply it in different cooperative tasks: cooperative manipulation and cooperative search and transportation. Simulations and real experiments demonstrating the effectiveness of the proposed mechanism are presented

Control and Coordination in a Networked Robotic Platform

Control and Coordination of the robots has been widely researched area among the swarm robotics. Usually these swarms are involved in accomplishing tasks assigned to them either one after another or concurrently. Most of the times, the tasks assigned may not need the entire population of the swarm but a subset of them. In this project, emphasis has been given to determination of such subsets of robots termed as ”flock” whose size actually depends on the complexity of the task. Once the flock is determined from the swarm, leader and follower robots are determined which accomplish the task in a controlled and cooperative fashion. Although the entire control system,which is determined for collision free and coordinated environment, is stable, the results show that both wireless (bluetooth) and internet (UDP) communication system can introduce some lag which can lead robot trajectories to an unexpected set. The reason for this is each robot and a corresponding computer is considered as a complete robot and communication between the robot and the computer and between the computers was inevitable. These problems could easily be solved by integrating a computer on the robot or just add a wifi transmitter/receiver on the robot. On going down the lane, by introducing smarter robots with different kinds of sensors this project could be extended on a large scale for varied heterogenous and homogenous applications

Multi-Agent Fitness Functions For Evolutionary Architecture

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

Configuration Recognition, Communication Fault Tolerance and Self-reassembly for the CKBot

We present and experimentally verify novel methods for increasing the generality of control, autonomy and reliability for modular robotic systems. In particular, we demonstrate configuration recognition, distributed communication fault tolerance, and the organization and control of self-reassembly with the Connector Kinetic roBot (CKBot). The primary contribution of this work is the presentation and experimental verification of these innovative methods that are general and applicable to other modular robotic systems. We describe our CKBot system and compare it to other similar, state-of-the-art modular robotic systems. Our description and comparison highlights various design developments, features, and notable achievements of these systems. We present work on isomorphic configuration recognition with CKBot. Here, we utilize basic principles from graph theory to create and implement an algorithm on CKBot that automatically recognizes modular robot configurations. In particular, we describe how comparing graph spectra of configuration matrices can be used to find a permutation matrix that maps a given configuration to a known one. If a configuration is matched to one in a library of stored gaits, a permutation mapping is applied and the corresponding coordinated control for locomotion is executed. An implementation of the matching algorithm with small configurations of CKBot configurations that can be rearranged during runtime is presented. We also present work on a distributed fault-tolerance algorithm used to control CKBot configurations. Here, we use a triple modular redundancy approach for CKBot units to collectively vote on observations and execute commands in the presence of infrared (IR) communication failures. In our implementation, we broadcast infrared signals to modules which collaboratively vote on a majority course of action. Various gait selections for a seven module caterpillar and sixteen module quadruped with faulty subsets of IR receivers have been verified to demonstrate the algorithm\u27s robustness. Lastly, we present work on the communication hierarchy and control state machine for the Self-reassembly After Explosion (SAE) robot. Here, we discuss the interaction and integration of the various sensory inputs and control outputs implemented for camera-guided self-reassembly with CKBot. This section describes the overall communication system and reassembly sequence planning after a group of CKBot clusters is kicked apart