aiqbench analysis
ATOM introduces a hierarchical navigation framework that significantly accelerates repeated path planning in large-scale 3D environments by reusing lower-level option policies within graph structures. The approach achieves nearly a 98% reduction in cumulative planning time compared to monolithic MDP baselines while maintaining high trajectory accuracy, validated through both simulation and physical experiments on an F1Tenth vehicle. This work advances the efficiency of robotic autonomy in complex scenes by leveraging experience-informed refinement to minimize redundant computation across tasks.
ATOM: Abstract Transition and Option Modeling - Experience-Informed Hierarchical Navigation
arXiv:2610.17555v1 Announce Type: new Abstract: We propose ATOM (Abstract Transition and Option Modeling), a hierarchical navigation framework that combines higher-level graph planning with reusable lower-level option policies for efficient repeated navigation in large-scale 3D environments represented by hierarchical structures such as 3D scene graphs (3DSGs). ATOM operates on a hierarchical graph representation, implemented using, for instance, the Rooms and Places layers of a 3DSG, where each directed abstract transition is associated with a navigation option. For each transition, ATOM computes and stores a reusable option policy along with its state-dependent cost-to-go. Across repeated navigation tasks, ATOM maintains a smoothed empirical distribution over option initiation states and uses it to progressively refine the corresponding abstract transition cost. Ablation studies show that ATOM reduces cumulative repeated-planning time by 97.5% relative to a monolithic MDP baseline while maintaining trajectories within approximately 7% of a Global Places A* shortest-path reference. Experience-informed refinement further reduces abstract transition-cost estimation error by 10.3%. Physical experiments validate ATOM on an F1Tenth vehicle, successfully completing all five navigation queries with 43% of inter-region option executions reusing previously generated solutions.
Abstract:We propose ATOM (Abstract Transition and Option Modeling), a hierarchical navigation framework that combines higher-level graph planning with reusable lower-level option policies for efficient repeated navigation in large-scale 3D environments represented by hierarchical structures such as 3D scene graphs (3DSGs). ATOM operates on a hierarchical graph representation, implemented using, for instance, the Rooms and Places layers of a 3DSG, where each directed abstract transition is associated with a navigation option. For each transition, ATOM computes and stores a reusable option policy along with its state-dependent cost-to-go. Across repeated navigation tasks, ATOM maintains a smoothed empirical distribution over option initiation states and uses it to progressively refine the corresponding abstract transition cost. Ablation studies show that ATOM reduces cumulative repeated-planning time by 97.5% relative to a monolithic MDP baseline while maintaining trajectories within approximately 7% of a Global Places A* shortest-path reference. Experience-informed refinement further reduces abstract transition-cost estimation error by 10.3%. Physical experiments validate ATOM on an F1Tenth vehicle, successfully completing all five navigation queries with 43% of inter-region option executions reusing previously generated solutions.
8 pages, 12 figures. To be submitted to IEEE Robotics and Automation Letters (RA-L)
Robotics (cs.RO)
arXiv:2610.17555 [cs.RO]
(or arXiv:2610.17555v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2610.17555 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 · 282 words
Related coverage
Problems of Proliferation
LessWrong · Sep 29, 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · Oct 8, 2026
Dyna-2: General Purpose Physical Agents with Hour-Long Autonomy — Jason Ma, Dyna Robotics
Latent Space · Oct 13, 2026

Article: Governing AI in the Cloud: A Practical Guide for Architects
InfoQ · Jun 15, 2026