{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MTSML5UYJCFSFTZERWOTQQU2MC","short_pith_number":"pith:MTSML5UY","schema_version":"1.0","canonical_sha256":"64e4c5f698488b22cf248d9d38429a60a5794a04081559f2a1858e94b07d94b2","source":{"kind":"arxiv","id":"1706.06927","version":1},"attestation_state":"computed","paper":{"title":"Combined Task and Motion Planning as Classical AI Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Guillem Franc\\`es, Hector Geffner, Jonathan Ferrer-Mestres","submitted_at":"2017-06-21T14:24:54Z","abstract_excerpt":"Planning in robotics is often split into task and motion planning. The high-level, symbolic task planner decides what needs to be done, while the motion planner checks feasibility and fills up geometric detail. It is known however that such a decomposition is not effective in general as the symbolic and geometrical components are not independent. In this work, we show that it is possible to compile task and motion planning problems into classical AI planning problems; i.e., planning problems over finite and discrete state spaces with a known initial state, deterministic actions, and goal state"},"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":"1706.06927","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-06-21T14:24:54Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"6bfae3744f77b6952ae12feb5f2b3d2a7c69cf90fb747bf09fc6b36bb19fcc20","abstract_canon_sha256":"5c1fd84e1f85763e84bd9acb9ae1899995157080c5ef7f4d8a2a4521f68887df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:56.469589Z","signature_b64":"IePOjleezK1RXXW8pMzjmNvBfMrnIJzZW+RZfVbU7v27X2WKCcTcdBMmsCNEqrndAhadYimAyF5Gz0K6Ux0CDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64e4c5f698488b22cf248d9d38429a60a5794a04081559f2a1858e94b07d94b2","last_reissued_at":"2026-05-18T00:41:56.469126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:56.469126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combined Task and Motion Planning as Classical AI Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Guillem Franc\\`es, Hector Geffner, Jonathan Ferrer-Mestres","submitted_at":"2017-06-21T14:24:54Z","abstract_excerpt":"Planning in robotics is often split into task and motion planning. The high-level, symbolic task planner decides what needs to be done, while the motion planner checks feasibility and fills up geometric detail. It is known however that such a decomposition is not effective in general as the symbolic and geometrical components are not independent. In this work, we show that it is possible to compile task and motion planning problems into classical AI planning problems; i.e., planning problems over finite and discrete state spaces with a known initial state, deterministic actions, and goal state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06927","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":"1706.06927","created_at":"2026-05-18T00:41:56.469187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.06927v1","created_at":"2026-05-18T00:41:56.469187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06927","created_at":"2026-05-18T00:41:56.469187+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTSML5UYJCFS","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTSML5UYJCFSFTZE","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTSML5UY","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC","json":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC.json","graph_json":"https://pith.science/api/pith-number/MTSML5UYJCFSFTZERWOTQQU2MC/graph.json","events_json":"https://pith.science/api/pith-number/MTSML5UYJCFSFTZERWOTQQU2MC/events.json","paper":"https://pith.science/paper/MTSML5UY"},"agent_actions":{"view_html":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC","download_json":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC.json","view_paper":"https://pith.science/paper/MTSML5UY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.06927&json=true","fetch_graph":"https://pith.science/api/pith-number/MTSML5UYJCFSFTZERWOTQQU2MC/graph.json","fetch_events":"https://pith.science/api/pith-number/MTSML5UYJCFSFTZERWOTQQU2MC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC/action/storage_attestation","attest_author":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC/action/author_attestation","sign_citation":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC/action/citation_signature","submit_replication":"https://pith.science/pith/MTSML5UYJCFSFTZERWOTQQU2MC/action/replication_record"}},"created_at":"2026-05-18T00:41:56.469187+00:00","updated_at":"2026-05-18T00:41:56.469187+00:00"}