arXiv:2608.19453cs.ROcs.FL2026-08

让机器人规划同时满足时间顺序和安全约束,突破流式规划的局限。

When Automata Meet Streams: Temporal Logic Compilation for Stream-Based Robotics Task and Motion Planning

论文配图:When Automata Meet Streams: Temporal Logic Compilation for Stream-Based Robotics Task and Motion Planning
图 1 · 摘自论文原文
  • 将LTL_f逻辑转化为自动机,嵌入动作模板中提前约束
  • 支持规划过程中动态生成的物体,无需预设对象集
  • 适用于需要严格时序安全的复杂机器人任务,如自动驾驶

基于流的机器人任务与运动规划(TAMP)将离散符号规划与动态生成的连续几何参数(如位姿、抓取、轨迹)相结合。然而,现有流式规划器通常仅关注目标可达性,而长周期任务还需满足安全关键的时间约束,如顺序、不变性和活性要求。由于流在规划中通过迭代细化循环不断生成扩展的几何对象集,现有时序逻辑编译技术无法适用。为此,本文提出同步动作监控与令牌销毁(SAM-TD),一种可在流式TAMP中强制执行任意有限迹线线性时序逻辑(LTL_f)约束的编译方法。SAM-TD将任意LTL_f约束转换为自动机,并将回溯的自动机守卫嵌入动作模式中,这些模式在规划前已预先设定。由此,SAM-TD可处理规划期间由流生成的对象,避免枚举固定对象集或修改底层规划器。搜索过程中,SAM-TD同步更新自动机状态,并使用跨所有自动机共享的有效性令牌剪枝违反约束的分支。实验表明,SAM-TD首次实现了在三个PDDLStream机器人环境中的流式TAMP在LTL_f约束下的求解。此外,在标准离散PDDL基准上,SAM-TD性能与当前最先进的时序约束编译方法相当。

原文摘要 · Abstract (English)

Stream-based robotics Task and Motion Planning (TAMP) integrates discrete symbolic planning with dynamically generated continuous geometric parameters, such as poses, grasps, and trajectories. However, stream-based planners typically reason only about goal reachability, whereas long-horizon tasks also demand adherence to temporal specifications, such as safety-critical ordering, invariance, and liveness constraints. No methods currently exist to enforce such temporal constraints for stream-based solvers because streams generate an expanding geometric object set via iterative stream refinement loops during planning, rendering existing temporal-logic compilation techniques incompatible. We therefore present Synchronous Action Monitoring with Token Destruction (SAM-TD), a compilation method that enforces arbitrary Linear Temporal Logic over finite traces ($\textrm{LTL}_f$) specifications in stream-based TAMP. SAM-TD translates arbitrary $\textrm{LTL}_f$ constraints into automata and embeds regressed automaton guards into action schemas, which are pre-specified before planning begins. By doing so, SAM-TD can handle objects generated by streams during planning, thus circumventing the need to enumerate a fixed object set or modify the underlying planner. During search, SAM-TD synchronously updates automaton states and uses a validity token shared across all automata to prune constraint-violating branches. We show that SAM-TD supports dynamically generated stream objects from iterative stream refinements during plan search. Experimental results provide the first ever demonstration of stream-based TAMP under $\textrm{LTL}_f$ constraints in three robotics PDDLStream environments. Furthermore, on standard discrete PDDL benchmarks, SAM-TD is competitive with state-of-the-art temporal-constraint compilation methods.

机器人规划时序逻辑流式推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。