Connectivity Preservation in Distributed Control of Multi-Agent Systems

The problem of designing bounded distributed connectivity preserving control strategies for multi-agent systems is studied in this work. In distributed control of multi-agent systems, each agent is required to measure some variables of other agents, or a subset of them. Such variables include, for example, relative positions, relative velocities, and headings of the neighboring agents. One of the main assumptions in this type of systems is the connectivity of the corresponding network. Therefore, regardless of the overall objective, the designed control laws should preserve the network connectivity, which is usually a distance-dependent condition. The designed controllers should also be bounded because in practice the actuators of the agents can only handle finite forces or torques. This problem is investigated for two cases of single-integrator agents and unicycles, using a novel class of distributed potential functions. The proposed controllers maintain the connectivity of the agents that are initially in the connectivity range. Therefore, if the network is initially connected, it will remain connected at all times. The results are first developed for a static information flow graph, and then extended to the case of dynamic edge addition. Connectivity preservation for problems involving static leaders is covered as well. The potential functions are chosen to be smooth, resulting in bounded control inputs. These functions are subsequently used to develop connectivity preserving controllers for the consensus and containment problems. Collision avoidance is investigated as another relevant problem, where a bounded distributed swarm aggregation strategy with both connectivity preservation and collision avoidance properties is presented. Simulations are provided throughout the work to support the theoretical findings

Opinion Dynamics in Social Networks with Hostile Camps: Consensus vs. Polarization

Most of the distributed protocols for multi-agent consensus assume that the agents are mutually cooperative and "trustful," and so the couplings among the agents bring the values of their states closer. Opinion dynamics in social groups, however, require beyond these conventional models due to ubiquitous competition and distrust between some pairs of agents, which are usually characterized by repulsive couplings and may lead to clustering of the opinions. A simple yet insightful model of opinion dynamics with both attractive and repulsive couplings was proposed recently by C. Altafini, who examined first-order consensus algorithms over static signed graphs. This protocol establishes modulus consensus, where the opinions become the same in modulus but may differ in signs. In this paper, we extend the modulus consensus model to the case where the network topology is an arbitrary time-varying signed graph and prove reaching modulus consensus under mild sufficient conditions of uniform connectivity of the graph. For cut-balanced graphs, not only sufficient, but also necessary conditions for modulus consensus are given.Comment: scheduled for publication in IEEE Transactions on Automatic Control, 2016, vol. 61, no. 7 (accepted in August 2015

Stability of singularly perturbed hybrid systems with restricted systems evolving on boundary layer manifolds

We present a singular perturbation theory applicable to systems with hybrid boundary layer systems and hybrid reduced systems {with} jumps from the boundary layer manifold. First, we prove practical attractivity of an adequate attractor set for small enough tuning parameters and sufficiently long time between almost all jumps. Second, under mild conditions on the jump mapping, we prove semi-global practical asymptotic stability of a restricted attractor set. Finally, for certain classes of dynamics, we prove semi-global practical asymptotic stability of the restricted attractor set for small enough tuning parameters and sufficiently long period between almost all jumps of the slow states only

An Overview of Recent Progress in the Study of Distributed Multi-agent Coordination

This article reviews some main results and progress in distributed multi-agent coordination, focusing on papers published in major control systems and robotics journals since 2006. Distributed coordination of multiple vehicles, including unmanned aerial vehicles, unmanned ground vehicles and unmanned underwater vehicles, has been a very active research subject studied extensively by the systems and control community. The recent results in this area are categorized into several directions, such as consensus, formation control, optimization, task assignment, and estimation. After the review, a short discussion section is included to summarize the existing research and to propose several promising research directions along with some open problems that are deemed important for further investigations

Hybrid Flocking Control Algorithm with Application to Coordination between Multiple Fixed-wing Aircraft

Flocking, as a collective behavior of a group, has been investigated in many areas, and in the recent decade, flocking algorithm design has gained a lot of attention due to its variety of potential applications. Although there are many applications exclusively related to fixed-wing aircraft, most of the theoretical works rarely consider these situations. The fixed-wing aircraft flocking is distinct from the general flocking problems by four practical concerns, which include the nonholonomic constraint, the limitation of speed, the collision avoidance and the efficient use of airspace. None of the existing works have addressed all these concerns. The major difficulty is to take into account the all four concerns simultaneously meanwhile having a relatively mild requirement on the initial states of aircraft. In this thesis, to solve the fixed-wing aircraft flocking problem, a supervisory decentralized control algorithm is proposed. The proposed control algorithm has a switching control structure, which basically includes three modes of control protocol and a state-dependent switching logic. Three modes of decentralized control protocol are designed based on the artificial potential field method, which helps to address the nonholonomic constraint, the limitation of speed and the collision avoidance for appropriate initial conditions. The switching logic is designed based on the invariance property induced by the control modes such that the desirable convergence properties of the flocking behavior and the efficient use of airspace are addressed. The proposed switching logic can avoid the fast mode switching, and the supervisor does not require to perform switchings frequently and respond to the aircraft immediately, which means the desired properties can still be guaranteed with the presence of the dwell time in the supervisor

Robotic Wireless Sensor Networks

In this chapter, we present a literature survey of an emerging, cutting-edge, and multi-disciplinary field of research at the intersection of Robotics and Wireless Sensor Networks (WSN) which we refer to as Robotic Wireless Sensor Networks (RWSN). We define a RWSN as an autonomous networked multi-robot system that aims to achieve certain sensing goals while meeting and maintaining certain communication performance requirements, through cooperative control, learning and adaptation. While both of the component areas, i.e., Robotics and WSN, are very well-known and well-explored, there exist a whole set of new opportunities and research directions at the intersection of these two fields which are relatively or even completely unexplored. One such example would be the use of a set of robotic routers to set up a temporary communication path between a sender and a receiver that uses the controlled mobility to the advantage of packet routing. We find that there exist only a limited number of articles to be directly categorized as RWSN related works whereas there exist a range of articles in the robotics and the WSN literature that are also relevant to this new field of research. To connect the dots, we first identify the core problems and research trends related to RWSN such as connectivity, localization, routing, and robust flow of information. Next, we classify the existing research on RWSN as well as the relevant state-of-the-arts from robotics and WSN community according to the problems and trends identified in the first step. Lastly, we analyze what is missing in the existing literature, and identify topics that require more research attention in the future

Error Analysis in Multi-Agent Control Systems

Any cooperative control scheme relies on some measurements which are often assumed to be exact to simplify the analysis. However, it is known that in practice all measured quantities are subject to error, which can deteriorate the overall performance of the network significantly. This work proposes a new measurement error analysis in the control of multi-agent systems. In particular, the connectivity preservation of multi-agent systems with state-dependent error in distance measurements is considered. It is assumed that upper bounds on the measurement error and its rate of change are available. A general class of distributed control strategies is then proposed for the distance-dependent connectivity preservation of the agents in the network. It is shown that if two neighboring agents are initially located in the connectivity range, they are guaranteed to remain connected at all times. Furthermore, the formation control problem for a team of single-integrator agents subject to distance measurement error is investigated using navigation functions. Collision, obstacle and boundary avoidance are important features of the proposed strategy. Conditions on the magnitude of the measurement error and its rate of change are derived under which a new error-dependent formation can be achieved anywhere in the space. The effectiveness of the proposed control strategies in consensus and containment problems is demonstrated by simulation

Decentralized Autonomous Navigation Strategies for Multi-Robot Search and Rescue

In this report, we try to improve the performance of existing approaches for search operations in multi-robot context. We propose three novel algorithms that are using a triangular grid pattern, i.e., robots certainly go through the vertices of a triangular grid during the search procedure. The main advantage of using a triangular grid pattern is that it is asymptotically optimal in terms of the minimum number of robots required for the complete coverage of an arbitrary bounded area. We use a new topological map which is made and shared by robots during the search operation. We consider an area that is unknown to the robots a priori with an arbitrary shape, containing some obstacles. Unlike many current heuristic algorithms, we give mathematically proofs of convergence of the algorithms. The computer simulation results for the proposed algorithms are presented using a simulator of real robots and environment. We evaluate the performance of the algorithms via experiments with real robots. We compare the performance of our own algorithms with three existing algorithms from other researchers. The results demonstrate the merits of our proposed solution. A further study on formation building with obstacle avoidance for a team of mobile robots is presented in this report. We propose a decentralized formation building with obstacle avoidance algorithm for a group of mobile robots to move in a defined geometric configuration. Furthermore, we consider a more complicated formation problem with a group of anonymous robots; these robots are not aware of their position in the final configuration and need to reach a consensus during the formation process. We propose a randomized algorithm for the anonymous robots that achieves the convergence to a desired configuration with probability 1. We also propose a novel obstacle avoidance rule, used in the formation building algorithm.Comment: arXiv admin note: substantial text overlap with arXiv:1402.5188 by other author

A Continuum Framework and Homogeneous Map Based Algorithms for Formation Control of Multi Agent Systems

In this dissertation, new algorithms for formation control of multi agent systems (MAS) based on continuum mechanics principles will be suggested. For this purpose, agents of the MAS are considered as particles in a continuum, evolving in R^n, whose desired configuration is required to satisfy an admissible deformation function. Considered is a specific class of mappings that are called homogenous where the Jacobian of the mapping is only a function of time and is not spatially varying. The primary objectives of this dissertation are to develop the necessary theory and its validation 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 a desired configuration. Developed will be a framework based on homogenous transformations for the evolution of an MAS in an n-dimensional space (n=1,2, and 3), under1) no inter-agent communication (predefined motion plan), 2) local inter-agent communication, and 3) intelligent perception by agents. In this dissertation, different communication protocols for MAS evolution that are based on certain special features of a homogenous transformation will be developed. It is also aimed to deal with the robustness of tracking of a desired motion by an MAS evolving in R^n. Furthermore, the effect of communication delays in an MAS evolving under consensus algorithms or homogenous maps is investigated. In this regard, the maximum allowable communication delay for MAS evolution is formulated on the basis of eigen-analysis.Ph.D., Mechanical Engineering and Mechanics -- Drexel University, 201