{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:7AJSFJCRASZOW54E355ROIWFFI","short_pith_number":"pith:7AJSFJCR","schema_version":"1.0","canonical_sha256":"f81322a45104b2eb7784df7b1722c52a2ab8f01a792f51ceadf245288c642e08","source":{"kind":"arxiv","id":"2010.01083","version":1},"attestation_state":"computed","paper":{"title":"Integrated Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Beomjoon Kim, Caelan Reed Garrett, Leslie Pack Kaelbling, Rachel Holladay, Rohan Chitnis, Tom\\'as Lozano-P\\'erez, Tom Silver","submitted_at":"2020-10-02T16:23:08Z","abstract_excerpt":"The problem of planning for a robot that operates in environments containing a large number of objects, taking actions to move itself through the world as well as to change the state of the objects, is known as task and motion planning (TAMP). TAMP problems contain elements of discrete task planning, discrete-continuous mathematical programming, and continuous motion planning, and thus cannot be effectively addressed by any of these fields directly. In this paper, we define a class of TAMP problems and survey algorithms for solving them, characterizing the solution methods in terms of their st"},"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":"2010.01083","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-10-02T16:23:08Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ea438660503cad59211a876e08f6ebdebfe824562039202875365b6e61539bd4","abstract_canon_sha256":"51632a6c6c5cceabfa9a9ad2ebb6d7d17bdad5724ce83e102198d63ff2a7332e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:39:51.510019Z","signature_b64":"Of3ZXq+QWFB7KARbUWPWzS2YU5VkddDyWNY/C6t8My0jk/scHJIgkMjHtxaHjBfuxRpSC5nbuHZUScauK2UDAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f81322a45104b2eb7784df7b1722c52a2ab8f01a792f51ceadf245288c642e08","last_reissued_at":"2026-07-05T01:39:51.509631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:39:51.509631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integrated Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Beomjoon Kim, Caelan Reed Garrett, Leslie Pack Kaelbling, Rachel Holladay, Rohan Chitnis, Tom\\'as Lozano-P\\'erez, Tom Silver","submitted_at":"2020-10-02T16:23:08Z","abstract_excerpt":"The problem of planning for a robot that operates in environments containing a large number of objects, taking actions to move itself through the world as well as to change the state of the objects, is known as task and motion planning (TAMP). TAMP problems contain elements of discrete task planning, discrete-continuous mathematical programming, and continuous motion planning, and thus cannot be effectively addressed by any of these fields directly. In this paper, we define a class of TAMP problems and survey algorithms for solving them, characterizing the solution methods in terms of their st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.01083","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/2010.01083/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":"2010.01083","created_at":"2026-07-05T01:39:51.509688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.01083v1","created_at":"2026-07-05T01:39:51.509688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.01083","created_at":"2026-07-05T01:39:51.509688+00:00"},{"alias_kind":"pith_short_12","alias_value":"7AJSFJCRASZO","created_at":"2026-07-05T01:39:51.509688+00:00"},{"alias_kind":"pith_short_16","alias_value":"7AJSFJCRASZOW54E","created_at":"2026-07-05T01:39:51.509688+00:00"},{"alias_kind":"pith_short_8","alias_value":"7AJSFJCR","created_at":"2026-07-05T01:39:51.509688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24884","citing_title":"InSight: Self-Guided Skill Acquisition via Steerable VLAs","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2606.17511","citing_title":"MagicSim: A Unified Infrastructure for Executable Embodied Interaction","ref_index":89,"is_internal_anchor":false},{"citing_arxiv_id":"2606.12365","citing_title":"Ambient Diffusion Policy: Imitation Learning from Suboptimal Data in Robotics","ref_index":81,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20648","citing_title":"Jointly Learning Predicates and Actions Enables Zero-Shot Skill Composition","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2602.23024","citing_title":"InCoM: Intent-Driven Perception and Structured Coordination for Mobile Manipulation","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI","json":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI.json","graph_json":"https://pith.science/api/pith-number/7AJSFJCRASZOW54E355ROIWFFI/graph.json","events_json":"https://pith.science/api/pith-number/7AJSFJCRASZOW54E355ROIWFFI/events.json","paper":"https://pith.science/paper/7AJSFJCR"},"agent_actions":{"view_html":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI","download_json":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI.json","view_paper":"https://pith.science/paper/7AJSFJCR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.01083&json=true","fetch_graph":"https://pith.science/api/pith-number/7AJSFJCRASZOW54E355ROIWFFI/graph.json","fetch_events":"https://pith.science/api/pith-number/7AJSFJCRASZOW54E355ROIWFFI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI/action/storage_attestation","attest_author":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI/action/author_attestation","sign_citation":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI/action/citation_signature","submit_replication":"https://pith.science/pith/7AJSFJCRASZOW54E355ROIWFFI/action/replication_record"}},"created_at":"2026-07-05T01:39:51.509688+00:00","updated_at":"2026-07-05T01:39:51.509688+00:00"}