{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:BYE2Y4X5WDVB6SM65A4KQSKXI2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"76f645d0892dcc651e3d42baafce0d2e6ed2165de4cce265550bd0bede2d8e0a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-28T03:30:25Z","title_canon_sha256":"8de72f01a8ef0195f3d14ab074e48da9ef2702887974d32b2edba51091a6b6ac"},"schema_version":"1.0","source":{"id":"2403.19122","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.19122","created_at":"2026-07-05T10:10:40Z"},{"alias_kind":"arxiv_version","alias_value":"2403.19122v3","created_at":"2026-07-05T10:10:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.19122","created_at":"2026-07-05T10:10:40Z"},{"alias_kind":"pith_short_12","alias_value":"BYE2Y4X5WDVB","created_at":"2026-07-05T10:10:40Z"},{"alias_kind":"pith_short_16","alias_value":"BYE2Y4X5WDVB6SM6","created_at":"2026-07-05T10:10:40Z"},{"alias_kind":"pith_short_8","alias_value":"BYE2Y4X5","created_at":"2026-07-05T10:10:40Z"}],"graph_snapshots":[{"event_id":"sha256:e02d11af98aed9f1fa63c242986ebb4deeb2967ad7eef8ebfa0edd27951c0fab","target":"graph","created_at":"2026-07-05T10:10:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.19122/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic obstacle avoidance is a challenging topic for optimal control and optimization-based trajectory planning problems. Many existing works use Control Barrier Functions (CBFs) to enforce safety constraints for control systems. CBFs are typically formulated based on the distance to obstacles, or integrated with path planning algorithms as a safety enhancement tool. However, these approaches usually require knowledge of the obstacle boundary equations or have very slow computational efficiency. In this paper, we propose a framework based on model predictive control (MPC) with discrete-time h","authors_text":"Calin A. Belta, Shuo Liu, Yihui Mao","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-28T03:30:25Z","title":"Safety-Critical Planning and Control for Dynamic Obstacle Avoidance Using Control Barrier Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.19122","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4c12201c23566bade6d889cb83b9fa032f284bd86f2a59868a3df48b0e9b912a","target":"record","created_at":"2026-07-05T10:10:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"76f645d0892dcc651e3d42baafce0d2e6ed2165de4cce265550bd0bede2d8e0a","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-28T03:30:25Z","title_canon_sha256":"8de72f01a8ef0195f3d14ab074e48da9ef2702887974d32b2edba51091a6b6ac"},"schema_version":"1.0","source":{"id":"2403.19122","kind":"arxiv","version":3}},"canonical_sha256":"0e09ac72fdb0ea1f499ee838a84957468d5345f931b189ea5fb61d2b54998f27","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0e09ac72fdb0ea1f499ee838a84957468d5345f931b189ea5fb61d2b54998f27","first_computed_at":"2026-07-05T10:10:40.056542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:10:40.056542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"egYlDlJsn/ZWi6hJF4rpoeloNTqMt20aKPVX+nBlbd4Rg197qlpUB8nigs8RLjEDka0gWmFhA49F+DbgqQb8CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:10:40.056943Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.19122","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c12201c23566bade6d889cb83b9fa032f284bd86f2a59868a3df48b0e9b912a","sha256:e02d11af98aed9f1fa63c242986ebb4deeb2967ad7eef8ebfa0edd27951c0fab"],"state_sha256":"e37a61c4bc170a760cdacdb4ea0c98c9fd365f0a5adeaf6abe1dbb18f1fd8ce1"}