{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:BMXDSI3VA4JB63NGWS65Y4LQ37","short_pith_number":"pith:BMXDSI3V","schema_version":"1.0","canonical_sha256":"0b2e39237507121f6da6b4bddc7170dfe6a142d26e538c64c7efd424e6a2ed9e","source":{"kind":"arxiv","id":"2402.15604","version":4},"attestation_state":"computed","paper":{"title":"Goal-Reaching Trajectory Design Near Danger with Piecewise Affine Reach-avoid Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chuizheng Kong, Long Kiu Chung, Shreyas Kousik, Wonsuhk Jung","submitted_at":"2024-02-23T20:54:47Z","abstract_excerpt":"Autonomous mobile robots must maintain safety, but should not sacrifice performance, leading to the classical reach-avoid problem: find a trajectory that is guaranteed to reach a goal and avoid obstacles. This paper addresses the near danger case, also known as a narrow gap, where the agent starts near the goal, but must navigate through tight obstacles that block its path. The proposed method builds off the common approach of using a simplified planning model to generate plans, which are then tracked using a high-fidelity tracking model and controller. Existing approaches use reachability ana"},"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":"2402.15604","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-02-23T20:54:47Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"ec389a8dafa03ff005639779866693de62840402b97dfec3dcdc43bfb4206fd0","abstract_canon_sha256":"05321332345224db511a1cab600d59f1ccee6b65c6fc0cd1695f24ec9cc789f7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:25:40.801201Z","signature_b64":"D+v2UfiMj5r+gQb7pml9Zy4f53y8t0s6477ZmI4cUr28icBLp79UCefWgQ/CSdl4zw3WVnO9Yp0WkN/lOSnBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b2e39237507121f6da6b4bddc7170dfe6a142d26e538c64c7efd424e6a2ed9e","last_reissued_at":"2026-07-05T09:25:40.800652Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:25:40.800652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Goal-Reaching Trajectory Design Near Danger with Piecewise Affine Reach-avoid Computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Chuizheng Kong, Long Kiu Chung, Shreyas Kousik, Wonsuhk Jung","submitted_at":"2024-02-23T20:54:47Z","abstract_excerpt":"Autonomous mobile robots must maintain safety, but should not sacrifice performance, leading to the classical reach-avoid problem: find a trajectory that is guaranteed to reach a goal and avoid obstacles. This paper addresses the near danger case, also known as a narrow gap, where the agent starts near the goal, but must navigate through tight obstacles that block its path. The proposed method builds off the common approach of using a simplified planning model to generate plans, which are then tracked using a high-fidelity tracking model and controller. Existing approaches use reachability ana"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2402.15604","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/2402.15604/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":"2402.15604","created_at":"2026-07-05T09:25:40.800724+00:00"},{"alias_kind":"arxiv_version","alias_value":"2402.15604v4","created_at":"2026-07-05T09:25:40.800724+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2402.15604","created_at":"2026-07-05T09:25:40.800724+00:00"},{"alias_kind":"pith_short_12","alias_value":"BMXDSI3VA4JB","created_at":"2026-07-05T09:25:40.800724+00:00"},{"alias_kind":"pith_short_16","alias_value":"BMXDSI3VA4JB63NG","created_at":"2026-07-05T09:25:40.800724+00:00"},{"alias_kind":"pith_short_8","alias_value":"BMXDSI3V","created_at":"2026-07-05T09:25:40.800724+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.30935","citing_title":"ShardNet: Training Neural Controllers with Hard, Non-Convex Constraints","ref_index":9,"is_internal_anchor":false},{"citing_arxiv_id":"2604.07644","citing_title":"Safe Large-Scale Robust Nonlinear MPC in Milliseconds via Reachability-Constrained System Level Synthesis on the GPU","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37","json":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37.json","graph_json":"https://pith.science/api/pith-number/BMXDSI3VA4JB63NGWS65Y4LQ37/graph.json","events_json":"https://pith.science/api/pith-number/BMXDSI3VA4JB63NGWS65Y4LQ37/events.json","paper":"https://pith.science/paper/BMXDSI3V"},"agent_actions":{"view_html":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37","download_json":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37.json","view_paper":"https://pith.science/paper/BMXDSI3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2402.15604&json=true","fetch_graph":"https://pith.science/api/pith-number/BMXDSI3VA4JB63NGWS65Y4LQ37/graph.json","fetch_events":"https://pith.science/api/pith-number/BMXDSI3VA4JB63NGWS65Y4LQ37/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37/action/storage_attestation","attest_author":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37/action/author_attestation","sign_citation":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37/action/citation_signature","submit_replication":"https://pith.science/pith/BMXDSI3VA4JB63NGWS65Y4LQ37/action/replication_record"}},"created_at":"2026-07-05T09:25:40.800724+00:00","updated_at":"2026-07-05T09:25:40.800724+00:00"}