Capturability of realistic generalized true proportional navigation

The capturability of a realistic generalized true proportional navigation (RGTPN) guidance law, against a nonmaneuvering target, is analyzed. The RGTPN law is obtained by relaxing the somewhat unrealistic assumption of constant closing velocity, made in all earlier studies on generalized true proportional navigation (GTPN), and incorporating the actual time-varying value in the guidance law. Closed-form solutions for the complete capture region of RGTPN is obtained in terms of both zero and acceptable non-zero miss distances. It is shown that the capture region of RGTPN in the initial relative velocity space is significantly smaller than that of GTPN, for reasonable values of navigation constant (N) and angular direction (eta) of the missile commanded latax. However, for certain values of N and eta, capturability of RGTPN is found to be better. It is also shown that if in one of the versions of GTPN, which uses constant values of both the closing velocity and the line-of-sight (LOS) angular velocity in the guidance law, the corresponding realistic time-varying quantities are used, the capture region actually expands to cover the whole of the initial relative velocity space. A number of examples are given to compare the capture performance of RGTPN with other versions of the GTPN guidance laws.

Critical buckling temperature of single-walled carbon nanotubes embedded in a one-parameter elastic medium based on nonlocal continuum mechanics

In this paper, the critical budding temperature of single-walled carbon nanotubes (SWCNTs), which are embedded in one-parameter elastic medium (Winkler foundation) is estimated under the umbrella of continuum mechanics theory. Nonlocal continuum theory is incorporated into Timoshenko beam model and the governing differential equations of motion are derived. An explicit expression for the non-dimensional critical buckling temperature is also derived in this work. The effect of the nonlocal small scale coefficient, the Winkler foundation parameter and the ratio of the length to the diameter on the critical buckling temperature is investigated in detail. It can be observed that the effects of nonlocal small scale parameter and the Winkler foundation parameter are significant and should be considered for thermal analysis of SWCNTs. The results presented in this paper can provide useful guidance for the study and design of the next generation of nanodevices that make use of the thermal buckling properties of embedded single-walled carbon nanotubes. (C) 2011 Elsevier B.V. All rights reserved.

Suboptimal Midcourse Guidance of Interceptors for High-Speed Targets with Alignment Angle Constraint

Using the recently developed computationally efficient model predictive static programming and a closely related model predictive spread control concept, two nonlinear suboptimal midcourse guidance laws are presented in this paper for interceptors engaging against incoming high-speed ballistic missiles. The guidance laws are primarily based on nonlinear optimal control theory, and hence imbed effective trajectory optimization concepts into the guidance laws. Apart from being energy efficient by minimizing the control usage throughout the trajectory (minimum control usage leads to minimum turning, and hence leads to minimum induced drag), both of these laws enforce desired alignment constraints in both elevation and azimuth in a hard-constraint sense. This good alignment during midcourse is expected to enhance the effectiveness of the terminal guidance substantially. Both point mass as well as six-degree-of-freedom simulation results (with a realistic inner-loop autopilot based on dynamic inversion) are presented in this paper, which clearly shows the effectiveness of the proposed guidance laws. It has also been observed that, even with different perturbations of missile parameters, the performance of guidance is satisfactory. A comparison study, with the vector explicit guidance scheme proposed earlier in the literature, also shows that the newly proposed model-predictive-static-programming-based and model-predictive-spread-control-based guidance schemes lead to lesser lateral acceleration demand and lesser velocity loss during engagement.

Incremental-angle and angular velocity estimation using a star sensor

A method is described for estimating the incremental angle and angular velocity of a spacecraft using integrated rate parameters with the help of a star sensor alone. The chief advantage of this method is that the measured stars need not be identified, whereas the identification of the stars is necessary in earlier methods. This proposed estimation can be carried out with all of the available measurements by a simple linear Kalman filter, albeit with a time-varying sensitivity matrix. The residuals of estimated angular velocity by the proposed spacecraft incremental-angle and angular velocity estimation method are as accurate as the earlier methods. This method also enables the spacecraft attitude to be reconstructed for mapping the stars into an imaginary unit sphere in the body reference frame, which will preserve the true angular separation of the stars. This will pave the way for identification of the stars using any angular separation or triangle matching techniques applied to even a narrow field of view sensor that is made to sweep the sky. A numerical simulation for inertial as well as Earth pointing spacecraft is carried out to establish the results.

Axial wave propagation in coupled nanorod system with nonlocal small scale effects

This article deals with the axial wave propagation properties of a coupled nanorod system with consideration of small scale effects. The nonlocal elasticity theory has been incorporated into classical rod/bar model to capture unique features of the coupled nanorods under the umbrella of continuum mechanics theory. Nonlocal rod model is developed for coupled nanorods. The strong effect of the nonlocal scale has been obtained which leads to substantially different wave behavior of nanorods from those of macroscopic rods. Explicit expressions are derived for wavenumber, cut-off frequency and escape frequency of nanorods. The analysis shows that the wave characteristics of nanorods are highly over estimated by the classical rod model, which ignores the effect of small-length scale. The studies also shows that the nonlocal scale parameter introduces certain band gap region in axial or longitudinal wave mode, where no wave propagation occurs. This is manifested in the spectrum cures as the region, where the wavenumber tends to infinite or wave speed tends to zero. The effect of the coupled spring stiffness is also capture in the present analysis. It has been also shown that the cut-off frequency increases as the stiffness of the coupled spring increases and also the coupled spring stiffness has no effect on escape frequency of the axial wave mode in the nanorod. This cut-off frequency is also independent of the nonlocal small scale parameter. The present study may bring in helpful insights while investigating multiple-nanorod-system-models for future nano-optomechanical systems applications. The results can also provide useful guidance for the study and design of the next generation of nanodevices that make use of the wave propagation properties of coupled single-walled carbon nanotubes or coupled nanorods. (C) 2011 Elsevier Ltd. All rights reserved.

Nonlinear Model Predictive Spread Acceleration Guidance with Impact Angle Constraint for Stationary Targets

A new technique named as model predictive spread acceleration guidance (MPSAG) is proposed in this paper. It combines nonlinear model predictive control and spread acceleration guidance philosophies. This technique is then used to design a nonlinear suboptimal guidance law for a constant speed missile against stationary target with impact angle constraint. MPSAG technique can be applied to a class of nonlinear problems, which leads to a closed form solution of the lateral acceleration (latax) history update. Guidance command assumed is the lateral acceleration (latax), applied normal to the velocity vector. The new guidance law is validated by considering the nonlinear kinematics with both lag-free as well as first order autopilot delay. The simulation results show that the proposed technique is quite promising to come up with a nonlinear guidance law that leads to both very small miss distance as well as the desired impact angle.

Energy-insensitive Guidance of Solid Motor Propelled Long Range Flight Vehicles Using MPSP and Dynamic Inversion

A energy-insensitive explicit guidance design is proposed in this paper by appending newlydeveloped nonlinear model predictive static programming technique with dynamic inversion, which render a closed form solution of the necessary guidance command update. The closed form nature of the proposed optimal guidance scheme suppressed the computational difficulties, and facilitate realtime solution. The guidance law is successfully verified in a solid motor propelled long range flight vehicle, for which developing an effective guidance law is more difficult as compared to a liquid engine propelled vehicle, mainly because of the absence of thrust cutoff facility. The scheme guides the vehicle appropriately so that it completes the mission within a tight error bound assuming that the starting point of the second stage to be a deterministic point beyond the atmosphere. The simulation results demonstrate its ability to intercept the target, even with an uncertainty of greater than 10% in the burnout time

Nonlinear Model Predictive Spread Acceleration Guidance with Impact Angle Constraint for Slow-moving Targets

A new technique named as model predictive spread acceleration guidance (MPSAG) is proposed in this paper. It combines nonlinear model predictive control and spread acceleration guidance philosophies. This technique is then used to design a nonlinear suboptimal guidance law for a constant speed missile against stationary target with impact angle constraint. MPSAG technique can be applied to a class of nonlinear problems, which leads to a closed form solution of the lateral acceleration (latax) history update. Guidance command assumed is the lateral acceleration (latax), applied normal to the velocity vector. The new guidance law is validated by considering the nonlinear kinematics with both lag-free as well as first order autopilot delay. The simulation results show that the proposed technique is quite promising to come up with a nonlinear guidance law that leads to both very small miss distance as well as the desired impact angle.

Protocols for Collection, Preservation and Enumeration of Diatoms from Aquatic Habitats fro Water Quality Monitoring in India

Diatoms have become important organisms for monitoring freshwaters and their value has been recognised in Europe, American and African continents. If India is to include diatoms in the current suite of bioindicators, then thorough testing of diatom-based techniques is required. This paper provides guidance on methods through all stages of diatom collection from different habitats from streams and lakes, preparation and examination for the purposes of water quality assessment that can be adapted to most aquatic ecosystems in India.

Efficient Algorithms for Computing All Low s-t Edge Connectivities and Related Problems

Given an undirected unweighted graph G = (V, E) and an integer k ≥ 1, we consider the problem of computing the edge connectivities of all those (s, t) vertex pairs, whose edge connectivity is at most k. We present an algorithm with expected running time Õ(m + nk3) for this problem, where |V| = n and |E| = m. Our output is a weighted tree T whose nodes are the sets V1, V2,..., V l of a partition of V, with the property that the edge connectivity in G between any two vertices s ε Vi and t ε Vj, for i ≠ j, is equal to the weight of the lightest edge on the path between Vi and Vj in T. Also, two vertices s and t belong to the same Vi for any i if and only if they have an edge connectivity greater than k. Currently, the best algorithm for this problem needs to compute all-pairs min-cuts in an O(nk) edge graph; this takes Õ(m + n5/2kmin{k1/2, n1/6}) time. Our algorithm is much faster for small values of k; in fact, it is faster whenever k is o(n5/6). Our algorithm yields the useful corollary that in Õ(m + nc3) time, where c is the size of the global min-cut, we can compute the edge connectivities of all those pairs of vertices whose edge connectivity is at most αc for some constant α. We also present an Õ(m + n) Monte Carlo algorithm for the approximate version of this problem. This algorithm is applicable to weighted graphs as well. Our algorithm, with some modifications, also solves another problem called the minimum T-cut problem. Given T ⊆ V of even cardinality, we present an Õ(m + nk3) algorithm to compute a minimum cut that splits T into two odd cardinality components, where k is the size of this cut.

Faster algorithms for all-pairs small stretch distances in weighted graphs

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