32 resultados para Bombing, Aerial.
Resumo:
In this article, the problem of two Unmanned Aerial Vehicles (UAVs) cooperatively searching an unknown region is addressed. The search region is discretized into hexagonal cells and each cell is assumed to possess an uncertainty value. The UAVs have to cooperatively search these cells taking limited endurance, sensor and communication range constraints into account. Due to limited endurance, the UAVs need to return to the base station for refuelling and also need to select a base station when multiple base stations are present. This article proposes a route planning algorithm that takes endurance time constraints into account and uses game theoretical strategies to reduce the uncertainty. The route planning algorithm selects only those cells that ensure the agent will return to any one of the available bases. A set of paths are formed using these cells which the game theoretical strategies use to select a path that yields maximum uncertainty reduction. We explore non-cooperative Nash, cooperative and security strategies from game theory to enhance the search effectiveness. Monte-Carlo simulations are carried out which show the superiority of the game theoretical strategies over greedy strategy for different look ahead step length paths. Within the game theoretical strategies, non-cooperative Nash and cooperative strategy perform similarly in an ideal case, but Nash strategy performs better than the cooperative strategy when the perceived information is different. We also propose a heuristic based on partitioning of the search space into sectors to reduce computational overhead without performance degradation.
Resumo:
This paper presents a robust fixed order H-2 controller design using Strengthened discrete optimal projection equations, which approximate the first order necessary optimality condition. The novelty of this work is the application of the robust H-2 controller to a micro aerial vehicle named Sarika2 developed in house. The controller is designed in discrete domain for the lateral dynamics of Sarika2 in the presence of low frequency atmospheric turbulence (gust) and high frequency sensor noise. The design specification includes simultaneous stabilization, disturbance rejection and noise attenuation over the entire flight envelope of the vehicle. The resulting controller performance is comprehensively analyzed by means of simulation.
Resumo:
The structures of three new diterpenes, calyone, calyenone, and precalyone, isolated from the aerial portion of Roylea calycina have been shown to be 3-acetoxy-15,16-epoxy-9-hydroxylabda-1 3(16),14-dien-7-one (2), 3-acetoxy-15,16-epoxylabda-8,13(16),14-trien-7-one (5), and 3-acetoxy-9,13;15,16-diepoxylabda-14-en-7-one (7), respectively, by chemical and spectroscopic studies. Precalyone showed antitumor activity against P-388 lymphocytic leukaemia.
Resumo:
An attempt has been made to forecast the potential of thermophilic fungi to grow in soil in the laboratory and in the field in the presence of a predominantly mesophilic fungal flora at usual temperature. The respiratory rate of thermophilic fungi was markedly responsive to changes in temperature, but that of mesophilic fungi was relatively independent of such changes. This suggested that in a thermally fluctuating environment, thermophilic fungi may be at a physiological disadvantage compared to mesophilic fungi. In mixed cultures in soil plates, thermophilic fungi outgrew mesophilic fungi under a fluctuating temperature regime only when the amplitude of the fluctuating temperatures was small and approached their temperature optima for growth. An antibody probe was used to detect the activity of native or an introduced strain of a thermophilic fungus, Thermomyces lanuginosus, under field conditions. The results suggest that although widespread, thermophilic fungi are ordinarily not an active component of soil microflora. Their presence in soil most likely may be the result of the aerial dissemination of propagules from composting plant material.
Resumo:
This paper addresses the problem of determining an optimal (shortest) path in three dimensional space for a constant speed and turn-rate constrained aerial vehicle, that would enable the vehicle to converge to a rectilinear path, starting from any arbitrary initial position and orientation. Based on 3D geometry, we propose an optimal and also a suboptimal path planning approach. Unlike the existing numerical methods which are computationally intensive, this optimal geometrical method generates an optimal solution in lesser time. The suboptimal solution approach is comparatively more efficient and gives a solution that is very close to the optimal one. Due to its simplicity and low computational requirements this approach can be implemented on an aerial vehicle with constrained turn radius to reach a straight line with a prescribed orientation as required in several applications. But, if the distance between the initial point and the straight line to be followed along the vertical axis is high, then the generated path may not be flyable for an aerial vehicle with limited range of flight path angle and we resort to a numerical method for obtaining the optimal solution. The numerical method used here for simulation is based on multiple shooting and is found to be comparatively more efficient than other methods for solving such two point boundary value problem.
Resumo:
Unmanned aerial vehicles (UAVs) have the potential to carry resources in support of search and prosecute operations. Often to completely prosecute a target, UAVs may have to simultaneously attack the target with various resources with different capacities. However, the UAVs are capable of carrying only limited resources in small quantities, hence, a group of UAVs (coalition) needs to be assigned that satisfies the target resource requirement. The assigned coalition must be such that it minimizes the target prosecution delay and the size of the coalition. The problem of forming coalitions is computationally intensive due to the combinatorial nature of the problem, but for real-time applications computationally cheap solutions are required. In this paper, we propose decentralized sub-optimal (polynomial time) and decentralized optimal coalition formation algorithms that generate coalitions for a single target with low computational complexity. We compare the performance of the proposed algorithms to that of a global optimal solution for which we need to solve a centralized combinatorial optimization problem. This problem is computationally intensive because the solution has to (a) provide a coalition for each target, (b) design a sequence in which targets need to be prosecuted, and (c) take into account reduction of UAV resources with usage. To solve this problem we use the Particle Swarm Optimization (PSO) technique. Through simulations, we study the performance of the proposed algorithms in terms of mission performance, complexity of the algorithms and the time taken to form the coalition. The simulation results show that the solution provided by the proposed algorithms is close to the global optimal solution and requires far less computational resources.
Resumo:
A team of unmanned aerial vehicles (UAVs) with limited communication ranges and limited resources are deployed in a region to search and destroy stationary and moving targets. When a UAV detects a target, depending on the target resource requirement, it is tasked to form a coalition over the dynamic network formed by the UAVs. In this paper, we develop a mechanism to find potential coalition members over the network using principles from internet protocol and introduce an algorithm using Particle Swarm Optimization to generate a coalition that destroys the target is minimum time. Monte-Carlo simulations are carried out to study how coalition are formed and the effects of coalition process delays.
Altitude variation of aerosol properties over the Himalayan range inferred from spatial measurements
Resumo:
Altitude variations of the mass concentration of black carbon, number concentration of composite aerosols are examined along with the columnar spectral aerosol optical depths using state of the art instruments and the Angstrom parameters are inferred from the ground based measurements at several altitude levels, en route from Manora Peak, Nainital (similar to 1950 m above mean sea level) to a low altitude station Haldwani (similar to 330 m above mean sea level) at its foothill within an aerial distance of <10,000 m. The measurements were done during the winter months (November-February) of 2005, 2006 and 2007 under fair weather conditions. The results show a rapid decrease in all the measured parameters with increase in altitude, with >60% contribution to the AOD coming from the regions below 1000 m. The Angstrom wavelength exponent remained high in the well mixed region, and decreased above. The normalized AOD gradient was used to estimate aerosol mixing height, which was found to be in the altitude range 1000-1500 m, above which the particle concentrations are slowly varying as a function of altitude. The heating rate at the surface is found to be maximum but decreases sharply with increase in altitude. Analysis of the wavelength dependence of absorption aerosol optical depth (AAOD) showed that the aerosol absorption over the site is generally due to mixed aerosols. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
This paper presents a robust fixed order H2controller design using strengthened discrete optimal projection equations, which approximate the first order necessary optimality condition. The novelty of this work is the application of the robust H2controller to a micro aerial vehicle named Sarika2 developed in house. The controller is designed in discrete domain for the lateral dynamics of Sarika2 in the presence of low frequency atmospheric turbulence (gust) and high frequency sensor noise. The design specification includes simultaneous stabilization, disturbance rejection and noise attenuation over the entire flight envelope of the vehicle. The resulting controller performance is comprehensively analyzed by means of simulation
Resumo:
GH3 proteins control auxin homeostasis by inactivating excess auxin as conjugates of amino acids and sugars and thereby controlling cellular bioactive auxin. Since auxin regulates many aspects of plant growth and development, regulated expression of these genes offers a mechanism to control various developmental processes. OsMGH3/OsGH3-8 is expressed abundantly in rice florets and is regulated by two related and redundant transcription factors, OsMADS1 and OsMADS6, but its contribution to flower development is not known. We functionally characterize OsMGH3 by overexpression and knock-down analysis and show a partial overlap in these phenotypes with that of mutants in OsMADS1 and OsMADS6. The overexpression of OsMGH3 during the vegetative phase affects the overall plant architecture, whereas its inflorescence-specific overexpression creates short panicles with reduced branching, resembling in part the effects of OsMADS1 overexpression. In contrast, the down-regulation of endogenous OsMGH3 caused phenotypes consistent with auxin overproduction or activated signaling, such as ectopic rooting from aerial nodes. Florets in OsMGH3 knock-down plants were affected in carpel development and pollen viability, both of which reduced fertility. Some of these floret phenotypes are similar to osmads6 mutants. Taken together, we provide evidence for the functional significance of auxin homeostasis and its transcriptional regulation during rice panicle branching and floret organ development.
Resumo:
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.
Resumo:
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.
Resumo:
In this paper a generalisation of the Voronoi partition is used for locational optimisation of facilities having different service capabilities and limited range or reach. The facilities can be stationary, such as base stations in a cellular network, hospitals, schools, etc., or mobile units, such as multiple unmanned aerial vehicles, automated guided vehicles, etc., carrying sensors, or mobile units carrying relief personnel and materials. An objective function for optimal deployment of the facilities is formulated, and its critical points are determined. The locally optimal deployment is shown to be a generalised centroidal Voronoi configuration in which the facilities are located at the centroids of the corresponding generalised Voronoi cells. The problem is formulated for more general mobile facilities, and formal results on the stability, convergence and spatial distribution of the proposed control laws responsible for the motion of the agents carrying facilities, under some constraints on the agents' speed and limit on the sensor range, are provided. The theoretical results are supported with illustrative simulation results.
Resumo:
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.