A survey on the application of path-planning algorithms for multi-rotor UAVs in precision agriculture

Multi-rotor Unmanned Aerial Vehicles (UAVs), although originally designed and developed for defence and military purposes, in the last ten years have gained momentum, especially for civilian applications, such as search and rescue, surveying and mapping, and agricultural crops and monitoring. Thanks to their hovering and Vertical Take-Off and Landing (VTOL) capabilities and the capacity to carry out tasks with complete autonomy, they are now a standard platform for both research and industrial uses. However, while the flight control architecture is well established in the literature, there are still many challenges in designing autonomous guidance and navigation systems to make the UAV able to work in constrained and cluttered environments or also indoors. Therefore, the main motivation of this work is to provide a comprehensive and exhaustive literature review on the numerous methods and approaches to address path-planning problems for multi-rotor UAVs. In particular, the inclusion of a review of the related research in the context of Precision Agriculture (PA) provides a unified and accessible presentation for researchers who are initiating their endeavours in this subject.

Finite Impulse Response Filter-Based Track Formation for Preceding Vehicle Tracking Using Automotive Radars

Automotive radars, which are used for preceding vehicle tracking, have attracted significant attention in recent years. However, the false measurements that occur in cluttered roadways hinders the tracking process in vehicles; thus, it is essential to develop automotive radar systems that are robust against false measurements. This study proposed a novel track formation algorithm to initialize the preceding vehicle tracking in automotive radar systems. The proposed algorithm is based on finite impulse response filtering, and exhibited significantly higher accuracy in highly cluttered environments than a conventional track formation algorithm. The excellent performance of the proposed algorithm was demonstrated using extensive simulations under real conditions.

Faster than Real-Time Surface Pose Estimation with Application to Autonomous Robotic Grasping

Motivated by grasp planning applications within cluttered environments, this paper presents a novel approach to performing real-time surface segmentations of never-before-seen objects scattered across a given scene. This approach utilizes an input 2D depth map, where a first principles-based algorithm is utilized to exploit the fact that continuous surfaces are bounded by contours of high gradient. From these regions, the associated object surfaces can be isolated and further adapted for grasp planning. This paper also provides details for extracting the six-DOF pose for an isolated surface and presents the case of leveraging such a pose to execute planar grasping to achieve both force and torque closure. As a consequence of the highly parallel software implementation, the algorithm is shown to outperform prior approaches across all notable metrics and is also shown to be invariant to object rotation, scale, orientation relative to other objects, clutter, and varying degree of noise. This allows for a robust set of operations that could be applied to many areas of robotics research. The algorithm is faster than real time in the sense that it is nearly two times faster than the sensor rate of 30 fps.

An auditory-visual tradeoff in susceptibility to clutter

Sensory cortical mechanisms combine auditory or visual features into perceived objects. This is difficult in noisy or cluttered environments. Knowing that individuals vary greatly in their susceptibility to clutter, we wondered whether there might be a relation between an individual’s auditory and visual susceptibilities to clutter. In auditory masking, background sound makes spoken words unrecognizable. When masking arises due to interference at central auditory processing stages, beyond the cochlea, it is called informational masking. A strikingly similar phenomenon in vision, called visual crowding, occurs when nearby clutter makes a target object unrecognizable, despite being resolved at the retina. We here compare susceptibilities to auditory informational masking and visual crowding in the same participants. Surprisingly, across participants, we find a negative correlation (R = –0.7) between susceptibility to informational masking and crowding: Participants who have low susceptibility to auditory clutter tend to have high susceptibility to visual clutter, and vice versa. This reveals a tradeoff in the brain between auditory and visual processing.

Enhancing Robots Navigation in Internet of Things Indoor Systems

In this study, an effective local minima detection and definition algorithm is introduced for a mobile robot navigating through unknown static environments. Furthermore, five approaches are presented and compared with the popular approach wall-following to pull the robot out of the local minima enclosure namely; Random Virtual Target, Reflected Virtual Target, Global Path Backtracking, Half Path Backtracking, and Local Path Backtracking. The proposed approaches mainly depend on changing the target location temporarily to avoid the original target’s attraction force effect on the robot. Moreover, to avoid getting trapped in the same location, a virtual obstacle is placed to cover the local minima enclosure. To include the most common shapes of deadlock situations, the proposed approaches were evaluated in four different environments; V-shaped, double U-shaped, C-shaped, and cluttered environments. The results reveal that the robot, using any of the proposed approaches, requires fewer steps to reach the destination, ranging from 59 to 73 m on average, as opposed to the wall-following strategy, which requires an average of 732 m. On average, the robot with a constant speed and reflected virtual target approach takes 103 s, whereas the identical robot with a wall-following approach takes 907 s to complete the tasks. Using a fuzzy-speed robot, the duration for the wall-following approach is greatly reduced to 507 s, while the reflected virtual target may only need up to 20% of that time. More results and detailed comparisons are embedded in the subsequent sections.

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.