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

Decentralized Multi-Subgroup Formation Control With Connectivity Preservation and Collision Avoidance

This paper proposes a formation control algorithm to create separated multiple formations for an undirected networked multi-agent system while preserving the network connectivity and avoiding collision among agents. Through the modified multi-consensus technique, the proposed algorithm can simultaneously divide a group of multiple agents into any arbitrary number of desired formations in a decentralized manner. Furthermore, the agents assigned to each formation group can be easily reallocated to other formation groups without network topological constraints as long as the entire network is initially connected; an operator can freely partition agents even if there is no spanning tree within each subgroup. Besides, the system can avoid collision without loosing the connectivity even during the transient period of formation by applying the existing potential function based on the network connectivity estimation. If the estimation is correct, the potential function not only guarantees the connectivity maintenance but also allows some extra edges to be broken if the network remains connected. Numerical simulations are performed to verify the feasibility and performance of the proposed multi-subgroup formation control

Decentralized local-global connectivity maintenance for networked robotic teams

A prerequisite for a team of robots to cooperate is to maintain connectivity among robots. Connectivity maintenance has been extensively studied recently and several local and global connectivity maintenance algorithms have been proposed for the distance dependent communication topology. Local methods are known to be very restrictive and it will be shown that global methods, based on power iteration estimation, could be sluggish in the presence of communication delay and non-converging in large and sparse robot teams. Therefore, a method based on k-hop routing is proposed, where k is a design parameter to determine the locality level of the proposed method. Before any link disconnection, a test for an alternative k-hop path is executed and, based on its result, the disconnection is allowed or blocked. Blocking displacement for maintaining connectivity will eventually immobilize (freeze) the network. Therefore, a procedure for unfreezing the network is also proposed. Simulation results are provided to further investigate the proposed method

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

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

Coordination of multi-agent systems: stability via nonlinear Perron-Frobenius theory and consensus for desynchronization and dynamic estimation.

This thesis addresses a variety of problems that arise in the study of complex networks composed by multiple interacting agents, usually called multi-agent systems (MASs). Each agent is modeled as a dynamical system whose dynamics is fully described by a state-space representation. In the first part the focus is on the application to MASs of recent results that deal with the extensions of Perron-Frobenius theory to nonlinear maps. In the shift from the linear to the nonlinear framework, Perron-Frobenius theory considers maps being order-preserving instead of matrices being nonnegative. The main contribution is threefold. First of all, a convergence analysis of the iterative behavior of two novel classes of order-preserving nonlinear maps is carried out, thus establishing sufficient conditions which guarantee convergence toward a fixed point of the map: nonnegative row-stochastic matrices turns out to be a special case. Secondly, these results are applied to MASs, both in discrete and continuous-time: local properties of the agents' dynamics have been identified so that the global interconnected system falls into one of the above mentioned classes, thus guaranteeing its global stability. Lastly, a sufficient condition on the connectivity of the communication network is provided to restrict the set of equilibrium points of the system to the consensus points, thus ensuring the agents to achieve consensus. These results do not rely on standard tools (e.g., Lyapunov theory) and thus they constitute a novel approach to the analysis and control of multi-agent dynamical systems. In the second part the focus is on the design of dynamic estimation algorithms in large networks which enable to solve specific problems. The first problem consists in breaking synchronization in networks of diffusively coupled harmonic oscillators. The design of a local state feedback that achieves desynchronization in connected networks with arbitrary undirected interactions is provided. The proposed control law is obtained via a novel protocol for the distributed estimation of the Fiedler vector of the Laplacian matrix. The second problem consists in the estimation of the number of active agents in networks wherein agents are allowed to join or leave. The adopted strategy consists in the distributed and dynamic estimation of the maximum among numbers locally generated by the active agents and the subsequent inference of the number of the agents that took part in the experiment. Two protocols are proposed and characterized to solve the consensus problem on the time-varying max value. The third problem consists in the average state estimation of a large network of agents where only a few agents' states are accessible to a centralized observer. The proposed strategy projects the dynamics of the original system into a lower dimensional state space, which is useful when dealing with large-scale systems. Necessary and sufficient conditions for the existence of a linear and a sliding mode observers are derived, along with a characterization of their design and convergence properties

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

Dynamical area coverage by mobile sensor networks. Analysis, Modeling and Control

The thesis is a theoretical study of the problem of collecting data from a given field of interest with a team of mobile sensors communicating over an ad-hoc network. It is related with problems of optimal control, ad-hoc networking, distributed computation, computational geometry

Algoritmo bioinspirado a redes de robots para la asistencia en operaciones de busqueda y rescate

ilustraciones, diagramas, fotografíasThis thesis proposes a bio-inspired algorithm for robot networks assisting in the operations of search and rescue scenarios. We consider ants as social animals to study and abstract beha- viors that can be useful in the framework of search and rescue using robots. We consider three main topics to address when using robots to assist rescuers. First, the exploration and mapping of the disaster zones. For this, we consider the mecha- nisms and interactions of ants to explore their environment, look for food, avoid predators, and explore better places to establish a nest. Then, we deploy robots to explore the en- vironment and discourage robots from entering regions other robots have explored using pheromones as markers for the robots. We also abstract the randomness ants use to explore and implement a Q-learning algorithm that allows robots to explore unvisited regions. Second, the navigation and victim detection. Once the environment has been explored, we vi use Reynolds rules to allow the navigation of robots to create cohesion, attraction to target goals, and repulsion to obstacles and inter-agent collisions. Then, we use a neural network to determine whether what robots are detecting is a victim. Lastly, we use a consensus-like approach to classify victims or no victims based on distributed information. Lastly, ants have been famous for carrying loads that surpass their size and payload capacity by cooperating. We consider quadrotors to carry loads cooperatively that can be medical supplies or victims in search and rescue (Texto tomado de la fuente)Esta tesis propone un algoritmo bioinspirado para redes de robots que asisten en las operaciones de escenarios de busqueda y rescate. Consideramos a las hormigas como animales sociales para estudiar y abstraer comportamientos que pueden ser utiles en el marco de la busqueda y rescate mediante robots. Consideramos tres temas principales para abordar cuando se utilizan robots para ayudar a los rescatistas. Primero, la exploracion y mapeo de las zonas de desastre. Para esto, consideramos los mecanismos e interacciones de las hormigas para explorar su entorno, buscar comida, evitar depredadores y explorar mejores lugares para establecer un nido. Luego, desplegamos robots para explorar el entorno y disuadimos a los robots de ingresar a regiones que otros robots han explorado usando feromonas como marcadores para los robots. Tambien abstraemos la aleatoriedad que usan las hormigas para explorar e implementar un algoritmo Q-learning que permite a los robots explorar regiones no visitadas. En segundo lugar, la navegacion y deteccion de vıctimas. Una vez que se ha explorado el entorno, usamos las reglas de Reynolds para permitir que la navegacion de los robots cree cohesion, atraccion hacia los objetivos y repulsion hacia los obstaculos y las colisiones entre agentes. Luego, usamos una red neuronal para determinar si lo que detectan los robots es una vıctima. Por ultimo, utilizamos un enfoque de consenso para clasificar a las vıctimas o no vıctimas en funcion de la informacion distribuida. Por ultimo, las hormigas han sido famosas por llevar cargas que superan su tamano y capacidad de carga al cooperar. Consideramos quadrotors para transportar cargas de manera cooperativa que pueden ser suministros medicos o vıctimas en busqueda y rescate.MaestríaMagister en Ingenieria - Automatizacion IndustrialRobotic