Detecting Topology Variations in Dynamical Networks

This paper considers the problem of detecting topology variations in dynamical networks. We consider a network whose behavior can be represented via a linear dynamical system. The problem of interest is then that of finding conditions under which it is possible to detect node or link disconnections from prior knowledge of the nominal network behavior and on-line measurements. The considered approach makes use of analysis tools from switching systems theory. A number of results are presented along with examples

Active Self-Assembly of Algorithmic Shapes and Patterns in Polylogarithmic Time

We describe a computational model for studying the complexity of self-assembled structures with active molecular components. Our model captures notions of growth and movement ubiquitous in biological systems. The model is inspired by biology's fantastic ability to assemble biomolecules that form systems with complicated structure and dynamics, from molecular motors that walk on rigid tracks and proteins that dynamically alter the structure of the cell during mitosis, to embryonic development where large-scale complicated organisms efficiently grow from a single cell. Using this active self-assembly model, we show how to efficiently self-assemble shapes and patterns from simple monomers. For example, we show how to grow a line of monomers in time and number of monomer states that is merely logarithmic in the length of the line. Our main results show how to grow arbitrary connected two-dimensional geometric shapes and patterns in expected time that is polylogarithmic in the size of the shape, plus roughly the time required to run a Turing machine deciding whether or not a given pixel is in the shape. We do this while keeping the number of monomer types logarithmic in shape size, plus those monomers required by the Kolmogorov complexity of the shape or pattern. This work thus highlights the efficiency advantages of active self-assembly over passive self-assembly and motivates experimental effort to construct general-purpose active molecular self-assembly systems

A Decentralized Architecture for Active Sensor Networks

This thesis is concerned with the Distributed Information Gathering (DIG) problem in which a Sensor Network is tasked with building a common representation of environment. The problem is motivated by the advantages offered by distributed autonomous sensing systems and the challenges they present. The focus of this study is on Macro Sensor Networks, characterized by platform mobility, heterogeneous teams, and long mission duration. The system under consideration may consist of an arbitrary number of mobile autonomous robots, stationary sensor platforms, and human operators, all linked in a network. This work describes a comprehensive framework called Active Sensor Network (ASN) which addresses the tasks of information fusion, decistion making, system configuration, and user interaction. The main design objectives are scalability with the number of robotic platforms, maximum flexibility in implementation and deployment, and robustness to component and communication failure. The framework is described from three complementary points of view: architecture, algorithms, and implementation. The main contribution of this thesis is the development of the ASN architecture. Its design follows three guiding principles: decentralization, modularity, and locality of interactions. These principles are applied to all aspects of the architecture and the framework in general. To achieve flexibility, the design approach emphasizes interactions between components rather than the definition of the components themselves. The architecture specifies a small set of interfaces sufficient to implement a wide range of information gathering systems. In the area of algorithms, this thesis builds on the earlier work on Decentralized Data Fusion (DDF) and its extension to information-theoretic decistion making. It presents the Bayesian Decentralized Data Fusion (BDDF) algorithm formulated for environment features represented by a general probability density function. Several specific representations are also considered: Gaussian, discrete, and the Certainty Grid map. Well known algorithms for these representations are shown to implement various aspects of the Bayesian framework. As part of the ASN implementation, a practical indoor sensor network has been developed and tested. Two series of experiments were conducted, utilizing two types of environment representation: 1) point features with Gaussian position uncertainty and 2) Certainty Grid maps. The network was operational for several days at a time, with individual platforms coming on and off-line. On several occasions, the network consisted of 39 software components. The lessons learned during the system's development may be applicable to other heterogeneous distributed systems with data-intensive algorithms

Heterogeneous Self-Reconfiguring Robotics

Self-reconfiguring (SR) robots are modular systems that can autonomously change shape, or reconfigure, for increased versatility and adaptability in unknown environments. In this thesis, we investigate planning and control for systems of non-identical modules, known as heterogeneous SR robots. Although previous approaches rely on module homogeneity as a critical property, we show that the planning complexity of fundamental algorithmic problems in the heterogeneous case is equivalent to that of systems with identical modules. Primarily, we study the problem of how to plan shape changes while considering the placement of specific modules within the structure. We characterize this key challenge in terms of the amount of free space available to the robot and develop a series of decentralized reconfiguration planning algorithms that assume progressively more severe free space constraints and support reconfiguration among obstacles. In addition, we compose our basic planning techniques in different ways to address problems in the related task domains of positioning modules according to function, locomotion among obstacles, self-repair, and recognizing the achievement of distributed goal-states. We also describe the design of a novel simulation environment, implementation results using this simulator, and experimental results in hardware using a planar SR system called the Crystal Robot. These results encourage development of heterogeneous systems. Our algorithms enhance the versatility and adaptability of SR robots by enabling them to use functionally specialized components to match capability, in addition to shape, to the task at hand

Design And Implementation Of Co-Operative Control Strategy For Hybrid AC/DC Microgrids

This thesis is mainly divided in two major sections: 1) Modelling and control of AC microgrid, DC microgrid, Hybrid AC/DC microgrid using distributed co-operative control, and 2) Development of a four bus laboratory prototype of an AC microgrid system. At first, a distributed cooperative control (DCC) for a DC microgrid considering the state-of-charge (SoC) of the batteries in a typical plug-in-electric-vehicle (PEV) is developed. In DC microgrids, this methodology is developed to assist the load sharing amongst the distributed generation units (DGs), according to their ratings with improved voltage regulation. Subsequently, a DCC based control algorithm for AC microgrid is also investigated to improve the performance of AC microgrid in terms of power sharing among the DGs, voltage regulation and frequency deviation. The results validate the advantages of the proposed methodology as compared to traditional droop control of AC microgrid. The DCC-based control methodology for AC microgrid and DC microgrid are further expanded to develop a DCC-based power management algorithm for hybrid AC/DC microgrid. The developed algorithm for hybrid microgrid controls the power flow through the interfacing converter (IC) between the AC and DC microgrids. This will facilitate the power sharing between the DGs according to their power ratings. Moreover, it enables the fixed scheduled power delivery at different operating conditions, while maintaining good voltage regulation and improved frequency profile. The second section provides a detailed explanation and step-by-step design and development of an AC/DC microgrid testbed. Controllers for the three-phase inverters are designed and tested on different generation units along with their corresponding inductor-capacitor-inductor (LCL) filters to eliminate the switching frequency harmonics. Electric power distribution line models are developed to form the microgrid network topology. Voltage and current sensors are placed in the proper positions to achieve a full visibility over the microgrid. A running average filter (RAF) based enhanced phase-locked-loop (EPLL) is designed and implemented to extract frequency and phase angle information. A PLL-based synchronizing scheme is also developed to synchronize the DGs to the microgrid. The developed laboratory prototype runs on dSpace platform for real time data acquisition, communication and controller implementation