analiza aiqbench
HorizonFlow addresses a key inefficiency in offline goal-conditioned reinforcement learning by jointly generating plan content and length, eliminating the need to pre-specify a planning horizon. By treating plan duration as an output of the generation process rather than an input constraint, the method avoids infeasible transitions and redundant motion while achieving top-tier performance on navigation and manipulation benchmarks. This advancement represents a significant step forward in generative planning architectures for autonomous agents.
HorizonFlow: Variable-Length Planning for Offline Goal-Conditioned RL
arXiv:2609.36896v1 Announce Type: new Abstract: Recent advances in generative planning have made trajectory inpainting a promising approach to offline goal-conditioned reinforcement learning. However, these methods typically specify the planning horizon before generating plan content, even though the appropriate horizon depends on the route itself. A horizon that is too short can force infeasible transitions, whereas one that is too long can introduce redundant motion. We introduce HorizonFlow, a hierarchical planner that treats plan length as an output of generation rather than a prescribed input. Its subgoal route planner guides its action-prefix controller through a sequence of latent subgoals. Both components combine insertion-based generation with flow matching to jointly generate continuous plan content and length, using the partially generated plan to guide token insertion. HorizonFlow reuses the resulting length information to select candidates and steer generation toward shorter plans without a separate learned value model. Across Maze2D, Multi2D, and OGBench navigation and visual manipulation benchmarks, HorizonFlow achieves the highest average performance among the compared methods.
Abstract:Recent advances in generative planning have made trajectory inpainting a promising approach to offline goal-conditioned reinforcement learning. However, these methods typically specify the planning horizon before generating plan content, even though the appropriate horizon depends on the route itself. A horizon that is too short can force infeasible transitions, whereas one that is too long can introduce redundant motion. We introduce HorizonFlow, a hierarchical planner that treats plan length as an output of generation rather than a prescribed input. Its subgoal route planner guides its action-prefix controller through a sequence of latent subgoals. Both components combine insertion-based generation with flow matching to jointly generate continuous plan content and length, using the partially generated plan to guide token insertion. HorizonFlow reuses the resulting length information to select candidates and steer generation toward shorter plans without a separate learned value model. Across Maze2D, Multi2D, and OGBench navigation and visual manipulation benchmarks, HorizonFlow achieves the highest average performance among the compared methods.
Artificial Intelligence (cs.AI)
arXiv:2609.36896 [cs.AI]
(or arXiv:2609.36896v1 [cs.AI] for this version)
https://doi.org/10.48550/arXiv.2609.36896 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.
Text integral sub licența deschisă a publicației · 253 cuvinte
Subiecte conexe

The Machines that Make the Machines
NVIDIA · 7 oct. 2026
FlexiWorld: Learning and Planning via Flexible Action Chunks Across Multiple Time Scales
arXiv · 29 sept. 2026
Horizon Adaptive Offline Policy Learning via Value Stitching
arXiv · 14 oct. 2026
Variational Learning for Insertion-based Generation
arXiv · 12 iun. 2026