Mobile robotic network deployment for intruder detection and tracking

This thesis investigates the problem of intruder detection and tracking using mobile robotic networks. In the first part of the thesis, we consider the problem of seeking an electromagnetic source using a team of robots that measure the local intensity of the emitted signal. We propose a planner for a team of robots based on Particle Swarm Optimization (PSO) which is a population based stochastic optimization technique. An equivalence is established between particles generated in the traditional PSO technique, and the mobile agents in the swarm. Since the positions of the robots are updated using the PSO algorithm, modifications are required to implement the PSO algorithm on real robots to incorporate collision avoidance strategies. The modifications necessary to implement PSO on mobile robots, and strategies to adapt to real environments are presented in this thesis. Our results are also validated on an experimental testbed. In the second part, we present a game theoretic framework for visibility-based target tracking in multi-robot teams. A team of observers (pursuers) and a team of targets (evaders) are present in an environment with obstacles. The objective of the team of observers is to track the team of targets for the maximum possible time. While the objective of the team of targets is to escape (break line-of-sight) in the minimum time. We decompose the problem into two layers. At the upper level, each pursuer is allocated to an evader through a minimum cost allocation strategy based on the risk of each evader, thereby, decomposing the agents into multiple single pursuer-single evader pairs. Two decentralized allocation strategies are proposed and implemented in this thesis. At the lower level, each pursuer computes its strategy based on the results of the single pursuer-single evader target-tracking problem. We initially address this problem in an environment containing a semi-infinite obstacle with one corner. The pursuer\u27s optimal tracking strategy is obtained regardless of the evader\u27s strategy using techniques from optimal control theory and differential games. Next, we extend the result to an environment containing multiple polygonal obstacles. We construct a pursuit field to provide a guiding vector for the pursuer which is a weighted sum of several component vectors. The performance of different combinations of component vectors is investigated. Finally, we extend our work to address the case when the obstacles are not polygonal, and the observers have constraints in motion

New Game-Theoretic Convolutional Neural Network Applied for the Multi-Pursuer Multi-Evader Game

Pursuit-Evasion Game (PEG) can be defined as a set of agents known as pursuers, which cooperate with the aim forming dynamic coalitions to capture dynamic evader agents, while the evaders try to avoid this capture by moving in the environment according to specific velocities. The factor of capturing time was treated by various studies before, but remain the powerful tools used to satisfy this factor object of research. To improve the capturing time factor we proposed in this work a novel online decentralized coalition formation algorithm equipped with Convolutional Neural Network (CNN) and based on the Iterated Elimination of Dominated Strategies (IEDS). The coalition is formed such that the pursuer should learn at each iteration the approximator formation achieving the capture in the shortest time. The pursuer’s learning process depends on the features extracted by CNN at each iteration. The proposed supervised technique is compared through simulation, with the IEDS algorithm, AGR algorithm. Simulation results show that the proposed learning technique outperform the IEDS algorithm and the AGR algorithm with respect to the learning time which represents an important factor in a chasing game

Analysis of multi-agent systems under varying degrees of trust, cooperation, and competition

Multi-agent systems rely heavily on coordination and cooperation to achieve a variety of tasks. It is often assumed that these agents will be fully cooperative, or have reliable and equal performance among group members. Instead, we consider cooperation as a spectrum of possible interactions, ranging from performance variations within the group to adversarial agents. This thesis examines several scenarios where cooperation and performance are not guaranteed. Potential applications include sensor coverage, emergency response, wildlife management, tracking, and surveillance. We use geometric methods, such as Voronoi tessellations, for design insight and Lyapunov-based stability theory to analyze our proposed controllers. Performance is verified through simulations and experiments on a variety of ground and aerial robotic platforms. First, we consider the problem of Voronoi-based coverage control, where a group of robots must spread out over an environment to provide coverage. Our approach adapts online to sensing and actuation performance variations with the group. The robots have no prior knowledge of their relative performance, and in a distributed fashion, compensate by assigning weaker robots a smaller portion of the environment. Next, we consider the problem of multi-agent herding, akin to shepherding. Here, a group of dog-like robots must drive a herd of non-cooperative sheep-like agents around the environment. Our key insight in designing the control laws for the herders is to enforce geometrical relationships that allow for the combined system dynamics to reduce to a single nonholonomic vehicle. We also investigate the cooperative pursuit of an evader by a group of quadrotors in an environment with no-fly zones. While the pursuers cannot enter the no-fly zones, the evader moves freely through the zones to avoid capture. Using tools for Voronoi-based coverage control, we provide an algorithm to distribute the pursuers around the zone's boundary and minimize capture time once the evader emerges. Finally, we present an algorithm for the guaranteed capture of multiple evaders by one or more pursuers in a bounded, convex environment. The pursuers utilize properties of the evader's Voronoi cell to choose a control strategy that minimizes the safe-reachable area of the evader, which in turn leads to the evader's capture

Advanced Mobile Robotics: Volume 3

Mobile robotics is a challenging field with great potential. It covers disciplines including electrical engineering, mechanical engineering, computer science, cognitive science, and social science. It is essential to the design of automated robots, in combination with artificial intelligence, vision, and sensor technologies. Mobile robots are widely used for surveillance, guidance, transportation and entertainment tasks, as well as medical applications. This Special Issue intends to concentrate on recent developments concerning mobile robots and the research surrounding them to enhance studies on the fundamental problems observed in the robots. Various multidisciplinary approaches and integrative contributions including navigation, learning and adaptation, networked system, biologically inspired robots and cognitive methods are welcome contributions to this Special Issue, both from a research and an application perspective