Uncertainty based online planning for UAV target finding in cluttered and GPS-denied environments

There are some scenarios in which Unmmaned Aerial Vehicle (UAV) navigation becomes a challenge due to the occlusion of GPS systems signal, the presence of obstacles and constraints in the space in which a UAV operates. An additional challenge is presented when a target whose location is unknown must be found within a confined space. In this paper we present a UAV navigation and target finding mission, modelled as a Partially Observable Markov Decision Process (POMDP) using a state-of-the-art online solver in a real scenario using a low cost commercial multi rotor UAV and a modular system architecture running under the Robotic Operative System (ROS). Using POMDP has several advantages to conventional approaches as they take into account uncertainties in sensor information. We present a framework for testing the mission with simulation tests and real flight tests in which we model the system dynamics and motion and perception uncertainties. The system uses a quad-copter aircraft with an board downwards looking camera without the need of GPS systems while avoiding obstacles within a confined area. Results indicate that the system has 100% success rate in simulation and 80% rate during flight test for finding targets located at different locations.

Theoretical Studies of Hard Filling in Loop Heat Pipes

Loop heat pipe is a passive two-phase heat transport device that is gaining importance as a part of spacecraft thermal control systems and also in applications (such as in avionic cooling and submarines). Hard fill of a loop heat pipe occurs when the compensation chamber is full of liquid. A theoretical study is undertaken to investigate the issues underlying the loop beat pipe hard-fill phenomenon. The results of the study suggest that the mass of charge and the presence of a bayonet have significant impact on the loop heat pipe operation. With a largern mass of charge, a loop heat pipe hard fills at a lower heat load. As the heat load increases, there is a steep rise in the loop heat pipe operating temperature. In a loop heat pipe with a saturated compensation chamber, and also in a hard-filled loop heat pipe without a bayonet, the temperature of the compensation chamber and that of the liquid core are nearly equal. When a loop heat pipe with a bayonet hard fills, the compensation chamber and the evaporator core temperatures are different.

Performance Analysis of Guidance Laws Based on Timescale Gap

An analytical treatment of performance analysis of guidance laws is possible only in simplistic scenarios. As the complexity of the guidance system increases, a search for analytical solutions becomes quite impractical. In this paper, a new performance measure, based upon the notion of a timescale gap that can be computed through numerical simulations, is developed for performance analysis of guidance laws. Finite time Lyapunov exponents are used to define the timescale gap. It is shown that the timescale gap can be used for quantification of the rate of convergence of trajectories to the collision course. Comparisonbetween several guidance laws, based on the timescale gap, is presented. Realistic simulations to study the effect of aerodynamicsand atmospheric variations on the timescale gap of these guidance laws are also presented.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Collecting data from distributed FOSS projects

A key trait of Free and Open Source Software (FOSS) development is its distributed nature. Nevertheless, two project-level operations, the fork and the merge of program code, are among the least well understood events in the lifespan of a FOSS project. Some projects have explicitly adopted these operations as the primary means of concurrent development. In this study, we examine the effect of highly distributed software development, is found in the Linux kernel project, on collection and modelling of software development data. We find that distributed development calls for sophisticated temporal modelling techniques where several versions of the source code tree can exist at once. Attention must be turned towards the methods of quality assurance and peer review that projects employ to manage these parallel source trees. Our analysis indicates that two new metrics, fork rate and merge rate, could be useful for determining the role of distributed version control systems in FOSS projects. The study presents a preliminary data set consisting of version control and mailing list data.

Optimal management of beaver population using a reduced-order distributed parameter model and single network adaptive critics

Beavers are often found to be in conflict with human interests by creating nuisances like building dams on flowing water (leading to flooding), blocking irrigation canals, cutting down timbers, etc. At the same time they contribute to raising water tables, increased vegetation, etc. Consequently, maintaining an optimal beaver population is beneficial. Because of their diffusion externality (due to migratory nature), strategies based on lumped parameter models are often ineffective. Using a distributed parameter model for beaver population that accounts for their spatial and temporal behavior, an optimal control (trapping) strategy is presented in this paper that leads to a desired distribution of the animal density in a region in the long run. The optimal control solution presented, imbeds the solution for a large number of initial conditions (i.e., it has a feedback form), which is otherwise nontrivial to obtain. The solution obtained can be used in real-time by a nonexpert in control theory since it involves only using the neural networks trained offline. Proper orthogonal decomposition-based basis function design followed by their use in a Galerkin projection has been incorporated in the solution process as a model reduction technique. Optimal solutions are obtained through a "single network adaptive critic" (SNAC) neural-network architecture.

On using peak amplitude and rise time for AE source characterization

Acoustic Emission (AE) signals, which are electrical version of acoustic emissions, are usually analysed using a set of signal parameters. The major objective of signal analysis is to study the characteristics of the sources of emissions. Peak amplitude (P-a) and rise time (R-t) are two such parameters used for source characterization. In this paper, we theoretically investigate the efficiency of P-a and R-t to classify and characterize AE sources by modelling the input stress pulse and transducer. Analytical expressions obtained for P-a and R-t clearly indicate their use and efficiency for source characterization. It is believed that these results may be of use to investigators in areas like control systems and signal processing also.

Constant weight codes based on ideals of commutative rings

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme is based on the uniqueness of the primary decomposition of ideals in Noetherian rings. The source alphabet consists of a set of radical ideals constructed from a chosen subset of the prime spectrum of the ring. The distance function between two radical ideals is taken to be the Hamming metric based on the symmetric distance between sets. As an application we construct codes for random networks employing SAF routing.

Loop Heat Pipes: A Review of Fundamentals, Operation, and Design

The loop heat pipe (LHP) is a passive two-phase heat transport device that is gaining importance as a part of spacecraft thermal control systems and also in applications such as in avionics cooling and submarines. A major advantage of a loop heat pipe is that the porous wick structure is confuned to the evaporator section, and connection between the evaporator and condenser sections is by smooth tubes, thus minimizing pressure drop. A brief overview of loop heat pipes with respect to basic fundamentals, construction details, operating principles, and typical operating characteristics is presented in this paper. Finally, the paper presents the current developments in modeling of thermohydraulics and design methodologies of LHPs.

Proportional navigation with delayed line-of-sight rate

This brief discusses the convergence analysis of proportional navigation (PN) guidance law in the presence of delayed line-of-sight (LOS) rate information. The delay in the LOS rate is introduced by the missile guidance system that uses a low cost sensor to obtain LOS rate information by image processing techniques. A Lyapunov-like function is used to analyze the convergence of the delay differential equation (DDE) governing the evolution of the LOS rate. The time-to-go until which decreasing behaviour of the Lyapunov-like function can be guaranteed is obtained. Conditions on the delay for finite time convergence of the LOS rate are presented for the linearized engagement equation. It is observed that in the presence of line-of-sight rate delay, increasing the effective navigation constant of the PN guidance law deteriorates its performance. Numerical simulations are presented to validate the results.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Capturability Analysis of a 3-D Retro-PN Guidance Law for Higher Speed Nonmaneuvering Targets

This brief presents the capturability analysis of a 3-D Retro-proportional navigation (Retro-PN) guidance law, which uses a negative navigation constant (as against the usual positive one), for intercepting targets having higher speeds than interceptors. This modification makes it possible to achieve collision conditions that were inaccessible to the standard PN law. A modified polar coordinate system, that makes the model more compact, is used in this brief for capturability analysis. In addition to the ratio of the target to interceptor speeds, the directional cosines of the interceptor, and target velocity vectors play a crucial role in the capturability. The existence of nontrivial capture zone of the Retro-PN guidance law and necessary and sufficient conditions, for capturing the target in finite time, are presented. A sufficient condition on the navigation constant is derived to ensure finiteness of the line-of-sight turn rate. The results are more extensive than those available for 2-D engagements, which can be obtained as special cases of this brief. Simulation results are given to support the analytical results.

Synchronization of modified Chua's circuit with x vertical bar x vertical bar function

This paper considers the chaos synchronization of the modified Chua's circuit with x vertical bar x vertical bar function. We firstly show that a couple of the modified Chua systems with different parameters and initial conditions can be synchronized using active control when the values of parameters both in drive system and response system are known aforehand. Furthermore, based on Lyapunov stability theory we propose an adaptive active control approach to make the states of two identical Chua systems with unknown constant parameters asymptotically synchronized. Moreover the designed controller is independent of those unknown parameters. Numerical simulations are given to validate the proposed synchronization approach.