Metraipolis › archive › dc_8ca3010d2f83
When Automata Meet Streams: Temporal Logic Compilation for Stream-Based Robotics Task and Motion Planning — arXiv:2608.19453
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.19453
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T12:07:26.102Z
- SHA-256 of the archived text
a9266ad74c6e82f6ace40396c077a6453badda48b59249e463790c3e4353a932- Stable URL of this page
https://metraipolis.com/documento/dc_8ca3010d2f83
How to cite
When Automata Meet Streams: Temporal Logic Compilation for Stream-Based Robotics Task and Motion Planning — arXiv:2608.19453 — arXiv (en), https://arxiv.org/abs/2608.19453 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8ca3010d2f83 (Metraipolis archive dc_8ca3010d2f83, sha256 a9266ad74c6e82f6ace40396c077a6453badda48b59249e463790c3e4353a932)
BibTeX
@misc{dc8ca3010d2f83,
title = {When Automata Meet Streams: Temporal Logic Compilation for Stream-Based Robotics Task and Motion Planning — arXiv:2608.19453},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.19453},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8ca3010d2f83; sha256 a9266ad74c6e82f6ace40396c077a6453badda48b59249e463790c3e4353a932},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19453. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-21 in cs.FL).
Categorie arXiv: Robotics (cs.RO) ; Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2608.19453 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-18T12:07:23.936Z dalla pagina https://arxiv.org/catchup/cs.FL/2026-08-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).