Search Strategies for Multiple UAV Search and Destroy Missions

Multiple UAVs are deployed to carry out a search and destroy mission in a bounded region. The UAVs have limited sensor range and can carry limited resources which reduce with use. The UAVs perform a search task to detect targets. When a target is detected which requires different type and quantities of resources to completely destroy, then a team of UAVs called as a coalition is formed to attack the target. The coalition members have to modify their route to attack the target, in the process, the search task is affected, as search and destroy tasks are coupled. The performance of the mission is a function of the search and the task allocation strategies. Therefore, for a given task allocation strategy, we need to devise search strategies that are efficient. In this paper, we propose three different search strategies namely; random search strategy, lanes based search strategy and grid based search strategy and analyze their performance through Monte-Carlo simulations. The results show that the grid based search strategy performs the best but with high information overhead.

UAV Grouping and Coordination Tactics for Ground Attack Missions

Grouping and coordination tactics for ground attack missions by a heterogeneous mix of reconnaissance, enemy suppression, and attack unmanned aerial vehicles (UAVs) is presented. Dubins' paths are used to determine the optimal number of attack UAVs and their positional and heading freedoms, as functions of weapon seeker range and field of view. A generic battlefield scenario with layered defense is created and the tactics are evaluated on a Group Flyer simulation platform for both nominal and off-nominal conditions.

Greening India Mission

The Government of India has announced the Greening India Mission (GIM) under the National Climate Change Action Plan. The Mission aims to restore and afforest about 10 mha over the period 2010-2020 under different sub-missions covering moderately dense and open forests, scrub/grasslands, mangroves, wetlands, croplands and urban areas. Even though the main focus of the Mission is to address mitigation and adaptation aspects in the context of climate change, the adaptation component is inadequately addressed. There is a need for increased scientific input in the preparation of the Mission. The mitigation potential is estimated by simply multiplying global default biomass growth rate values and area. It is incomplete as it does not include all the carbon pools, phasing, differing growth rates, etc. The mitigation potential estimated using the Comprehensive Mitigation Analysis Process model for the GIM for the year 2020 has the potential to offset 6.4% of the projected national greenhouse gas emissions, compared to the GIM estimate of only 1.5%, excluding any emissions due to harvesting or disturbances. The selection of potential locations for different interventions and species choice under the GIM must be based on the use of modelling, remote sensing and field studies. The forest sector provides an opportunity to promote mitigation and adaptation synergy, which is not adequately addressed in the GIM. Since many of the interventions proposed are innovative and limited scientific knowledge exists, there is need for an unprecedented level of collaboration between the research institutions and the implementing agencies such as the Forest Departments, which is currently non-existent. The GIM could propel systematic research into forestry and climate change issues and thereby provide global leadership in this new and emerging science.

Optimal explicit guidance of multistage launch vehicle along three-dimensional trajectory

Details of an efficient optimal closed-loop guidance algorithm for a three-dimensional launch are presented with simulation results. Two types of orbital injections, with either true anomaly or argument of perigee being free at injection, are considered. The resulting steering-angle profile under the assumption of uniform gravity lies in a canted plane which transforms a three-dimensional problem into an equivalent two-dimensional one. Effects of thrust are estimated using a series in a recursive way. Encke's method is used to predict the trajectory during powered flight and then to compute the changes due to actual gravity using two gravity-related vectors. Guidance parameters are evaluated using the linear differential correction method. Optimality of the algorithm is tested against a standard ground-based trajectory optimization package. The performance of the algorithm is tested for accuracy, robustness, and efficiency for a sun-synchronous mission involving guidance for a multistage vehicle that requires large pitch and yaw maneuver. To demonstrate applicability of the algorithm to a range of missions, injection into a geostationary transfer orbit is also considered. The performance of the present algorithm is found to be much better than others.

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.

Simulation and modelling of orbital debris environment by equivalent breakups

It is well known that the increasing space activities pose a serious threat to future missions. This is mainly due to the presence of spent stages, rockets spacecraft and fragments which can lead to collisions. The calculation of the collision probability of future space vehicles with the orbital debris is necessary for estimating the risk. There is lack of adequately catalogued and openly available detailed information on the explosion characteristics of trackable and untrackable debris data. Such a situation compels one to develop suitable mathematical modelling of the explosion and the resultant debris environment. Based on a study of the available information regarding the fragmentation, subsequent evolution and observation, it turns out to be possible to develop such a mathematical model connecting the dynamical features of the fragmentation with the geometrical/orbital characteristics of the debris and representing the environment through the idea of equivalent breakup. (C) 1997 COSPAR.

A perspective of biological supramolecular electron transfer

Electron transfer is an essential activity in biological systems. The migrating electron originates from water-oxygen in photosynthesis and reverts to dioxygen in respiration. In this cycle two metal porphyrin complexes possessing circular conjugated system and macrocyclic pi-clouds, chlorophyll and hems, play a decisive role in mobilising electrons for travel over biological structures as extraneous electrons. Transport of electrons within proteins (as in cytochromes) and within DNA (during oxidative damage and repair) is known to occur. Initial evaluations did not favour formation of semiconducting pathways of delocalized electrons of the peptide bonds in proteins and of the bases in nucleic acids. Direct measurement of conductivity of bulk material and quantum chemical calculations of their polymeric structures also did not support electron transfer in both proteins and nucleic acids. New experimental approaches have revived interest in the process of charge transfer through DNA duplex. The fluorescence on photoexcitation of Ru-complex was found to be quenched by Rh-complex, when both were tethered to DNA and intercalated in the base stack. Similar experiments showed that damage to G-bases and repair of T-T dimers in DNA can occur by possible long range electron transfer through the base stack. The novelty of this phenomenon prompted the apt name, chemistry at a distance. Based on experiments with ruthenium modified proteins, intramolecular electron transfer in proteins is now proposed to use pathways that include C-C sigma-bonds and surprisingly hydrogen bonds which remained out of favour for a long time. In support of this, some experimental evidence is now available showing that hydrogen bond-bridges facilitate transfer of electrons between metal-porphyrin complexes. By molecular orbital calculations over 20 years ago. we found that "delocalization of an extraneous electron is pronounced when it enters low-lying virtual orbitals of the electronic structures of peptide units linked by hydrogen bonds". This review focuses on supramolecular electron transfer pathways that can emerge on interlinking by hydrogen bonds and metal coordination of some unnoticed structures with pi-clouds in proteins and nucleic acids, potentially useful in catalysis and energy missions.

Traffic engineered NoC for streaming applications

Streaming applications demand hard bandwidth and throughput guarantees in a multiprocessor environment amidst resource competing processes. We present a Label Switching based Network-on-Chip (LS-NoC) motivated by throughput guarantees offered by bandwidth reservation. Label switching is a packet relaying technique in which individual packets carry route information in the form of labels. A centralized LS-NoC Management framework engineers traffic into Quality of Service (QoS) guaranteed routes. LS-NoC caters to the requirements of streaming applications where communication channels are fixed over the lifetime of the application. The proposed NoC framework inherently supports heterogeneous and ad hoc system-on-chips. The LS-NoC can be used in conjunction with conventional best effort NoC as a QoS guaranteed communication network or as a replacement to the conventional NoC. A multicast, broadcast capable label switched router for the LS-NoC has been designed. A 5 port, 256 bit data bus, 4 bit label router occupies 0.431 mm(2) in 130 nm and delivers peak bandwidth of 80 Gbits/s per link at 312.5 MHz. Bandwidth and latency guarantees of LS-NoC have been demonstrated on traffic from example streaming applications and on constant and variable bit rate traffic patterns. LS-NoC was found to have a competitive AreaxPower/Throughput figure of merit with state-of-the-art NoCs providing QoS. Circuit switching with link sharing abilities and support for asynchronous operation make LS-NoC a desirable choice for QoS servicing in chip multiprocessors. (C) 2013 Elsevier B.V. All rights reserved.

Optimal trajectory planning for path convergence in three-dimensional space

This article addresses the problem of determining the shortest path that connects a given initial configuration (position, heading angle, and flight path angle) to a given rectilinear or a circular path in three-dimensional space for a constant speed and turn-rate constrained aerial vehicle. The final path is assumed to be located relatively far from the starting point. Due to its simplicity and low computational requirements the algorithm can be implemented on a fixed-wing type unmanned air vehicle in real time in missions where the final path may change dynamically. As wind has a very significant effect on the flight of small aerial vehicles, the method of optimal path planning is extended to meet the same objective in the presence of wind comparable to the speed of the aerial vehicles. But, if the path to be followed is closer to the initial point, an off-line method based on multiple shooting, in combination with a direct transcription technique, is used to obtain the optimal solution. Optimal paths are generated for a variety of cases to show the efficiency of the algorithm. Simulations are presented to demonstrate tracking results using a 6-degrees-of-freedom model of an unmanned air vehicle.