{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:LOSQUNXVT2YH4FHGKMNAAL5SH2","short_pith_number":"pith:LOSQUNXV","schema_version":"1.0","canonical_sha256":"5ba50a36f59eb07e14e6531a002fb23ea7647b07a722bc83469080b988188347","source":{"kind":"arxiv","id":"2407.13694","version":1},"attestation_state":"computed","paper":{"title":"Anticipatory Task and Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Duc M. Nguyen, Gregory J. Stein, Roshan Dhakal, Tom Silver, Xuesu Xiao","submitted_at":"2024-07-18T16:59:33Z","abstract_excerpt":"We consider a sequential task and motion planning (tamp) setting in which a robot is assigned continuous-space rearrangement-style tasks one-at-a-time in an environment that persists between each. Lacking advance knowledge of future tasks, existing (myopic) planning strategies unwittingly introduce side effects that impede completion of subsequent tasks: e.g., by blocking future access or manipulation. We present anticipatory task and motion planning, in which estimates of expected future cost from a learned model inform selection of plans generated by a model-based tamp planner so as to avoid"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2407.13694","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-07-18T16:59:33Z","cross_cats_sorted":[],"title_canon_sha256":"283edb795580cd89e7b57abd3d1294e4b62a3656aa7c2d7f9f0392936690dd56","abstract_canon_sha256":"754180016b7ba3537c0d34833c2cdeaec87929eedd5bd794a11d69a80419b9d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:45:42.552348Z","signature_b64":"a5W3MCpm2ELMEurp2lZ4Mj1M7TqSuhN8VO7BNqUMSuRdRB6iHe/CLtYKxxqGMnchzMnYG7yPeX5k/maNbVvYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5ba50a36f59eb07e14e6531a002fb23ea7647b07a722bc83469080b988188347","last_reissued_at":"2026-07-05T08:45:42.551932Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:45:42.551932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anticipatory Task and Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Duc M. Nguyen, Gregory J. Stein, Roshan Dhakal, Tom Silver, Xuesu Xiao","submitted_at":"2024-07-18T16:59:33Z","abstract_excerpt":"We consider a sequential task and motion planning (tamp) setting in which a robot is assigned continuous-space rearrangement-style tasks one-at-a-time in an environment that persists between each. Lacking advance knowledge of future tasks, existing (myopic) planning strategies unwittingly introduce side effects that impede completion of subsequent tasks: e.g., by blocking future access or manipulation. We present anticipatory task and motion planning, in which estimates of expected future cost from a learned model inform selection of plans generated by a model-based tamp planner so as to avoid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.13694","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.13694/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2407.13694","created_at":"2026-07-05T08:45:42.551988+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.13694v1","created_at":"2026-07-05T08:45:42.551988+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.13694","created_at":"2026-07-05T08:45:42.551988+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOSQUNXVT2YH","created_at":"2026-07-05T08:45:42.551988+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOSQUNXVT2YH4FHG","created_at":"2026-07-05T08:45:42.551988+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOSQUNXV","created_at":"2026-07-05T08:45:42.551988+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05313","citing_title":"Failing Gracefully: Mitigating Impact of Inevitable Robot Failures","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2","json":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2.json","graph_json":"https://pith.science/api/pith-number/LOSQUNXVT2YH4FHGKMNAAL5SH2/graph.json","events_json":"https://pith.science/api/pith-number/LOSQUNXVT2YH4FHGKMNAAL5SH2/events.json","paper":"https://pith.science/paper/LOSQUNXV"},"agent_actions":{"view_html":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2","download_json":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2.json","view_paper":"https://pith.science/paper/LOSQUNXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.13694&json=true","fetch_graph":"https://pith.science/api/pith-number/LOSQUNXVT2YH4FHGKMNAAL5SH2/graph.json","fetch_events":"https://pith.science/api/pith-number/LOSQUNXVT2YH4FHGKMNAAL5SH2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2/action/storage_attestation","attest_author":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2/action/author_attestation","sign_citation":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2/action/citation_signature","submit_replication":"https://pith.science/pith/LOSQUNXVT2YH4FHGKMNAAL5SH2/action/replication_record"}},"created_at":"2026-07-05T08:45:42.551988+00:00","updated_at":"2026-07-05T08:45:42.551988+00:00"}