{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CDOTMRUPQGBFEFPHICPKTI3N2I","short_pith_number":"pith:CDOTMRUP","schema_version":"1.0","canonical_sha256":"10dd36468f81825215e7409ea9a36dd21a245dbafed6ef85c1f8da2c51d821aa","source":{"kind":"arxiv","id":"1609.06277","version":1},"attestation_state":"computed","paper":{"title":"Design of Admissible Heuristics for Kinodynamic Motion Planning via Sum-of-Squares Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brian Paden, Emilio Frazzoli, Valerio Varriccho","submitted_at":"2016-09-20T18:08:51Z","abstract_excerpt":"How does one obtain an admissible heuristic for a kinodynamic motion planning problem? This paper develops the analytical tools and techniques to answer this question. A sufficient condition for the admissibility of a heuristic is presented which can be checked directly from the problem data. This condition is also used to formulate a concave program to optimize an admissible heuristic. This optimization is then approximated and solved in polynomial time using sum-of-squares programming techniques. A number of examples are provided to demonstrate these concepts."},"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":"1609.06277","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-09-20T18:08:51Z","cross_cats_sorted":[],"title_canon_sha256":"5afd8326a05db9128a0a7834b7ed644b4333fe00ac5923331ea7675459afe561","abstract_canon_sha256":"07ea5d1acaa41ff4ceb33127a31b4b0627a7b3efe04407b6c0779631eaa2439d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:16.273729Z","signature_b64":"Tm8TlR9yE9cKJBWbaUwEN7SxglpwibLxrC0HVVHBAOWYc6TWPn4TybTFh2ugTuyPMXEtmmb2xithEP/98e5QCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10dd36468f81825215e7409ea9a36dd21a245dbafed6ef85c1f8da2c51d821aa","last_reissued_at":"2026-05-18T01:04:16.273389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:16.273389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Design of Admissible Heuristics for Kinodynamic Motion Planning via Sum-of-Squares Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brian Paden, Emilio Frazzoli, Valerio Varriccho","submitted_at":"2016-09-20T18:08:51Z","abstract_excerpt":"How does one obtain an admissible heuristic for a kinodynamic motion planning problem? This paper develops the analytical tools and techniques to answer this question. A sufficient condition for the admissibility of a heuristic is presented which can be checked directly from the problem data. This condition is also used to formulate a concave program to optimize an admissible heuristic. This optimization is then approximated and solved in polynomial time using sum-of-squares programming techniques. A number of examples are provided to demonstrate these concepts."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06277","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":"1609.06277","created_at":"2026-05-18T01:04:16.273444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06277v1","created_at":"2026-05-18T01:04:16.273444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06277","created_at":"2026-05-18T01:04:16.273444+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDOTMRUPQGBF","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDOTMRUPQGBFEFPH","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDOTMRUP","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2603.16231","citing_title":"Featurized Occupation Measures for Structured Global Search in Numerical Optimal Control","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I","json":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I.json","graph_json":"https://pith.science/api/pith-number/CDOTMRUPQGBFEFPHICPKTI3N2I/graph.json","events_json":"https://pith.science/api/pith-number/CDOTMRUPQGBFEFPHICPKTI3N2I/events.json","paper":"https://pith.science/paper/CDOTMRUP"},"agent_actions":{"view_html":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I","download_json":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I.json","view_paper":"https://pith.science/paper/CDOTMRUP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06277&json=true","fetch_graph":"https://pith.science/api/pith-number/CDOTMRUPQGBFEFPHICPKTI3N2I/graph.json","fetch_events":"https://pith.science/api/pith-number/CDOTMRUPQGBFEFPHICPKTI3N2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I/action/storage_attestation","attest_author":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I/action/author_attestation","sign_citation":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I/action/citation_signature","submit_replication":"https://pith.science/pith/CDOTMRUPQGBFEFPHICPKTI3N2I/action/replication_record"}},"created_at":"2026-05-18T01:04:16.273444+00:00","updated_at":"2026-05-18T01:04:16.273444+00:00"}