Renato Zanetti
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Renato Zanetti has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Andrey A. Popov
Department of Information and Computer Sciences, The University of Hawai’i at Mānoa, Honolulu, HI 96822 USA, and Computational Science Laboratory, Department of Computer Science, Virginia Tech, Blacksburg, VA 24061 USA
4 shared publications - Andrey A. Popov
Department of Information and Computer Sciences, The University of Hawai’i at Mānoa, Honolulu, USA
4 shared publications - Simone Servadio
Iowa State University
4 shared publications Christopher D’sOuza
NASA Johnson Space Center
2 shared publications- Dalton Durant
The University of Texas at Austin
2 shared publications - Dalton Durant
Department of Aerospace Engineering & Engineering Mechanics The University of Texas at Austin 78712 Austin TX
2 shared publications
Latest Publications
- 1 November 2026
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Guidance, Control, and Dynamics
- Vol. 49 (11) , 3148-3167
Posterior Weights in Single-Target and Multitarget Gaussian Mixture Filters
This work advocates for computing weights using posterior estimates rather than priors because the posterior typically offers a more accurate representation of the system after incorporating the latest measurement data. Several posterior weight formulations are presented and applied to the Gaussian sum filter (GSF) for single-target filtering (STF) and the Gaussian mixture probability hypothesis density (GM-PHD) filter for multitarget filtering (MTF). Under linear Gaussian conditions, the presented weight formulations are shown to be equal to each other and to the exact Bayesian weights. For nonlinear systems, however, all methods are approximate, and the various weight updates are neither equal to each other nor equal to the exact Bayesian weights. The results suggest that posterior weights improve filter accuracy and consistency for STF and improve multitarget accuracy for MTF, without considerable additional computational cost. Code: https://github.com/daltondurant/Posterior-Weights_GM-PHD.git .
- 1 November 2026
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Guidance, Control, and Dynamics
- Vol. 49 (11) , 3148-3167
Posterior Weights in Single-Target and Multitarget Gaussian Mixture Filters
This work advocates for computing weights using posterior estimates rather than priors because the posterior typically offers a more accurate representation of the system after incorporating the latest measurement data. Several posterior weight formulations are presented and applied to the Gaussian sum filter (GSF) for single-target filtering (STF) and the Gaussian mixture probability hypothesis density (GM-PHD) filter for multitarget filtering (MTF). Under linear Gaussian conditions, the presented weight formulations are shown to be equal to each other and to the exact Bayesian weights. For nonlinear systems, however, all methods are approximate, and the various weight updates are neither equal to each other nor equal to the exact Bayesian weights. The results suggest that posterior weights improve filter accuracy and consistency for STF and improve multitarget accuracy for MTF, without considerable additional computational cost. Code: https://github.com/daltondurant/Posterior-Weights_GM-PHD.git .
- Open Access
- 8 September 2026
- Published by Springer Nature in The Journal of the Astronautical Sciences
- Vol. 73 (5) , 80
Adaptive Relative Spacecraft Navigation in Proximity Operations with Unmodeled Target Behavior
An online method is presented for detecting and estimating unmodeled translational maneuvers of a target vehicle. Designed for relative navigation scenarios, the algorithm runs onboard the chaser vehicle and operates without communication from the target. By leveraging a buffer of observed pre-fit measurement innovations, the method eliminates the need for prior knowledge about the timing, magnitude, or direction of the target’s maneuvers. This method integrates adaptive process noise estimation with a splitting algorithm designed specifically for this type of unmodeled dynamics. The algorithm demonstrates rapid detection and estimation of unmodeled target maneuvers in a low Earth orbit scenario, without relying on inflated uncertainty bounds. Its performance surpasses that of state-of-the-art adaptive filters designed with prior knowledge of the maneuver. The algorithm also demonstrates competitive performance in detecting and estimating target maneuvers in a cislunar scenario, matching or exceeding state-of-the-art filters configured with prior knowledge of the maneuver. In both scenarios, the adaptive estimation of process noise is key to enable both rapid transient response to detected maneuvers and accurate steady-state performance; all without any prior knowledge of the target’s maneuver timing, magnitude and direction.
- 8 September 2026
- Published by Springer Nature in The Journal of the Astronautical Sciences
- Vol. 73 (5) , 80
Open AccessAdaptive Relative Spacecraft Navigation in Proximity Operations with Unmodeled Target Behavior
An online method is presented for detecting and estimating unmodeled translational maneuvers of a target vehicle. Designed for relative navigation scenarios, the algorithm runs onboard the chaser vehicle and operates without communication from the target. By leveraging a buffer of observed pre-fit measurement innovations, the method eliminates the need for prior knowledge about the timing, magnitude, or direction of the target’s maneuvers. This method integrates adaptive process noise estimation with a splitting algorithm designed specifically for this type of unmodeled dynamics. The algorithm demonstrates rapid detection and estimation of unmodeled target maneuvers in a low Earth orbit scenario, without relying on inflated uncertainty bounds. Its performance surpasses that of state-of-the-art adaptive filters designed with prior knowledge of the maneuver. The algorithm also demonstrates competitive performance in detecting and estimating target maneuvers in a cislunar scenario, matching or exceeding state-of-the-art filters configured with prior knowledge of the maneuver. In both scenarios, the adaptive estimation of process noise is key to enable both rapid transient response to detected maneuvers and accurate steady-state performance; all without any prior knowledge of the target’s maneuver timing, magnitude and direction.
- Open Access
Tensor Decompositions for Online Grid-Based Terrain-Aided Navigation
This paper presents a practical and scalable grid-based state estimation method for high-dimensional models with invertible linear dynamics and with highly non-linear measurements, such as the nearly constant velocity model with measurements of e.g. altitude, bearing, and/or range. Unlike previous tensor decomposition-based approaches, which have largely remained at the proof-of-concept stage, the proposed method delivers an efficient and practical solution by exploiting decomposable model structure-specifically, block-diagonal dynamics and sparsely coupled measurement dimensions. The algorithm integrates a Lagrangian formulation for the time update and leverages low-rank tensor decompositions to compactly represent and effectively propagate state densities. This enables real-time estimation for models with large state dimension, significantly extending the practical reach of grid-based filters beyond their traditional low-dimensional use. Although demonstrated in the context of terrain-aided navigation, the method is applicable to a wide range of models with decomposable structure. The computational complexity and estimation accuracy depend on the specific structure of the model. All experiments are fully reproducible, with source code provided alongside this paper (GitHub link: https://github.com/pesslovany/Matlab-LagrangianPMF).
Open AccessTensor Decompositions for Online Grid-Based Terrain-Aided Navigation
This paper presents a practical and scalable grid-based state estimation method for high-dimensional models with invertible linear dynamics and with highly non-linear measurements, such as the nearly constant velocity model with measurements of e.g. altitude, bearing, and/or range. Unlike previous tensor decomposition-based approaches, which have largely remained at the proof-of-concept stage, the proposed method delivers an efficient and practical solution by exploiting decomposable model structure-specifically, block-diagonal dynamics and sparsely coupled measurement dimensions. The algorithm integrates a Lagrangian formulation for the time update and leverages low-rank tensor decompositions to compactly represent and effectively propagate state densities. This enables real-time estimation for models with large state dimension, significantly extending the practical reach of grid-based filters beyond their traditional low-dimensional use. Although demonstrated in the context of terrain-aided navigation, the method is applicable to a wide range of models with decomposable structure. The computational complexity and estimation accuracy depend on the specific structure of the model. All experiments are fully reproducible, with source code provided alongside this paper (GitHub link: https://github.com/pesslovany/Matlab-LagrangianPMF).
- 3 September 2025
- Published by Springer Nature in The Journal of the Astronautical Sciences
- Vol. 72 (5) , 1-32
Optimal Sampling for Point Mass Filtering with Applications to Cislunar Orbit Determination
- 3 September 2025
- Published by Springer Nature in The Journal of the Astronautical Sciences
- Vol. 72 (5) , 1-32
Optimal Sampling for Point Mass Filtering with Applications to Cislunar Orbit Determination
- 22 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. PP (00189251) , 1-11
Error Flow Filter
Particle filters have become ubiquitous in state estimation due to the relative ease of propagating a set of particles through a nonlinear dynamics model. However, incorporating information from nonlinear measurements is a perennial challenge. In particle flow, we seek to smoothly transport the particles from the prior distribution to the Bayesian posterior distribution resulting from each measurement. This work introduces a particle flow inspired by a homotopy between the prior mean and the maximizer of the posterior distribution. We derive a second homotopy that flows the set of particles along with the mean, treating them as errors on the prior distribution. We show experimental evidence that the error flow update is better able to match the shapes of non-Gaussian posterior distributions than existing flows. We also demonstrate the performance of the error flow filter in two applications, including a cislunar tracking scenario.
- 22 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. PP (00189251) , 1-11
Error Flow Filter
Particle filters have become ubiquitous in state estimation due to the relative ease of propagating a set of particles through a nonlinear dynamics model. However, incorporating information from nonlinear measurements is a perennial challenge. In particle flow, we seek to smoothly transport the particles from the prior distribution to the Bayesian posterior distribution resulting from each measurement. This work introduces a particle flow inspired by a homotopy between the prior mean and the maximizer of the posterior distribution. We derive a second homotopy that flows the set of particles along with the mean, treating them as errors on the prior distribution. We show experimental evidence that the error flow update is better able to match the shapes of non-Gaussian posterior distributions than existing flows. We also demonstrate the performance of the error flow filter in two applications, including a cislunar tracking scenario.
- Open Access
Kernel-Based Ensemble Gaussian Mixture Probability Hypothesis Density Filter
In this work, a kernel-based Ensemble Gaussian Mixture Probability Hypothesis Density (EnGM-PHD) filter is presented for multi-target filtering applications. The EnGM-PHD filter combines the Gaussian-mixture-based techniques of the Gaussian Mixture Probability Hypothesis Density (GM-PHD) filter with the particle-based techniques of the Sequential Monte Carlo Probability Hypothesis Density (SMC-PHD) filter. It achieves this by obtaining particles from the posterior intensity function, propagating them through the system dynamics, and then using Kernel Density Estimation (KDE) techniques to approximate the Gaussian mixture of the prior intensity function. This approach guarantees convergence to the true intensity function in the limit of the number of components. Moreover, in the special case of a single target with no births, deaths, clutter, and perfect detection probability, the EnGM-PHD filter reduces to the standard Ensemble Gaussian Mixture Filter (EnGMF). In the presented experiment, the results indicate that the EnGM-PHD filter achieves better multi-target filtering performance than both the GM-PHD and SMC-PHD filters while using the same number of components or particles.
Open AccessKernel-Based Ensemble Gaussian Mixture Probability Hypothesis Density Filter
In this work, a kernel-based Ensemble Gaussian Mixture Probability Hypothesis Density (EnGM-PHD) filter is presented for multi-target filtering applications. The EnGM-PHD filter combines the Gaussian-mixture-based techniques of the Gaussian Mixture Probability Hypothesis Density (GM-PHD) filter with the particle-based techniques of the Sequential Monte Carlo Probability Hypothesis Density (SMC-PHD) filter. It achieves this by obtaining particles from the posterior intensity function, propagating them through the system dynamics, and then using Kernel Density Estimation (KDE) techniques to approximate the Gaussian mixture of the prior intensity function. This approach guarantees convergence to the true intensity function in the limit of the number of components. Moreover, in the special case of a single target with no births, deaths, clutter, and perfect detection probability, the EnGM-PHD filter reduces to the standard Ensemble Gaussian Mixture Filter (EnGMF). In the presented experiment, the results indicate that the EnGM-PHD filter achieves better multi-target filtering performance than both the GM-PHD and SMC-PHD filters while using the same number of components or particles.
- 8 April 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-19
Multiple data assimilation as an approximate maximum a posteriori estimator
- 8 April 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-19
Multiple data assimilation as an approximate maximum a posteriori estimator
- 29 March 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-23
Ensemble-regularized Kernel density estimation with applications to the ensemble Gaussian mixture filter
- 29 March 2025
- Published by Springer Nature in Computational Geosciences
- Vol. 29 (2) , 1-23
Ensemble-regularized Kernel density estimation with applications to the ensemble Gaussian mixture filter
- 21 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (4) , 9392-9405
Updating Gaussian Mixture Weights Using Posterior Estimates
Gaussian Mixture Model (GMM) filters tackle the intricacies of nonlinear and multimodal systems by representing probability distributions as a weighted sum of Gaussian components. However, traditional GMM approaches often update component weights based on prior state estimates, which can lead to filter divergence and degeneracy. Therefore, in this work, weights based on posterior state estimates are used instead, which provide a more accurate and dynamic reflection of the system's state after receiving new measurement data. The posterior-based approach extends to GMM filters that update individual Gaussian components using linearization techniques, such as the Extended Kalman Filter (EKF) and the Bayesian Recursive Update Filter (BRUF). Additionally, a Jacobian-free version, using importance sampling, is proposed for sigma-point-based methods, such as the Unscented Kalman Filter (UKF) and the Cubature Kalman Filter (CKF). Empirical results from a 2-dimensional Avocado example and a cislunar orbit determination example show that updating weights using posterior estimates improves accuracy and consistency, while maintaining computational efficiency comparable to prior-based approaches.
- 21 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (4) , 9392-9405
Updating Gaussian Mixture Weights Using Posterior Estimates
Gaussian Mixture Model (GMM) filters tackle the intricacies of nonlinear and multimodal systems by representing probability distributions as a weighted sum of Gaussian components. However, traditional GMM approaches often update component weights based on prior state estimates, which can lead to filter divergence and degeneracy. Therefore, in this work, weights based on posterior state estimates are used instead, which provide a more accurate and dynamic reflection of the system's state after receiving new measurement data. The posterior-based approach extends to GMM filters that update individual Gaussian components using linearization techniques, such as the Extended Kalman Filter (EKF) and the Bayesian Recursive Update Filter (BRUF). Additionally, a Jacobian-free version, using importance sampling, is proposed for sigma-point-based methods, such as the Unscented Kalman Filter (UKF) and the Cubature Kalman Filter (CKF). Empirical results from a 2-dimensional Avocado example and a cislunar orbit determination example show that updating weights using posterior estimates improves accuracy and consistency, while maintaining computational efficiency comparable to prior-based approaches.
- 21 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (3) , 7062-7075
Gaussian Mixture-Based Point Mass Filtering With Applications to Terrain-Relative Navigation
The accuracy of the point mass filter (PMF) relies on the precise placement of grid points. Since the approximated probability distributions are evaluated only at these points, suboptimal grid placement can result in an inaccurate representation of the posterior distribution. This work addresses this issue by introducing a variant of the PMF that represents the propagated grid points as a Gaussian mixture, enabling a Gaussian sum filter (GSF) update before grid construction. The GSF update improves the accuracy of the posterior mean and covariance estimates, leading to better grid placement. Additionally, an extension is presented, using kernel density estimation techniques to improve filter performance in low process noise scenarios. A comparative analysis is conducted between the proposed approach, the standard PMF, and other PMF variants. Using a bivariate example, the proposed method shows a better approximation of the posterior distribution compared to the other filters. Furthermore, two sequential filtering problems are used to analyze the performance of the filter, the first involving the Ikeda map and the second focusing on terrain-relative navigation. The results show that the proposed method provides more accurate and consistent filtering compared to the other PMF variants considered.
- 21 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 61 (3) , 7062-7075
Gaussian Mixture-Based Point Mass Filtering With Applications to Terrain-Relative Navigation
The accuracy of the point mass filter (PMF) relies on the precise placement of grid points. Since the approximated probability distributions are evaluated only at these points, suboptimal grid placement can result in an inaccurate representation of the posterior distribution. This work addresses this issue by introducing a variant of the PMF that represents the propagated grid points as a Gaussian mixture, enabling a Gaussian sum filter (GSF) update before grid construction. The GSF update improves the accuracy of the posterior mean and covariance estimates, leading to better grid placement. Additionally, an extension is presented, using kernel density estimation techniques to improve filter performance in low process noise scenarios. A comparative analysis is conducted between the proposed approach, the standard PMF, and other PMF variants. Using a bivariate example, the proposed method shows a better approximation of the posterior distribution compared to the other filters. Furthermore, two sequential filtering problems are used to analyze the performance of the filter, the first involving the Ikeda map and the second focusing on terrain-relative navigation. The results show that the proposed method provides more accurate and consistent filtering compared to the other PMF variants considered.