KLKeith A. LeGrand

Keith A. LeGrand

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Keith A. LeGrand has a total of 31 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Adaptive Filtering for Multisatellite Relative Navigation with Quantized Measurements

    by Simone Semeraro, John L. Iannamorelli, Keith A. LeGrand, Carolin Frueh

    In non-cooperative close-proximity operations, onboard optical measurements of a nearby space object can be used to determine its relative state. If the target geometry is known a priori, range information can be inferred from the apparent target extent in the image plane using a process known as stadiametric range finding. However, quantization errors of the target extent can dominate the indirect range measurement, thus violating standard modeling assumptions. This paper develops a new probabilistic measurement model to account for quantized and imprecise measurements. A Bayesian adaptive Gaussian mixture filter is derived for single- and multisatellite relative navigation that splits mixands about the quantization set boundaries. The navigation filter is shown to produce accurate and consistent relative state estimates in single- and multi-inspector scenarios involving a geostationary-orbiting target.

  • Open Access

    Analytical Multi-Impulse Collision Avoidance Manoeuvre Optimization

    by Luigi De Maria, Zeno Pavanello, Andrea De Vittori, Keith A. LeGrand, Pierluigi Di Lizia

  • Higher-Order Tensor-Based Deferral of Gaussian Splitting for Orbit Uncertainty Propagation

    by G. Andrew Siciliano, Keith A. LeGrand, Jackson Kulik

    Accurate propagation of orbital uncertainty is essential for a range of applications within space domain awareness. Adaptive Gaussian mixture-based approaches offer tractable nonlinear uncertainty propagation through splitting mixands to increase resolution in areas of stronger nonlinearities, as well as by reducing mixands to prevent unnecessary computational effort. Recent work introduced principled heuristics that incorporate information from the system dynamics and initial uncertainty to determine optimal directions for splitting. This paper develops adaptive uncertainty propagation methods based on these robust splitting techniques. A deferred splitting algorithm tightly integrated with higher-order splitting techniques is proposed and shown to offer substantial gains in computational efficiency without sacrificing accuracy. Second-order propagation of mixand moments is also seen to improve accuracy while retaining significant computational savings from deferred splitting. Different immediate and deferred splitting methods are compared in four representative test cases, including a low Earth orbit, a geostationary orbit, a Molniya orbit, and a multi-body cislunar orbit.


  • Nonlinearity- and Uncertainty-Informed Moment-Matching Gaussian Mixture Splitting

    by Jackson Kulik, Keith A. LeGrand

    Many problems in navigation and tracking require increasingly accurate characterizations of the evolution of uncertainty in nonlinear systems. Nonlinear uncertainty propagation approaches based on Gaussian mixture density approximations offer distinct advantages over sampling based methods in their computational cost and continuous representation. State-of-the art Gaussian mixture approaches are adaptive in that individual Gaussian mixands are selectively split into mixtures to yield better approximations of the true propagated distribution. Despite the importance of the splitting process to accuracy and computational efficiency, relatively little work has been devoted to mixand selection and splitting direction optimization. The first part of this work presents splitting methods that preserve the mean and covariance of the original distribution. Then, we present and compare a number of heuristics for selecting the splitting direction. The choice of splitting direction is informed by the initial uncertainty distribution, properties of the nonlinear function through which the original distribution is propagated, and a whitening based natural scaling method to avoid dependence of the splitting direction on the scaling of coordinates. We compare these heuristics to existing techniques in three distinct examples involving Cartesian to polar coordinate transformation, Keplerian orbital element propagation, and uncertainty propagation in the circular restricted three-body problem. Source code is available at https://github.com/scope-lab/pyest.


  • Open Access

    Adaptive Gaussian Mixture Filtering for Multi-sensor Maneuvering Cislunar Space Object Tracking

    by John L. Iannamorelli, Keith A. LeGrand

    Successful space domain awareness (SDA) requires maintaining track custody of cooperative and noncooperative cislunar space objects (CSOs) through both ballistic and maneuvering trajectories. The surveillance of CSOs is particularly challenging due to the underlying chaotic multi-body dynamics, which makes uncertainty propagation more difficult when compared to Keplerian orbits. While methods exist for tracking cooperative spacecraft using high accuracy range measurements, the problem of passive noncooperative maneuvering CSO tracking has received considerably less attention. In this paper, CSO motion is modeled as a jump Markov system (JMS), where the CSO modality is unknown and subject to random switching. A novel adaptive Bayesian filter is proposed and shown to successfully maintain CSO track custody through both ballistic and maneuvering phases of an Artemis I-like trajectory.


  • Open Access

    Cell Multi-Bernoulli (Cell-MB) Sensor Control for Multi-Object Search-While-Tracking (SWT)

    by Keith A. LeGrand, Pingping Zhu, Silvia Ferrari

    Information-driven control can be used to develop intelligent sensors that can optimize their measurement value based on environmental feedback. In object tracking applications, sensor actions are chosen based on the expected reduction in uncertainty also known as information gain. Random finite set (RFS) theory provides a formalism for quantifying and estimating information gain in multi-object tracking problems. However, estimating information gain in these applications remains computationally challenging. This paper presents a new tractable approximation of the RFS expected information gain applicable to sensor control for multi-object search and tracking. Unlike existing RFS approaches, the information gain approximation presented in this paper considers the contributions of non-ideal noisy measurements, missed detections, false alarms, and object appearance/disappearance. The effectiveness of the information-driven sensor control is demonstrated through two multi-vehicle search-while-tracking experiments using real video data from remote terrestrial and satellite sensors.


  • Real-Time Communication Control in Decentralized Autonomous Sensor Networks

    by Hongchuan Wei, Keith A. LeGrand, Andre A. Paradise, Silvia Ferrari

    Minimizing the amount of communication required by a sensor network is crucial to minimizing both energy and time consumption, as well to operating covertly and robustly in communication-contested ...

  • Survey of Challenges in Labeled Random Finite Set Distributed Multi-Sensor Multi-Object Tracking

    by Augustus Buonviri, Matthew York, Keith LeGrand, James Meub

    In recent years, increasing interest in distributed sensing networks has led to a demand for robust multi-sensor multi-object tracking (MOT) methods that can take advantage of large quantities of gathered data. However, distributed sensing has unique challenges stemming from limited computational resources, limited bandwidth, and complex network topology that must be considered within a given tracking method. Several recently developed methods that are based upon the random finite set (RFS) have shown promise as statistically rigorous approaches to the distributed MOT problem. Among the most desirable qualities of RFS-based approaches is that they are derived from a common mathematical framework, finite set statistics, which provides a basis for principled fusion of full multi-object probability distributions. Yet, distributed labeled RFS tracking is a still-maturing field of research, and many practical considerations must be addressed before large-scale, real-time systems can be implemented. For example, methods that use label-based fusion require perfect label consistency of objects across sensors, which is impossible to guarantee in scalable distributed systems. This paper provides a survey of the challenges inherent in distributed tracking using labeled RFS methods. An overview of labeled RFS filtering is presented, the distributed MOT problem is characterized, and recent approaches to distributed labeled RFS filtering are examined. The problems that currently prevent implementation of distributed labeled RFS trackers in scalable real-time systems are identified and demonstrated within the scope of several exemplar scenarios.


  • The data-driven delta-generalized labeled multi-Bernoulli tracker for automatic birth initialization

    by Keith A. LeGrand, Kyle J. DeMars

    The δ-generalized labeled multi-Bernoulli (δ-GLMB) tracker is the first multiple hypothesis tracking (MHT)-like tracker that is provably Bayes-optimal. However, in its basic form, the δ-GLMB provides no mechanism for adaptively initializing targets at their first appearance from unlabeled measurements. By introducing a new multitarget likelihood function that accounts for new target appearance, a data-driven δ-GLMB tracker is derived that automatically initializes new targets in the tracker measurement update. Monte Carlo results of simulated multitarget tracking problems demonstrate improved multitarget tracking accuracy over comparable adaptive birth methods.


  • Performance of an emerging MB filter

    by Andrew Finelli, Zachariah Sutton, Qin Lu, Peter Willett, Yaakov Bar-Shalom, Keith LeGrand, Raymond Byrne

    A method for solving the multi-target tracking (MTT) problem in urban environments is presented. The difficulties specific to urban environments include changing target cardinality, high target density, and targets that present different types of motion. The solution presented involves the use of the Multi-Object Particle Multi-Bernoulli (MOP-MB) filter, a computationally efficient approximation of the Bayes' Multi-Object Filter. This filter is then extended to employ the use of multiple motion models that combine to provide a better estimate of target state and cardinality. The new filter, called the Interacting Multiple Model Multi-Object Particle Multi-Bernoulli (IMM-MOP-MB), uses the multi-object particles (MOPs) to additionally estimate the target's motion mode. We then compare the performance of these MB filters with an IMMJPDAF with track management software in terms of cardinality tracking and position estimates. This is done through the use of the Generalized Optimal Sub-Pattern Assignment (GOSPA) metric and we find that the IMM-MOP-MB performs best in all test scenarios.