Physical Time as a Missing Dimension of Robot Policy Memory Dynamics
Summary
提出Temporal Flow Policy (TFP),将物理时间作为机器人策略记忆的缺失维度,使记忆状态随实测时间间隔演化,从而在扩散策略与π₀.₅上实现更准确的时序控制与记忆读出,在LIBERO及真实机器人任务中优于循环与状态空间记忆基线。
View Cached Full Text
Cached at: 10/15/26, 07:04 AM
Paper page - Physical Time as a Missing Dimension of Robot Policy Memory Dynamics
Source: https://huggingface.co/papers/2610.20524
Abstract
Existingrobotpolicymemoriestypicallyevolvewithobservationsequences,implicitlytreatingeachupdateasthesameamountofphysicaltime.Yetidenticalobservationhistoriescanspandifferentdurationsandrequiredifferentactions,exposingphysicaltimeasamissingdimensionofpolicymemory.WeintroduceTemporalFlowPolicy(TFP),whichlearnsmemorydynamicstoretainpasteventsandevolvethememorystateovermeasuredtimeintervals.Observationsandpriormemorydeterminethecontentandtimescalesofeachtransition;elapsedtimedetermineshowfarthestateadvances.TFPconditionsdiffusionandflow-matchingpoliciesthroughthismemorystateandistrainedwiththeirnativeimitationobjectives.WeevaluateTFPwithDiffusionPolicyandπ_{0.5}throughcontrolledcomparisonsofmemorydesigns.Theseexperimentsshowthatsuccessfultimingdependsonbothmeasuredintervalsandretainedhistory.TFPachieveshigheraveragesuccessthantherecurrentandstate-spacememoriesweequipwiththesameintervalsandthanavariantthatfeedstheintervaltoalearnedgate.Memoryreadoutsrecoverthetimesinceaneventandmotioninformationafterocclusion.Changingthesuppliedintervalssystematicallydelaysoradvancesactions,linkingtimeinputstobehavior.Real-robottasksrequiringtimingormemory,togetherwithLIBEROevaluations,demonstratebenefitsinphysicalandgeneralmanipulation.Theseresultssuggestviewingrobotmemorynotasstoredobservationhistory,butasastatethatretainspasteventsandevolveswithphysicaltime.
View arXiv pageView PDFAdd to collection
Get this paper in your agent:
hf papers read 2610\.20524
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2610.20524 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2610.20524 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2610.20524 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Temporal-Distance JEPA: Plan-Aware Representation Learning for Latent World Model Predictive Control
Proposes temporal-distance JEPA (TD-JEPA) which mines directed temporal cost from offline trajectories to improve latent world model predictive control, achieving higher success rates on robotic environments.
Remember When It Matters: Proactive Memory Agent for Long-Horizon Agents
This paper introduces a proactive memory agent that runs alongside an action agent to prevent behavioral state decay in long-horizon tasks, achieving significant improvements on Terminal-Bench2.0 and τ^2-Bench. The authors also train Qwen3.5-27B using SFT and GRPO as an early step toward open-weight memory policies.
πR^2: Reactive Real-time Flow Policies
πR^2 introduces a reactive real-time flow policy for robot manipulation that splits conditioning into fast and slow channels and uses a latency-adaptive flow schedule, enabling closed-loop replanning ~4x faster than baseline policies and improving success rates by up to 30%.
AURA: Action-Gated Memory for Robot Policies at Constant VRAM
AURA-Mem proposes a constant-size memory for robot policies using a learned gate that writes only when current observations would change the next action. It matches baseline accuracy with significantly fewer writes and constant VRAM, addressing the memory bottleneck for long-horizon robot tasks.
Neuro-Symbolic Meta-Policies for Temporal Knowledge-Graph Memory under Partial Observability
This paper introduces a neuro-symbolic meta-policy for temporal knowledge-graph memory in partially observable reinforcement learning, combining RDF-based graph representations with symbolic memory management heuristics to achieve inspectable and adaptive control.