cs.ROFeb 14, 2026

XIT: Exploration and Exploitation Informed Trees for Active Gas Distribution Mapping in Unknown Environments

Authors: Mal Fazliu, Matthew Coombes, Sen Wang, Cunjia Liu

Organizations: Department of Aeronautical and Automotive Engineering, Loughborough University, Leicestershire, UK, LE11 3TU · Department of Electrical and Electronic Engineering, Faculty of Engineering, Imperial College London, South Kensington Campus, London, UK, SW7 2AZ

Abstract

Mobile robotic gas distribution mapping (GDM) provides critical situational awareness during emergency responses to hazardous gas releases. However, most systems still rely on teleoperation, limiting scalability and response speed. Autonomous active GDM is challenging in unknown and cluttered environments, because the robot must simultaneously explore traversable space, map the environment, and infer the gas distribution belief from sparse chemical measurements. We address this by formulating active GDM as a next-best-trajectory informative path planning (IPP) problem and develop XIT (Exploration and Exploitation Informed Trees), a sampling-based planner that grows a single shared tree toward multiple frontier goals, coupling exploration of unresolved regions with informative gas sampling en route. XIT draws a batch of samples from an Upper Confidence Bound (UCB) information field derived from the current gas posterior and expands the tree using a cost that trades off travel effort against information acquisition. To enable plume-aware exploration, we introduce the gas frontier concept, defined as unobserved regions adjacent to high gas concentrations, and propose the Wavefront Gas Frontier Detection (WGFD) algorithm for their identification. High-fidelity simulations demonstrate the benefits of XIT in terms of GDM quality and efficiency, and a scaled real-world experiment demonstrates its practicality. Although developed for active GDM, XIT is applicable to other robotic information-gathering tasks in unknown environments that face the exploration and exploitation trade-off.

Figures & tables

Explore similar work

Sep 30, 2026

GPU-Accelerated Path-Dependent Marginal Information Gain for Autonomous Exploration

Autonomous exploration demands that robots continuously evaluate candidate viewpoints based on their expected information gain and execution cost. Sampling-based planners estimate this gain by volumetric raycasting and, due to its computational cost, evaluate candidates under an assumption of mutual independence, ignoring the overlap between viewpoints along the same path. This work presents a GPU-accelerated method for computing path-dependent marginal information gain, where instead of storing and merging the observed unknown voxels along each candidate path, previous observations are represented using depth buffers. Candidate rays are projected into the depth buffers of their ancestors to identify observation overlap and exclude regions expected to be observed. The planning tree is evaluated in depth order to maintain the dependency between viewpoints and their optimized yaws, while candidate nodes and rays at each level are processed in parallel on the GPU. The proposed method stays within 5-10% of the exact marginal gain computed using voxel hash maps, with speed-ups of up to 118x on a desktop GPU and 28x on an NVIDIA Jetson Orin NX. The method was integrated into two sampling-based exploration planners and evaluated in three simulation environments, where marginal gain reduced the time to 95% coverage in five of the six evaluated planner-environment combinations. Real-world experiments also showed a 30% reduction in the time to 95% coverage, as well as earlier exploration termination times.
Sep 17, 2026

SmellDiffusion: Diffusion-Based Quadruped Navigation with Olfactory Scene Graphs

A robot sent to a named gas leak must preserve gas identity, estimate the source, and navigate to the resulting goal. We present SmellDiffusion, a simulation pipeline that represents species-specific gas zones in an open-vocabulary olfactory scene graph and shares the selected goal between classical and diffusion planners. Its key components are a peak-local geometric gate for selective source correction and diffusion-based, gas-guided trajectory generation. Among 424 unique source-wind configurations in solved flow, 28 have a concentration peak displaced more than 0.5m from the source. A source-independent geometric gate, calibrated only on the training split and evaluated at the observed peak, detects 9 of 10 held-out displacements at 0.64 precision. Gating a precomputed forward-matching correction reduces mean error on the displaced cases from 1.468m to 0.592m (60%), using matching for only 14/204 cases. All-case mean error falls from 0.205m to 0.180m. All planners receive the same scene-graph source estimate as their goal. In a controlled comparison, best-of-ten diffusion achieves mean gas exposure comparable to gas-guided A* (0.0476 versus 0.0455). A single diffusion proposal takes 41.7ms, compared with 72.3ms for gas-guided A*, although best-of-ten sequential sampling increases total runtime. Plain A* also reaches the same goal and remains the fastest and shortest-path method. Six matched Gazebo runs give mean robot-to-source errors of 0.39m for A* and 0.31m for diffusion.
Sep 19, 2026

MIRA-PRM: Mission-Informed Reusable Roadmap Planning for Mobile Gas-Sensing Inspection

Mobile gas-sensing inspection requires a mobile platform to reliably reach ordered sampling poses. We present MIRA-PRM, a mission-informed probabilistic roadmap that combines geometry-, mission-flow-, and inspection-conditioned sampling with locally adaptive connectivity and evidence-gated refinement. Eight development campaigns comprising 142,448 planner runs evaluated mission scaling, repeated-query adaptation, finite node budgets, target distributions, local map repair, ablation, cross-family comparison, and parameter sensitivity. MIRA-PRM maintained 100% seed-level success as ordered targets increased from two to eight, and achieved 97.67% seed-level success under a 40-node ceiling, compared with 67.17% for PRM and 86.50% for PRM*. Local repair reduced event time by 79.9-81.9% and node additions by 90.8-94.3% relative to rebuilding. On a separate frozen holdout of 12 maps, 48 ordered missions, and three seeds per map-mission unit, MIRA-PRM produced 96/144 validated successes, versus 82/144 for PRM, 89/144 for PRM*, and 70/144 for LE-HG-PRM. On paired common-success runs, MIRA-PRM reduced wall time by 16.89% relative to PRM* and 81.01% relative to LE-HG-PRM, but was 52.23% slower than PRM; paths were 0.54-1.86% longer. All validated paths passed independent full-segment checks and clearance non-inferiority. The results support a reliability-oriented trade-off in structured simulations and motivate external-map and physical mobile-sensing validation.