Collision avoidance between UAV clusters using swarm intelligence techniques

In this article, several basic swarming laws for Unmanned Aerial Vehicles (UAVs) are developed for both two-dimensional (2D) plane and three-dimensional (3D) space. Effects of these basic laws on the group behaviour of swarms of UAVs are studied. It is shown that when cohesion rule is applied an equilibrium condition is reached in which all the UAVs settle at the same altitude on a circle of constant radius. It is also proved analytically that this equilibrium condition is stable for all values of velocity and acceleration. A decentralised autonomous decision-making approach that achieves collision avoidance without any central authority is also proposed in this article. Algorithms are developed with the help of these swarming laws for two types of collision avoidance, Group-wise and Individual, in 2D plane and 3D space. Effect of various parameters are studied on both types of collision avoidance schemes through extensive simulations.

A Reactive Inverse PN Algorithm for Collision Avoidance among Multiple Unmanned Aerial Vehicles

While performing a mission, multiple Unmanned Aerial Vehicles (UAVs) need to avoid each other to prevent collisions among them. In this paper, we design a collision avoidance algorithm to resolve the conflict among UAVs that are on a collision course while flying to heir respective destinations. The collision avoidance algorithm consist of each UAV that is on a collision course reactively executing a maneuver that will, as in `inverse' Proportional Navigation (PN), increase Line of Sight (LOS) rate between them, resulting in a `pulling out' of collision course. The algorithm is tested for high density traffic scenarios as well as for robustness in the presence of noise.

Correlation, Coding, and Cooperation in Wireless Sensor Networks

We consider a single-hop data-gathering sensor network, consisting of a set of sensor nodes that transmit data periodically to a base-station. We are interested in maximizing the lifetime of this network. With our definition of network lifetime and the assumption that the radio transmission energy consumption forms the most significant portion of the total energy consumption at a sensor node, we attempt to enhance the network lifetime by reducing the transmission energy budget of sensor nodes by exploiting three system-level opportunities. We pose the problem of maximizing lifetime as a max-min optimization problem subject to the constraint of successful data collection and limited energy supply at each node. This turns out to be an extremely difficult optimization to solve. To reduce the complexity of this problem, we allow the sensor nodes and the base-station to interactively communicate with each other and employ instantaneous decoding at the base-station. The chief contribution of the paper is to show that the computational complexity of our problem is determined by the complex interplay of various system-level opportunities and challenges.

Ship collision avoidance and COLREGS compliance using simulation-based control behavior selection with predictive hazard assessment

This paper describes a concept for a collision avoidance system for ships, which is based on model predictive control. A finite set of alternative control behaviors are generated by varying two parameters: offsets to the guidance course angle commanded to the autopilot and changes to the propulsion command ranging from nominal speed to full reverse. Using simulated predictions of the trajectories of the obstacles and ship, compliance with the Convention on the International Regulations for Preventing Collisions at Sea and collision hazards associated with each of the alternative control behaviors are evaluated on a finite prediction horizon, and the optimal control behavior is selected. Robustness to sensing error, predicted obstacle behavior, and environmental conditions can be ensured by evaluating multiple scenarios for each control behavior. The method is conceptually and computationally simple and yet quite versatile as it can account for the dynamics of the ship, the dynamics of the steering and propulsion system, forces due to wind and ocean current, and any number of obstacles. Simulations show that the method is effective and can manage complex scenarios with multiple dynamic obstacles and uncertainty associated with sensors and predictions.

Mobile Base Stations Placement and Energy Aware Routing in Wireless Sensor Networks

Increasing network lifetime is important in wireless sensor/ad-hoc networks. In this paper, we are concerned with algorithms to increase network lifetime and amount of data delivered during the lifetime by deploying multiple mobile base stations in the sensor network field. Specifically, we allow multiple mobile base stations to be deployed along the periphery of the sensor network field and develop algorithms to dynamically choose the locations of these base stations so as to improve network lifetime. We propose energy efficient low-complexity algorithms to determine the locations of the base stations; they include i) Top-K-max algorithm, ii) maximizing the minimum residual energy (Max-Min-RE) algorithm, and iii) minimizing the residual energy difference (MinDiff-RE) algorithm. We show that the proposed base stations placement algorithms provide increased network lifetimes and amount of data delivered during the network lifetime compared to single base station scenario as well as multiple static base stations scenario, and close to those obtained by solving an integer linear program (ILP) to determine the locations of the mobile base stations. We also investigate the lifetime gain when an energy aware routing protocol is employed along with multiple base stations.

Evolving Philosophies on Autonomous Obstacle/Collision Avoidance of Unmanned Aerial Vehicles

Much of the benefits of deploying unmanned aerial vehicles can be derived from autonomous missions. For such missions, however, sense-and-avoid capability (i.e., the ability to detect potential collisions and avoid them) is a critical requirement. Collision avoidance can be broadly classified into global and local path-planning algorithms, both of which need to be addressed in a successful mission. Whereas global path planning (which is mainly done offline) broadly lays out a path that reaches the goal point, local collision-avoidance algorithms, which are usually fast, reactive, and carried out online, ensure safety of the vehicle from unexpected and unforeseen obstacles/collisions. Even though many techniques for both global and local collision avoidance have been proposed in the recent literature, there is a great interest around the globe to solve this important problem comprehensively and efficiently and such techniques are still evolving. This paper presents a brief overview of a few promising and evolving ideas on collision avoidance for unmanned aerial vehicles, with a preferential bias toward local collision avoidance.

Rendezvous of Multiple UAVs with Collision Avoidance Using Consensus

This paper addresses the problem of multiple unmanned aerial vehicle (UAV) rendezvous when the UAVs have to perform maneuvers to avoid collisions with other UAVs. The proposed solution consists of using velocity control and a wandering maneuver, if needed, of the UAVs based on a consensus among them on the estimated time of arrival at the point of the rendezvous. This algorithm, with a slight modification is shown to be useful in tracking stationary or slowly moving targets with a standoff distance. The proposed algorithm is simple and computationally efficient. The simulation results demonstrate the efficacy of the proposed approach. DOI: 10.1061/(ASCE)AS.1943-5525.0000145. (C) 2012 American Society of Civil Engineers.

A co-operative formation-based collision avoidance approach for a group of autonomous vehicles (Special Issue on Adaptive Control and Signal Processing in Marine System)

This paper employs a unique decentralised cooperative control method to realise a formation-based collision avoidance strategy for a group of autonomous vehicles. In this approach, the vehicles' role in the formation and their alert and danger areas are first defined, and the formation-based intra-group and external collision avoidance methods are then proposed to translate the collision avoidance problem into the formation stability problem. The extension–decomposition–aggregation formation control method is next employed to stabilise the original and modified formations, whilst manoeuvring, and subsequently solve their collision avoidance problem indirectly. Simulation study verifies the feasibility and effectiveness of the intra-group and external collision avoidance strategy. It is demonstrated that both formation control and collision avoidance problems can be simultaneously solved if the stability of the expanded formation including external obstacles can be satisfied.

An adaptive cluster based routing scheme for mobile wireless sensor networks

Clustering schemes improve energy efficiency of wireless sensor networks. The inclusion of mobility as a new criterion for the cluster creation and maintenance adds new challenges for these clustering schemes. Cluster formation and cluster head selection is done on a stochastic basis for most of the algorithms. In this paper we introduce a cluster formation and routing algorithm based on a mobility factor. The proposed algorithm is compared with LEACH-M protocol based on metrics viz. number of cluster head transitions, average residual energy, number of alive nodes and number of messages lost