A Review of Consensus-based Multi-agent UAV Applications

In this paper, a review of distributed control for multi-agent systems is proposed, focusing on consensus-based applications. Both rotary-wing and fixed-wing Unmanned Aerial Vehicles (UAVs) are considered. On one side, methodologies and implementations based on collision and obstacle avoidance through consensus are analyzed for multirotor UAVs. On the other hand, a target tracking through consensus is considered for fixed-wing UAVs. This novel approach to classify the literature could help researchers to assess the outcomes achieved in these two directions in view of potential practical implementations of consensus-based methodologies

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

Computational intelligence approaches to robotics, automation, and control [Volume guest editors]

No abstract available

Unifying Consensus and Covariance Intersection for Efficient Distributed State Estimation over Unreliable Networks

This thesis studies the problem of recursive distributed state estimation over unreliable networks. The main contribution is to fuse the independent and dependent information separately. Local estimators communicate directly only with their immediate neighbors and nothing is assumed about the structure of the communication network, specifically it need not be connected at all times. The proposed estimator is a Hybrid one that fuses independent and dependent (or correlated) information using a distributed averaging and iterative conservative fusion rule respectively. It will be discussed how the hybrid method can improve estimators's performance and make it robust to network failures. The content of the thesis is divided in two main parts. In the first part I study how this idea is applied to the case of dynamical systems with continuous state and Gaussian noise. I establish bounds for estimation performance and show that my method produces unbiased conservative estimates that are better than Iterative Covariance Intersection (ICI). I will test the proposed algorithm on an atmospheric dispersion problem, a random linear system estimation and finally a target tracking problem. In the second part, I will discuss how the hybrid method can be applied to distributed estimation on a Hidden Markov Model. I will discuss the notion of conservativeness for general probability distributions and use the appropriate cost function to achieve improvement similar to the first part. The performance of the proposed method is evaluated in a multi-agent tracking problem and a high dimensional HMM and it is shown that its performance surpasses the competing algorithms

Autonomous Navigation of Quadrotor Swarms

RÉSUMÉ La mise sur le marché de composants toujours plus performants et compétitifs en termes de coût, ainsi que le développement rapide des technologies de commande et de navigation en robotique, nous ont amenés à envisager le contrôle d’un large essaim de quadrirotors. Di-verses solutions impliquant des drones existent déjà pour différentes applications: inventaire forestier, gestion du littoral, suivi du trafic, etc. Parmi celles-ci, la recherche et le sauvetage en situation d’urgence représentent à nos yeux la possibilité la plus intéressante et constitue, de fait, la première motivation de notre travail. Par conséquent, une large revue de littérature sur la question est fournie. Ce travail se concentre sur le contrôle de l’essaim lui-même, et non sur l’application finale. Tout d’abord, un modèle mathématique de la dynamique du quadrirotor est présenté et plusieurs lois de commande numérique sont synthétisées. Ces dernières implémentent les modes de fonctionnement nécessaires aux algorithmes de navigation, à savoir : commande en vitesse, commande en position et commande en suivi. Ensuite, deux solutions originales et complémentaires de contrôle d’essaim sont proposées. D’une part, un algorithme d’essaimage pour la navigation extérieure est développé. Contrairement à la plupart des travaux trouvés dans la littérature, la solution proposée ici gère non seulement le maintien, mais aussi l’initialisation de la formation. Plus spécifiquement, un modèle de formation hexagonale est introduit. Ensuite, les places en formation sont attribuées de façon optimale à l’aide de l’algorithme hongrois. Enfin, les agents se déplacent jusqu’à la place qui leur est assignée tout en évitant les autres agents avec un algorithme de navigation inspiré du Artificial Potential Field. De plus, cette solution tient compte de contraintes de conception réalistes et a été intégrée avec succès dans un logiciel embarqué de quadrotor déjà existant et opérationnel. Les résultats de simulations Software-In-The-Loop sont fournis. D’autre part, une solution d’essaimage pour la navigation intérieure est étudiée. L’algorithme proposé implémente un certain nombre de comportements individuels simples, de sorte qu’un grand essaim peut suivre un meneur dans des environnements encombrés en se fiant uniquement aux informations locales. Des simulations préliminaires sont effectuées et les résultats montrent qu’il serait possible de faire fonctionner, conformément au besoin étudié, un essaim de cent quadrirotors avec l’algorithme proposé. En particulier, l’essaim est capable de suivre le meneur, de maintenir la connectivité, d’éviter les collisions entre agents, d’éviter les obstacles et même de se faufiler dans des espaces étroits.----------ABSTRACT The ever-growing hardware capabilities and the rapid development of robotic control and navigation technologies have led us to consider the control of an entire swarm of quadrotors. Drone-based solutions have been developed for different applications: forest inventory, coastal management, traÿc monitoring, etc... Among these, the Search And Rescue application represents for us a very promising field of application and constitutes the first motivation of our work. As a result, a wide literature review on the matter is provided. Nevertheless, this work focuses on the swarm control itself, and not on the end user application. First, a mathematical model of the quadrotor dynamics is presented and several digital control laws are designed. The latter provide operating modes useful for the navigation algorithms, namely: velocity control, position control and tracking control. Then, two original and complimentary swarming solutions are proposed. On the one hand, a swarming algorithm for outdoor navigation is developed. Unlike most of the works reviewed in the literature, our solution handles not only the maintenance but also the initialization of the formation. More specifically, an hexagonal formation pattern is intro-duced. Then, positions are optimally assigned using the Hungarian algorithm. Finally, the agents move to their assigned position while avoiding collisions with the other fleet members thanks to a navigation algorithm inspired from Artificial Potential Field. In addition, this solution accounts for realistic design constraints and was successfully integrated into already existing quadrotor onboard software. Software-In-The-Loop simulation results are provided. On the other hand, a swarming solution for indoor navigation is investigated. The proposed algorithm enforces a certain set of expected individual simple behaviors such that a large swarm can follow a leader through cluttered environments relying only on local information. Preliminary simulations are run and the results show that it is possible to operate a swarm of a hundred quadrotors with the proposed algorithm. In particular, the swarm is able to follow the leader, maintain connectivity, avoid collisions with the other agents, avoid obstacles, and even squeeze to pass through narrow spaces

Adaptive and learning-based formation control of swarm robots

Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation

Modeling and Simulation Methods of Neuronal Populations and Neuronal Networks

This thesis presents numerical methods and modeling related to simulating neurons. Two approaches to the simulation are taken: a population density approach and a neuronal network approach. The first two chapters present the results from the population density approach and its applications. The population density approach assumes that each neuron can be identified by its states (e.g., membrane potential, conductance of ion channels). Additionally, it assumes the population is large such that it can be approximated by a continuous population density distribution in the state space. By updating this population density, we can learn the macroscopic behavior of the population, such as the average firing rate and average membrane potential. The Population density approach avoids the need to simulate every single neuron when the population is large. While many previous population-density methods, such as the mean-field method, make further simplifications to the models, we developed the Asymmetric Particle Population Density (APPD) method to simulate the population density directly without the need to simplify the dynamics of the model. This enables us to simulate the macroscopic properties of coupled neuronal populations as accurately as a direct simulation. The APPD method tracks multiple asymmetric Gaussians as they advance in time due to a convection-diffusion equation, and our main theoretical innovation is deriving this update algorithm by tracking a level set. Tracking a single Gaussian is also applicable to the Bayesian filtering for continuous-discrete systems. By adding a measurement-update step, we reformulated our tracking method as the Level Set Kalman Filter(LSKF) method and find that it offers greater accuracy than state-of-the-art methods. Chapter IV presents the methods for direct simulation of a neuronal network. For this approach, the aim is to build a high-performance and expandable framework that can be used to simulate various neuronal networks. The implementation is done on GPUs using CUDA, and this framework enables simulation for millions of neurons on a high-performance desktop computer. Additionally, real-time visualization of neuron activities is implemented. Pairing with the simulation framework, a detailed mouse cortex model with experiment-determined morphology using the CUBIC-Atlas, and neuron connectome information from Allen's brain atlas is generated.PHDApplied and Interdisciplinary MathematicsUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/169840/1/nywang_1.pd