Models and algorithms for tracking of maneuvering objects using variable rate particle filters

Standard algorithms in tracking and other state-space models assume identical and synchronous sampling rates for the state and measurement processes. However, real trajectories of objects are typically characterized by prolonged smooth sections, with sharp, but infrequent, changes. Thus, a more parsimonious representation of a target trajectory may be obtained by direct modeling of maneuver times in the state process, independently from the observation times. This is achieved by assuming the state arrival times to follow a random process, typically specified as Markovian, so that state points may be allocated along the trajectory according to the degree of variation observed. The resulting variable dimension state inference problem is solved by developing an efficient variable rate particle filtering algorithm to recursively update the posterior distribution of the state sequence as new data becomes available. The methodology is quite general and can be applied across many models where dynamic model uncertainty occurs on-line. Specific models are proposed for the dynamics of a moving object under internal forcing, expressed in terms of the intrinsic dynamics of the object. The performance of the algorithms with these dynamical models is demonstrated on several challenging maneuvering target tracking problems in clutter. © 2006 IEEE.

Heterogeneous reconfigurable system for adaptive particle filters in real-time applications

This paper presents a heterogeneous reconfigurable system for real-time applications applying particle filters. The system consists of an FPGA and a multi-threaded CPU. We propose a method to adapt the number of particles dynamically and utilise the run-time reconfigurability of the FPGA for reduced power and energy consumption. An application is developed which involves simultaneous mobile robot localisation and people tracking. It shows that the proposed adaptive particle filter can reduce up to 99% of computation time. Using run-time reconfiguration, we achieve 34% reduction in idle power and save 26-34% of system energy. Our proposed system is up to 7.39 times faster and 3.65 times more energy efficient than the Intel Xeon X5650 CPU with 12 threads, and 1.3 times faster and 2.13 times more energy efficient than an NVIDIA Tesla C2070 GPU. © 2013 Springer-Verlag.

Interactive multi-objective particle swarm optimisation using decision space interaction

The most common approach to decision making in multi-objective optimisation with metaheuristics is a posteriori preference articulation. Increased model complexity and a gradual increase of optimisation problems with three or more objectives have revived an interest in progressively interactive decision making, where a human decision maker interacts with the algorithm at regular intervals. This paper presents an interactive approach to multi-objective particle swarm optimisation (MOPSO) using a novel technique to preference articulation based on decision space interaction and visual preference articulation. The approach is tested on a 2D aerofoil design case study and comparisons are drawn to non-interactive MOPSO. © 2013 IEEE.

The role of the catalytic particle in the growth of carbon nanotubes by plasma enhanced chemical vapor deposition

Vertically aligned carbon nanotubes were synthesized by plasma enhanced chemical vapor deposition using nickel as a metal catalyst. High resolution transmission electron microscopy analysis of the particle found at the tip of the tubes reveals the presence of a metastable carbide Ni3C. Since the carbide is found to decompose upon annealing at 600 degreesC, we suggest that Ni3C is formed after the growth is stopped due to the rapid cooling of the Ni-C interstitial solid solution. A detailed description of the tip growth mechanism is given, that accounts for the composite structure of the tube walls. The shape and size of the catalytic particle determine the concentration gradient that drives the diffusion of C atoms across and though the metal. (C) 2004 American Institute of Physics.

Resistance of cast polyurethane elastomers to solid particle erosion

The rates of erosive wear have been measured for a series of eight polyester-based one-component castable polyurethane elastomers, with widely varying mechanical properties. Erosion tests were conducted with airborne silica sand, 120μm in particle size, at an impact velocity of 50 ms-1 and impact angles of 30° and 90°. For these materials, which all showed similar values of rebound resilience, the erosion rate increased with increasing hardness, tensile modulus and tensile strength. These findings are at variance with those expected for wear by abrasion, perhaps because of differences in the strain rate or strain levels imposed on the elastomer during erosion and abrasion.

Comparative study of the slurry erosion and free-fall particle erosion of aluminum

A study has been performed of the erosion of aluminium by silica sand particles at a velocity of 4.5 m s-1, both air-borne and in the form of a water-borne slurry. Measurements made under similar experimental conditions show that slurry erosion proceeds at a rate several times that of air-borne erosion, the ratio of the two rates depending strongly on the angle of impact. Sand particles become embedded into the metal surface during air-borne particle erosion, forming a composite layer of metal and silica, and provide the major cause of the difference in wear rate. The embedded particles giving rise to surface hardening and a significant reduction in the erosion rate. Embedment of erodent particles was not observed during slurry erosion. Lubrication of the impacting interfaces by water appears to have minimal effect on the wear of aluminium by slurry erosion.

Simulation-based optimal sensor scheduling with application to observer trajectory planning

The sensor scheduling problem can be formulated as a controlled hidden Markov model and this paper solves the problem when the state, observation and action spaces are continuous. This general case is important as it is the natural framework for many applications. The aim is to minimise the variance of the estimation error of the hidden state w.r.t. the action sequence. We present a novel simulation-based method that uses a stochastic gradient algorithm to find optimal actions. © 2007 Elsevier Ltd. All rights reserved.