Planning And Control Of Swarm Motion As Continua

In this thesis, new algorithms for formation control of multi agent systems (MAS) based on continuum mechanics principles will be investigated. For this purpose agents of the MAS are treated as particles in a continuum, evolving in an n-D space, whose desired configuration is required to satisfy an admissible deformation function. Considered is a specific class of mappings that is called homogenous where the Jacobian of the mapping is only a function of time and is not spatially varying. The primary objectives of this thesis are to develop the necessary theory and its validation via simulation on a mobile-agent based swarm test bed that includes two primary tasks: 1) homogenous transformation of MAS and 2) deployment of a random distribution of agents on to a desired configuration. Developed will be a framework based on homogenous transformations for the evolution of a MAS in an n-D space (n=1, 2, and 3), under two scenarios: 1) no inter-agent communication (predefined motion plan); and 2) local inter-agent communication. Additionally, homogenous transformations based on communication protocols will be used to deploy an arbitrary distribution of a MAS on to a desired curve. Homogenous transformation with no communication: A homogenous transformation of a MAS, evolving in an space, under zero inter agent communication is first considered. Here the homogenous mapping, is characterized by an n x n Jacobian matrix ( ) and an n x 1 rigid body displacement vector ( ), that are based on positions of n+1 agents of the MAS, called leader agents. The designed Jacobian ( ) and rigid body displacement vector ( ) are passed onto rest of the agents of the MAS, called followers, who will then use that information to update their positions under a pre- iv defined motion plan. Consequently, the motion of MAS will evolve as a homogenous transformation of the initial configuration without explicit communication among agents. Homogenous Transformation under Local Communication: We develop a framework for homogenous transformation of MAS, evolving in , under a local inter agent communication topology. Here we assume that some agents are the leaders, that are transformed homogenously in an n-D space. In addition, every follower agent of the MAS communicates with some local agents to update its position, in order to grasp the homogenous mapping that is prescribed by the leader agents. We show that some distance ratios that are assigned based on initial formation, if preserved, lead to asymptotic convergence of the initial formation to a final formation under a homogenous mapping. Deployment of a Random Distribution on a Desired Manifold: Deployment of agents of a MAS, moving in a plane, on to a desired curve, is a task that is considered as an application of the proposed approach. In particular, a 2-D MAS evolution problem is considered as two 1-D MAS evolution problems, where x or y coordinates of the position of all agents are modeled as points confined to move on a straight line. Then, for every coordinate of MAS evolution, bulk motion is controlled by two agents considered leaders that move independently, with rest of the follower agents motions evolving through each follower agent communicating with two adjacent agents

Effects of communication and utility-based decision making in a simple model of evacuation

We present a simple cellular automaton based model of decision making during evacuation. Evacuees have to choose between two different exit routes, resulting in a strategic decision making problem. Agents take their decisions based on utility functions, these can be revised as the evacuation proceeds, leading to complex interaction between individuals and to jamming transitions. The model also includes the possibility to communicate and exchange information with distant agents, information received may affect the decision of agents. We show that under a wider range of evacuation scenarios performance of the model system as a whole is optimal at an intermediate fraction of evacuees with access to communication.Comment: 9 pages, 9 figure

The control theory of motion-based communication: problems in teaching robots to dance

The paper describes results on two components of a research program focused on motion-based communication mediated by the dynamics of a control system. Specifically we are interested in how mobile agents engaged in a shared activity such as dance can use motion as a medium for transmitting certain types of messages. The first part of the paper adopts the terminology of motion description languages and deconstructs an elementary form of the well-known popular dance, Salsa, in terms of four motion primitives (dance steps). Several notions of dance complexity are introduced. We describe an experiment in which ten performances by an actual pair of dancers are evaluated by judges and then compared in terms of proposed complexity metrics. An energy metric is also defined. Values of this metric are obtained by summing the lengths of motion segments executed by wheeled robots replicating the movements of the human dancers in each of the ten dance performances. Of all the metrics that are considered in this experiment, energy is the most closely correlated with the human judges' assessments of performance quality. The second part of the paper poses a general class of dual objective motion control problems in which a primary objective (artistic execution of a dance step or efficient movement toward a specified terminal state) is combined with a communication objective. Solutions of varying degrees of explicitness can be given in several classes of problems of communicating through the dynamics of finite dimensional linear control systems. In this setting it is shown that the cost of adding a communication component to motions that steer a system between prescribed pairs of states is independent of those states. At the same time, the optimal encoding problem itself is shown to be a problem of packing geometric objects, and it remains open. Current research is aimed at solving such communication-through-action problems in the context of the motion control of mobile robots.Support for this work is gratefully acknowledged to ODDR&E MURI07 Program Grant Number FA9550-07-1-0528, the National Science Founda tion ITR Program Grant Number DMI-0330171, and the Office of Naval Research, and by ODDR&E MURI10 Program Grant Number N00014-10- 1-0952. (FA9550-07-1-0528 - ODDRE MURI07; DMI-0330171 - National Science Foundation ITR Program; Office of Naval Research; N00014-10-1-0952 - ODDRE MURI10

A Process-Oriented Architecture for Complex System Modelling

A fine-grained massively-parallel process-oriented model of platelets (potentially artificial) within a blood vessel is presented. This is a CSP inspired design, expressed and implemented using the occam-pi language. It is part of the TUNA pilot study on nanite assemblers at the universities of York, Surrey and Kent. The aim for this model is to engineer emergent behaviour from the platelets, such that they respond to a wound in the blood vessel wall in a way similar to that found in the human body -- i.e. the formation of clots to stem blood flow from the wound and facilitate healing. An architecture for a three dimensional model (relying strongly on the dynamic and mobile capabilities of occam-pi) is given, along with mechanisms for visualisation and interaction. The biological accuracy of the current model is very approximate. However, its process-oriented nature enables simple refinement (through the addition of processes modelling different stimulants/inhibitors of the clotting reaction, different platelet types and other participating organelles) to greater and greater realism. Even with the current system, simple experiments are possible and have scientific interest (e.g. the effect of platelet density on the success of the clotting mechanism in stemming blood flow: too high or too low and the process fails). General principles for the design of large and complex system models are drawn. The described case study runs to millions of processes engaged in ever-changing communication topologies. It is free from deadlock, livelock, race hazards and starvation em by design, employing a small set of synchronisation patterns for which we have proven safety theorems