{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5AWTDWYDMQG3QFNCXPLERFFBVC","short_pith_number":"pith:5AWTDWYD","schema_version":"1.0","canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","source":{"kind":"arxiv","id":"1802.05835","version":1},"attestation_state":"computed","paper":{"title":"An Anytime Algorithm for Task and Motion MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nishant Desai, Richard Freedman, Shlomo Zilberstein, Siddharth Srivastava","submitted_at":"2018-02-16T04:52:58Z","abstract_excerpt":"Integrated task and motion planning has emerged as a challenging problem in sequential decision making, where a robot needs to compute high-level strategy and low-level motion plans for solving complex tasks. While high-level strategies require decision making over longer time-horizons and scales, their feasibility depends on low-level constraints based upon the geometries and continuous dynamics of the environment. The hybrid nature of this problem makes it difficult to scale; most existing approaches focus on deterministic, fully observable scenarios. We present a new approach where the high"},"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":"1802.05835","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-16T04:52:58Z","cross_cats_sorted":[],"title_canon_sha256":"f5d859c98f35ea708bd9c2956b515b8a8f53179e160077784927564f87086605","abstract_canon_sha256":"830b98bfd99540b63419dde4535f0d28e7a4112e66149482f79ebbb2ebbcb314"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:10.859392Z","signature_b64":"qkjf0oGXTCj8hLizHDoTGOdatDZy06funQj/ms/a2Jdxv0wGMmTOsaxdo70EldEfjoC73Glz3KFaDW4IQoGwDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e82d31db03640db815a2bbd64894a1a8b28e09aecffbfeafd62af592d47aef3c","last_reissued_at":"2026-05-18T00:23:10.858700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:10.858700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Anytime Algorithm for Task and Motion MDPs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Nishant Desai, Richard Freedman, Shlomo Zilberstein, Siddharth Srivastava","submitted_at":"2018-02-16T04:52:58Z","abstract_excerpt":"Integrated task and motion planning has emerged as a challenging problem in sequential decision making, where a robot needs to compute high-level strategy and low-level motion plans for solving complex tasks. While high-level strategies require decision making over longer time-horizons and scales, their feasibility depends on low-level constraints based upon the geometries and continuous dynamics of the environment. The hybrid nature of this problem makes it difficult to scale; most existing approaches focus on deterministic, fully observable scenarios. We present a new approach where the high"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05835","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":""},"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":"1802.05835","created_at":"2026-05-18T00:23:10.858813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.05835v1","created_at":"2026-05-18T00:23:10.858813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05835","created_at":"2026-05-18T00:23:10.858813+00:00"},{"alias_kind":"pith_short_12","alias_value":"5AWTDWYDMQG3","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5AWTDWYDMQG3QFNC","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5AWTDWYD","created_at":"2026-05-18T12:32:08.215937+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09094","citing_title":"Hybrid Planning for Dynamic Multimodal Stochastic Shortest Paths","ref_index":27,"is_internal_anchor":true},{"citing_arxiv_id":"2605.01860","citing_title":"Optimizing Trajectory-Trees in Belief Space: An Application from Model Predictive Control to Task and Motion Planning","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC","json":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC.json","graph_json":"https://pith.science/api/pith-number/5AWTDWYDMQG3QFNCXPLERFFBVC/graph.json","events_json":"https://pith.science/api/pith-number/5AWTDWYDMQG3QFNCXPLERFFBVC/events.json","paper":"https://pith.science/paper/5AWTDWYD"},"agent_actions":{"view_html":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC","download_json":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC.json","view_paper":"https://pith.science/paper/5AWTDWYD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.05835&json=true","fetch_graph":"https://pith.science/api/pith-number/5AWTDWYDMQG3QFNCXPLERFFBVC/graph.json","fetch_events":"https://pith.science/api/pith-number/5AWTDWYDMQG3QFNCXPLERFFBVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/action/storage_attestation","attest_author":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/action/author_attestation","sign_citation":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/action/citation_signature","submit_replication":"https://pith.science/pith/5AWTDWYDMQG3QFNCXPLERFFBVC/action/replication_record"}},"created_at":"2026-05-18T00:23:10.858813+00:00","updated_at":"2026-05-18T00:23:10.858813+00:00"}