A collision avoidance solution for UAVs following planned missions

With the rapid development of aviation technology, especially in intelligent situation awareness, autonomous flight control and electric propulsion, the number of unmanned aerial vehicles (UAVs) has grown explosively, bringing challenges to low-altitude flight safety. Autonomous UAV detect and avoid (DAA) technology is a key future direction. Firstly, this paper focuses on UAV multi-sensor data fusion, proposing an asynchronous trajectory fusion method via comprehensive weighting that accounts for multiple influencing factors. Secondly, for trajectory tracking of ownship and intruders, improved Kalman filter (KF) and enhanced Sage-Husa adaptive unscented Kalman filter (AUKF) algorithms are used for vertical and horizontal tracking to enhance accuracy. Then, a hybrid method combining detect and avoid alerting logic for unmanned aircraft systems (DAIDALUS) with Markov decision process (MDP) is proposed to solve the UAV collision avoidance decision-making problem. It calculates collision avoidance strategies via the state space, takes them as MDP’s action space, sets up reward functions and state transition probabilities to build an MDP model, and explores the influence of discount factors. Finally, through experimental tests, results show the proposed UAV detection and avoidance decision method has a 27.2% efficiency increase compared to standalone DAIDALUS, the loss of well clear (LoWC) rate is only 5.8%, and the nearest distance between the intruder and the ownship is 343 m, meeting the collision avoidance requirements for UAV flight.

The proliferation of unmanned aerial vehicles (UAVs) has driven the emergence of urban air mobility (UAM) as a solution to alleviate the increasing demand for UAVs applications in various domains. The concept of UAM envisions a future where UAVs play a pivotal role in short-distance transportation, delivery services, surveillance, emergency rescue, and more. However, the rapid growth of UAVs poses significant challenges arising from the need to ensure the safe coexistence of UAVs with other manned/unmanned aerial vehicles. To ensure the safe integration of UAVs into low-altitude urban airspace and support high-density on-demand mobility, this research focuses on handling the safety-centric challenges related to UAV collision risk assessment, obstacle avoidance, and conflict resolution in complex urban environments.
\nOne of the main challenges is the intrusion of UAVs into airport runways. Airports serve as critical hubs for civil aircraft takeoff and landing operations. However, the increasing presence of UAVs has raised concerns about intruding into airports, leading to flight delays and temporary runway closures. To quantify the potential interference of UAVs on civil aircraft, a collision-course based trajectory planning model is proposed to evaluate the collision risk between manned civil aircraft and intruding UAVs. In this risk assessment model, the trajectory of the intruding UAV is formulated using a collision-course concept, taking into account the limited trajectory information available about intruding UAVs. The planned trajectory of the UAVs is then used to predict its relative position concerning civil aircraft. To account for the possible disturbances of the relative distance, a stochastic position prediction model based on Brownian motion is developed. The collision risk is assessed based on this stochastic kinematic model, providing a quantitative measure of the potential collisions. The proposed model is validated through extensive simulations involving different UAV initial positions, position updates, and different sizes of collision zone tests, as well as comparative tests with the Monte-Carlo algorithm, demonstrating its robustness in assessing the collision risk of the airport restricted area. To facilitate the application, the model is finally used to develop a platform to generate runway heatmaps, accounting for airport runway risk distributions. 
\nAnother safety-centric challenge is ensuring autonomous obstacle avoidance and conflict resolution of UAVs. To enable UAV autonomous safe operations in uncontrolled urban low-altitude airspace, a comprehensive collision-free path planning framework is developed to address the avoidance of both static obstacles and dynamic threats. Firstly, to handle static obstacles, a novel algorithm of 3D voxel jump point research is introduced to generate a global reference path for UAV navigation to avoid static obstacles, particularly for a free flight at different altitudes. Additionally, to optimize the reference path for specific mission requirements, techniques such as trajectory de-diagonalization, reconstruction, and smoothness are proposed to reduce the risk of static collisions, shorten the fly range, and enable UAVs to negotiate turns more efficiently. Secondly, real-time conflict resolution actions based on the Markov decision process are developed to avoid local dynamic threats encountered along the optimized desired path. This allows the host UAV to dynamically adjust its course to a resolution trajectory while maintaining its planned speed without hovering to avoid the potential collision with the approaching intruders. By avoiding near mid-air collisions (NMAC) and preventing the UAV from hovering, the proposed method ensures the timely completion of UAV missions. Simulation results demonstrate that the developed method successfully achieves UAV autonomous global path planning and local real-time conflict resolution in complex urban low-altitude environments, thereby avoiding both static obstacles and dynamic threats. 
\nMoreover, to bridge the research gap of UAV hard conflict resolution in mitigating NMAC risks arising from local dynamic threats, a novel situational NMAC risk assessment approach is developed by integrating the conditional random field (CRF) algorithm with safety metrics and conflict resolution performance to facilitate UAV tiered aerial passage operations. To improve UAV operating environments in urban airspace, a concept of tiered aerial passages is first designed to provide a practical urban airspace planning scheme that addresses UAV heterogeneity and optimizes the utilization of urban airspace. For UAV tiered aerial passage operations, a situational NMAC risk assessment module coupled with a conflict resolution decision-making module is formulated, enabling the host UAV to evaluate and respond to real-time conflicts, ensuring avoidance of potential collisions. To assess NMAC risks, a general risk assessment model is proposed based on the CRF algorithm, considering UAV safety metrics and resolution performance. Then the overtaking, approaching head-on, and converging UAV encounters are analyzed, and situational risk potential scores are created using the Gaussian kernel function in the CRF algorithm, considering advisory, caution, and warning risk alert levels. To resolve conflict, acceptable, tolerable, and unacceptable scenarios are proposed to enhance the flexibility and personalization of the resolution decision-making. The proposed scheme is validated by simulating geometric encounter situations and comparative tests with the previous hard resolution technique. The results indicate that the proposed method outperforms UAV NMAC risk assessment and conflict resolution. Even in the most dangerous unacceptable resolution decision-making scenarios across three conflict encounters, the proposed algorithm achieves NMAC rates of 0.036, 0.070, and 0.043, which are lower than the corresponding NMAC rates associated with the hard resolution approach. Together with the acceptable and tolerable scenarios, the proposed negotiation resolution effectively tailors different risk requirements to accommodate diverse UAV missions. 
\nWith a primary focus on ensuring the safety of the UAM architecture, this research endeavors to assess UAV NMAC risks and efficiently manage potential conflicts. The proposed work are thoroughly validated to demonstrate their effectiveness in real-world scenarios. As a result, this study significantly contributes to the establishment of a robust UAM architecture, facilitating the realization of safe and reliable UAM.

Unmanned Aerial Vehicles (UAV) have become more popular for usage due to the low cost of deployment and maintenance. Single UAV employment allows remote area monitoring and transferring different payloads to inaccessible or dangerous zones for human. In order to deal with flight tasks that are more complex, UAV swarms are applied. The main challenge of UAV swarm formation and flight control is to avoid vehicle collisions. In this case, artificial intelligence is responsible for flight performance in the airspace in such way that collision is avoided. The main requirements to the method, which will provide conflict-free maneuvers, are safety (collision avoidance), liveness (decentralized control, destination area reachability) and flyability (UAV flight performance constraints are satisfied). Artificial force field method fulfills all of these demands. It allows to detect a potential conflict between multiple UAVs in a swarm and other static or moving obstacles found in airspace, to provide collision resolution by changing UAVs flight parameters through maintaining minimum separation distance, including cases when manned vehicles are found in the same airspace. There can be distinguished by a wide range of obstacles: static (buildings, restricted areas and bed weather conditions) and dynamic ones (other UAVs, manned aircraft). Method allows keeping UAV swarm shape on the flight path, taking into account ground speed and turn bank angle values restrictions according to UAV’s flight performance characteristics.

The importance of local intervention capability for the assertion of Canadian Sovereignty in the Northwest Passage is recognized. However, Canada lacks the ability to deploy, on demand, assets to search a wide area for rescue or surveillance purposes in the North. This fact motivated our investigation of the feasibility of a rapid intervention system based on a carrier-scouts design in which a number of unmanned aerial vehicles (UAVs) would be transported, air launched and recovered by a carrier aircraft. These UAVs would have the ability to self-organize in formations that correspond to the task at hand. When searching for a target, they would fly in a linear pattern so that the search area swept per hour and the probability of detecting the target would be considerably increased. A 1973 report by the Tactical Combat Aircraft Programs of the Boeing Aerospace Company for the US Air Force [15] and a 2007 thesis by Chalamont [6] indicate that airborne launch and recovery of many UAVs from a carrier aircraft is feasible and requires only already existing technology. We propose here a solution to the remaining problem of managing simultaneously the many UAVs that are required by the vastness of the areas to be surveyed, with a minimum number of human controllers and communications. Namely, we present algorithms for the self-organization of the UAVs in the required formations. These allow for surveillance operations during which close-up images would be acquired of activities in a region of interest, and searching an area for assets in distress and providing a visual presence for such. We reach the conclusion that our proposed local intervention system with flocking UAVs is feasible and would provide a valuable asset for asserting Canadian Sovereignty in the North.

To enable safe and efficient operation of a large number of Unmanned Aerial Vehicles (UAVs) as envisioned in future commercial operations, a novel networked-based air traffic control paradigm is needed to provide for autonomous route optimization and cooperation to enable deconfliction. This system would need to ensure deconfliction from nearby manned and unmanned operations and would need the capability to respond to unexpected close-proximity aircraft, known as interlopers. This network-based control paradigm will require that operators be able to oversee a network of cooperative and autonomous UAVs capable of maneuvering at low altitudes. Such a network would need new algorithms and increased autonomy to best support cooperative deconfliction and high level supervisory control, and one that also allows operators the ability to both understand local and global behavior of a network of UAVs. To this end, we propose a paradigm-shifting multi-layer distributed air traffic control concept focused on low altitude, high density UAV operations. This new architecture would include a group of analysts that perform a global analysis of the UAV network at a strategic level and more tactical, local controllers manipulating the UAV network, who are advised by the analysts. The proposed operational support system would include methods for the automatic identification of issues within the network, as well as a method for the automatic distribution of effective tasks to the most suitable personnel. This architecture would be a combination of current air traffic control techniques as well as those troubleshooting techniques found in other domains like network and cloud computing management.

With the development of unmanned platforms, there are large numbers of unmanned aerial vehicles(UAVs), due to UAVs’ new features such as lightweight, high speed mobility and heterogeneous, UAVs are facing great challenges of data security. As a key means to protect data security, cryptography is of great significance. Traditional mature and complete cryptography schemes need to be adjusted to meet the new features of UAVs. We start with the security challenges faced by UAV architecture, then analyze the cryptographic technologies that can be applied. By comparing with existing researching schemes, we shows the advantages of different cryptographic technologies in the security protection of unmanned platforms and looks forward to the future.

U NMANNED Aerial Vehicles (UAVs) hold good promise for autonomously carrying out complex civilian and military operations. However, many of these missions require them to fly at low altitudes, making them vulnerable to collision with both stationary as well as moving obstacles. Hence, it is vital that UAVs are equipped with autonomous capability to sense and avoid collisions, especially for the pop-up threats. When such a threat is sensed and a collision is predictedwithin a short time ahead, theUAV should be able to react and maneuver away quickly so that the collision is avoided. An algorithmwhich can assure such amaneuver is called a “reactive collision avoidance algorithm.” Since the available reaction time in such a scenario is usually is small and UAVs are usually limited by computational resources, such an algorithm should also be computationally very efficient (it should preferably be noniterative). It is also required that whilemaneuvering away, it should notmaneuver toomuch away from the obstacle either. This is both to avoid collision from other nearby obstacles and not to compromise on the overall mission objective. There are various attempts in the literature to develop algorithms for collision avoidance purpose, many of which are inspired from global path planning algorithms. The artificial potential field method is such an approach where the motion of the vehicle is guided under the influence of a potential field. The potential field (which is essentially a cost function) is designed in such a way that obstacles have repulsive fields while the destination has an attractive field. The safe path of the UAV is then found by optimizing the carefully selected cost function. To tune this basic philosophy for reactive collision avoidance, a model predictive control-based algorithm has been proposed in the literature. This algorithm essentially assures path following under safe conditions (i.e. if no collision is predicted in the near future) and invokes the potential field function when new collisions are sensed. However, in potential field based techniques the associated optimization process is typically done in an iterative manner. Because of this they are usually computationally intensive and hence are not suitable for reactive collision avoidance of airborne UAVs in general. A promising algorithm in collision avoidance and global path planning is the philosophy of rapidly-exploring random tree (RRT) [1], which has also been used for reactive collision avoidance. However, there are many concerns about the RRT approach, which can largely be attributed to the random nature of the algorithm. For example, the path predicted by RRT is usually a sting of connected straight lines that does not reflect the path followed by a vehicle with nonholonomic constraints. More important, it is a probabilistic approach and hence there is no guarantee of finding a feasible path within a limited finite time. Other graph search algorithms such as best-first search are also implemented for reactive collision avoidance [2]. However, this is not systematic approach and could result in the algorithm searching far too many nodes under some conditions. Moreover, precomputing motion primitives and saving them in a lookup table is infeasible for UAVs, which are usually resource-limited. An interesting perspective to collision avoidance problem is the minimum effort guidance [3], where an optimal control-based approach has been proposed after applying the collision cone philosophy to detect collisions. This method is computationally nonintensive as a closed form solution has been proposed. Even though this is an interesting idea, by minimizing the lateral acceleration, perhaps it imposes unwanted extra constraint on the problem formulation as reactive collision avoidance problems do not necessarily have to be carried out with minimum lateral acceleration. More important, one can observe that this formulation only assures position guarantee and no constraint is imposed on the velocity vector. Hence, even though it guides the vehicle to a carefully selected target point on the safety boundary (we call it the “aiming point”), it causes the vehicle to maneuver until this point. This can be risky as the vehicle may enter the safety ball before reaching the aiming point. Even though the collision cone based aiming point philosophy is a very good idea, the authors of this Note strongly believe that instead of only position guarantee, rather the velocity vector should be aligned towards the aiming point as soon as a collision is detected (which will automatically lead to position guarantee as well). Towards this objective, two new nonlinear guidance laws are proposed in this Note, which are named as nonlinear geometric guidance (NGG) and differential geometric guidance (DGG). These guidance laws are inspired by the philosophy of “aiming point guidance” (APG) [4], which has been proposed in missile guidance literature. It turns out that the APG is a simplified case of the NGG where the associated since function is replaced by its linear approximation (hence, for a systematic discussion, it is renamed as linear geometric guidance (LGG) in this Note). Both of the guidance algorithms proposed in this Note quickly align the velocity vector of the UAValong the aiming point within a part of the available time-togo, which ensures quick reaction and hence safety of the vehicle. The main feature of this philosophy is that they effect high maneuvering at the beginning, causing the velocity vector of the UAV to align with the aiming point direction quickly and then settling along it. Therefore there is no need to maneuver all the way until the aiming point is reached and hence the chance of the UAV entering into the safety ball is minimized. Using the point of closest approach (PCA) [5], the proposed NGG andDGGalgorithms have also been extended for collision avoidance with moving obstacles in both cooperative as well as ignorant scenarios. Mathematical correlations between the guidance laws have also been established, which show that the NGG and DGG are exactly correlated to each other with appropriate gain selections, while the LGG is an approximation of DGG. A “sphere-tracking algorithm” is also proposed in this Note where the UAV is guided to track the surface of the safety spherewhenever a brief violation of the safety boundary occurs after reaching the aiming point because of the location of the next aiming point (which may include the target in Presented as Paper 2010-8315 at the AIAA Guidance, Navigation and Control, Toronto, 2–5August 2010; received 26May 2010; revision received 4 October 2010; accepted for publication 6 October 2010. Copyright © 2010 by Radhakant Padhi. Published by the American Institute of Aeronautics and Astronautics, Inc., with permission. Copies of this paper may be made for personal or internal use, on condition that the copier pay the $10.00 per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923; include the code 0731-5090/11 and $10.00 in correspondence with the CCC. ∗Former Project Assistant, Department of Aerospace Engineering; anushamujumdar87@gmail.com. Associate Professor, Department of Aerospace Engineering; padhi@ aero.iisc.ernet.in. JOURNAL OF GUIDANCE, CONTROL, AND DYNAMICS Vol. 34, No. 1, January–February 2011

The problem of assessing the quality of equipment of different unmanned aerial vehicles groups types based on fuzzy sets is considered. The growth in the number of unmanned aerial vehicles for various purposes and the expansion of their application in heterogeneous groups raises the question of developing new criteria for the effectiveness of their use. A new approach to increase the productivity of registration and information processing operations by determining the image quality based on the video camera's angle of inclination, altitude and flight speed of the unmanned aerial vehicle is proposed. Since the input information about the state of the scene and data from unmanned aerial vehicle sensors may be incomplete and poorly structured, the article proposes to apply the concept of granular calculations and fuzzy sets to build an air reconnaissance database. A new mathematical model (information granule) is proposed based on fuzzy data on the altitude and speed of flight and the angle of the camera, which allows obtaining a forecast of image quality that can be gotten by unmanned aerial vehicles while traveling along the route.

The increase in the number of Unmanned Aerial Vehicles (UAVs) for liquid transport tasks, such as agricultural spraying, results in significant stability challenges. The free movement of the liquid, known as sloshing, generates unpredictable forces that destabilize the vehicle and increase collision risks. This study treats this problem by developing and validating a nonlinear control strategy to ensure precise trajectory tracking while actively suppressing liquid sloshing. The coupled dynamics of the system are modeled using the Euler–Lagrange formalism by representing the UAV as a planar vertical take-off and landing (PVTOL) aircraft and the liquid sloshing dynamics as an equivalent pendulum model. The stability of the entire closed-loop system is proven using Lyapunov’s direct method. The analytical results are validated through numerical simulations in MATLAB/Simulink, which demonstrate excellent tracking of desired altitude and horizontal trajectories. Crucially, the simulations confirm that the controller effectively attenuates the sloshing oscillations, offering a robust solution to enhance the safety and operational performance of UAVs in liquid transport applications.

In this paper, a novel framework for power-efficient, cluster- based machine-to-machine (M2M) communications is proposed. In the studied model, a number of unmanned aerial vehicles (UAVs) are used as aerial base stations to collect data from the cluster heads (CHs) of a set of M2M clusters. To minimize the CHs' transmit power while satisfying the rate requirements of M2M devices, an optimal scheduling and resource allocation mechanism for CH-UAV communications is proposed. First, using the queue rate stability concept, the minimum number of UAVs as well as the dwelling time that each UAV must spend for servicing the CHs are computed. Next, the optimal resource allocation for the CH-UAV communication links is determined such that M2M devices rate requirements are satisfied with a minimum transmit power. Simulation results show that, as the packet transmission probability of machines increases, the minimum number of UAVs required to guarantee the queue rate stability of CHs will also significantly increase. Our results also show that, compared to a case with pre-deployed terrestrial base stations, the average transmit power of CHs will decrease by 68% when UAVs are used.

This article establishes a new multiunmanned aerial vehicle (multi-UAV)-enabled mobile edge computing (MEC) system, where a number of unmanned aerial vehicles (UAVs) are deployed as flying edge clouds for large-scale mobile users. In this system, we need to optimize the deployment of UAVs, by considering their number and locations. At the same time, to provide good services for all mobile users, it is necessary to optimize task scheduling. Specifically, for each mobile user, we need to determine whether its task is executed locally or on a UAV (i.e., offloading decision), and how many resources should be allocated (i.e., resource allocation). This article presents a two-layer optimization method for jointly optimizing the deployment of UAVs and task scheduling, with the aim of minimizing system energy consumption. By analyzing this system, we obtain the following property: the number of UAVs should be as small as possible under the condition that all tasks can be completed. Based on this property, in the upper layer, we propose a differential evolution algorithm with an elimination operator to optimize the deployment of UAVs, in which each individual represents a UAV's location and the entire population represents an entire deployment of UAVs. During the evolution, we first determine the maximum number of UAVs. Subsequently, the elimination operator gradually reduces the number of UAVs until at least one task cannot be executed under delay constraints. This process achieves an adaptive adjustment of the number of UAVs. In the lower layer, based on the given deployment of UAVs, we transform the task scheduling into a 0-1 integer programming problem. Due to the large-scale characteristic of this 0-1 integer programming problem, we propose an efficient greedy algorithm to obtain the near-optimal solution with much less time. The effectiveness of the proposed two-layer optimization method and the established multi-UAV-enabled MEC system is demonstrated on ten instances with up to 1000 mobile users.

Unmanned Aerial Vehicle (UAV) has received wide interest in recent years because of their promising potentials for several applications that include border surveillance, intrusion, detection, emergent item delivery, wildlife monitoring, rescue operations etc. The growing number of entrances of drones into airspace has emerged a significant interest in the collision and obstacle avoidance in autonomous operation. One of major challenges for safer deployment of UAVs is collision avoidance in order to make UAVs autonomous and self-sustainable. In today’s technological era, it is possible for UAVs to avoid obstacles and prevent collisions while navigation by implementing cutting edge computer vision algorithms and visual tracking systems. But it is challenging due to the limited payload in UAV that only permits vision based sensors such as camera, inertial measurement unit such for control and obstacle detection. This paper aims to summarize existing solutions of collision avoidance strategies used in the navigation of UAV. Collision avoidance strategies based on geometry, optimization, sense and avoid, vision-based and force field based methods are investigated in this study.

Unmanned aerial vehicles (UAV) have been widely used in many fields. UAV formation flight can complete more assignments than single UAV. Collision avoidance is an important part of UAV formation flight. In this paper, we put forward a three-dimensional method of dynamic collision avoidance for UAV formation flight based on the theory of velocity obstacle. The collection of all possible accelerations of the UAV can be obtained by the input of UAV. Considering that the relative velocity between the UAV and obstacle must be out of the collision cone, we can obtain the collection of feasible accelerations next moment. Then we choose the acceleration which is able to let the UAV closest to the target next moment in the collection as the real acceleration. The maximum and minimum velocity should also be set up. Each UAV can determine the best acceleration next time for itself. In addition to formation keeping, this paper also presents how to split the formation on the basis of the direction of each UAV. Numerical simulation is used to test the performance of this method at the end of this paper.

Autonomous Landing of Fixed Wing Unmanned Aerial Vehicle with Reactive Collision Avoidance

Recently, the use of unmanned aerial vehicles for both reconnaissance and fire strikes has been increasing. The control of such vehicles and the transmission of telemetry information are carried out using a combined command and telemetry radio link and frequency hopping spread spectrum technology. In such conditions, the task of developing automatic algorithms for detecting and separating radio links for portable radio monitoring devices becomes especially relevant. The aim of this work is to extend the capabilities of portable radio monitoring devices to detect unmanned aerial vehicles’ radio signals in sophisticated electronic environment by automating signal processing. Formally, the research task is to detect and separate several frequency hopping spread spectrum signals in same frequency band. To solve this task, it is first necessary to detect the frequency channels and estimate frequency and, if necessary, temporal and modulation parameters of the signals in these channels. Estimates of signal parameters values are recorded in associative arrays. The paper proposes a scheme of the algorithm for automatic detection and separation of signals with frequency hopping spread spectrum, as well as the structure of the array with the results of frequency band analysis. In the study of developed algorithm, we considered the practically important option of separating radio links with frequency hopping spread spectrum by the spectral width of the frequency element and the value of the signal-to-noise ratio in the frequency channel, since these features can be quite easily distinguished in the frequency domain. The radio links separation was performed by cluster analysis of scatter plots of parameter pairs estimates using a Gaussian mixture model. The developed algorithm can be implemented in existing and prospective portable radio monitoring devices to automatically detect and determine the number of unmanned aerial vehicles by their radio links signals, in particular, under conditions of a priori uncertainty about the values of signal parameters.