975 resultados para all terrain vehicle
Resumo:
Abstract. Let G = (V,E) be a weighted undirected graph, with non-negative edge weights. We consider the problem of efficiently computing approximate distances between all pairs of vertices in G. While many efficient algorithms are known for this problem in unweighted graphs, not many results are known for this problem in weighted graphs. Zwick [14] showed that for any fixed ε> 0, stretch 1 1 + ε distances between all pairs of vertices in a weighted directed graph on n vertices can be computed in Õ(n ω) time, where ω < 2.376 is the exponent of matrix multiplication and n is the number of vertices. It is known that finding distances of stretch less than 2 between all pairs of vertices in G is at least as hard as Boolean matrix multiplication of two n×n matrices. It is also known that all-pairs stretch 3 distances can be computed in Õ(n 2) time and all-pairs stretch 7/3 distances can be computed in Õ(n 7/3) time. Here we consider efficient algorithms for the problem of computing all-pairs stretch (2+ε) distances in G, for any 0 < ε < 1. We show that all pairs stretch (2 + ε) distances for any fixed ε> 0 in G can be computed in expected time O(n 9/4 logn). This algorithm uses a fast rectangular matrix multiplication subroutine. We also present a combinatorial algorithm (that is, it does not use fast matrix multiplication) with expected running time O(n 9/4) for computing all-pairs stretch 5/2 distances in G. 1
Resumo:
In this paper, we present the design and development details of a micro air vehicle (MAV) built around a quadrotor configuration. A survey of implemented MAVs suggests that a quadrotor design has several advantages over other configurations, especially in the context of swarm intelligence applications. Our design approach consists of three stages. However, the focus of this paper is restricted to the first stage that involves selection of crucial components such as motor-rotor pair, battery source, and structural material. The application of MAVs are broad-ranging, from reconnaissance to search and rescue, and have immense potential in the rapidly advancing field of swarm intelligence.
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:
A method for calculating the bends in the glide slope due to uneven terrain is presented. A computer program written for the purpose enables the calculation of the difference in depth of modulation (DDM) at any point, taking into account the effect of uneven terrain. Results are presented for a hypothetical case of a hill in front of the runway. The program enables us to predict the glide slope bends due to irregular terrain, so that proper selection of glide slope antenna location can be made.
Resumo:
A new and efficient approach to construct a 3D wire-frame of an object from its orthographic projections is described. The input projections can be two or more and can include regular and complete auxiliary views. Each view may contain linear, circular and other conic sections. The output is a 3D wire-frame that is consistent with the input views. The approach can handle auxiliary views containing curved edges. This generality derives from a new technique to construct 3D vertices from the input 2D vertices (as opposed to matching coordinates that is prevalent in current art). 3D vertices are constructed by projecting the 2D vertices in a pair of views on the common line of the two views. The construction of 3D edges also does not require the addition of silhouette and tangential vertices and subsequently splitting edges in the views. The concepts of complete edges and n-tuples are introduced to obviate this need. Entities corresponding to the 3D edge in each view are first identified and the 3D edges are then constructed from the information available with the matching 2D edges. This allows the algorithm to handle conic sections that are not parallel to any of the viewing directions. The localization of effort in constructing 3D edges is the source of efficiency of the construction algorithm as it does not process all potential 3D edges. Working of the algorithm on typical drawings is illustrated. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
Expanding energy access to the rural population of India presents a critical challenge for its government. The presence of 364 million people without access to electricity and 726 million who rely on biomass for cooking indicate both the failure of past policies and programs, and the need for a radical redesign of the current system. We propose an integrated implementation framework with recommendations for adopting business principles with innovative institutional, regulatory, financing and delivery mechanisms. The framework entails establishment of rural energy access authorities and energy access funds, both at the national and regional levels, to be empowered with enabling regulatory policies, capital resources and the support of multi-stakeholder partnership. These institutions are expected to design, lead, manage and monitor the rural energy interventions. At the other end, trained entrepreneurs would be expected to establish bioenergy-based micro-enterprises that will produce and distribute energy carriers to rural households at an affordable cost. The ESCOs will function as intermediaries between these enterprises and the international carbon market both in aggregating carbon credits and in trading them under CDM. If implemented, such a program could address the challenges of rural energy empowerment by creating access to modern energy carriers and climate change mitigation. (C) 2011 Elsevier Ltd. All rights reserved.
Resumo:
Kinetic schemes as pursued in CFD Centre are obtained by taking suitable moments of upwind schemes for Boltzmann equation without collision term. The primary ones among these are KFVS, LSKUM, KFMG and these have been applied successfully to a variety of flow problems using various meshes. These schemes have been found to be very robust.
Resumo:
More than six years after the great (M-w 9.2) Sumatra-Andaman earthquake, postevent processes responsible for relaxation of the coseismic stress change remain controversial. Modeling of Andaman Islands Global Positioning System (GPS) displacements indicated early near-field motions were dominated by slip down-dip of the rupture, but various researchers ascribe elements of relaxation to dominantly poroelastic, dominantly viscoelastic, and dominantly fault slip processes, depending primarily on their measurement sampling and modeling tools used. After subtracting a pre-2004 interseismic velocity, significant transient motion during the 2008.5-2010.5 epoch confirms that postseismic relaxation processes continue in Andaman. Modeling three-component velocities as viscoelastic flow yields a weighted root-mean-square (wrms) misfit that always exceeds the wrms of the measured signal (26.3 mm/yr). The best-fitting models are those that yield negligible deformation, indicating the model parameters have no real physical meaning. GPS velocities are well fit (wrms 4.0 mm/yr) by combining a viscoelastic flow model that best fits the horizontal velocities with similar to 50 cm/yr thrust slip down-dip of the coseismic rupture. Both deep slip and flow respond to stress changes, and each can significantly change stress in the realm of the other; it therefore is reasonable to expect that both transient deep slip and viscoelastic flow will influence surface deformation long after a great earthquake.