Marginal multi-Bernoulli filters: RFS derivation of MHT, JIPDA and association-based MeMBer

Recent developments in random finite sets (RFSs) have yielded a variety of tracking methods that avoid data association. This paper derives a form of the full Bayes RFS filter and observes that data association is implicitly present, in a data structure similar to MHT. Subsequently, algorithms are obtained by approximating the distribution of associations. Two algorithms result: one nearly identical to JIPDA, and another related to the MeMBer filter. Both improve performance in challenging environments.Comment: Journal version at http://ieeexplore.ieee.org/document/7272821. Matlab code of simple implementation included with ancillary file

Hybrid Poisson and multi-Bernoulli filters

The probability hypothesis density (PHD) and multi-target multi-Bernoulli (MeMBer) filters are two leading algorithms that have emerged from random finite sets (RFS). In this paper we study a method which combines these two approaches. Our work is motivated by a sister paper, which proves that the full Bayes RFS filter naturally incorporates a Poisson component representing targets that have never been detected, and a linear combination of multi-Bernoulli components representing targets under track. Here we demonstrate the benefit (in speed of track initiation) that maintenance of a Poisson component of undetected targets provides. Subsequently, we propose a method of recycling, which projects Bernoulli components with a low probability of existence onto the Poisson component (as opposed to deleting them). We show that this allows us to achieve similar tracking performance using a fraction of the number of Bernoulli components (i.e., tracks).Comment: Submitted to 15th International Conference on Information Fusion (2012

Gaussian Mixture Reduction of Tracking Multiple Maneuvering Targets in Clutter

The problem of tracking multiple maneuvering targets in clutter naturally leads to a Gaussian mixture representation of the Provability Density Function (PDF) of the target state vector. State-of-the-art Multiple Hypothesis Tracking (MHT) techniques maintain the mean, covariance and probability weight corresponding to each hypothesis, yet they rely on ad hoc merging and pruning rules to control the growth of hypotheses

Information theoretic sensor management

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2007.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.Includes bibliographical references (p. 195-203).Sensor management may be defined as those stochastic control problems in which control values are selected to influence sensing parameters in order to maximize the utility of the resulting measurements for an underlying detection or estimation problem. While problems of this type can be formulated as a dynamic program, the state space of the program is in general infinite, and traditional solution techniques are inapplicable. Despite this fact, many authors have applied simple heuristics such as greedy or myopic controllers with great success. This thesis studies sensor management problems in which information theoretic quantities such as entropy are utilized to measure detection or estimation performance. The work has two emphases: Firstly, we seek performance bounds which guarantee performance of the greedy heuristic and derivatives thereof in certain classes of problems. Secondly, we seek to extend these basic heuristic controllers to nd algorithms that provide improved performance and are applicable in larger classes of problems for which the performance bounds do not apply. The primary problem of interest is multiple object tracking and identification; application areas include sensor network management and multifunction radar control.(cont.) Utilizing the property of submodularity, as proposed for related problems by different authors, we show that the greedy heuristic applied to sequential selection problems with information theoretic objectives is guaranteed to achieve at least half of the optimal reward. Tighter guarantees are obtained for diffusive problems and for problems involving discounted rewards. Online computable guarantees also provide tighter bounds in specific problems. The basic result applies to open loop selections, where all decisions are made before any observation values are received; we also show that the closed loop greedy heuristic, which utilizes observations received in the interim in its subsequent decisions, possesses the same guarantee relative to the open loop optimal, and that no such guarantee exists relative to the optimal closed loop performance. The same mathematical property is utilized to obtain an algorithm that exploits the structure of selection problems involving multiple independent objects. The algorithm involves a sequence of integer programs which provide progressively tighter upper bounds to the true optimal reward. An auxiliary problem provides progressively tighter lower bounds, which can be used to terminate when a near-optimal solution has been found.(cont.) The formulation involves an abstract resource consumption model, which allows observations that expend different amounts of available time. Finally, we present a heuristic approximation for an object tracking problem in a sensor network, which permits a direct trade-o between estimation performance and energy consumption. We approach the trade-o through a constrained optimization framework, seeking to either optimize estimation performance over a rolling horizon subject to a constraint on energy consumption, or to optimize energy consumption subject to a constraint on estimation performance. Lagrangian relaxation is used alongside a series of heuristic approximations to and a tractable solution that captures the essential structure in the problem.by Jason L. Williams.Ph.D

A Persistent Simulation Environment for Autonomous Systems

The age of Autonomous Unmanned Aircraft Systems (AUAS) is creating new challenges for the accreditation and certification requiring new standards, policies and procedures that sanction whether a UAS is safe to fly. Establishing a basis for certification of autonomous systems via research into trust and trustworthiness is the focus of Autonomy Teaming and TRAjectories for Complex Trusted Operational Reliability (ATTRACTOR), a new NASA Convergent Aeronautics Solution (CAS) project. Simulation Environments to test and evaluate AUAS decision making may be a low-cost solution to help certify that various AUAS systems are trustworthy enough to be allowed to fly in current general and commercial aviation airspace. NASA is working to build a peer-to-peer persistent simulation (P3 Sim) environment. The P3 Sim will be a Massively Multiplayer Online (MMO) environment were AUAS avatars can interact with a complex dynamic environment and each other. The focus of the effort is to provide AUAS researchers a low-cost intuitive testing environment that will aid training for and assessment of decisions made by autonomous systems such as AUAS. This presentation focuses on the design approach and challenges faced in development of the P3 Sim Environment is support of investigating trustworthiness of autonomous systems

Gender Presentation and Membership Bias in Greek Organizations

The study objective was to explore the possibility of discrimination and bias based on perceived gender presentation. In this study, subjects were female and male undergraduate students of both Greek and non-Greek affiliations at a University in the Southeastern United States. Subjects were asked to rate the probability of extending group membership to others based on perceived visual gender appearance. In the pilot study, 150 University of Central Florida students were polled to assess three categories of visual gender presentation in pictures: average gender presentation (typical female or male), extreme gender presentation (extremely feminine or extremely masculine) and non-traditional gender presentation (masculine females or effeminate males). Three pictures of each gender presentation category were then chosen for the final study. In both studies, The Crowne-Marlowe (1964) Social Desirability Scale (CMDS) was administered. Results indicated no difference in the ratings between Greek and non-Greek participants. However, the results did show a statistically significant bias against individuals of average and non-traditional gender presentation versus individuals who represented extreme gender presentation. Hence, subjects were more likely to extend membership to individuals who appeared to be extremely feminine or extremely masculine. There was also a statistically significant bias favoring average over non-traditional gender presentation individuals. Additionally, social desirability bias played a significant role in how subjects made their selection. The study not only shows significant relationships between gender presentation and discrimination, but also provides evidence that male students prefer hyper-masculine males and female students prefer hyper-feminine females