Adoption of vehicular ad hoc networking protocols by networked robots

This paper focuses on the utilization of wireless networking in the robotics domain. Many researchers have already equipped their robots with wireless communication capabilities, stimulated by the observation that multi-robot systems tend to have several advantages over their single-robot counterparts. Typically, this integration of wireless communication is tackled in a quite pragmatic manner, only a few authors presented novel Robotic Ad Hoc Network (RANET) protocols that were designed specifically with robotic use cases in mind. This is in sharp contrast with the domain of vehicular ad hoc networks (VANET). This observation is the starting point of this paper. If the results of previous efforts focusing on VANET protocols could be reused in the RANET domain, this could lead to rapid progress in the field of networked robots. To investigate this possibility, this paper provides a thorough overview of the related work in the domain of robotic and vehicular ad hoc networks. Based on this information, an exhaustive list of requirements is defined for both types. It is concluded that the most significant difference lies in the fact that VANET protocols are oriented towards low throughput messaging, while RANET protocols have to support high throughput media streaming as well. Although not always with equal importance, all other defined requirements are valid for both protocols. This leads to the conclusion that cross-fertilization between them is an appealing approach for future RANET research. To support such developments, this paper concludes with the definition of an appropriate working plan

Mission-based mobility models for UAV networks

Las redes UAV han atraído la atención de los investigadores durante la última década. Las numerosas posibilidades que ofrecen los sistemas single-UAV aumentan considerablemente al usar múltiples UAV. Sin embargo, el gran potencial del sistema multi-UAV viene con un precio: la complejidad de controlar todos los aspectos necesarios para garantizar que los UAVs cumplen la misión que se les ha asignado. Ha habido numerosas investigaciones dedicadas a los sistemas multi-UAV en el campo de la robótica en las cuales se han utilizado grupos de UAVs para diferentes aplicaciones. Sin embargo, los aspectos relacionados con la red que forman estos sistemas han comenzado a reclamar un lugar entre la comunidad de investigación y han hecho que las redes de UAVs se consideren como un nuevo paradigma entre las redes multi-salto. La investigación de redes de UAVs, de manera similar a otras redes multi-salto, se divide principalmente en dos categorías: i) modelos de movilidad que capturan la movilidad de la red, y ii) algoritmos de enrutamiento. Ambas categorías han heredado muchos algoritmos que pertenecían a las redes MANET, que fueron el primer paradigma de redes multi-salto que atrajo la atención de los investigadores. Aunque hay esfuerzos de investigación en curso que proponen soluciones para ambas categorías, el número de modelos de movilidad y algoritmos de enrutamiento específicos para redes UAV es limitado. Además, en el caso de los modelos de movilidad, las soluciones existentes propuestas son simplistas y apenas representan la movilidad real de un equipo de UAVs, los cuales se utilizan principalmente en operaciones orientadas a misiones, en la que cada UAV tiene asignados movimientos específicos. Esta tesis propone dos modelos de movilidad basados en misiones para una red de UAVs que realiza dos operaciones diferentes. El escenario elegido en el que se desarrollan las misiones corresponde con una región en la que ha ocurrido, por ejemplo, un desastre natural. La elección de este tipo de escenario se debe a que en zonas de desastre, la infraestructura de comunicaciones comúnmente está dañada o totalmente destruida. En este tipo de situaciones, una red de UAVs ofrece la posibilidad de desplegar rápidamente una red de comunicaciones. El primer modelo de movilidad, llamado dPSO-U, ha sido diseñado para capturar la movilidad de una red UAV en una misión con dos objetivos principales: i) explorar el área del escenario para descubrir las ubicaciones de los nodos terrestres, y ii) hacer que los UAVs converjan de manera autónoma a los grupos en los que se organizan los nodos terrestres (también conocidos como clusters). El modelo de movilidad dPSO-U se basa en el conocido algoritmo particle swarm optimization (PSO), considerando los UAV como las partículas del algoritmo, y también utilizando el concepto de valores dinámicos para la inercia, el local best y el neighbour best de manera que el modelo de movilidad tenga ambas capacidades: la de exploración y la de convergencia. El segundo modelo, denominado modelo de movilidad Jaccard-based, captura la movilidad de una red UAV que tiene asignada la misión de proporcionar servicios de comunicación inalámbrica en un escenario de mediano tamaño. En este modelo de movilidad se ha utilizado una combinación del virtual forces algorithm (VFA), de la distancia Jaccard entre cada par de UAVs y metaheurísticas como hill climbing y simulated annealing, para cumplir los dos objetivos de la misión: i) maximizar el número de nodos terrestres (víctimas) que se encuentran bajo el área de cobertura inalámbrica de la red UAV, y ii) mantener la red UAV como una red conectada, es decir, evitando las desconexiones entre UAV. Se han realizado simulaciones exhaustivas con herramientas software específicamente desarrolladas para los modelos de movilidad propuestos. También se ha definido un conjunto de métricas para cada modelo de movilidad. Estas métricas se han utilizado para validar la capacidad de los modelos de movilidad propuestos de emular los movimientos de una red UAV en cada misión.UAV networks have attracted the attention of the research community in the last decade. The numerous capabilities of single-UAV systems increase considerably by using multiple UAVs. The great potential of a multi-UAV system comes with a price though: the complexity of controlling all the aspects required to guarantee that the UAV team accomplish the mission that it has been assigned. There have been numerous research works devoted to multi-UAV systems in the field of robotics using UAV teams for different applications. However, the networking aspects of multi-UAV systems started to claim a place among the research community and have made UAV networks to be considered as a new paradigm among the multihop ad hoc networks. UAV networks research, in a similar manner to other multihop ad hoc networks, is mainly divided into two categories: i) mobility models that capture the network mobility, and ii) routing algorithms. Both categories have inherited previous algorithms mechanisms that originally belong to MANETs, being these the first multihop networking paradigm attracting the attention of researchers. Although there are ongoing research efforts proposing solutions for the aforementioned categories, the number of UAV networks-specific mobility models and routing algorithms is limited. In addition, in the case of the mobility models, the existing solutions proposed are simplistic and barely represent the real mobility of a UAV team, which are mainly used in missions-oriented operations. This thesis proposes two mission-based mobility models for a UAV network carrying out two different operations over a disaster-like scenario. The reason for selecting a disaster scenario is because, usually, the common communication infrastructure is malfunctioning or completely destroyed. In these cases, a UAV network allows building a support communication network which is rapidly deployed. The first mobility model, called dPSO-U, has been designed for capturing the mobility of a UAV network in a mission with two main objectives: i) exploring the scenario area for discovering the location of ground nodes, and ii) making the UAVs to autonomously converge to the groups in which the nodes are organized (also referred to as clusters). The dPSO-U mobility model is based on the well-known particle swarm optimization algorithm (PSO), considering the UAVs as the particles of the algorithm, and also using the concept of dynamic inertia, local best and neighbour best weights so the mobility model can have both abilities: exploration and convergence. The second one, called Jaccard-based mobility model, captures the mobility of a UAV network that has been assigned with the mission of providing wireless communication services in a medium-scale scenario. A combination of the virtual forces algorithm (VFA), the Jaccard distance between each pair of UAVs and metaheuristics such as hill climbing or simulated annealing have been used in this mobility model in order to meet the two mission objectives: i) to maximize the number of ground nodes (i.e. victims) under the UAV network wireless coverage area, and ii) to maintain the UAV network as a connected network, i.e. avoiding UAV disconnections. Extensive simulations have been performed with software tools that have been specifically developed for the proposed mobility models. Also, a set of metrics have been defined and measured for each mobility model. These metrics have been used for validating the ability of the proposed mobility models to emulate the movements of a UAV network in each mission

Flying real-time network to coordinate disaster relief activities in urban areas

While there have been important advances within wireless communication technology, the provision of communication support during disaster relief activities remains an open issue. The literature in disaster research reports several major restrictions to conducting first response activities in urban areas, given the limitations of telephone networks and radio systems to provide digital communication in the field. In search-and-rescue operations, the communication requirements are increased, since the first responders need to rely on real-time and reliable communication to perform their activities and coordinate their efforts with other teams. Therefore, these limitations open the door to improvisation during disaster relief efforts. In this paper, we argue that flying ad-hoc networks can provide the communication support needed in these scenarios, and propose a new solution towards that goal. The proposal involves the use of flying witness units, implemented using drones, that act as communication gateways between first responders working at different locations of the affected area. The proposal is named the Flying Real-Time Network, and its feasibility to provide communication in a disaster scenario is shown by presenting both a real-time schedulability analysis of message delivery, as well as simulations of the communication support in a physical scenario inspired by a real incident. The obtained results were highly positive and consistent, therefore this proposal represents a step forward towards the solution of this open issuePeer ReviewedPostprint (published version

Self-management Framework for Mobile Autonomous Systems

The advent of mobile and ubiquitous systems has enabled the development of autonomous systems such as wireless-sensors for environmental data collection and teams of collaborating Unmanned Autonomous Vehicles (UAVs) used in missions unsuitable for humans. However, with these range of new application domains comes a new challenge – enabling self-management in mobile autonomous systems. The primary challenge in using autonomous systems for real-life missions is shifting the burden of management from humans to these systems themselves without loss of the ability to adapt to failures, changes in context, and changing user requirements. Autonomous systems have to be able to manage themselves individually as well as to form self-managing teams that are able to recover or adapt to failures, protect themselves from attacks and optimise performance. This thesis proposes a novel distributed policy-based framework that enables autonomous systems to perform self management individually and as a team. The framework allows missions to be specified in terms of roles in an adaptable and reusable way, enables dynamic and secure team formation with a utility-based approach for optimal role assignment, caters for communication link maintenance among team members and recovery from failure. Adaptive management is achieved by employing an architecture that uses policy-based techniques to allow dynamic modification of the management strategy relating to resources, role behaviour, team and communications management, without reloading the basic software within the system. Evaluation of the framework shows that it is scalable with respect to the number of roles, and consequently the number of autonomous systems participating in the mission. It is also shown to be optimal with respect to role assignments, and robust to intermittent communication link disconnections and permanent team-member failures. The prototype implementation was tested on mobile robots as a proof-ofconcept demonstration

Enabling Large-scale Heterogeneous Collaboration with Opportunistic Communications

Multi-robot collaboration in large-scale environments with limited-sized teams and without external infrastructure is challenging, since the software framework required to support complex tasks must be robust to unreliable and intermittent communication links. In this work, we present MOCHA (Multi-robot Opportunistic Communication for Heterogeneous Collaboration), a framework for resilient multi-robot collaboration that enables large-scale exploration in the absence of continuous communications. MOCHA is based on a gossip communication protocol that allows robots to interact opportunistically whenever communication links are available, propagating information on a peer-to-peer basis. We demonstrate the performance of MOCHA through real-world experiments with commercial-off-the-shelf (COTS) communication hardware. We further explore the system's scalability in simulation, evaluating the performance of our approach as the number of robots increases and communication ranges vary. Finally, we demonstrate how MOCHA can be tightly integrated with the planning stack of autonomous robots. We show a communication-aware planning algorithm for a high-altitude aerial robot executing a collaborative task while maximizing the amount of information shared with ground robots. The source code for MOCHA and the high-altitude UAV planning system is available open source: http://github.com/KumarRobotics/MOCHA, http://github.com/KumarRobotics/air_router.Comment: 7 pages, 8 figure