aiqbench analysis
This paper introduces TRACE, which reformulates active 3D reconstruction as an ergodic coverage problem rather than relying on greedy next-best-view selection. By optimizing the time-averaged spatial statistics of sensor trajectories to match information needs directly, it significantly improves mapping efficiency and image quality over standard baselines. The work represents a meaningful advancement in trajectory optimization algorithms for robotics perception systems.
TRACE: Ergodic Trajectory Optimization for Active Scene Reconstruction
arXiv:2608.02304v1 Announce Type: new 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.
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: this https URL.
Robotics (cs.RO)
arXiv:2608.02304 [cs.RO]
(or arXiv:2608.02304v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2608.02304 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 229 words
Related coverage

[AINews] not much happened today
Latent Space · Sep 18, 2026

[AINews] not much happened today
Latent Space · Oct 3, 2026

Capturing token IDs during agentic interactions for better reinforcement learning
Amazon Science · Jul 9, 2026

[AINews] Claude Opus 5.5, the new default model for AINews — and everybody cuts prices 40-50%
Latent Space · Sep 23, 2026