Skip to content
AI News HubLIVE
Original source2 min read

ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition

Summary

ChronoForest introduces a closed-loop planning system that couples local bridge search with online route re-solving via an anchor-chaining tree diffusion planner and an online multi-tree orchestrator. It uses temporal distance for short-range guidance and node evaluation while leveraging search-time bridge evidence to validate long-range anchor connectivity and repeatedly re-solve routes. On OGBench AntMaze-Stitch, it achieves 99.8%, 99.3%, and 99.5% success on medium, large, and giant splits, improving giant-stitch success by up to 34.5 points over prior diffusion-based results. On Hamiltonian route-composition benchmarks, online re-solving corrects poor temporal orderings and improves route quality at substantially lower cost than exhaustive planning.

SourcearXiv RoboticsAuthor: Jungmin Seo, Jaesik Park
ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2606.06618] ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition

[Submitted on 4 Jun 2026]

Title:ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition

View a PDF of the paper titled ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition, by Jungmin Seo and Jaesik Park

View PDF HTML (experimental)

Abstract:How can we plan long-horizon routes that reach designated goals, visit required waypoints, and remain short when only short-horizon offline trajectories are available? This problem matters in offline navigation because collecting sufficiently rich long-horizon data is difficult, yet real agents must still solve long-range tasks with route-level efficiency rather than mere feasibility. The difficulty is twofold: at the microscopic level, composing many short-horizon segments creates a trade-off between search cost and path quality, while at the macroscopic level, waypoint ordering requires comparing pairwise travel costs among start, goal, and waypoint anchors that are unknown before planning and increasingly unreliable when estimated only from long-range temporal distance.

In this paper, we propose ChronoForest, a closed-loop planning system that couples local bridge search and online route re-solving through an anchor-chaining tree diffusion planner and an online multi-tree orchestrator. ChronoForest uses temporal distance for short-range guidance and node evaluation, while using search-time bridge evidence to validate long-range anchor connectivity and repeatedly re-solve the route. On OGBench AntMaze-Stitch, ChronoForest achieves 99.8%, 99.3%, and 99.5% success on the medium, large, and giant splits and improves giant-stitch success by up to 34.5 points over prior reported diffusion-based results. On Hamiltonian route-composition benchmarks, online re-solving corrects poor temporal orderings and improves route quality while remaining substantially cheaper than exhaustive planning.

Comments: 40 pages, 4 figures, 7 tables, 3 algorithms

Subjects:

Robotics (cs.RO); Artificial Intelligence (cs.AI); Machine Learning (cs.LG)

ACM classes: I.2.6; I.2.8; I.2.9

Cite as: arXiv:2606.06618 [cs.RO]

(or arXiv:2606.06618v1 [cs.RO] for this version)

https://doi.org/10.48550/arXiv.2606.06618

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Jungmin Seo [view email] [v1] Thu, 4 Jun 2026 18:09:02 UTC (2,099 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition, by Jungmin Seo and Jaesik Park

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.RO

new | recent | 2026-06

Change to browse by:

cs cs.AI cs.LG

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

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.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • ChronoForest closes the loop between local bridge search and online route re-solving to plan long-horizon routes from only short-horizon offline trajectories.
  • It reaches 99.8%, 99.3%, and 99.5% success on OGBench AntMaze-Stitch medium, large, and giant splits, with up to 34.5 points gain on giant-stitch.
  • On Hamiltonian route-composition benchmarks, online re-solving fixes poor temporal orderings and improves route quality while being much cheaper than exhaustive planning.
  • The method uses temporal distance for short-range guidance and node evaluation, and uses search-time bridge evidence to validate long-range anchor connectivity.

Highlights and analysis are generated automatically and may contain errors. Check the original source.

ChronoForest: Closed-Loop Multi-Tree Diffusion Planning for Efficient Bridge Search and Route Composition | AI News Hub