{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:IBUCSIVPZZIDF7AIPFTGMIGFWT","short_pith_number":"pith:IBUCSIVP","schema_version":"1.0","canonical_sha256":"40682922afce5032fc0879666620c5b4f2ce075ec9b9b48d9c508a53714922b5","source":{"kind":"arxiv","id":"2211.01576","version":2},"attestation_state":"computed","paper":{"title":"Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Caelan Reed Garrett, Dieter Fox, Leslie Kaelbling, Tom\\'as Lozano-P\\'erez, Zhutian Yang","submitted_at":"2022-11-03T04:12:04Z","abstract_excerpt":"We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. Our idea is to bias the search procedure of a traditional TAMP planner with a learned plan feasibility predictor. The core of our algorithm is PIGINet, a novel Transformer-based learning method that takes in a task plan, the goal, and the initial state, and predicts the probability of finding motion trajectories associated with the task plan. We integrate PIGINet within a TAMP planner that generates a diverse set of high-l"},"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":"2211.01576","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2022-11-03T04:12:04Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"dafe9da5fadfcc6c3b311a807d8997c665eefd1f9a60f11ddaaf334eeb611fd5","abstract_canon_sha256":"4bf46d01e4666088f5c640d077a7869e7965a72df851f702d903384e32eb7b5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:12:23.093757Z","signature_b64":"FINDcepQIlwxZbs/0uX7LA1aSCPuA9dtXcJALGLBDB8LypWaYh5tW0Q86foQbwZXxrfIXX9EJ9Y6cUGQHpCnCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40682922afce5032fc0879666620c5b4f2ce075ec9b9b48d9c508a53714922b5","last_reissued_at":"2026-07-05T06:12:23.093272Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:12:23.093272Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequence-Based Plan Feasibility Prediction for Efficient Task and Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.RO","authors_text":"Caelan Reed Garrett, Dieter Fox, Leslie Kaelbling, Tom\\'as Lozano-P\\'erez, Zhutian Yang","submitted_at":"2022-11-03T04:12:04Z","abstract_excerpt":"We present a learning-enabled Task and Motion Planning (TAMP) algorithm for solving mobile manipulation problems in environments with many articulated and movable obstacles. Our idea is to bias the search procedure of a traditional TAMP planner with a learned plan feasibility predictor. The core of our algorithm is PIGINet, a novel Transformer-based learning method that takes in a task plan, the goal, and the initial state, and predicts the probability of finding motion trajectories associated with the task plan. We integrate PIGINet within a TAMP planner that generates a diverse set of high-l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01576","kind":"arxiv","version":2},"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/2211.01576/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":"2211.01576","created_at":"2026-07-05T06:12:23.093328+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01576v2","created_at":"2026-07-05T06:12:23.093328+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01576","created_at":"2026-07-05T06:12:23.093328+00:00"},{"alias_kind":"pith_short_12","alias_value":"IBUCSIVPZZID","created_at":"2026-07-05T06:12:23.093328+00:00"},{"alias_kind":"pith_short_16","alias_value":"IBUCSIVPZZIDF7AI","created_at":"2026-07-05T06:12:23.093328+00:00"},{"alias_kind":"pith_short_8","alias_value":"IBUCSIVP","created_at":"2026-07-05T06:12:23.093328+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2409.01652","citing_title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","ref_index":88,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT","json":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT.json","graph_json":"https://pith.science/api/pith-number/IBUCSIVPZZIDF7AIPFTGMIGFWT/graph.json","events_json":"https://pith.science/api/pith-number/IBUCSIVPZZIDF7AIPFTGMIGFWT/events.json","paper":"https://pith.science/paper/IBUCSIVP"},"agent_actions":{"view_html":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT","download_json":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT.json","view_paper":"https://pith.science/paper/IBUCSIVP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01576&json=true","fetch_graph":"https://pith.science/api/pith-number/IBUCSIVPZZIDF7AIPFTGMIGFWT/graph.json","fetch_events":"https://pith.science/api/pith-number/IBUCSIVPZZIDF7AIPFTGMIGFWT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT/action/storage_attestation","attest_author":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT/action/author_attestation","sign_citation":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT/action/citation_signature","submit_replication":"https://pith.science/pith/IBUCSIVPZZIDF7AIPFTGMIGFWT/action/replication_record"}},"created_at":"2026-07-05T06:12:23.093328+00:00","updated_at":"2026-07-05T06:12:23.093328+00:00"}