Distributed Algorithms for Stochastic Source Seeking With Mobile Robot Networks

Autonomous robot networks are an effective tool for monitoring large-scale environmental fields. This paper proposes distributed control strategies for localizing the source of a noisy signal, which could represent a physical quantity of interest such as magnetic force, heat, radio signal, or chemical concentration. We develop algorithms specific to two scenarios: one in which the sensors have a precise model of the signal formation process and one in which a signal model is not available. In the model-free scenario, a team of sensors is used to follow a stochastic gradient of the signal field. Our approach is distributed, robust to deformations in the group geometry, does not necessitate global localization, and is guaranteed to lead the sensors to a neighborhood of a local maximum of the field. In the model-based scenario, the sensors follow a stochastic gradient of the mutual information (MI) between their expected measurements and the expected source location in a distributed manner. The performance is demonstrated in simulation using a robot sensor network to localize the source of a wireless radio signal

Particle Swarm Optimization Based Source Seeking

Signal source seeking using autonomous vehicles is a complex problem. The complexity increases manifold when signal intensities captured by physical sensors onboard are noisy and unreliable. Added to the fact that signal strength decays with distance, noisy environments make it extremely difficult to describe and model a decay function. This paper addresses our work with seeking maximum signal strength in a continuous electromagnetic signal source with mobile robots, using Particle Swarm Optimization (PSO). A one to one correspondence with swarm members in a PSO and physical Mobile robots is established and the positions of the robots are iteratively updated as the PSO algorithm proceeds forward. Since physical robots are responsive to swarm position updates, modifications were required to implement the interaction between real robots and the PSO algorithm. The development of modifications necessary to implement PSO on mobile robots, and strategies to adapt to real life environments such as obstacles and collision objects are presented in this paper. Our findings are also validated using experimental testbeds.Comment: 13 pages, 12 figure

Collision Free Navigation of a Multi-Robot Team for Intruder Interception

In this report, we propose a decentralised motion control algorithm for the mobile robots to intercept an intruder entering (k-intercepting) or escaping (e-intercepting) a protected region. In continuation, we propose a decentralized navigation strategy (dynamic-intercepting) for a multi-robot team known as predators to intercept the intruders or in the other words, preys, from escaping a siege ring which is created by the predators. A necessary and sufficient condition for the existence of a solution of this problem is obtained. Furthermore, we propose an intelligent game-based decision-making algorithm (IGD) for a fleet of mobile robots to maximize the probability of detection in a bounded region. We prove that the proposed decentralised cooperative and non-cooperative game-based decision-making algorithm enables each robot to make the best decision to choose the shortest path with minimum local information. Then we propose a leader-follower based collision-free navigation control method for a fleet of mobile robots to traverse an unknown cluttered environment where is occupied by multiple obstacles to trap a target. We prove that each individual team member is able to traverse safely in the region, which is cluttered by many obstacles with any shapes to trap the target while using the sensors in some indefinite switching points and not continuously, which leads to saving energy consumption and increasing the battery life of the robots consequently. And finally, we propose a novel navigation strategy for a unicycle mobile robot in a cluttered area with moving obstacles based on virtual field force algorithm. The mathematical proof of the navigation laws and the computer simulations are provided to confirm the validity, robustness, and reliability of the proposed methods

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

Autonomous Behaviors With A Legged Robot

Over the last ten years, technological advancements in sensory, motor, and computational capabilities have made it a real possibility for a legged robotic platform to traverse a diverse set of terrains and execute a variety of tasks on its own, with little to no outside intervention. However, there are still several technical challenges to be addressed in order to reach complete autonomy, where such a platform operates as an independent entity that communicates and cooperates with other intelligent systems, including humans. A central limitation for reaching this ultimate goal is modeling the world in which the robot is operating, the tasks it needs to execute, the sensors it is equipped with, and its level of mobility, all in a unified setting. This thesis presents a simple approach resulting in control strategies that are backed by a suite of formal correctness guarantees. We showcase the virtues of this approach via implementation of two behaviors on a legged mobile platform, autonomous natural terrain ascent and indoor multi-flight stairwell ascent, where we report on an extensive set of experiments demonstrating their empirical success. Lastly, we explore how to deal with violations to these models, specifically the robot\u27s environment, where we present two possible extensions with potential performance improvements under such conditions

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

Hybrid Feedback for Autonomous Navigation in Environments with Arbitrary Non-Convex Obstacles

We develop an autonomous navigation algorithm for a robot operating in two-dimensional environments containing obstacles, with arbitrary non-convex shapes, which can be in close proximity with each other, as long as there exists at least one safe path connecting the initial and the target location. The proposed navigation approach relies on a hybrid feedback to guarantee global asymptotic stabilization of the robot towards a predefined target location while ensuring the forward invariance of the obstacle-free workspace. The proposed hybrid feedback controller guarantees Zeno-free switching between the move-to-target mode and the obstacle-avoidance mode based on the proximity of the robot with respect to the obstacle-occupied workspace. An instrumental transformation that reshapes (virtually) the non-convex obstacles, in a non-conservative manner, is introduced to facilitate the design of the obstacle-avoidance strategy. Finally, we provide an algorithmic procedure for the sensor-based implementation of the proposed hybrid controller and validate its effectiveness through simulation results.Comment: arXiv admin note: text overlap with arXiv:2111.0938