SearcharxivSearch

arXiv subjects

Julio A. Placed

Publications and source records attributed to Julio A. Placed.

11 recordsLinked to original sources

Topology-Aware Decision Making for Multi-Session Localization and Mapping

Operating in previously visited environments is becoming increasingly crucial for autonomous systems, with direct applications in autonomous driving, surveying, and warehouse or household robotics. This repeated exposure to observing the same areas poses significant challenges for mapping and localization across sessions, particularly in deciding when a prior model is sufficient for reliable localization and when new mapping is required. In this work, we propose a novel multi-session framework that builds on map-based localization, in contrast to the common practice of greedily running full SLAM sessions and trying to find correspondences between the resulting maps. The core contribution is a principled, topology-driven mechanism to detect multi-session mapping needs from the pose-graph structure. Specifically, our approach uses spectral connectivity metrics on the joint pose-graph to identify disconnections and weakly constrained regions, and selectively triggers mapping and loop closing only when the pose-graph topology indicates insufficient structural support. The resulting map and pose-graph are seamlessly integrated into the existing model, reducing accumulated error and enhancing global consistency while avoiding redundant remapping. We validate our method on overlapping sequences from datasets and demonstrate its effectiveness in a real-world mine-like environment.

cs.RO

Rheos: Modelling Continuous Motion Dynamics in Hierarchical 3D Scene Graphs

3D Scene Graphs (3DSGs) provide hierarchical, multi-resolution abstractions that encode the geometric and semantic structure of an environment, yet their treatment of dynamics remains limited to tracking individual agents. Maps of Dynamics (MoDs) complement this by modeling aggregate motion patterns, but rely on uniform grid discretizations that lack semantic grounding and scale poorly. We present Rheos, a framework that explicitly embeds continuous directional motion models into an additional dynamics layer of a hierarchical 3DSG that enhances the navigational properties of the graph. Each dynamics node maintains a semi-wrapped Gaussian mixture model that captures multimodal directional flow as a principled probability distribution with explicit uncertainty, replacing the discrete histograms used in prior work. To enable online operation, Rheos employs reservoir sampling for bounded-memory observation buffers, parallel per-cell model updates and a principled Bayesian Information Criterion (BIC) sweep that selects the optimal number of mixture components, reducing per-update initialization cost from quadratic to linear in the number of samples. Evaluated across four spatial resolutions in a simulated pedestrian environment, Rheos consistently outperforms the discrete baseline under continuous as well as unfavorable discrete metrics. We release our implementation as open source.

cs.RO

Massive Parallel Deep Reinforcement Learning for Active SLAM

Recent advances in parallel computing and GPU acceleration have created new opportunities for computation-intensive learning problems such as Active SLAM -- where actions are selected to reduce uncertainty and improve joint mapping and localization. However, existing DRL-based approaches remain constrained by the lack of scalable parallel training. In this work, we address this challenge by proposing a scalable end-to-end DRL framework for Active SLAM that enables massively parallel training. Compared with the state of the art, our method significantly reduces training time, supports continuous action spaces and facilitates the exploration of more realistic scenarios. It is released as an open-source framework to promote reproducibility and community adoption.

cs.RO

Aion: Towards Hierarchical 4D Scene Graphs with Temporal Flow Dynamics

Autonomous navigation in dynamic environments requires spatial representations that capture both semantic structure and temporal evolution. 3D Scene Graphs (3DSGs) provide hierarchical multi-resolution abstractions that encode geometry and semantics, but existing extensions toward dynamics largely focus on individual objects or agents. In parallel, Maps of Dynamics (MoDs) model typical motion patterns and temporal regularities, yet are usually tied to grid-based discretizations that lack semantic awareness and do not scale well to large environments. In this paper we introduce Aion, a framework that embeds temporal flow dynamics directly within a hierarchical 3DSG, effectively incorporating the temporal dimension. Aion employs a graph-based sparse MoD representation to capture motion flows over arbitrary time intervals and attaches them to navigational nodes in the scene graph, yielding more interpretable and scalable predictions that improve planning and interaction in complex dynamic environments. We provide the code at https://github.com/IacopomC/aion

cs.RO

From Underground Mines to Offices: A Versatile and Robust Framework for Range-Inertial SLAM

Simultaneous Localization and Mapping (SLAM) is an essential component of autonomous robotic applications and self-driving vehicles, enabling them to understand and operate in their environment. Many SLAM systems have been proposed in the last decade, but they are often complex to adapt to different settings or sensor setups. In this work, we present LiDAR Graph-SLAM (LG-SLAM), a versatile range-inertial SLAM framework that can be adapted to different types of sensors and environments, from underground mines to offices with minimal parameter tuning. Our system integrates range, inertial and GNSS measurements into a graph-based optimization framework. We also use a refined submap management approach and a robust loop closure method that effectively accounts for uncertainty in the identification and validation of putative loop closures, ensuring global consistency and robustness. Enabled by a parallelized architecture and GPU integration, our system achieves pose estimation at LiDAR frame rate, along with online loop closing and graph optimization. We validate our system in diverse environments using public datasets and real-world data, consistently achieving an average error below 20 cm and outperforming other state-of-the-art algorithms.

cs.RO

G-Loc: Tightly-coupled Graph Localization with Prior Topo-metric Information

Localization in already mapped environments is a critical component in many robotics and automotive applications, where previously acquired information can be exploited along with sensor fusion to provide robust and accurate localization estimates. In this work, we offer a new perspective on map-based localization by reusing prior topological and metric information. Thus, we reformulate this long-studied problem to go beyond the mere use of metric maps. Our framework seamlessly integrates LiDAR, inertial and GNSS measurements, and cloud-to-map registrations in a sliding window graph fashion, which allows to accommodate the uncertainty of each observation. The modularity of our framework allows it to work with different sensor configurations (e.g., LiDAR resolutions, GNSS denial) and environmental conditions (e.g., mapless regions, large environments). We have conducted several validation experiments, including the deployment in a real-world automotive application, demonstrating the accuracy, efficiency, and versatility of our system in online localization.

cs.RO

A Survey on Active Simultaneous Localization and Mapping: State of the Art and New Frontiers

Active Simultaneous Localization and Mapping (SLAM) is the problem of planning and controlling the motion of a robot to build the most accurate and complete model of the surrounding environment. Since the first foundational work in active perception appeared, more than three decades ago, this field has received increasing attention across different scientific communities. This has brought about many different approaches and formulations, and makes a review of the current trends necessary and extremely valuable for both new and experienced researchers. In this work, we survey the state-of-the-art in active SLAM and take an in-depth look at the open challenges that still require attention to meet the needs of modern applications. After providing a historical perspective, we present a unified problem formulation and review the well-established modular solution scheme, which decouples the problem into three stages that identify, select, and execute potential navigation actions. We then analyze alternative approaches, including belief-space planning and deep reinforcement learning techniques, and review related work on multi-robot coordination. The manuscript concludes with a discussion of new research directions, addressing reproducible research, active spatial perception, and practical applications, among other topics.

cs.RO

ExplORB-SLAM: Active Visual SLAM Exploiting the Pose-graph Topology

Deploying autonomous robots capable of exploring unknown environments has long been a topic of great relevance to the robotics community. In this work, we take a further step in that direction by presenting an open-source active visual SLAM framework that leverages the accuracy of a state-of-the-art graph-SLAM system and takes advantage of the fast utility computation that exploiting the structure of the underlying pose-graph offers. Through careful estimation of a posteriori weighted pose-graphs, D-optimal decision-making is achieved online with the objective of improving localization and mapping uncertainties as exploration occurs.

cs.RO

A General Relationship between Optimality Criteria and Connectivity Indices for Active Graph-SLAM

Quantifying uncertainty is a key stage in active simultaneous localization and mapping (SLAM), as it allows to identify the most informative actions to execute. However, dealing with full covariance or even Fisher information matrices (FIMs) is computationally heavy and easily becomes intractable for online systems. In this work, we study the paradigm of active graph-SLAM formulated over \textit{SE(n)}, and propose a general relationship between the FIM of the system and the Laplacian matrix of the underlying pose-graph. This link makes possible to use graph connectivity indices as utility functions with optimality guarantees, since they approximate the well-known optimality criteria that stem from optimal design theory. Experimental validation demonstrates that the proposed method leads to equivalent decisions for active SLAM in a fraction of the time.

cs.RO

Enough is Enough: Towards Autonomous Uncertainty-driven Stopping Criteria

Autonomous robotic exploration has long attracted the attention of the robotics community and is a topic of high relevance. Deploying such systems in the real world, however, is still far from being a reality. In part, it can be attributed to the fact that most research is directed towards improving existing algorithms and testing novel formulations in simulation environments rather than addressing practical issues of real-world scenarios. This is the case of the fundamental problem of autonomously deciding when exploration has to be terminated or changed (stopping criteria), which has not received any attention recently. In this paper, we discuss the importance of using appropriate stopping criteria and analyse the behaviour of a novel criterion based on the evolution of optimality criteria in active graph-SLAM.

cs.RO

Fast Autonomous Robotic Exploration Using the Underlying Graph Structure

In this work, we fully define the existing relationships between traditional optimality criteria and the connectivity of the underlying pose-graph in Active SLAM, characterizing, therefore, the connection between Graph Theory and the Theory Optimal Experimental Design. We validate the proposed relationships in 2D and 3D graph SLAM datasets, showing a remarkable relaxation of the computational load when using the graph structure. Furthermore, we present a novel Active SLAM framework which outperforms traditional methods by successfully leveraging the graphical facet of the problem so as to autonomously explore an unknown environment.

cs.RO