{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:NW56OQCOMU6PRHAQ6WZB2VVGGD","short_pith_number":"pith:NW56OQCO","schema_version":"1.0","canonical_sha256":"6dbbe7404e653cf89c10f5b21d56a630cfce870a5419e5f383761b0841972406","source":{"kind":"arxiv","id":"2410.20267","version":3},"attestation_state":"computed","paper":{"title":"Learning Maximal Safe Sets Using Hypernetworks for MPC-based Local Trajectory Planning in Unknown Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Bojan Deraji\\'c, Mohamed-Khalil Bouzidi, Sebastian Bernhard, Wolfgang H\\\"onig","submitted_at":"2024-10-26T20:37:57Z","abstract_excerpt":"This paper presents a novel learning-based approach for online estimation of maximal safe sets for local trajectory planning in unknown static environments. The neural representation of a set is used as the terminal set constraint for a model predictive control (MPC) local planner, resulting in improved recursive feasibility and safety. To achieve real-time performance and desired generalization properties, we employ the idea of hypernetworks. We use the Hamilton-Jacobi (HJ) reachability analysis as the source of supervision during the training process, allowing us to consider general nonlinea"},"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":"2410.20267","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-10-26T20:37:57Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"c05970228f73e5a238c4d09ae3b5a818ef5934c1ab0f55352411564f6690307b","abstract_canon_sha256":"159cce3913e5d83022ac99c5ba2a21d0305d6e7068eaee2a7c25dcb52c3d4181"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:38:01.597412Z","signature_b64":"9DeIE7u7tfw9B0kCpx6NIPGzE16hBb1OOjaF2Zqc5JFQHvqpeZLPH1+21E6ysDd7WHa8YfIg4ZcX4Bou/N/lCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dbbe7404e653cf89c10f5b21d56a630cfce870a5419e5f383761b0841972406","last_reissued_at":"2026-07-05T11:38:01.596960Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:38:01.596960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Maximal Safe Sets Using Hypernetworks for MPC-based Local Trajectory Planning in Unknown Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Bojan Deraji\\'c, Mohamed-Khalil Bouzidi, Sebastian Bernhard, Wolfgang H\\\"onig","submitted_at":"2024-10-26T20:37:57Z","abstract_excerpt":"This paper presents a novel learning-based approach for online estimation of maximal safe sets for local trajectory planning in unknown static environments. The neural representation of a set is used as the terminal set constraint for a model predictive control (MPC) local planner, resulting in improved recursive feasibility and safety. To achieve real-time performance and desired generalization properties, we employ the idea of hypernetworks. We use the Hamilton-Jacobi (HJ) reachability analysis as the source of supervision during the training process, allowing us to consider general nonlinea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.20267","kind":"arxiv","version":3},"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/2410.20267/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":"2410.20267","created_at":"2026-07-05T11:38:01.597023+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.20267v3","created_at":"2026-07-05T11:38:01.597023+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.20267","created_at":"2026-07-05T11:38:01.597023+00:00"},{"alias_kind":"pith_short_12","alias_value":"NW56OQCOMU6P","created_at":"2026-07-05T11:38:01.597023+00:00"},{"alias_kind":"pith_short_16","alias_value":"NW56OQCOMU6PRHAQ","created_at":"2026-07-05T11:38:01.597023+00:00"},{"alias_kind":"pith_short_8","alias_value":"NW56OQCO","created_at":"2026-07-05T11:38:01.597023+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.15863","citing_title":"Generative AI for Autonomous Driving: A Review","ref_index":296,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD","json":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD.json","graph_json":"https://pith.science/api/pith-number/NW56OQCOMU6PRHAQ6WZB2VVGGD/graph.json","events_json":"https://pith.science/api/pith-number/NW56OQCOMU6PRHAQ6WZB2VVGGD/events.json","paper":"https://pith.science/paper/NW56OQCO"},"agent_actions":{"view_html":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD","download_json":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD.json","view_paper":"https://pith.science/paper/NW56OQCO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.20267&json=true","fetch_graph":"https://pith.science/api/pith-number/NW56OQCOMU6PRHAQ6WZB2VVGGD/graph.json","fetch_events":"https://pith.science/api/pith-number/NW56OQCOMU6PRHAQ6WZB2VVGGD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD/action/storage_attestation","attest_author":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD/action/author_attestation","sign_citation":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD/action/citation_signature","submit_replication":"https://pith.science/pith/NW56OQCOMU6PRHAQ6WZB2VVGGD/action/replication_record"}},"created_at":"2026-07-05T11:38:01.597023+00:00","updated_at":"2026-07-05T11:38:01.597023+00:00"}