Multi-UAV Coverage Path Planning Based on Hexagonal Grid Decomposition in Maritime Search and Rescue

In the event of a maritime accident, surveying the maximum area efficiently in the least amount of time is crucial for rescuing survivors. Increasingly, unmanned aerial vehicles (UAVs) are being used in search and rescue operations. This study proposes a method to generate a search path that covers all generated nodes in the shortest amount of time with multiple heterogeneous UAVs. The proposed model, which is a mixed-integer linear programming (MILP) model based on a hexagonal grid-based decomposition method, was verified through a simulation analysis based on the performance of an actual UAV. This study presents both the optimization technique’s calculation time as a function of the search area size and the various UAV routes derived as the search area grows. The results of this study can have wide-ranging applications for emergency search and rescue operations.

Coverage Path Planning with Semantic Segmentation for UAV in PV Plants

Solar energy is one of the most strategic energy sources for the world’s economic development. This has caused the number of solar photovoltaic plants to increase around the world; consequently, they are installed in places where their access and manual inspection are arduous and risky tasks. Recently, the inspection of photovoltaic plants has been conducted with the use of unmanned aerial vehicles (UAV). Although the inspection with UAVs can be completed with a drone operator, where the UAV flight path is purely manual or utilizes a previously generated flight path through a ground control station (GCS). However, the path generated in the GCS has many restrictions that the operator must supply. Due to these restrictions, we present a novel way to develop a flight path automatically with coverage path planning (CPP) methods. Using a DL server to segment the region of interest (RoI) within each of the predefined PV plant images, three CPP methods were also considered and their performances were assessed with metrics. The UAV energy consumption performance in each of the CPP methods was assessed using two different UAVs and standard metrics. Six experiments were performed by varying the CPP width, and the consumption metrics were recorded in each experiment. According to the results, the most effective and efficient methods are the exact cellular decomposition boustrophedon and grid-based wavefront coverage, depending on the CPP width and the area of the PV plant. Finally, a relationship was established between the size of the photovoltaic plant area and the best UAV to perform the inspection with the appropriate CPP width. This could be an important result for low-cost inspection with UAVs, without high-resolution cameras on the UAV board, and in small plants.

Robotic Coverage Path Planning for Ultrasonic Inspection

Automatic robotic inspection of arbitrary free-form shapes is relevant for many quality control applications in different industries. We propose a method for planning the motion of an industrial robot to perform ultrasonic inspection of varying 3D shapes. Our method starts with the calculation of a set of sub-paths. These sub-paths are derived from streamlines. The underlying vector field is deduced from local curvature of the inspected geometry. Intermediate robot motions are planned to connect individual sub-paths to obtain a single complete inspection path. Coverage is calculated via ray tracing to simulate the propagation of ultrasound signals. This simulation enables the algorithm to proceed adaptively and to find a good trade-off between path length and coverage. We report experiments for four different geometries. The results indicate that shorter paths are achieved by using ray tracing for adaptive adjustment of streamline density. Our algorithm is tailored to ultrasonic inspection. However, the main concept of exploiting local surface curvature and streamlines for coverage path planning generalizes to other robotic inspection problems.

Multi-Domain Informative Coverage Path Planning for A Hybrid Aerial Underwater Vehicle in Dynamic Environments

Hybrid aerial underwater vehicles (HAUV) are a new frontier for vehicles. They can operate both underwater and aerially, providing enormous potential for a wide range of scientific explorations. Informative path planning is essential to vehicle autonomy. However, covering an entire mission region is a challenge to HAUVs because of the possibility of a multidomain environment. This paper presents an informative trajectory planning framework for planning paths and generating trajectories for HAUVs performing multidomain missions in dynamic environments. We introduce the novel heuristic generalized extensive neighborhood search GLNS–k-means algorithm that uses k-means to cluster information into several sets; then through the heuristic GLNS algorithm, it searches the best path for visiting these points, subject to various constraints regarding path budgets and the motion capabilities of the HAUV. With this approach, the HAUV is capable of sampling and focusing on regions of interest. Our method provides a significantly more optimal trajectory (enabling collection of more information) than ant colony optimization (ACO) solutions. Moreover, we introduce an efficient online replanning scheme to adapt the trajectory according to the dynamic obstacles during the mission. The proposed replanning scheme based on KD tree enables significantly shorter computational times than the scapegoat tree methods.

Multi UAV Coverage Path Planning in Urban Environments

Coverage path planning (CPP) is a field of study which objective is to find a path that covers every point of a certain area of interest. Recently, the use of Unmanned Aerial Vehicles (UAVs) has become more proficient in various applications such as surveillance, terrain coverage, mapping, natural disaster tracking, transport, and others. The aim of this paper is to design efficient coverage path planning collision-avoidance capable algorithms for single or multi UAV systems in cluttered urban environments. Two algorithms are developed and explored: one of them plans paths to cover a target zone delimited by a given perimeter with predefined coverage height and bandwidth, using a boustrophedon flight pattern, while the other proposed algorithm follows a set of predefined viewpoints , calculating a smooth path that ensures that the UAVs pass over the objectives. Both algorithms have been developed for a scalable number of UAVs, which fly in a triangular deformable leader-follower formation with the leader at its front. In the case of an even number of UAVs, there is no leader at the front of the formation and a virtual leader is used to plan the paths of the followers. The presented algorithms also have collision avoidance capabilities, powered by the Fast Marching Square algorithm. These algorithms are tested in various simulated urban and cluttered environments, and they prove capable of providing safe and smooth paths for the UAV formation in urban environments.

Complete Coverage Path Planning of an Unmanned Surface Vehicle Based on a Complete Coverage Neural Network Algorithm

In practical applications, an unmanned surface vehicle (USV) generally employs a task of complete coverage path planning for exploration in a target area of interest. The biological inspired neural network (BINN) algorithm has been extensively employed in path planning of mobile robots, recently. In this paper, a complete coverage neural network (CCNN) algorithm for the path planning of a USV is proposed for the first time. By simplifying the calculation process of the neural activity, the CCNN algorithm can significantly reduce calculation time. To improve coverage efficiency and make the path more regular, the optimal next position decision formula combined with the covering direction term is established. The CCNN algorithm has increased moving directions of the path in grid maps, which in turn has further reduced turning-angles and makes the path smoother. Besides, an improved A* algorithm that can effectively decrease path turns is presented to escape the deadlock. Simulations are carried out in different environments in this work. The results show that the coverage path generated by the CCNN algorithm has less turning-angle accumulation, deadlocks, and calculation time. In addition, the CCNN algorithm is capable to maintain the covering direction and adapt to complex environments, while effectively escapes deadlocks. It is applicable for USVs to perform multiple engineering missions.