Searcharxiv⌕ Search

arXiv subjects

Jonathan Kelly

Publications and source records attributed to Jonathan Kelly.

At least 19 recordsLinked to original sources

Direct Informed Sampling on Riemannian Manifolds via Loewner Order Lower Bounds

Informed sampling techniques accelerate sampling-based motion planners by focusing the search on promising regions of the state space, yet most existing methods rely on Euclidean heuristics that can become inadmissible under configuration-dependent Riemannian metrics. While scalar eigenvalue bounds restore admissibility by uniformly scaling the Euclidean distance, they discard the directional structure of the metric, producing overly conservative informed sets. We propose a matrix-valued admissible heuristic that exploits the Loewner order on symmetric positive definite matrices to compute the tightest constant lower bound on the metric tensor while retaining directional information discarded by scalar bounds. The Cholesky factorization of this constant bound maps the lower-bound informed set to a standard prolate hyperspheroid in Euclidean space, enabling direct, rejection-free sampling using existing algorithms. We then present an incremental algorithm for computing such a constant lower bound on the metric tensor from a sequence of pointwise evaluations. Experiments on manipulation tasks with a 6-DoF UR5, 7-DoF Franka, and 14-DoF PR2 under three distinct Riemannian metrics show that our heuristic produces consistently tighter informed sets than those produced by the Euclidean and scalar-eigenvalue heuristics, accelerating convergence across multiple state-of-the-art asymptotically optimal planners. Our implementation is available in the open-source geodex framework at https://github.com/utiasSTARS/geodex.

cs.RO↗

Galilean Symmetry in Robotics

In this paper, we present a robotics-tailored exposition of Galilean symmetry that leverages the community's familiarity with and understanding of rigid-body transformations and pose representations. Our approach contrasts with common treatments in the physics literature that introduce Galilean symmetry as a stepping stone to Einstein's relativity. We show that the classical homogeneous matrix algebra known well to roboticist translates directly into the Galilean modeling framework and provides a powerful tool for tackling robotics problems involving inertial measurements and spatio-temporal variables. We demonstrate the potential of the approach by developing a powerful model for studying motion of vehicles in an Earth fixed rotating reference frame, and developing a fusion algorithm for measurements with uncertain time-stamps.

cs.RO↗

Galilean Robots, Aristotelian Sensors: Joint Spatiotemporal Trajectory Estimation and Extrinsic Calibration

Multi-sensor state estimation requires accurate spatial and temporal calibration between heterogeneous sensors. Existing spatiotemporal calibration methods typically represent sensor extrinsic parameters as a rigid-body transformation together with a scalar temporal offset, causing the spatial and temporal parameters to enter the estimation problem through separate mechanisms. While the spatial transformation composes directly with the robot pose, accounting for the temporal offset requires evaluating the trajectory at a shifted time, typically through motion compensation, interpolation, or a continuous-time trajectory representation. In this work, we formulate joint trajectory estimation and spatiotemporal calibration using the special Galilean group for the robot trajectory and the Aristotelian subgroup for sensor extrinsics. This representation incorporates the coupling between motion and temporal offset directly through the group structure, avoiding the need for a separately parameterized continuous-time trajectory. We develop twist- and IMU-driven motion priors, accommodate both ideal and non-ideal clocks, and evaluate the framework with camera, position, and range measurements. Simulated and real experiments demonstrate calibration and trajectory-estimation performance comparable to established methods across heterogeneous sensor configurations. Our simplified framework therefore offers a quality-of-life improvement over existing methods without compromising performance.

cs.RO↗

All About the Galilean Group SGal(3)

We consider the Galilean group of affine transformations that preserve absolute time intervals between events in spacetime, as well as spatial distances between simultaneous events. The special Galilean group, SGal(3), is a 10-dimensional Lie group; we examine the structure of the group and its Lie algebra and discuss the representation of uncertainty on the group manifold. We also derive closed-form expressions for the $\LieGroupSGal{3}$ exponential and logarithmic maps, the Cayley and inverse Cayley maps, and the left Jacobian and its inverse. Along the way, we mention other groups, including the special orthogonal group, the special Euclidean group, and the group of extended poses, all of which are proper subgroups of the special Galilean group. We describe the role of time in Galilean relativity and touch on the relationship between temporal and spatial uncertainty.

physics.gen-ph↗

Making Space for Time: The Special Galilean Group and Its Application to Some Robotics Problems

The special Galilean group, usually denoted SGal(3), is a 10-dimensional Lie group whose important subgroups include the special orthogonal group, the special Euclidean group, and the group of extended poses. We briefly describe SGal(3) and its Lie algebra and show how the group structure supports a unified representation of uncertainty in space and time. Our aim is to highlight the potential usefulness of this group for several robotics problems.

cs.RO↗

Exploring the Intrinsic Geometry of Diffusion Models with Constrained Inverse Kinematics

Recent studies suggest that diffusion models can recover geometric structure in the data they are trained on, yet the supporting evidence has so far come mostly from natural-image data, where the underlying geometry itself is unknown. We study this question in a setting where the geometry is analytically tractable: constrained inverse kinematics (IK). Each task-space constraint defines a configuration-space manifold with known intrinsic dimension, giving direct ground truth for evaluating the geometry learned by the model. For each of the 6-DoF UR5 and 7-DoF Franka, we train a single conditional diffusion model across seven constraint families, spanning solution manifolds from discrete IK branches to self-motion manifolds. Our empirical results reveal that the intrinsic dimension recovered from the model's score function matches the analytical degrees of freedom of the corresponding constraint manifold across both robots. Moreover, linear interpolation in the latent space leads to generated solutions that remain close to the appropriate constraint manifold, indicating that the learned representation further captures geometric structure of the constraint family beyond intrinsic dimension alone. Constrained IK therefore offers a controlled setting for studying the intrinsic geometry learned by diffusion models.

cs.RO↗

Greedy Heuristics for Sampling-Based Motion Planning in High-Dimensional State Spaces

Informed sampling techniques accelerate the convergence of sampling-based motion planners by biasing sampling toward regions of the state space that are most likely to yield better solutions. However, when the current solution path contains redundant or tortuous segments, the resulting informed subset may remain unnecessarily large, slowing convergence. Our prior work addressed this issue by introducing the greedy informed set, which reduces the sampling region based on the maximum heuristic cost along the current solution path. In this article, we formally characterize the behavior of the greedy informed set within Rapidly-exploring Random Tree (RRT*)-like planners and analyze how greedy sampling affects exploration and asymptotic optimality. We then present Greedy RRT* (G-RRT*), a bi-directional anytime variant of RRT* that leverages the greedy informed set to focus sampling in the most promising regions of the search space. Experiments on abstract planning benchmarks, manipulation tasks from the MotionBenchMaker dataset, and a dual-arm Barrett WAM problem demonstrate that G-RRT* rapidly finds initial solutions and converges asymptotically to optimal paths, outperforming state-of-the-art sampling-based planners.

cs.RO↗

geodex: A Library for Motion Planning on Riemannian Manifolds

Planning motions that respect the intrinsic geometry of a robot's configuration space, including its curvature and a configuration-dependent notion of cost, yields shorter, lower-energy, and more natural trajectories than planning under the ambient flat metric. Existing libraries for optimization on manifolds provide rich geometric primitives but do not plan around obstacles. While general-purpose motion planning libraries support many state spaces and custom distance functions, they do not yet treat a configuration-dependent Riemannian metric as the geometry that drives distance, interpolation, and geodesics. We present geodex, an open-source C++20 library with Python bindings. The library exposes the manifold, its Riemannian metric, the retraction, and the sampler as independent, interchangeable components through a single sampling-based motion planning interface. The same planner runs unchanged on canonical spaces $\mathbb{R}^n$, $\mathbb{T}^n$, $\mathbb{S}^n$, matrix Lie groups such as $SO(2)$, $SE(2)$, $SO(3)$, and $SE(3)$, products of these spaces, and articulated-robot configuration spaces, each equipped with a user-defined Riemannian metric. We make geodex publicly available with documentation, tests, and a reproducible benchmark suite.

cs.RO↗

Contact Modes Are Strata: What Geometric Structure Buys in Discrete-Continuous Planning

Contact-rich manipulation poses a discrete question and a continuous one at once, namely which contacts are active and how to move while they hold. The two are coupled by a change of dimension, since each contact that a robot maintains confines its motion to a lower-dimensional manifold. We make that coupling the explicit object of planning by observing that a contact mode is not merely analogous to a stratum of the configuration space; it is one. A plan is then a walk over strata whose within-stratum segments are geodesics. On two contact-rich manipulation tasks in simulation, pushing a T-shaped block around obstacles and reorienting a cube in a dexterous hand, our planner returns solutions within seconds with no mode, contact sequence, or stratum given in advance.

cs.RO↗

Induced Riemannian Metrics for Motion Planning with Constraints

In constrained motion planning problems, task and loop-closure constraints restrict a robot's motion to a curved, lower-dimensional submanifold of its configuration space. Planners measure path length with a metric, which sets the cost of moving in each direction. Under the Euclidean metric, this cost is the same everywhere, whereas under a general Riemannian metric, such as the kinetic-energy metric, the cost can vary with direction and configuration. Existing methods often describe the submanifold either implicitly, as a constraint level set, or explicitly, through a parameterization. The implicit representation is typically combined with the Euclidean metric of the configuration space, and the explicit representation with the parameter domain, so the path length that a planner minimizes depends on the representation. Instead, we measure path length with the induced metric, which the submanifold inherits from a Riemannian metric on the configuration space. The implicit and explicit representations yield the same induced metric, expressed in different coordinates, and hence the same geometry. This result holds for any Riemannian metric on the configuration space, not only the Euclidean one. The choice of metric is therefore independent of the choice of representation. Using this result, we extend planning under a Riemannian metric from unconstrained spaces to constraint submanifolds by applying the induced metric in both a sampling-based planner and a trajectory optimizer. For an explicit representation, the induced metric also accounts for the distortion that the parameterization introduces. In experiments on a bimanual manipulation setup with two Franka arms under end-effector task constraints, we compare the Euclidean and kinetic-energy metrics.

cs.RO↗

REALM: An RGB- and Event-Aligned Latent Manifold for Cross-Modal Perception

Event cameras provide several unique advantages over standard frame-based sensors, including high temporal resolution, low latency, and robustness to extreme lighting. However, existing learning-based approaches for event processing are typically confined to narrow, task-specific silos and lack the ability to generalize across modalities. We address this gap with REALM, a cross-modal framework that learns an RGB- and Event-Aligned Latent Manifold by projecting event representations into the pretrained latent space of RGB foundation models. Instead of task-specific training, we leverage low-rank adaptation (LoRA) to bridge the modality gap, effectively unlocking the geometric and semantic priors of frozen RGB backbones for asynchronous event streams. We demonstrate that REALM effectively maps events into the ViT-based foundation latent space. Our method performs downstream tasks, such as depth estimation and semantic segmentation, by simply transferring linear heads trained on the RGB teacher. Most significantly, REALM enables the direct, zero-shot application of complex, frozen image-trained decoders, such as MASt3R, to raw event data. We demonstrate state-of-the-art performance in wide-baseline feature matching, significantly outperforming specialized architectures. Code and models are available at https://papers.starslab.ca/realm/.

cs.CV↗

A Sliding Window Filter on the Galilean Group for Consistent Aided Inertial Navigation with Unknown Measurement Delays

We study aided inertial navigation when the aiding sensor measurements are subject to an unknown constant delay. The goal is to estimate the delay and navigation state jointly so that delayed measurements correct the trajectory at the appropriate times, yielding a more accurate navigation solution. We formulate the problem on the special Galilean group, which provides a natural state-space structure for aided navigation with uncertainty in both motion and timing. We then examine the observability of joint delay and state estimation and show that, for a single delayed measurement, the model admits an exact symmetry in which a change in the delay can be compensated by a change in the navigation state, leaving the measurement unchanged. Processing measurements individually allows spurious information to `leak' along the corresponding null direction of the measurement Jacobian, producing overconfident and inconsistent estimates. Applying measurements from multiple times together can eliminate this direction when the trajectory is informative enough. Motivated by this result, we develop a sliding window filter that retains a short history of navigation states and applies delayed aiding corrections jointly across the active window. We conduct a series of simulation studies to characterize estimator accuracy and consistency. The simulations demonstrate that an estimator that does not maintain an adequate window can rapidly become highly inconsistent, whereas even a short sliding window markedly improves consistency by providing the temporal support that observability requires.

cs.RO↗

Lost in Time? Continuous Symmetry and Identifiability in Aided Inertial Navigation with Unknown Measurement Delays

In many multisensor systems, measurements from different sensors are subject to unknown relative time delays. Accurate state estimation requires that delays be accounted for and, when possible, calibrated online. We consider the case of aided inertial navigation, where measurements from a single aiding sensor are subject to an unknown but constant delay relative to the inertial measurement stream, and study the identifiability of the resulting system. Critically, identifiability depends not only on the temporal structure of the measurements, but also on the shape of the vehicle trajectory: some trajectories are sufficiently informative to support unique recovery of the delay and the navigation state, while others are not. Using the special Galilean Lie group, we characterize a broad family of uninformative trajectories, each generated by a constant element of the Galilean Lie algebra. We show that, along any such trajectory, the delayed measurement model admits a continuous symmetry that prevents unique recovery of the delay and the navigation state. We connect this symmetry-based characterization to the familiar linearized, Jacobian-based analysis. Although our development is motivated by aided navigation, the underlying ideas apply more generally to estimation problems on Lie groups with delayed measurements.

cs.RO↗

Geometry-Aware Sampling-Based Motion Planning on Riemannian Manifolds

In many robot motion planning problems, task objectives and physical constraints induce non-Euclidean geometry on the configuration space, yet many planners operate using Euclidean distances that ignore this structure. We address the problem of planning collision-free motions that minimize length under configuration-dependent Riemannian metrics, corresponding to geodesics on the configuration manifold. Conventional numerical methods for computing such paths do not scale well to high-dimensional systems, while sampling-based planners trade scalability for geometric fidelity. To bridge this gap, we propose a sampling-based motion planning framework that operates directly on Riemannian manifolds. We introduce a computationally efficient midpoint-based approximation of the Riemannian geodesic distance and prove that it matches the true Riemannian distance with third-order accuracy. Building on this approximation, we design a local planner that traces the manifold using first-order retractions guided by Riemannian natural gradients. Experiments on a two-link planar arm and a 7-DoF Franka manipulator under a kinetic-energy metric, as well as on rigid-body planning in $\mathrm{SE}(2)$ with non-holonomic motion constraints, demonstrate that our approach consistently produces lower-cost trajectories than Euclidean-based planners and classical numerical geodesic-solver baselines.

cs.RO↗

On the Identifiability of Aided Inertial Navigation Under Measurement Delays: A Geometric Approach

In aided inertial navigation, measurements from different sensors are often subject to unknown relative time delays. Consider a single aiding sensor whose measurements have an unknown but constant delay relative to the inertial-measurement data stream. We study the identifiability of the delay and the initial navigation state parameterizing the trajectory. Identifiability depends on both the temporal structure of the aiding measurements and the form of the trajectory. Using the special Galilean group, we determine the minimal number and type of aiding measurements needed to recover the delay and the navigation state. We also characterize a class of uninformative trajectories, for which the delayed measurement model admits a continuous symmetry that prevents unique delay-and-state recovery. We show that each such trajectory is generated by a constant element of the Galilean Lie algebra, and connect this result to the familiar linearized, Jacobian-based analysis.

cs.RO↗

VibES: Induced Vibration for Persistent Event-Based Sensing

Event cameras are a bio-inspired class of sensors that asynchronously measure per-pixel intensity changes. Under fixed illumination conditions in static or low-motion scenes, rigidly mounted event cameras are unable to generate any events and become unsuitable for most computer vision tasks. To address this limitation, recent work has investigated motion-induced event stimulation, which often requires complex hardware or additional optical components. In contrast, we introduce a lightweight approach to sustain persistent event generation by employing a simple rotating unbalanced mass to induce periodic vibrational motion. This is combined with a motion-compensation pipeline that removes the injected motion and yields clean, motion-corrected events for downstream perception tasks. We develop a hardware prototype to demonstrate our approach and evaluate it on real-world datasets. Our method reliably recovers motion parameters and improves both image reconstruction and edge detection compared to event-based sensing without motion induction.

cs.CV↗

Risk-Averse Traversal of Graphs with Stochastic and Correlated Edge Costs for Safe Global Planetary Mobility

In robotic planetary surface exploration, strategic mobility planning is an important task that involves finding candidate long-distance routes on orbital maps and identifying segments with uncertain traversability. Then, expert human operators establish safe, adaptive traverse plans based on the actual navigation difficulties encountered in these uncertain areas. In this paper, we formalize this challenge as a new, risk-averse variant of the Canadian Traveller Problem (CTP) tailored to global planetary mobility. The objective is to find a traverse policy minimizing a conditional value-at-risk (CVaR) criterion, which is a risk measure with an intuitive interpretation. We propose a novel search algorithm that finds exact CVaR-optimal policies. Our approach leverages well-established optimal AND-OR search techniques intended for (risk-agnostic) expectation minimization and extends these methods to the risk-averse domain. We validate our approach through simulated long-distance planetary surface traverses; we employ real orbital maps of the Martian surface to construct problem instances and use terrain maps to express traversal probabilities in uncertain regions. Our results illustrate different adaptive decision-making schemes depending on the level of risk aversion. Additionally, our problem setup allows accounting for traversability correlations between similar areas of the environment. In such a case, we empirically demonstrate how information-seeking detours can mitigate risk.

cs.RO↗

A Certifably Correct Algorithm for Generalized Robot-World and Hand-Eye Calibration

Automatic extrinsic sensor calibration is a fundamental problem for multi-sensor platforms. Reliable and general-purpose solutions should be computationally efficient, require few assumptions about the structure of the sensing environment, and demand little effort from human operators. In this work, we introduce a fast and certifiably globally optimal algorithm for solving a generalized formulation of the robot-world and hand-eye calibration (RWHEC) problem. The formulation of RWHEC presented is "generalized" in that it supports the simultaneous estimation of multiple sensor and target poses, and permits the use of monocular cameras that, alone, are unable to measure the scale of their environments. In addition to demonstrating our method's superior performance over existing solutions through extensive simulated and real experiments, we derive novel identifiability criteria and establish a priori guarantees of global optimality for problem instances with bounded measurement errors. As part of our analysis, we propose a new constraint qualification for nonlinear programs with redundant constraints; this constraint qualification is of independent interest for establishing the exactness of SDP relaxations of QCQPs that have been tightened through the addition of redundant constraints. Finally, we provide a free and open-source implementation of our algorithms and experiments.

cs.RO↗