A survey of formation control and motion planning of multiple unmanned vehicles

The increasing deployment of multiple unmanned vehicles systems has generated large research interest in recent decades. This paper therefore provides a detailed survey to review a range of techniques related to the operation of multi-vehicle systems in different environmental domains, including land based, aerospace and marine with the specific focuses placed on formation control and cooperative motion planning. Differing from other related papers, this paper pays a special attention to the collision avoidance problem and specifically discusses and reviews those methods that adopt flexible formation shape to achieve collision avoidance for multi-vehicle systems. In the conclusions, some open research areas with suggested technologies have been proposed to facilitate the future research development

Service-oriented agent architecture for autonomous maritime vehicles

Advanced ocean systems are increasing their capabilities and the degree of autonomy more and more in order to perform more sophisticated maritime missions. Remotely operated vehicles are no longer cost-effective since they are limited by economic support costs, and the presence and skills of the human operator. Alternatively, autonomous surface and underwater vehicles have the potential to operate with greatly reduced overhead costs and level of operator intervention. This Thesis proposes an Intelligent Control Architecture (ICA) to enable multiple collaborating marine vehicles to autonomously carry out underwater intervention missions. The ICA is generic in nature but aimed at a case study where a marine surface craft and an underwater vehicle are required to work cooperatively. They are capable of cooperating autonomously towards the execution of complex activities since they have different but complementary capabilities. The architectural foundation to achieve the ICA lays on the flexibility of service-oriented computing and agent technology. An ontological database captures the operator skills, platform capabilities and, changes in the environment. The information captured, stored as knowledge, enables reasoning agents to plan missions based on the current situation. The ICA implementation is verified in simulation, and validated in trials by means of a team of autonomous marine robots. This Thesis also presents architectural details and evaluation scenarios of the ICA, results of simulations and trials from different maritime operations, and future research directions

The design and implementation of a multi-agent architecture to increase coordination efficiency in multi-AUV operations

This research addresses the problem of coordinating multiple autonomous underwater vehicle (AUV) operations. An intelligent mission executive has been created that uses multi-agent technology to control and coordinate multiple AUVs in communication deficient environments. By incorporating real time vehicle prediction, blackboardbased hierarchical mission plans and mission optimisation in conjunction with a simple broadcast communication system this system aims to handle the limitations inherent in underwater operations and intelligently control multiple vehicles. In this research efficiency is evaluated and then compared to the current state of the art in multiple AUV control. The research is then validated in real AUV coordination trials. Results will show that compared to the state of the art the control system developed and implemented in this research coordinates multiple vehicles more efficiently and is able to function in a range of poor communication environments. These findings are supported by in water validation trials with heterogeneous AUVs. This thesis will first present an in depth state of the art of the related research topics including multi-agent systems, collaborative robotics and autonomous underwater vehicles. The development and functionality of this research will then be explained followed by a detailed description of the experiments. Results are then presented both for the simulated and real world trials followed by a discussion of the findings

Aerial base station placement in temporary-event scenarios

Die Anforderungen an den Netzdatenverkehr sind in den letzten Jahren dramatisch gestiegen, was ein großes Interesse an der Entwicklung neuartiger Lösungen zur Erhöhung der Netzkapazität in Mobilfunknetzen erzeugt hat. Besonderes Augenmerk wurde auf das Problem der Kapazitätsverbesserung bei temporären Veranstaltungen gelegt, bei denen das Umfeld im Wesentlichen dynamisch ist. Um der Dynamik der sich verändernden Umgebung gerecht zu werden und die Bodeninfrastruktur durch zusätzliche Kapazität zu unterstützen, wurde der Einsatz von Luftbasisstationen vorgeschlagen. Die Luftbasisstationen können in der Nähe des Nutzers platziert werden und aufgrund der im Vergleich zur Bodeninfrastruktur höheren Lage die Vorteile der Sichtlinienkommunikation nutzen. Dies reduziert den Pfadverlust und ermöglicht eine höhere Kanalkapazität. Das Optimierungsproblem der Maximierung der Netzkapazität durch die richtige Platzierung von Luftbasisstationen bildet einen Schwerpunkt der Arbeit. Es ist notwendig, das Optimierungsproblem rechtzeitig zu lösen, um auf Veränderungen in der dynamischen Funkumgebung zu reagieren. Die optimale Platzierung von Luftbasisstationen stellt jedoch ein NP-schweres Problem dar, wodurch die Lösung nicht trivial ist. Daher besteht ein Bedarf an schnellen und skalierbaren Optimierungsalgorithmen. Als Erstes wird ein neuartiger Hybrid-Algorithmus (Projected Clustering) vorgeschlagen, der mehrere Lösungen auf der Grundlage der schnellen entfernungsbasierten Kapazitätsapproximierung berechnet und sie auf dem genauen SINR-basierten Kapazitätsmodell bewertet. Dabei werden suboptimale Lösungen vermieden. Als Zweites wird ein neuartiges verteiltes, selbstorganisiertes Framework (AIDA) vorgeschlagen, welches nur lokales Wissen verwendet, den Netzwerkmehraufwand verringert und die Anforderungen an die Kommunikation zwischen Luftbasisstationen lockert. Bei der Formulierung des Platzierungsproblems konnte festgestellt werden, dass Unsicherheiten in Bezug auf die Modellierung der Luft-Bodensignalausbreitung bestehen. Da dieser Aspekt im Rahmen der Analyse eine wichtige Rolle spielt, erfolgte eine Validierung moderner Luft-Bodensignalausbreitungsmodelle, indem reale Messungen gesammelt und das genaueste Modell für die Simulationen ausgewählt wurden.As the traffic demands have grown dramatically in recent years, so has the interest in developing novel solutions that increase the network capacity in cellular networks. The problem of capacity improvement is even more complex when applied to a dynamic environment during a disaster or temporary event. The use of aerial base stations has received much attention in the last ten years as the solution to cope with the dynamics of the changing environment and to supplement the ground infrastructure with extra capacity. Due to higher elevations and possibility to place aerial base stations in close proximity to the user, path loss is significantly smaller in comparison to the ground infrastructure, which in turn enables high data capacity. We are studying the optimization problem of maximizing network capacity by proper placement of aerial base stations. To handle the changes in the dynamic radio environment, it is necessary to promptly solve the optimization problem. However, we show that the optimal placement of aerial base stations is the NP-hard problem and its solution is non-trivial, and thus, there is a need for fast and scalable optimization algorithms. This dissertation investigates how to solve the placement problem efficiently and to support the dynamics of temporary events. First, we propose a novel hybrid algorithm (Projected Clustering), which calculates multiple solutions based on the fast distance-based capacity approximation and evaluates them on the accurate SINR-based capacity model, avoiding sub-optimal solutions. Second, we propose a novel distributed, self-organized framework (AIDA), which conducts a decision-making process using only local knowledge, decreasing the network overhead and relaxing the requirements for communication between aerial base stations. During the formulation of the placement problem, we found that there is still considerable uncertainty with regard to air-to-ground propagation modeling. Since this aspect plays an important role in our analysis, we validated state-of-the-art air-to-ground propagation models by collecting real measurements and chose the most accurate model for the simulations

DESIGNING A MULTI-AGENT FRAMEWORK FOR UNMANNED AERIAL/GROUND VEHICLES

Ph.DDOCTOR OF PHILOSOPH

Reconfigurable AUV for Intervention Missions: A Case Study on Underwater Object Recovery

Starting in January 2009, the RAUVI (Reconfigurable Autonomous Underwater Vehicle for Intervention Missions) project is a 3-year coordinated research action funded by the Spanish Ministry of Research and Innovation. In this paper, the state of progress after 2 years of continuous research is reported. As a first experimental validation of the complete system, a search and recovery problem is addressed, consisting of finding and recovering a flight data recorder placed at an unknown position at the bottom of a water tank. An overview of the techniques used to successfully solve the problem in an autonomous way is provided. The obtained results are very promising and are the first step toward the final test in shallow water at the end of 2011

Path planning for unmanned aerial vehicles using visibility line-based methods

This thesis concerns the development of path planning algorithms for unmanned aerial vehicles (UAVs) to avoid obstacles in two- (2D) and three-dimensional (3D) urban environments based on the visibility graph (VG) method. As VG uses all nodes (vertices) in the environments, it is computationally expensive. The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. The computational efficiency of the proposed algorithms is further improved by limiting the BL’s length, which results in an even smaller number of vertices. Simulation results have proven that the proposed 2D path planning algorithms are much faster in comparison with the VG and hence are suitable for real time path planning applications. While vertices can be explicitly defined in 2D environments using VG, it is difficult to determine them in 3D as they are infinite in number at each obstacle’s border edge. This issue is tackled by using the so-called plane rotation approach in the proposed 3D path planning algorithms where the vertices are the intersection points between a plane rotated by certain angles and obstacles edges. In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. In addition, a software package using Matlab for 2D and 3D path planning has also been developed. The package is designed to be easy to use as well as user-friendly with step-by-step instructions