{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QOOOUV2G7FVNPS5BYV4NV7QT5A","short_pith_number":"pith:QOOOUV2G","schema_version":"1.0","canonical_sha256":"839cea5746f96ad7cba1c578dafe13e83c2e078002f9c33f80f2fb1645e4a35d","source":{"kind":"arxiv","id":"2304.00790","version":4},"attestation_state":"computed","paper":{"title":"LQR-CBF-RRT*: Safe and Optimal Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Ahmad Ahmad, Amanda Prorok, Calin Belta, Guang Yang, Mingyu Cai, Roberto Tron","submitted_at":"2023-04-03T08:23:53Z","abstract_excerpt":"We present LQR-CBF-RRT*, an incremental sampling-based algorithm for offline motion planning. Our framework leverages the strength of Control Barrier Functions (CBFs) and Linear Quadratic Regulators (LQR) to generate safety-critical and optimal trajectories for a robot with dynamics described by an affine control system. CBFs are used for safety guarantees, while LQRs are employed for optimal control synthesis during edge extensions. Popular CBF-based formulations for safety critical control require solving Quadratic Programs (QPs), which can be computationally expensive. Moreover, LQR-based c"},"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":"2304.00790","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-04-03T08:23:53Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"036e93b3aedb0591868eeb4a038d63f1814a8fd4d418ba6623f2489b8433cd6f","abstract_canon_sha256":"a119b0f2671f3aaf3a6d73c8ee82d49a3dd21ca85904354d6bf80c9b35e5a83c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:37.840634Z","signature_b64":"YMOsDbUjm6zlnA9nkm56AhLXrd2h413gotDcDRnDpQXECsKujL3amXGlZharm/pHjg9QrjZ606z96vEiWWsRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"839cea5746f96ad7cba1c578dafe13e83c2e078002f9c33f80f2fb1645e4a35d","last_reissued_at":"2026-07-05T06:54:37.840174Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:37.840174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LQR-CBF-RRT*: Safe and Optimal Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Ahmad Ahmad, Amanda Prorok, Calin Belta, Guang Yang, Mingyu Cai, Roberto Tron","submitted_at":"2023-04-03T08:23:53Z","abstract_excerpt":"We present LQR-CBF-RRT*, an incremental sampling-based algorithm for offline motion planning. Our framework leverages the strength of Control Barrier Functions (CBFs) and Linear Quadratic Regulators (LQR) to generate safety-critical and optimal trajectories for a robot with dynamics described by an affine control system. CBFs are used for safety guarantees, while LQRs are employed for optimal control synthesis during edge extensions. Popular CBF-based formulations for safety critical control require solving Quadratic Programs (QPs), which can be computationally expensive. Moreover, LQR-based c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.00790","kind":"arxiv","version":4},"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/2304.00790/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":"2304.00790","created_at":"2026-07-05T06:54:37.840231+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.00790v4","created_at":"2026-07-05T06:54:37.840231+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.00790","created_at":"2026-07-05T06:54:37.840231+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOOOUV2G7FVN","created_at":"2026-07-05T06:54:37.840231+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOOOUV2G7FVNPS5B","created_at":"2026-07-05T06:54:37.840231+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOOOUV2G","created_at":"2026-07-05T06:54:37.840231+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/QOOOUV2G7FVNPS5BYV4NV7QT5A","json":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A.json","graph_json":"https://pith.science/api/pith-number/QOOOUV2G7FVNPS5BYV4NV7QT5A/graph.json","events_json":"https://pith.science/api/pith-number/QOOOUV2G7FVNPS5BYV4NV7QT5A/events.json","paper":"https://pith.science/paper/QOOOUV2G"},"agent_actions":{"view_html":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A","download_json":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A.json","view_paper":"https://pith.science/paper/QOOOUV2G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.00790&json=true","fetch_graph":"https://pith.science/api/pith-number/QOOOUV2G7FVNPS5BYV4NV7QT5A/graph.json","fetch_events":"https://pith.science/api/pith-number/QOOOUV2G7FVNPS5BYV4NV7QT5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A/action/storage_attestation","attest_author":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A/action/author_attestation","sign_citation":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A/action/citation_signature","submit_replication":"https://pith.science/pith/QOOOUV2G7FVNPS5BYV4NV7QT5A/action/replication_record"}},"created_at":"2026-07-05T06:54:37.840231+00:00","updated_at":"2026-07-05T06:54:37.840231+00:00"}