arXiv (All)
open access
Conditional Timed Partial Orders: An Expressive and Interpretable Framework for Robot Task Specification and Planning
Timed Partial Orders (TPOs), originally proposed for workflows, provide an interpretable framework for robot task specification with planning algorithms based on mixed-integer linear programming (MILP). However, TPOs are limited in expressivity, capturing only partial-order events with simple timing
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Text-to-3D Policy: Fine-Grained Language-Behavior Alignment for Unseen Specification Generalization#1144566
- Unifying Temporal, Numeric and Hierarchical Task Planning through Constraint-Based Reasoning#11453
- Looking Back to Move Forward: Temporal Verification for Generative Robot Policies#1144005
- A Tree-Shaped Tableau for Checking the Satisfiability of Signal Temporal Logic with Bounded Temporal Operators#1014535
- LeanCSP: A Framework for Certifying Constraint Reformulation and Solving in Lean#414146
Record · ID 985316
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive