UAV/UGV Autonomous Cooperation: UAV Assists UGV to Climb a Cliff by Attaching a Tether

This paper proposes a novel cooperative system for an Unmanned Aerial Vehicle (UAV) and an Unmanned Ground Vehicle (UGV) which utilizes the UAV not only as a flying sensor but also as a tether attachment device. Two robots are connected with a tether, allowing the UAV to anchor the tether to a structure located at the top of a steep terrain, impossible to reach for UGVs. Thus, enhancing the poor traversability of the UGV by not only providing a wider range of scanning and mapping from the air, but also by allowing the UGV to climb steep terrains with the winding of the tether. In addition, we present an autonomous framework for the collaborative navigation and tether attachment in an unknown environment. The UAV employs visual inertial navigation with 3D voxel mapping and obstacle avoidance planning. The UGV makes use of the voxel map and generates an elevation map to execute path planning based on a traversability analysis. Furthermore, we compared the pros and cons of possible methods for the tether anchoring from multiple points of view. To increase the probability of successful anchoring, we evaluated the anchoring strategy with an experiment. Finally, the feasibility and capability of our proposed system were demonstrated by an autonomous mission experiment in the field with an obstacle and a cliff.Comment: 7 pages, 8 figures, accepted to 2019 International Conference on Robotics & Automation. Video: https://youtu.be/UzTT8Ckjz1

Cooperation of unmanned systems for agricultural applications: A case study in a vineyard

Fully-autonomous vehicles, both aerial and ground, could provide great benefits in the Agriculture 4.0 framework when operating within cooperative architectures, thanks to their ability to tackle difficult tasks, particularly within complex irregular and unstructured scenarios such as vineyards on sloped terrains. A decentralised multi-phase approach has been proposed as an alternative to more common cooperative schemes. When perennial crops are considered, it is advantageous to build a simplified geometrical (and georeferenced) crops model, which can be identified by using 3D point clouds acquired during apriori explorative missions by unmanned aerial vehicles. This model can be used to plan the tasks to be performed within the crops by the in-field aerial and ground drones. In this companion paper, the proposed strategy is applied to a specific case study involving a vineyard on a sloped terrain, located in the Barolo region in Piedmont, Italy. Ad-hoc technologies and guidance, navigation and control algorithms were designed and implemented. The main objectives were to improve the autonomous driving capabilities of the drones involved and to automate the process of retrieving low-complexity maps from the data collected with preliminary remote sensing missions to make them available for the autonomous navigation by a quadrotor and an unmanned 4-wheel steering ground vehicle within the vine rows. Preliminary results highlight the benefits achievable by exploiting the tailored technologies selected and applied to improve each of the analysed mission phases

Dynamic Resource Allocation for Efficient Sharing of Services from Heterogeneous Autonomous Vehicles

A novel dynamic resource allocation model is introduced for efficient sharing of services provided by ad hoc assemblies of heterogeneous autonomous vehicles. A key contribution is the provision of capability to dynamically select sensors and platforms within constraints imposed by time dependencies, refueling, and transportation services. The problem is modeled as a connected network of nodes and formulated as an integer linear program. Solution fitness is prioritized over computation time. Simulation results of an illustrative scenario are used to demonstrate the ability of the model to plan for sensor selection, refueling, collaboration, and cooperation between heterogeneous resources. Prioritization of operational cost leads to missions that use cheaper resources but take longer to complete. Prioritization of completion time leads to shorter missions at the expense of increased overall resource cost. Missions can be successfully replanned through dynamic reallocation of new requests during a mission. Monte Carlo studies on systems of increasing complexity show that good solutions can be obtained using low time resolutions, with small time windows at a relatively low computational cost. In comparison with other approaches, the developed integer linear program model provides best solutions at the expense of longer computation time

Cooperation of unmanned systems for agricultural applications: A theoretical framework

Agriculture 4.0 comprises a set of technologies that combines sensors, information systems, enhanced machinery, and informed management with the objective of optimising production by accounting for variabilities and uncertainties within agricultural systems. Autonomous ground and aerial vehicles can lead to favourable improvements in management by performing in-field tasks in a time-effective way. In particular, greater benefits can be achieved by allowing cooperation and collaborative action among unmanned vehicles, both aerial and ground, to perform in-field operations in precise and time-effective ways. In this work, the preliminary and crucial step of analysing and understanding the technical and methodological challenges concerning the main problems involved is performed. An overview of the agricultural scenarios that can benefit from using collaborative machines and the corresponding cooperative schemes typically adopted in this framework are presented. A collection of kinematic and dynamic models for different categories of autonomous aerial and ground vehicles is provided, which represents a crucial step in understanding the vehicles behaviour when full autonomy is desired. Last, a collection of the state-of-the-art technologies for the autonomous guidance of drones is provided, summarising their peculiar characteristics, and highlighting their advantages and shortcomings with a specific focus on the Agriculture 4.0 framework. A companion paper reports the application of some of these techniques in a complete case study in sloped vineyards, applying the proposed multi-phase collaborative scheme introduced here

Architecture for planning and execution of missions with fleets of unmanned vehicles

Esta tesis presenta contribuciones en el campo de la planificación automática y la programación de tareas, la rama de la inteligencia artificial que se ocupa de la realización de estrategias o secuencias de acciones típicamente para su ejecución por parte de vehículos no tripulados, robots autónomos y/o agentes inteligentes. Cuando se intenta alcanzar un objetivo determinado, la cooperación puede ser un aspecto clave. La complejidad de algunas tareas requiere la cooperación entre varios agentes. Mas aún, incluso si una tarea es lo suficientemente simple para ser llevada a cabo por un único agente, puede usarse la cooperación para reducir el coste total de la misma. Para realizar tareas complejas que requieren interacción física con el mundo real, los vehículos no tripulados pueden ser usados como agentes. En los últimos años se han creado y utilizado una gran diversidad de plataformas no tripuladas, principalmente vehículos que pueden ser dirigidos sin un humano a bordo, tanto en misiones civiles como militares. En esta tesis se aborda la aplicación de planificación simbólica de redes jerárquicas de tareas (HTN planning, por sus siglas en inglés) en la resolución de problemas de enrutamiento de vehículos (VRP, por sus siglas en inglés) [18], en dominios que implican múltiples vehículos no tripulados de capacidades heterogéneas que deben cooperar para alcanzar una serie de objetivos específicos. La planificación con redes jerárquicas de tareas describe dominios utilizando una descripción que descompone conjuntos de tareas en subconjuntos más pequeños de subtareas gradualmente, hasta obtener tareas del más bajo nivel que no pueden ser descompuestas y se consideran directamente ejecutables. Esta jerarquía es similar al modo en que los humanos razonan sobre los problemas, descomponiéndolos en subproblemas según el contexto, y por lo tanto suelen ser fáciles de comprender y diseñar. Los problemas de enrutamiento de vehículos son una generalización del problema del viajante (TSP, por sus siglas en inglés). La resolución del problema del viajante consiste en encontrar la ruta más corta posible que permite visitar una lista de ciudades, partiendo y acabando en la misma ciudad. Su generalización, el problema de enrutamiento de vehículos, consiste en encontrar el conjunto de rutas de longitud mínima que permite cubrir todas las ciudades con un determinado número de vehículos. Ambos problemas cuentan con una fuerte componente combinatoria para su resolución, especialmente en el caso del VRP, por lo que su presencia en dominios que van a ser tratados con un planificador HTN clásico supone un gran reto. Para la aplicación de un planificador HTN en la resolución de problemas de enrutamiento de vehículos desarrollamos dos métodos. En el primero de ellos presentamos un sistema de optimización de soluciones basado en puntuaciones, que nos permite una nueva forma de conexión entre un software especializado en la resolución del VRP con el planificador HTN. Llamamos a este modo de conexión el método desacoplado, puesto que resolvemos la componente combinatoria del problema de enrutamiento de vehículos mediante un solucionador específico que se comunica con el planificador HTN y le suministra la información necesaria para continuar con la descomposición de tareas. El segundo método consiste en mejorar el planificador HTN utilizado para que sea capaz de resolver el problema de enrutamiento de vehículos de la mejor forma posible sin tener que depender de módulos de software externos. Llamamos a este modo el método acoplado. Con este motivo hemos desarrollado un nuevo planificador HTN que utiliza un algoritmo de búsqueda distinto del que se utiliza normalmente en planificadores de este tipo. Esta tesis presenta nuevas contribuciones en el campo de la planificación con redes jerárquicas de tareas para la resolución de problemas de enrutamiento de vehículos. Se aplica una nueva forma de conexión entre dos planificadores independientes basada en un sistema de cálculo de puntuaciones que les permite colaborar en la optimización de soluciones, y se presenta un nuevo planificador HTN con un algoritmo de búsqueda distinto al comúnmente utilizado. Se muestra la aplicación de estos dos métodos en misiones civiles dentro del entorno de los Proyectos ARCAS y AEROARMS financiados por la Comisión Europea y se presentan extensos resultados de simulación para comprobar la validez de los dos métodos propuestos.This thesis presents contributions in the field of automated planning and scheduling, the branch of artificial intelligence that concerns the realization of strategies or action sequences typically for execution by unmanned vehicles, autonomous robots and/or intelligent agents. When trying to achieve certain goal, cooperation may be a key aspect. The complexity of some tasks requires the cooperation among several agents. Moreover, even if the task is simple enough to be carried out by a single agent, cooperation can be used to decrease the overall cost of the operation. To perform complex tasks that require physical interaction with the real world, unmanned vehicles can be used as agents. In the last years a great variety of unmanned platforms, mainly vehicles that can be driven without a human on board, have been developed and used both in civil and military missions. This thesis deals with the application of Hierarchical Task Network (HTN) planning in the resolution of vehicle routing problems (VRP) [18] in domains involving multiple heterogeneous unmanned vehicles that must cooperate to achieve specific goals. HTN planning describes problem domains using a description that decomposes set of tasks into subsets of smaller tasks and so on, obtaining low-level tasks that cannot be further decomposed and are supposed to be executable. The hierarchy resembles the way the humans reason about problems by decomposing them into sub-problems depending on the context and therefore tend to be easy to understand and design. Vehicle routing problems are a generalization of the travelling salesman problem (TSP). The TSP consists on finding the shortest path that connects all the cities from a list, starting and ending on the same city. The VRP consists on finding the set of minimal routes that cover all cities by using a specific number of vehicles. Both problems have a combinatorial nature, specially the VRP, that makes it very difficult to use a HTN planner in domains where these problems are present. Two approaches to use a HTN planner in domains involving the VRP have been tested. The first approach consists on a score-based optimization system that allows us to apply a new way of connecting a software specialized in the resolution of the VRP with the HTN planner. We call this the decoupled approach, as we tackle the combinatorial nature of the VRP by using a specialized solver that communicates with the HTN planner and provides all the required information to do the task decomposition. The second approach consists on improving and enhancing the HTN planner to be capable of solving the VRP without needing the use of an external software. We call this the coupled approach. For this reason, a new HTN planner that uses a different search algorithm from these commonly used in that type of planners has been developed and is presented in this work. This thesis presents new contributions in the field of hierarchical task network planning for the resolution of vehicle routing problem domains. A new way of connecting two independent planning systems based on a score calculation system that lets them cooperate in the optimization of the solutions is applied, and a new HTN planner that uses a different search algorithm from that usually used in other HTN planners is presented. These two methods are applied in civil missions in the framework of the ARCAS and AEROARMS Projects funded by the European Commission. Extensive simulation results are presented to test the validity of the two approaches