Pith. sign in

REVIEW 2 cited by

LTLDoG: Satisfying Temporally-Extended Symbolic Constraints for Safe Diffusion-based Planning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2405.04235 v2 pith:QF544YO4 submitted 2024-05-07 cs.RO cs.LG

classification cs.ROcs.LG
keywords ltldogconstraintsdiffusion-basedfunctioninstructionssafespecifiedsteps
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

Operating effectively in complex environments while complying with specified constraints is crucial for the safe and successful deployment of robots that interact with and operate around people. In this work, we focus on generating long-horizon trajectories that adhere to novel static and temporally-extended constraints/instructions at test time. We propose a data-driven diffusion-based framework, LTLDoG, that modifies the inference steps of the reverse process given an instruction specified using finite linear temporal logic ($\text{LTL}_f$). LTLDoG leverages a satisfaction value function on $\text{LTL}_f$ and guides the sampling steps using its gradient field. This value function can also be trained to generalize to new instructions not observed during training, enabling flexible test-time adaptability. Experiments in robot navigation and manipulation illustrate that the method is able to generate trajectories that satisfy formulae that specify obstacle avoidance and visitation sequences. Code and supplementary material are available online at https://github.com/clear-nus/ltldog.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching

    cs.RO 2025-05 conditional novelty 6.0 of 10

    A GNN-encoded flow matching model learns to generate STL-satisfying trajectories across five robot simulation domains, with a 200K-specification dataset, reporting best-of-1024 satisfaction rates.

  2. Hierarchical Temporal Logic Task and Motion Planning for Multi-Robot Systems

    cs.RO 2025-04 conditional novelty 6.0 of 10

    A product-graph planner that encodes hierarchical sc-LTL tasks and Graph-of-Convex-Sets motion together, with automatic task allocation and handover support, claims sound and complete multi-robot planning.

Pith tools