Energy-Efficient Deployment of Unmanned Aerial Vehicles in Wireless Communication Systems

University of Technology Sydney. Faculty of Engineering and Information Technology.Unmanned Aerial Vehicles (UAVs) are fast gaining popularity in a wide spectrum of areas in wireless communications. Their many desirable features - ability to hover, ability to fly in otherwise inaccessible areas and ease of deployment make UAVs promising aerial mobile base stations. Base stations mounted on UAVs (UAV-BSs) can provide wireless coverage to areas of urgent need, without having to deploy additional infrastructure. However, UAVs have limitations that hinder their full potential. Limited available energy is identified as a key constraint of UAVs, therefore energy efficiency is important in UAV applications. Our work focuses on energy-efficient deployment of UAV-BSs in wireless communication networks. Collision avoidance is identified as a key mission requirement in many UAV applications. Most of the collision avoidance methods for UAVs do not consider energy efficiency. However, minimising the energy spent on avoiding collisions is important to preserve the energy available for the assigned task. We propose energy efficient inter-UAV collision avoidance algorithms for multi-UAV systems. We propose selecting a subset of UAVs involved to act on avoiding collisions, while the rest of the UAVs are not impacted from potential collisions. We reduce the total distance travelled by the UAVs which results in improved energy efficiency. To improve the energy efficiency in a multi-UAV system, it is important to understand the factors that contribute to high energy consumption. Thus, having a complete and accurate energy model for UAVs is fundamental. We propose an energy model for UAVs, based on empirical studies of battery performance. The experiments were conducted on a commercial UAV with commercial and custom designed power loggers. The studies focused on determining the impact of payload, speed, wind, movement and communication on UAV energy consumption. We tested the reliability of the proposed energy model by using it to estimate the energy requirement of a planned UAV mission. The comparison of the predicted and measured energy requirements indicates negligible error of prediction. Deploying UAV-BSs to provide wireless connectivity can be highly advantageous and challenging. The limited available energy, possible collisions, managing interference, maintaining system fairness and other related factors make the problem of UAV-BS deployment and path planning too difficult to be solved by traditional methods. We propose Reinforcement Learning (RL) based solutions for UAV-BS path planning and deployment problem. Extensive simulations show that the proposed methods outperform the baseline methods with increased user throughput, increased number of users covered and increased system fairness

Multiple UAV systems: a survey

Nowadays, Unmanned Aerial Vehicles (UAVs) are used in many different applications. Using systems of multiple UAVs is the next obvious step in the process of applying this technology for variety of tasks. There are few research works that cover the applications of these systems and they are all highly specialized. The goal of this survey is to fill this gap by providing a generic review on different applications of multiple UAV systems that have been developed in recent years. We also present a nomenclature and architecture taxonomy for these systems. In the end, a discussion on current trends and challenges is provided.This work was funded by the Ministry of Economy, Industryand Competitiveness of Spain under Grant Nos. TRA2016-77012-R and BES-2017-079798Peer ReviewedPostprint (published version

Energy-Efficient Indoor Search by Swarms of Simulated Flying Robots Without Global Information

Swarms of flying robots are a promising alternative to ground-based robots for search in indoor environments with advantages such as increased speed and the ability to fly above obstacles. However, there are numerous problems that must be surmounted including limitations in available sensory and on-board processing capabilities, and low flight endurance. This paper introduces a novel strategy to coordinate a swarm of flying robots for indoor exploration that significantly increases energy efficiency. The presented algorithm is fully distributed and scalable. It relies solely on local sensing and low-bandwidth communication, and does not require absolute positioning, localisation, or explicit world-models. It assumes that flying robots can temporarily attach to the ceiling, or land on the ground for efficient surveillance over extended periods of time. To further reduce energy consumption, the swarm is incrementally deployed by launching one robot at a time. Extensive simulation experiments demonstrate that increasing the time between consecutive robot launches significantly lowers energy consumption by reducing total swarm flight time, while also decreasing collision probability. As a trade-off, however, the search time increases with increased inter-launch periods. These effects are stronger in more complex environments. The proposed localisation-free strategy provides an energy efficient search behaviour adaptable to different environments or timing constraints

Efficient Mission Planning for Robot Networks in Communication Constrained Environments

Many robotic systems are remotely operated nowadays that require uninterrupted connection and safe mission planning. Such systems are commonly found in military drones, search and rescue operations, mining robotics, agriculture, and environmental monitoring. Different robotic systems may employ disparate communication modalities such as radio network, visible light communication, satellite, infrared, Wi-Fi. However, in an autonomous mission where the robots are expected to be interconnected, communication constrained environment frequently arises due to the out of range problem or unavailability of the signal. Furthermore, several automated projects (building construction, assembly line) do not guarantee uninterrupted communication, and a safe project plan is required that optimizes collision risks, cost, and duration. In this thesis, we propose four pronged approaches to alleviate some of these issues: 1) Communication aware world mapping; 2) Communication preserving using the Line-of-Sight (LoS); 3) Communication aware safe planning; and 4) Multi-Objective motion planning for navigation. First, we focus on developing a communication aware world map that integrates traditional world models with the planning of multi-robot placement. Our proposed communication map selects the optimal placement of a chain of intermediate relay vehicles in order to maximize communication quality to a remote unit. We also vi propose an algorithm to build a min-Arborescence tree when there are multiple remote units to be served. Second, in communication denied environments, we use Line-of-Sight (LoS) to establish communication between mobile robots, control their movements and relay information to other autonomous units. We formulate and study the complexity of a multi-robot relay network positioning problem and propose approximation algorithms that restore visibility based connectivity through the relocation of one or more robots. Third, we develop a framework to quantify the safety score of a fully automated robotic mission where the coexistence of human and robot may pose a collision risk. A number of alternate mission plans are analyzed using motion planning algorithms to select the safest one. Finally, an efficient multi-objective optimization based path planning for the robots is developed to deal with several Pareto optimal cost attributes

Bioinspired approaches for coordination and behaviour adaptation of aerial robot swarms

Behavioural adaptation is a pervasive component in a myriad of animal societies. A well-known strategy, known as Levy Walk, has been commonly linked to such adaptation in foraging animals, where the motion of individuals couples periods of localized search and long straight forward motions. Despite the vast number of studies on Levy Walks in computational ecology, it was only in the past decade that the first studies applied this concept to robotics tasks. Therefore, this Thesis draws inspiration from the Levy Walk behaviour, and its recent applications to robotics, to design biologically inspired models for two swarm robotics tasks, aiming at increasing the performance with respect to the state of the art. The first task is cooperative surveillance, where the aim is to deploy a swarm so that at any point in time regions of the domain are observed by multiple robots simultaneously. One of the contributions of this Thesis, is the Levy Swarm Algorithm that augments the concept of Levy Walk to include the Reynolds’ flocking rules and achieve both exploration and coordination in a swarm of unmanned aerial vehicles. The second task is adaptive foraging in environments of clustered rewards. In such environments behavioural adaptation is of paramount importance to modulate the transition between exploitation and exploration. Nature enables these adaptive changes by coupling the behaviour to the fluctuation of hormones that are mostly regulated by the endocrine system. This Thesis draws further inspiration from Nature and proposes a second model, the Endocrine Levy Walk, that employs an Artificial Endocrine System as a modulating mechanism of Levy Walk behaviour. The Endocrine Levy Walk is compared with the Yuragi model (Nurzaman et al., 2010), in both simulated and physical experiments where it shows its increased performance in terms of search efficiency, energy efficiency and number of rewards found. The Endocrine Levy Walk is then augmented to consider social interactions between members of the swarm by mimicking the behaviour of fireflies, where individuals attract others when finding suitable environmental conditions. This extended model, the Endocrine Levy Firefly, is compared to the Levy+ model (Sutantyo et al., 2013) and the Adaptive Collective Levy Walk Nauta et al. (2020). This comparison is also made both in simulated and physical experiments and assessed in terms of search efficiency, number of rewards found and cluster search efficiency, strengthening the argument in favour of the Endocrine Levy Firefly as a promising approach to tackle collaborative foragin

An Empirical Methodology for Engineering Human Systems Integration

The systems engineering technical processes are not sufficiently supported by methods and tools that quantitatively integrate human considerations into early system design. Because of this, engineers must often rely on qualitative judgments or delay critical decisions until late in the system lifecycle. Studies reveal that this is likely to result in cost, schedule, and performance consequences. This dissertation presents a methodology to improve the application of systems engineering technical processes for design. This methodology is mathematically rigorous, is grounded in relevant theory, and applies extant human subjects data to critical systems development challenges. The methodology is expressed in four methods that support early systems engineering activities: a requirements elicitation method, a function allocation method, an input device design method, and a display layout design method. These form a coherent approach to early system development. Each method is separately discussed and demonstrated using a prototypical system development program. In total, this original and significant work has a broad range of systems engineer applicability to improve the engineering of human systems integration

Novel parallel approaches to efficiently solve spatial problems on heterogeneous CPU-GPU systems

Addressing this task is difficult as (i) it requires analysing large databases in a short time, and (ii) it is commonly addressed by combining different methods with complex data dependencies, making it challenging to exploit parallelism on heterogeneous CPU-GPU systems. Moreover, most efforts in this context focus on improving the accuracy of the approaches and neglect reducing the processing time—the most accurate algorithm was designed to process the fingerprints using a single thread. We developed a new methodology to address the latent fingerprint identification problem called “Asynchronous processing for Latent Fingerprint Identification” (ALFI) that speeds up processing while maintaining high accuracy. ALFI exploits all the resources of CPU-GPU systems using asynchronous processing and fine-coarse parallelism to analyse massive fingerprint databases. We assessed the performance of ALFI on Linux and Windows operating systems using the well-known NIST/FVC databases. Experimental results revealed that ALFI is on average 22x faster than the state-of-the-art identification algorithm, reaching a speed-up of 44.7x for the best-studied case. In terrain analysis, Digital Elevation Models (DEMs) are relevant datasets used as input to those algorithms that typically sweep the terrain to analyse its main topological features such as visibility, elevation, and slope. The most challenging computation related to this topic is the total viewshed problem. It involves computing the viewshed—the visible area of the terrain—for each of the points in the DEM. The algorithms intended to solve this problem require many memory accesses to 2D arrays, which, despite being regular, lead to poor data locality in memory. We proposed a methodology called “skewed Digital Elevation Model” (sDEM) that substantially improves the locality of memory accesses and exploits the inherent parallelism of rotational sweep-based algorithms. Particularly, sDEM applies a data relocation technique before accessing the memory and computing the viewshed, thus significantly reducing the execution time. Different implementations are provided for single-core, multi-core, single-GPU, and multi-GPU platforms. We carried out two experiments to compare sDEM with (i) the most used geographic information systems (GIS) software and (ii) the state-of-the-art algorithm for solving the total viewshed problem. In the first experiment, sDEM results on average 8.8x faster than current GIS software, despite considering only a few points because of the limitations of the GIS software. In the second experiment, sDEM is 827.3x faster than the state-of-the-art algorithm considering the best case. The use of Unmanned Aerial Vehicles (UAVs) with multiple onboard sensors has grown enormously in tasks involving terrain coverage, such as environmental and civil monitoring, disaster management, and forest fire fighting. Many of these tasks require a quick and early response, which makes maximising the land covered from the flight path an essential goal, especially when the area to be monitored is irregular, large, and includes many blind spots. In this regard, state-of-the-art total viewshed algorithms can help analyse large areas and find new paths providing all-round visibility. We designed a new heuristic called “Visibility-based Path Planning” (VPP) to solve the path planning problem in large areas based on a thorough visibility analysis. VPP generates flyable paths that provide high visual coverage to monitor forest regions using the onboard camera of a single UAV. For this purpose, the hidden areas of the target territory are identified and considered when generating the path. Simulation results showed that VPP covers up to 98.7% of the Montes de Malaga Natural Park and 94.5% of the Sierra de las Nieves National Park, both located in the province of Malaga (Spain). In addition, a real flight test confirmed the high visibility achieved using VPP. Our methodology and analysis can be easily applied to enhance monitoring in other large outdoor areas.In recent years, approaches that seek to extract valuable information from large datasets have become particularly relevant in today's society. In this category, we can highlight those problems that comprise data analysis distributed across two-dimensional scenarios called spatial problems. These usually involve processing (i) a series of features distributed across a given plane or (ii) a matrix of values where each cell corresponds to a point on the plane. Therefore, we can see the open-ended and complex nature of spatial problems, but it also leaves room for imagination to be applied in the search for new solutions. One of the main complications we encounter when dealing with spatial problems is that they are very computationally intensive, typically taking a long time to produce the desired result. This drawback is also an opportunity to use heterogeneous systems to address spatial problems more efficiently. Heterogeneous systems give the developer greater freedom to speed up suitable algorithms by increasing the parallel programming options available, making it possible for different parts of a program to run on the dedicated hardware that suits them best. Several of the spatial problems that have not been optimised for heterogeneous systems cover very diverse areas that seem vastly different at first sight. However, they are closely related due to common data processing requirements, making them suitable for using dedicated hardware. In particular, this thesis provides new parallel approaches to tackle the following three crucial spatial problems: latent fingerprint identification, total viewshed computation, and path planning based on maximising visibility in large regions. Latent fingerprint identification is one of the essential identification procedures in criminal investigations. Addressing this task is difficult as (i) it requires analysing large databases in a short time, and (ii) it is commonly addressed by combining different methods with complex data dependencies, making it challenging to exploit parallelism on heterogeneous CPU-GPU systems. Moreover, most efforts in this context focus on improving the accuracy of the approaches and neglect reducing the processing time—the most accurate algorithm was designed to process the fingerprints using a single thread. We developed a new methodology to address the latent fingerprint identification problem called “Asynchronous processing for Latent Fingerprint Identification” (ALFI) that speeds up processing while maintaining high accuracy. ALFI exploits all the resources of CPU-GPU systems using asynchronous processing and fine-coarse parallelism to analyse massive fingerprint databases. We assessed the performance of ALFI on Linux and Windows operating systems using the well-known NIST/FVC databases. Experimental results revealed that ALFI is on average 22x faster than the state-of-the-art identification algorithm, reaching a speed-up of 44.7x for the best-studied case. In terrain analysis, Digital Elevation Models (DEMs) are relevant datasets used as input to those algorithms that typically sweep the terrain to analyse its main topological features such as visibility, elevation, and slope. The most challenging computation related to this topic is the total viewshed problem. It involves computing the viewshed—the visible area of the terrain—for each of the points in the DEM. The algorithms intended to solve this problem require many memory accesses to 2D arrays, which, despite being regular, lead to poor data locality in memory. We proposed a methodology called “skewed Digital Elevation Model” (sDEM) that substantially improves the locality of memory accesses and exploits the inherent parallelism of rotational sweep-based algorithms. Particularly, sDEM applies a data relocation technique before accessing the memory and computing the viewshed, thus significantly reducing the execution time. Different implementations are provided for single-core, multi-core, single-GPU, and multi-GPU platforms. We carried out two experiments to compare sDEM with (i) the most used geographic information systems (GIS) software and (ii) the state-of-the-art algorithm for solving the total viewshed problem. In the first experiment, sDEM results on average 8.8x faster than current GIS software, despite considering only a few points because of the limitations of the GIS software. In the second experiment, sDEM is 827.3x faster than the state-of-the-art algorithm considering the best case. The use of Unmanned Aerial Vehicles (UAVs) with multiple onboard sensors has grown enormously in tasks involving terrain coverage, such as environmental and civil monitoring, disaster management, and forest fire fighting. Many of these tasks require a quick and early response, which makes maximising the land covered from the flight path an essential goal, especially when the area to be monitored is irregular, large, and includes many blind spots. In this regard, state-of-the-art total viewshed algorithms can help analyse large areas and find new paths providing all-round visibility. We designed a new heuristic called “Visibility-based Path Planning” (VPP) to solve the path planning problem in large areas based on a thorough visibility analysis. VPP generates flyable paths that provide high visual coverage to monitor forest regions using the onboard camera of a single UAV. For this purpose, the hidden areas of the target territory are identified and considered when generating the path. Simulation results showed that VPP covers up to 98.7% of the Montes de Malaga Natural Park and 94.5% of the Sierra de las Nieves National Park, both located in the province of Malaga (Spain). In addition, a real flight test confirmed the high visibility achieved using VPP. Our methodology and analysis can be easily applied to enhance monitoring in other large outdoor areas