Joshua G. Mangelson

Joshua G. Mangelson

Auto-generated profile, based on publicly available information

Joshua G. Mangelson

Brigham Young University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
EPEaston R. Potokar
Easton R. Potokar
KNKalin Norman
Kalin Norman
JMJoshua G. Mangelson
Joshua G. Mangelson
Recent advances in the utilization of Lie Groups for robotic localization have led to dramatic increases in the accuracy of estimation and uncertainty characterization. One of the novel methods, the Invariant Extended Kalman Filter (InEKF) extends the Extended Kalman Filter (EKF) by leveraging the fact that some error dynamics defined on matrix Lie Groups satisfy a log-linear differential equation. Utilization of these observations result in linearization with minimal approximation error, no dependence on current state estimates, and excellent convergence and accuracy properties. In this letter we show that the primary sensors used for underwater localization, inertial measurement units (IMUs) and doppler velocity logs (DVLs) meet the requirements of the InEKF. Furthermore, we show that singleton measurements, such as depth, can also be used in the InEKF update with minor modifications, thus expanding the set of measurements usable in an InEKF. We compare convergence, accuracy and timing results of the InEKF to a quaternion-based EKF using a Monte Carlo simulation and show notable improvements in long-term localization and much faster convergence with negligible difference in computation time.

24 June 2020 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
JMJoshua G. Mangelson
Joshua G. Mangelson
MGMaani Ghaffari
Maani Ghaffari
RVRam Vasudevan
Ram Vasudevan
RERyan M. Eustice
Ryan M. Eustice
An accurate characterization of pose uncertainty is essential for safe autonomous navigation. Early pose uncertainty characterization methods proposed by Smith, Self, and Cheeseman (SCC) used coordinate-based first-order methods to propagate uncertainty through nonlinear functions such as pose composition (head-to-tail), pose inversion, and relative pose extraction (tail-to-tail). Characterizing uncertainty in the Lie algebra of the special Euclidean group results in better uncertainty estimates. However, existing Lie-group-based uncertainty propagation techniques assume that individual poses are independent. After solving a pose graph, however, the entire trajectory is jointly distributed as factors induce correlation. Hence, the independence assumption does not capture reality. In addition, prior work has focused primarily on the pose composition operation. This article develops a framework for modeling the uncertainty of jointly distributed poses and describes how to perform the equivalent of the SSC pose operations while characterizing uncertainty in the Lie algebra. Evaluation on simulated and open-source datasets shows that the proposed methods result in more accurate uncertainty estimates and thus more accurate filtering of potential loop closures. An accompanying C++ library implementation is also released.

16 August 2024 in IEEE Journal of Oceanic Engineering
Verified
Journal Article
Closed access
EPEaston Potokar
Easton Potokar
KLKalliyan Lay
Kalliyan Lay
KNKalin Norman
Kalin Norman
DBDerek Benham
Derek Benham
SASpencer Ashford
Spencer Ashford
JMJoshua G. Mangelson
Joshua G. Mangelson
Due to the difficulty and expense of underwater field trials, a high-fidelity underwater simulator is a necessity for testing and developing algorithms. To fill this need, we present HoloOcean, an open-source underwater simulator, built upon Unreal Engine 4 (UE4). HoloOcean comes equipped with multiagent support, various sensor implementations of common underwater sensors, and simulated communications support. Due to being built upon UE4, new environments are straightforward to add, enabling easy extensions to be built. HoloOcean is controlled via a simple Python interface, allowing simple installation via pip, and requiring few lines of code to execute simulations. Each agent is equipped with various control schemes and dynamics that can be customized via the Python interface. Also included is a novel sonar sensor framework that leverages an octree representation of the environment for efficient and realistic sonar imagery generation. In addition, to improve the authenticity of the imaging sonar simulation, we use a novel cluster-based multipath ray-tracing algorithm, various probabilistic noise models, and properties of reflecting surfaces. We also leverage the sonar simulation framework to simulate sidescan, single-beam, and multibeam profiling sonars.

4 December 2024 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
TZTianyi Zhang
Tianyi Zhang
WZWeiming Zhi
Weiming Zhi
BMBraden Meyers
Braden Meyers
NDNelson Durrant
Nelson Durrant
KHKaining Huang
Kaining Huang
MJMatthew Johnson-Roberson
Matthew Johnson-Roberson
Water caustics are commonly observed in seafloor imaging data from shallow-water areas. Traditional methods that remove caustic patterns from images often rely on 2D filtering or pre-training on an annotated dataset, hindering the performance when generalizing to real-world seafloor data with 3D structures. In this paper, we present a novel method Recurrent Gaussian Splatting (RecGS), which takes advantage of today's photorealistic 3D reconstruction technology,3D Gaussian Splatting (3DGS), to separate caustics from seafloor imagery. With a sequence of images taken by an underwater robot, we build 3DGS recurrently and decompose the caustic with low-pass filtering in each iteration. In the experiments, we analyze and compare with different methods, including joint optimization, 2D filtering, and deep learning approaches. The results show that our proposed RecGS paradigm can effectively separate the caustic from the seafloor, improving the visual appearance, and can be potentially applied on more problems with inconsistent illumination. Our videos and code are released at https://tyz1030.github.io/proj/recgs.html

23 October 2022
Verified
Conference Paper
Closed access
MQMohamad Qadri
Mohamad Qadri
PSPaloma Sodhi
Paloma Sodhi
JMJoshua G. Mangelson
Joshua G. Mangelson
FDFrank Dellaert
Frank Dellaert
MKMichael Kaess
Michael Kaess
In this work, we investigate the problem of incre-mentally solving constrained non-linear optimization problems formulated as factor graphs. Prior incremental solvers were either restricted to the unconstrained case or required periodic batch relinearizations of the objective and constraints which are expensive and detract from the online nature of the algorithm. We present InCOpt, an Augmented Lagrangian-based incremental constrained optimizer that views matrix operations as message passing over the Bayes tree. We first show how the linear system, resulting from linearizing the constrained objective, can be represented as a Bayes tree. We then propose an algorithm that views forward and back substitutions, which naturally arise from solving the Lagrangian, as upward and downward passes on the tree. Using this formulation, In-COpt can exploit properties such as fluid/online relinearization leading to increased accuracy without a sacrifice in runtime. We evaluate our solver on different applications (navigation and manipulation) and provide an extensive evaluation against existing constrained and unconstrained solvers.

13 November 2024 in IEEE Control Systems
Verified
Journal Article
Closed access
EPEaston R. Potokar
Easton R. Potokar
RBRandal W. Beard
Randal W. Beard
JMJoshua G. Mangelson
Joshua G. Mangelson
Kalman filters (KFs) have become ubiquitous in modern-day technology with applications in medicine, robotics, and many others due to their straightforward implementation and impressive performance. Unfortunately, when KFs are extended for use with nonlinear systems, optimality is often no longer guaranteed and the asymptotic convergence guarantee is also lost. The Invariant Extended Kalman Filter (InEKF) is a recent extension of the KF for Lie Groups that provides log-linear error dynamics and restores the asymptotic convergence guarantee. This article provides an in-depth introduction and tutorial to the InEKF by covering the necessary mathematical background, providing derivations of its various components, and walking step by step through various examples of its usage.