{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HM6VPBA7PCMM72PGZEJKXYCTDE","short_pith_number":"pith:HM6VPBA7","schema_version":"1.0","canonical_sha256":"3b3d57841f7898cfe9e6c912abe053193a6496f9f47fa2ebe8895397c6a89100","source":{"kind":"arxiv","id":"1405.5345","version":2},"attestation_state":"computed","paper":{"title":"HATP: An HTN Planner for Robotics","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Lavindra de Silva, Rachid Alami, Rapha\\\"el Lallement","submitted_at":"2014-05-21T09:32:15Z","abstract_excerpt":"Hierarchical Task Network (HTN) planning is a popular approach that cuts down on the classical planning search space by relying on a given hierarchical library of domain control knowledge. This provides an intuitive methodology for specifying high-level instructions on how robots and agents should perform tasks, while also giving the planner enough flexibility to choose the lower-level steps and their ordering. In this paper we present the HATP (Hierarchical Agent-based Task Planner) planning framework which extends the traditional HTN planning domain representation and semantics by making the"},"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":"1405.5345","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.RO","submitted_at":"2014-05-21T09:32:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"da339161dd6fc1f0a4eee0cfdfce6b5c45c54126f15d022db6e8a50d201c5b00","abstract_canon_sha256":"e1ec940cd92cf3f96563b5a9944ddcec48cf3037fcb3a3cea708b20bfe535795"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:53.404074Z","signature_b64":"Gex4TFCDjBpeEbu8GMDuO9MIqIHi6neMhgM36lYbV0OAHI6j2lkKisnuRcDYYsdE4oUqkCRVEAmn+jVnQDVnBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b3d57841f7898cfe9e6c912abe053193a6496f9f47fa2ebe8895397c6a89100","last_reissued_at":"2026-05-18T02:49:53.403649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:53.403649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"HATP: An HTN Planner for Robotics","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Lavindra de Silva, Rachid Alami, Rapha\\\"el Lallement","submitted_at":"2014-05-21T09:32:15Z","abstract_excerpt":"Hierarchical Task Network (HTN) planning is a popular approach that cuts down on the classical planning search space by relying on a given hierarchical library of domain control knowledge. This provides an intuitive methodology for specifying high-level instructions on how robots and agents should perform tasks, while also giving the planner enough flexibility to choose the lower-level steps and their ordering. In this paper we present the HATP (Hierarchical Agent-based Task Planner) planning framework which extends the traditional HTN planning domain representation and semantics by making the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5345","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":""},"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":"1405.5345","created_at":"2026-05-18T02:49:53.403712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5345v2","created_at":"2026-05-18T02:49:53.403712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5345","created_at":"2026-05-18T02:49:53.403712+00:00"},{"alias_kind":"pith_short_12","alias_value":"HM6VPBA7PCMM","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HM6VPBA7PCMM72PG","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HM6VPBA7","created_at":"2026-05-18T12:28:30.664211+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/HM6VPBA7PCMM72PGZEJKXYCTDE","json":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE.json","graph_json":"https://pith.science/api/pith-number/HM6VPBA7PCMM72PGZEJKXYCTDE/graph.json","events_json":"https://pith.science/api/pith-number/HM6VPBA7PCMM72PGZEJKXYCTDE/events.json","paper":"https://pith.science/paper/HM6VPBA7"},"agent_actions":{"view_html":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE","download_json":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE.json","view_paper":"https://pith.science/paper/HM6VPBA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5345&json=true","fetch_graph":"https://pith.science/api/pith-number/HM6VPBA7PCMM72PGZEJKXYCTDE/graph.json","fetch_events":"https://pith.science/api/pith-number/HM6VPBA7PCMM72PGZEJKXYCTDE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE/action/storage_attestation","attest_author":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE/action/author_attestation","sign_citation":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE/action/citation_signature","submit_replication":"https://pith.science/pith/HM6VPBA7PCMM72PGZEJKXYCTDE/action/replication_record"}},"created_at":"2026-05-18T02:49:53.403712+00:00","updated_at":"2026-05-18T02:49:53.403712+00:00"}