Received signal strength based bearing-only robot navigation in a sensor network field

pre-printThis paper presents a low-complexity, novel approach to wireless sensor network (WSN) assisted autonomous mobile robot (AMR) navigation. The goal is to have an AMR navigate to a target location using only the information inherent to WSNs, i.e., topology of the WSN and received signal strength (RSS) information, while executing an efficient navigation path. Here, the AMR has neither the location information for the WSN, nor any sophisticated ranging equipment for prior mapping. Two schemes are proposed utilizing particle filtering based bearing estimation with RSS values obtained from directional antennas. Real-world experiments demonstrate the effectiveness of the proposed schemes. In the basic node-to-node navigation scheme, the bearing-only particle filtering reduces trajectory length by 11.7% (indoors) and 15% (outdoors), when compared to using raw bearing measurements. The advanced scheme further reduces the trajectory length by 22.8% (indoors) and 19.8% (outdoors), as compared to the basic scheme. The mechanisms exploit the low-cost, low-complexity advantages of the WSNs to provide an effective method for map-less and ranging-less navigation

Resilient source seeking with robot swarms

We present a solution for locating the source, or maximum, of an unknown scalar field using a swarm of mobile robots. Unlike relying on the traditional gradient information, the swarm determines an ascending direction to approach the source with arbitrary precision. The ascending direction is calculated from measurements of the field strength at the robot locations and their relative positions concerning the centroid. Rather than focusing on individual robots, we focus the analysis on the density of robots per unit area to guarantee a more resilient swarm, i.e., the functionality remains even if individuals go missing or are misplaced during the mission. We reinforce the robustness of the algorithm by providing sufficient conditions for the swarm shape so that the ascending direction is almost parallel to the gradient. The swarm can respond to an unexpected environment by morphing its shape and exploiting the existence of multiple ascending directions. Finally, we validate our approach numerically with hundreds of robots. The fact that a large number of robots always calculate an ascending direction compensates for the loss of individuals and mitigates issues arising from the actuator and sensor noises.Comment: 7 pages, submitted to ICRA 202

Exploiting Heterogeneity in Networks of Aerial and Ground Robotic Agents

By taking advantage of complementary communication technologies, distinct sensing functionalities and varied motion dynamics present in a heterogeneous multi-robotic network, it is possible to accomplish a main mission objective by assigning specialized sub-tasks to specific members of a robotic team. An adequate selection of the team members and an effective coordination are some of the challenges to fully exploit the unique capabilities that these types of systems can offer. Motivated by real world applications, we focus on a multi-robotic network consisting off aerial and ground agents which has the potential to provide critical support to humans in complex settings. For instance, aerial robotic relays are capable of transporting small ground mobile sensors to expand the communication range and the situational awareness of first responders in hazardous environments. In the first part of this dissertation, we extend work on manipulation of cable-suspended loads using aerial robots by solving the problem of lifting the cable-suspended load from the ground before proceeding to transport it. Since the suspended load-quadrotor system experiences switching conditions during this critical maneuver, we define a hybrid system and show that it is differentially-flat. This property facilitates the design of a nonlinear controller which tracks a waypoint-based trajectory associated with the discrete states of the hybrid system. In addition, we address the case of unknown payload mass by combining a least-squares estimation method with the designed controller. Second, we focus on the coordination of a heterogeneous team formed by a group of ground mobile sensors and a flying communication router which is deployed to sense areas of interest in a cluttered environment. Using potential field methods, we propose a controller for the coordinated mobility of the team to guarantee inter-robot and obstacle collision avoidance as well as connectivity maintenance among the ground agents while the main goal of sensing is carried out. For the case of the aerial communications relays, we combine antenna diversity with reinforcement learning to dynamically re-locate these relays so that the received signal strength is maintained above a desired threshold. Motivated by the recent interest of combining radio frequency and optical wireless communications, we envision the implementation of an optical link between micro-scale aerial and ground robots. This type of link requires maintaining a sufficient relative transmitter-receiver position for reliable communications. In the third part of this thesis, we tackle this problem. Based on the link model, we define a connectivity cone where a minimum transmission rate is guaranteed. For example, the aerial robot has to track the ground vehicle to stay inside this cone. The control must be robust to noisy measurements. Thus, we use particle filters to obtain a better estimation of the receiver position and we design a control algorithm for the flying robot to enhance the transmission rate. Also, we consider the problem of pairing a ground sensor with an aerial vehicle, both equipped with a hybrid radio-frequency/optical wireless communication system. A challenge is positioning the flying robot within optical range when the sensor location is unknown. Thus, we take advantage of the hybrid communication scheme by developing a control strategy that uses the radio signal to guide the aerial platform to the ground sensor. Once the optical-based signal strength has achieved a certain threshold, the robot hovers within optical range. Finally, we investigate the problem of building an alliance of agents with different skills in order to satisfy the requirements imposed by a given task. We find this alliance, known also as a coalition, by using a bipartite graph in which edges represent the relation between agent capabilities and required resources for task execution. Using this graph, we build a coalition whose total capability resources can satisfy the task resource requirements. Also, we study the heterogeneity of the formed coalition to analyze how it is affected for instance by the amount of capability resources present in the agents

Progress toward multi‐robot reconnaissance and the MAGIC 2010 competition

Tasks like search‐and‐rescue and urban reconnaissance benefit from large numbers of robots working together, but high levels of autonomy are needed to reduce operator requirements to practical levels. Reducing the reliance of such systems on human operators presents a number of technical challenges, including automatic task allocation, global state and map estimation, robot perception, path planning, communications, and human‐robot interfaces. This paper describes our 14‐robot team, which won the MAGIC 2010 competition. It was designed to perform urban reconnaissance missions. In the paper, we describe a variety of autonomous systems that require minimal human effort to control a large number of autonomously exploring robots. Maintaining a consistent global map, which is essential for autonomous planning and for giving humans situational awareness, required the development of fast loop‐closing, map optimization, and communications algorithms. Key to our approach was a decoupled centralized planning architecture that allowed individual robots to execute tasks myopically, but whose behavior was coordinated centrally. We will describe technical contributions throughout our system that played a significant role in its performance. We will also present results from our system both from the competition and from subsequent quantitative evaluations, pointing out areas in which the system performed well and where interesting research problems remain. © 2012 Wiley Periodicals, Inc.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/93532/1/21426_ftp.pd

Propagation, Localization and Navigation in Tunnel-like Environments

La robótica de servicio, entendida como aquella destinada al uso de uno o varios robots con fines de, por ejemplo, vigilancia, rescate e inspecciones, ha ido tomando cada vez más relevancia en los últimos años. Debido a los grandes avances en las distintas áreas de la robótica, los robots han sido capaces de ejecutar satisfactoriamente tareas que resultan peligrosas o incluso imposibles para los humanos, en diversos entornos. Entre ellos, los entornos confinados como túneles, minas y tuberías, han atraído la atención en aplicaciones relacionadas con transporte ferroviario, redes vehiculares, búsqueda y rescate, y vigilancia, tanto en el ámbito civil como militar. En muchas tareas, la utilización de varios robots resulta más provechoso que utilizar sólo uno. Para cooperar, los robots deben intercambiar información sobre el entorno y su propio estado, por lo que la comunicación entre ellos resulta crucial. Debido a la imposibilidad de utilizar redes cableadas entre robots móviles, se despliegan redes inalámbricas. Para determinar la calidad de señal entre dos robots, inicialmente se utilizaban modelos de propagación basados únicamente en la distancia entre ellos. Sin embargo, estas predicciones sólo resultan útiles en exteriores y sin la presencia de obstáculos, que sólo componen una pequeña parte de los escenarios de la robótica de servicio. Mas aún, la naturaleza altamente multi-trayecto de la propagación electromagnética en túneles hace que éstos actúen como guías de onda para cierto rango de frecuencias, extendiendo considerablemente el alcance de comunicación en comparación con entornos exteriores. Sin embargo, la señal se ve afectada con profundos desvanecimientos (llamados fadings en inglés). Esto los convierte en un reto para la robótica que considera la comunicación entre robots como fundamental. Además, la naturaleza hostil de estos entornos, así como también la falta de características visuales y estructurales, dificultan la localización en estos escenarios, cuestión que resulta fundamental para ejecutar con éxito una tarea con un robot. Los métodos de localización utilizados en interiores, como aquellos basados en SLAM visual, resultan imprecisos por la falta de características distintivas para cámaras o lásers, mientras que los sensores utilizados en exteriores, como el GPS, no funcionan dentro de túneles o tuberías. En esta tesis abordamos problemas fundamentales para la robótica con el fin de proporcionar herramientas necesarias para la exploración con robots en entornos tipo túnel, manteniendo la conectividad de la red de comunicaciones formada por varios robots y una estación base. Para ello, primeramente caracterizamos, en términos de propagación, los dos escenarios tipo túnel más comunes: un túnel de hormigón y una tubería metálica. Hacemos énfasis en el fenómeno de los fadings, ya que son el problema más importante a considerar para mantener la comunicación. Posteriormente presentamos una estrategia de navegación para desplegar un equipo de robots en un túnel, lidiando con los fadings para mantener la conectividad de la red formada por los robots. Esta estrategia ha sido validada a través de numerosos experimentos realizados en un túnel real, el túnel de Somport. Luego, abordamos el problema de la localización, proponiendo e implementando una técnica que permite estimar la posición de un robot dentro de una tubería, basada en la periodicidad de los fadings. El método es validado a través de experimentos reales en tuberías de pequeña y grandes dimensiones. Finalmente, proponemos esquemas de diversidad espacial, de forma que se facilita la navegación mientras se mejora la localización.Deploying a team of robots for search and rescue, inspection, or surveillance, has increasingly gained attention in the last years. As a result of the advances in several areas of robotics, robots have been able to successfully execute tasks that are hazardous or even impossible for humans in a variety of scenarios, such as outdoors, indoors, or even underground. Among these scenarios, tunnel-like environments (such as tunnels, mines, or pipes) have attracted attention for train applications, vehicular networks, search and rescue, and even service and surveillance missions in both military and civilian contexts. In most of the tasks, utilizing a multi-robot team yields better results than a singlerobot system, as it makes the system more robust while reducing the time required to complete tasks. In order to cooperate, robots must exchange information about their current state and the surrounding environment, making communication between them a crucial task. However, due to the mobile nature of robots used for exploration, a wired architecture is not possible nor convenient. Instead, a wireless network is often deployed. Wireless propagation in tunnel-like environments, characterized for the presence of strong fading phenomena, differs from regular indoor and outdoor scenarios, posing multiple challenges for communication-aware robotics. In addition, accurate localization is a problem in environments such as tunnels or pipes. These environments generally lack distinctive visual and/or structural features and are longer than they are wide in shape. Standard indoor localization techniques do not perform well in pipelines or tunnels given the lack of exploitable features, while outdoor techniques (GPS in particular) do not work in these scenarios. In this thesis, we address basic robotics-related problems in order to provide some tools necessary for robotics exploration in tunnel-like scenarios under connectivity constraints. In the first part, we characterize, in terms of propagation, two of the most common tunnel-like environments: a pipe and a tunnel. We emphasize the spatial-fadings phenomena, as it is one of the most relevant issues to deal with, in a communications context. Secondly, we present a navigation strategy to deploy a team of robots for tunnel exploration, in particular maintaining network connectivity in the presence of these fadings. Several experiments conducted in a tunnel allow us to validate the connectivity maintenance of the system. Next, we address the localization problem and propose a technique that uses the periodicity of the fadings to estimate the position of the robots from the base station. The method is validated in small-scale and large-scale pipes. Finally, we propose spatial diversity schemes in order to ease the navigation while improving the localization

Sampling-Based Exploration Strategies for Mobile Robot Autonomy

A novel, sampling-based exploration strategy is introduced for Unmanned Ground Vehicles (UGV) to efficiently map large GPS-deprived underground environments. It is compared to state-of-the-art approaches and performs on a similar level, while it is not designed for a specific robot or sensor configuration like the other approaches. The introduced exploration strategy, which is called Random-Sampling-Based Next-Best View Exploration (RNE), uses a Rapidly-exploring Random Graph (RRG) to find possible view points in an area around the robot. They are compared with a computation-efficient Sparse Ray Polling (SRP) in a voxel grid to find the next-best view for the exploration. Each node in the exploration graph built with RRG is evaluated regarding the ability of the UGV to traverse it, which is derived from an occupancy grid map. It is also used to create a topology-based graph where nodes are placed centrally to reduce the risk of collisions and increase the amount of observable space. Nodes that fall outside the local exploration area are stored in a global graph and are connected with a Traveling Salesman Problem solver to explore them later