{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FPTESETUNKQUCEF7FO4KML7XUG","short_pith_number":"pith:FPTESETU","schema_version":"1.0","canonical_sha256":"2be64912746aa14110bf2bb8a62ff7a19f1132ccc87997bfdf30cc368c7e74cd","source":{"kind":"arxiv","id":"2103.05456","version":3},"attestation_state":"computed","paper":{"title":"Extended Tree Search for Robot Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Georgia Chalvatzaki, Jan Peters, Tianyu Ren","submitted_at":"2021-03-09T14:44:08Z","abstract_excerpt":"Integrated task and motion planning (TAMP) is desirable for generalized autonomy robots but it is challenging at the same time. TAMP requires the planner to not only search in both the large symbolic task space and the high-dimension motion space but also deal with the infeasible task actions due to its intrinsic hierarchical process. We propose a novel decision-making framework for TAMP by constructing an extended decision tree for both symbolic task planning and high-dimension motion variable binding. We integrate top-k planning for generating explicitly a skeleton space where a variety of c"},"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":"2103.05456","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-03-09T14:44:08Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"11fe926412ef54a1670a024f6e73a0de89d5f18db4dda783288d147c59847508","abstract_canon_sha256":"ed5a5066680baa08ede9b19df073b63df7847616ea097b1e95b38487321d29e9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:22:57.732086Z","signature_b64":"+rhg9I413Qg/WjE2MfVHr60WqhoP9HS1LRSadWo73EqWO5b+da05XRaMSZFY/Siblh7csTg5TQoZArzAXONQBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2be64912746aa14110bf2bb8a62ff7a19f1132ccc87997bfdf30cc368c7e74cd","last_reissued_at":"2026-07-05T03:22:57.731642Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:22:57.731642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Tree Search for Robot Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.RO","authors_text":"Georgia Chalvatzaki, Jan Peters, Tianyu Ren","submitted_at":"2021-03-09T14:44:08Z","abstract_excerpt":"Integrated task and motion planning (TAMP) is desirable for generalized autonomy robots but it is challenging at the same time. TAMP requires the planner to not only search in both the large symbolic task space and the high-dimension motion space but also deal with the infeasible task actions due to its intrinsic hierarchical process. We propose a novel decision-making framework for TAMP by constructing an extended decision tree for both symbolic task planning and high-dimension motion variable binding. We integrate top-k planning for generating explicitly a skeleton space where a variety of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.05456","kind":"arxiv","version":3},"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/2103.05456/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":"2103.05456","created_at":"2026-07-05T03:22:57.731699+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.05456v3","created_at":"2026-07-05T03:22:57.731699+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.05456","created_at":"2026-07-05T03:22:57.731699+00:00"},{"alias_kind":"pith_short_12","alias_value":"FPTESETUNKQU","created_at":"2026-07-05T03:22:57.731699+00:00"},{"alias_kind":"pith_short_16","alias_value":"FPTESETUNKQUCEF7","created_at":"2026-07-05T03:22:57.731699+00:00"},{"alias_kind":"pith_short_8","alias_value":"FPTESETU","created_at":"2026-07-05T03:22:57.731699+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.07062","citing_title":"Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG","json":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG.json","graph_json":"https://pith.science/api/pith-number/FPTESETUNKQUCEF7FO4KML7XUG/graph.json","events_json":"https://pith.science/api/pith-number/FPTESETUNKQUCEF7FO4KML7XUG/events.json","paper":"https://pith.science/paper/FPTESETU"},"agent_actions":{"view_html":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG","download_json":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG.json","view_paper":"https://pith.science/paper/FPTESETU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.05456&json=true","fetch_graph":"https://pith.science/api/pith-number/FPTESETUNKQUCEF7FO4KML7XUG/graph.json","fetch_events":"https://pith.science/api/pith-number/FPTESETUNKQUCEF7FO4KML7XUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG/action/storage_attestation","attest_author":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG/action/author_attestation","sign_citation":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG/action/citation_signature","submit_replication":"https://pith.science/pith/FPTESETUNKQUCEF7FO4KML7XUG/action/replication_record"}},"created_at":"2026-07-05T03:22:57.731699+00:00","updated_at":"2026-07-05T03:22:57.731699+00:00"}