TRACE: Ergodic Trajectory Optimization for Active Scene Reconstruction

• URL: http://arxiv.org/abs/2608.02304v3
• Date: Thu, 06 Aug 2026 01:49:51 GMT
• Title: TRACE: Ergodic Trajectory Optimization for Active Scene Reconstruction
• Abstract summary: We study active reconstruction as an ergodic coverage problem.<n>Our approach derives this target distribution online from uncertainty and visibility.<n>We evaluate TRACE on the Replica dataset against the Next-Best-View (NBV) baselines, improving PSNR by 1.5 dB.
• Score: 7.636751274394083
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Existing active reconstruction systems with Gaussian-splatting maps select observations greedily, optimizing a single next-best-view (NBV) at each step and connecting the chosen views by short-horizon path planning. This greedy decoupling disregards the global structure of scene information, producing inefficient trajectories that waste sensing capacity in transit between selected views. In this work, we study active reconstruction as an ergodic coverage problem: the time-averaged spatial statistics of the sensor trajectory should match a target information distribution induced by the current map. Our approach derives this target distribution online from uncertainty and visibility, and calculates ergodic trajectories via a kernel-ergodic horizon planner with gradient flow and footprint depletion, closing the loop between mapping and trajectory optimization. We thoroughly evaluate TRACE on the Replica dataset against the Next-Best-View (NBV) baselines, improving PSNR by 1.5 dB. Code: https://github.com/spikelab-jhu/trace-active-reconstruction.

Related papers

• MapGCLR: Geospatial Contrastive Learning of Representations for Online Vectorized HD Map Construction [44.37176678126708]
  Autonomous vehicles rely on map information to understand the world around them.<n>A more scalable alternative lies in online HD map construction, which only requires map annotations at training time.<n>This work focuses on improving the latent birds-eye-view (BEV) feature grid representation within a vectorized online HD map construction model.<n>We train the same model supervised using a reduced set of single-traversal labeled data and self-supervised on a broader unlabeled set of data following our multi-traversal requirements.
  arXiv  Detail & Related papers  (2026-03-11T11:58:23Z)
• TopoCurate:Modeling Interaction Topology for Tool-Use Agent Training [53.93696896939915]
  Training tool-use agents typically rely on Supervised Fine-Tuning (SFT) on successful trajectories and Reinforcement Learning (RL) on pass-rate-selected tasks.<n>We propose TopoCurate, an interaction-aware framework that projects multi-trial rollouts from the same task into a unified semantic quotient topology.<n>TopoCurate achieves consistent gains of 4.2% (SFT) and 6.9% (RL) over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-03-02T10:38:54Z)
• Eva-Tracker: ESDF-update-free, Visibility-aware Planning with Target Reacquisition for Robust Aerial Tracking [51.06229328990625]
  Eva-Tracker is a visibility-aware trajectory planning framework for aerial tracking.<n>It eliminates ESDF updates and incorporates a recovery-capable path generation method for target reacquisition.<n>Our approach delivers more robust tracking results with lower computational effort than existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-02-13T02:56:34Z)
• Hierarchical Informative Path Planning via Graph Guidance and Trajectory Optimization [10.020847331719398]
  We study informative path planning (IPP) with travel budgets in cluttered environments, where an agent collects measurements of a latent field modeled as a Gaussian process (GP) to reduce uncertainty at target locations.<n>We propose a hierarchical framework with three stages: (i) graph-based global planning, (ii) segment-wise budget allocation using geometric and kernel bounds, and (iii) spline-based refinement of each segment with hard constraints and obstacle pruning.
  arXiv  Detail & Related papers  (2026-01-23T23:27:20Z)
• Unifying Environment Perception and Route Choice Modeling for Trajectory Representation Learning [47.00223863430964]
  Tray Learning (TRL) aims to encode raw trajectories into low-dimensional vectors, which can be leveraged in various downstream tasks, including travel time estimation, location prediction, and trajectory similarity analysis.<n>We propose a framework that unifies comprehensive environment textbfPertemporal explicit textRoute choice modeling for effective textbfPRTrajectory representation learning, dubbed textbfPRTraj.
  arXiv  Detail & Related papers  (2025-10-16T15:55:28Z)
• Active Next-Best-View Optimization for Risk-Averse Path Planning [27.736895306224863]
  Safe navigation in uncertain environments requires planning methods that integrate risk aversion with active perception.<n>We present a unified framework that refines a coarse reference path by constructing tail-sensitive risk maps on an online-updated 3D Gaussian-splat Radiance Field.<n>These maps enable the generation of locally safe and feasible trajectories.
  arXiv  Detail & Related papers  (2025-10-07T21:41:28Z)
• ActiveSplat: High-Fidelity Scene Reconstruction through Active Gaussian Splatting [12.644175177979196]
  We propose ActiveSplat, an autonomous high-fidelity reconstruction system leveraging Gaussian splatting.<n>The system establishes a unified framework for online mapping, viewpoint selection, and path planning.
  arXiv  Detail & Related papers  (2024-10-29T11:18:04Z)
• Truncating Trajectories in Monte Carlo Policy Evaluation: an Adaptive Approach [51.76826149868971]
  Policy evaluation via Monte Carlo simulation is at the core of many MC Reinforcement Learning (RL) algorithms. We propose as a quality index a surrogate of the mean squared error of a return estimator that uses trajectories of different lengths. We present an adaptive algorithm called Robust and Iterative Data collection strategy Optimization (RIDO)
  arXiv  Detail & Related papers  (2024-10-17T11:47:56Z)
• PRET: Planning with Directed Fidelity Trajectory for Vision and Language Navigation [30.710806048991923]
  Vision and language navigation is a task that requires an agent to navigate according to a natural language instruction. Recent methods predict sub-goals on constructed topology map at each step to enable long-term action planning. We propose an alternative method that facilitates navigation planning by considering the alignment between instructions and directed fidelity trajectories.
  arXiv  Detail & Related papers  (2024-07-16T08:22:18Z)
• Hallmarks of Optimization Trajectories in Neural Networks: Directional Exploration and Redundancy [75.15685966213832]
  We analyze the rich directional structure of optimization trajectories represented by their pointwise parameters. We show that training only scalar batchnorm parameters some while into training matches the performance of training the entire network.
  arXiv  Detail & Related papers  (2024-03-12T07:32:47Z)
• Trajectory Design for UAV-Based Internet-of-Things Data Collection: A Deep Reinforcement Learning Approach [93.67588414950656]
  In this paper, we investigate an unmanned aerial vehicle (UAV)-assisted Internet-of-Things (IoT) system in a 3D environment. We present a TD3-based trajectory design for completion time minimization (TD3-TDCTM) algorithm. Our simulation results show the superiority of the proposed TD3-TDCTM algorithm over three conventional non-learning based baseline methods.
  arXiv  Detail & Related papers  (2021-07-23T03:33:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.