Declarative vs Rule-based Control for Flocking Dynamics

The popularity of rule-based flocking models, such as Reynolds' classic flocking model, raises the question of whether more declarative flocking models are possible. This question is motivated by the observation that declarative models are generally simpler and easier to design, understand, and analyze than operational models. We introduce a very simple control law for flocking based on a cost function capturing cohesion (agents want to stay together) and separation (agents do not want to get too close). We refer to it as {\textit declarative flocking} (DF). We use model-predictive control (MPC) to define controllers for DF in centralized and distributed settings. A thorough performance comparison of our declarative flocking with Reynolds' model, and with more recent flocking models that use MPC with a cost function based on lattice structures, demonstrate that DF-MPC yields the best cohesion and least fragmentation, and maintains a surprisingly good level of geometric regularity while still producing natural flock shapes similar to those produced by Reynolds' model. We also show that DF-MPC has high resilience to sensor noise.Comment: 7 Page

Bounded Distributed Flocking Control of Nonholonomic Mobile Robots

There have been numerous studies on the problem of flocking control for multiagent systems whose simplified models are presented in terms of point-mass elements. Meanwhile, full dynamic models pose some challenging problems in addressing the flocking control problem of mobile robots due to their nonholonomic dynamic properties. Taking practical constraints into consideration, we propose a novel approach to distributed flocking control of nonholonomic mobile robots by bounded feedback. The flocking control objectives consist of velocity consensus, collision avoidance, and cohesion maintenance among mobile robots. A flocking control protocol which is based on the information of neighbor mobile robots is constructed. The theoretical analysis is conducted with the help of a Lyapunov-like function and graph theory. Simulation results are shown to demonstrate the efficacy of the proposed distributed flocking control scheme

A Decentralized Mobile Computing Network for Multi-Robot Systems Operations

Collective animal behaviors are paradigmatic examples of fully decentralized operations involving complex collective computations such as collective turns in flocks of birds or collective harvesting by ants. These systems offer a unique source of inspiration for the development of fault-tolerant and self-healing multi-robot systems capable of operating in dynamic environments. Specifically, swarm robotics emerged and is significantly growing on these premises. However, to date, most swarm robotics systems reported in the literature involve basic computational tasks---averages and other algebraic operations. In this paper, we introduce a novel Collective computing framework based on the swarming paradigm, which exhibits the key innate features of swarms: robustness, scalability and flexibility. Unlike Edge computing, the proposed Collective computing framework is truly decentralized and does not require user intervention or additional servers to sustain its operations. This Collective computing framework is applied to the complex task of collective mapping, in which multiple robots aim at cooperatively map a large area. Our results confirm the effectiveness of the cooperative strategy, its robustness to the loss of multiple units, as well as its scalability. Furthermore, the topology of the interconnecting network is found to greatly influence the performance of the collective action.Comment: Accepted for Publication in Proc. 9th IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conferenc

Beyond swarm intelligence: The Ultraswarm

This paper explores the idea that it may be possible to combine two ideas – UAV flocking, and wireless cluster computing – in a single system, the UltraSwarm. The possible advantages of such a system are considered, and solutions to some of the technical problems are identified. Initial work on constructing such a system based around miniature electric helicopters is described

UltraSwarm: A Further Step Towards a Flock of Miniature Helicopters

We describe further progress towards the development of a MAV (micro aerial vehicle) designed as an enabling tool to investigate aerial flocking. Our research focuses on the use of low cost off the shelf vehicles and sensors to enable fast prototyping and to reduce development costs. Details on the design of the embedded electronics and the modification of the chosen toy helicopter are presented, and the technique used for state estimation is described. The fusion of inertial data through an unscented Kalman filter is used to estimate the helicopter’s state, and this forms the main input to the control system. Since no detailed dynamic model of the helicopter in use is available, a method is proposed for automated system identification, and for subsequent controller design based on artificial evolution. Preliminary results obtained with a dynamic simulator of a helicopter are reported, along with some encouraging results for tackling the problem of flocking

Verifiable control of a swarm of unmanned aerial vehicles

This article considers the distributed control of a swarm of unmanned aerial vehicles (UAVs) investigating autonomous pattern formation and reconfigurability. A behaviour-based approach to formation control is considered with a velocity field control algorithm developed through bifurcating potential fields. This new approach extends previous research into pattern formation using potential field theory by considering the use of bifurcation theory as a means of reconfiguring a swarm pattern through a free parameter change. The advantage of this kind of system is that it is extremely robust to individual failures, is scalpable, and also flexible. The potential field consists of a steering and repulsive term with the bifurcation of the steering potential resulting in a change of the swarm pattern. The repulsive potential ensures collision avoidance and an equally spaced final formation. The stability of the system is demonstrated to ensure that desired behaviours always occur, assuming that at large separation distances the repulsive potential can be neglected through a scale separation that exists between the steering and repulsive potential. The control laws developed are applied to a formation of ten UAVs using a velocity field tracking approach, where it is shown numerically that desired patterns can be formed safely ensuring collision avoidance

Multi-Agent Based Simulation of an Unmanned Aerial Vehicles System

The rapid growth of using Unmanned Aerial Vehicles (UAV) for civilian and military applications has promoted the development of research in many areas. Most of the unmanned aerial vehicles in use are manually controlled. Often, UAVs require highly trained pilot operators. Hence, the main challenge faced by researchers has been to make UAVs autonomous or semiautonomous. The goal of this research project is to develop and implement a simulation for a user-defined environment allowing UAVs to maneuver in free environments and obstacle-laden environments using Boid's algorithm of flocking with obstacle avoidance. The users are permitted to analyze the maneuvering area and coverage efficiency of the UAVs and to dynamically change environments. This project makes use of Boid's flocking algorithm to generate different kinds of movements for the flying agents, enabling the user to analyze the effectiveness of patrolling in that particular scenario. The number of UAVs and the type of environment are set by the user. The set number of UAVs moves as a flock or swarm inside the set environment by using Boid's rules of flocking: cohesion, alignment, and separation. The coverage efficiency of the UAVs in that particular environment is reported based on the ratio between the area covered and the time when the search time reaches a threshold. The advantages and feasibilities of the approach are discussed with the simulation results

Using agent based simulation to empirically examine complexity in carbon footprint business process

Through the critical analysis of the extant literature, it is observed that Simulation is widely used as a research method in Natural Sciences, Engineering and Social Sciences, in addition to argumentation and formalisation as the third way of carrying out research. Simulation is not so widely used in Business and Management research as it ought to have been, though this is changing for the better with the technological advances in computers and their computational power. These technological advances enhance the capability of theoretical research models, in defining a problem and their use in empirically examining a solution to the problem in simulated reality, like never before. Management journal searches for “Simulation and Complexity Theory” returned nil or zero returns, which explain that this combination is not popular in management research, though they are used individually more often. The major objective of this paper is to analyse some of the conceptual (or theoretical) and methodological (or empirical) contributions that Agent Based Simulation and Complexity Theory can make to the business and management community in their business process related research In view of this, some basic ideas are discussed of using Agent Based Simulation as a method in Business and Management Studies research and how an Agent Based Model can be applied to a business process as complex as Carbon Footprint. It is in this context that the use of Complexity as the base theory to empirically examine a business process is discussed. Throughout this article, our research on complex adaptive systems (e.g., Accounting Information System) in continuously changing organisations managing complex business processes (e.g., Carbon Footprint business process) is considered as the basis for illustrating some of the concepts. Through this article, avenues for further management research using these tools and methodology are suggested

Immune systems inspired multi-robot cooperative shepherding

Certain tasks require multiple robots to cooperate in order to solve them. The main problem with multi-robot systems is that they are inherently complex and usually situated in a dynamic environment. Now, biological immune systems pos- sess a natural distributed control and exhibit real-time adaptivity, properties that are required to solve problems in multi-robot systems. In this thesis, biological immune systems and their response to external elements to maintain an organ- ism's health state are researched. The objective of this research is to propose immune-inspired approaches to cooperation, to establish an adaptive cooperation algorithm, and to determine the re�nements that can be applied in relation to co- operation. Two immune-inspired models that are based on the immune network theory are proposed, namely the Immune Network T-cell-regulated|with Mem- ory (INT-M) and the Immune Network T-cell-regulated|Cross-Reactive (INT-X) models. The INT-M model is further studied where the results have suggested that the model is feasible and suitable to be used, especially in the multi-robot cooperative shepherding domain. The Collecting task in the RoboShepherd sce- nario and the application of the INT-M algorithm for multi-robot cooperation are discussed. This scenario provides a highly dynamic and complex situation that has wide applicability in real-world problems. The underlying `mechanism of cooperation' in the immune inspired model (INT-M) is veri�ed to be adaptive in this chosen scenario. Several multi-robot cooperative shepherding factors are studied and re�nements proposed, notably methods used for Shepherds' Approach, Shepherds' Formation and Steering Points' Distance. This study also recognises the importance of ock identi�cation in relation to cooperative shepherding, and the Connected Components Labelling method to overcome the related problem is presented. Further work is suggested on the proposed INT-X model that was not implemented in this study, since it builds on top of the INT-M algorithm and its re�nements. This study can also be extended to include other shepherd- ing behaviours, further investigation of other useful features of biological immune systems, and the application of the proposed models to other cooperative tasks