{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6EYB2M74ZMOTCYXOKED6S5VCXY","short_pith_number":"pith:6EYB2M74","schema_version":"1.0","canonical_sha256":"f1301d33fccb1d3162ee5107e976a2be10782559a070db373e52564d3f87b697","source":{"kind":"arxiv","id":"2403.06222","version":2},"attestation_state":"computed","paper":{"title":"Robust Predictive Motion Planning by Learning Obstacle Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Bj\\\"orn Olofsson, Erik Frisk, Jian Zhou, Ola Johansson, Yulong Gao","submitted_at":"2024-03-10T13:59:18Z","abstract_excerpt":"Safe motion planning for robotic systems in dynamic environments is nontrivial in the presence of uncertain obstacles, where estimation of obstacle uncertainties is crucial in predicting future motions of dynamic obstacles. The worst-case characterization gives a conservative uncertainty prediction and may result in infeasible motion planning for the ego robotic system. In this paper, an efficient, robust, and safe motion-planing algorithm is developed by learning the obstacle uncertainties online. More specifically, the unknown yet intended control set of obstacles is efficiently computed by "},"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":"2403.06222","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-03-10T13:59:18Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"8e811b7eab889383b4814bbef3d9c0b02f2bdaef3fdf9f8542284ba8cb711c72","abstract_canon_sha256":"b32b8e77c357c7965f812a8581159f714b6e1960c89cc5955a6c40c1fd55b8d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:02:44.175264Z","signature_b64":"4eUFcHPArm9ejCT4RYHGEvvkwLTDwYd33bpDHGMRk5pzS3fQCNK9kMb9TqMayPjFlVSUMDkDeC2aYQPtdZ+aDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1301d33fccb1d3162ee5107e976a2be10782559a070db373e52564d3f87b697","last_reissued_at":"2026-07-05T10:02:44.174780Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:02:44.174780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Predictive Motion Planning by Learning Obstacle Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Bj\\\"orn Olofsson, Erik Frisk, Jian Zhou, Ola Johansson, Yulong Gao","submitted_at":"2024-03-10T13:59:18Z","abstract_excerpt":"Safe motion planning for robotic systems in dynamic environments is nontrivial in the presence of uncertain obstacles, where estimation of obstacle uncertainties is crucial in predicting future motions of dynamic obstacles. The worst-case characterization gives a conservative uncertainty prediction and may result in infeasible motion planning for the ego robotic system. In this paper, an efficient, robust, and safe motion-planing algorithm is developed by learning the obstacle uncertainties online. More specifically, the unknown yet intended control set of obstacles is efficiently computed by "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06222","kind":"arxiv","version":2},"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/2403.06222/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":"2403.06222","created_at":"2026-07-05T10:02:44.174838+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06222v2","created_at":"2026-07-05T10:02:44.174838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06222","created_at":"2026-07-05T10:02:44.174838+00:00"},{"alias_kind":"pith_short_12","alias_value":"6EYB2M74ZMOT","created_at":"2026-07-05T10:02:44.174838+00:00"},{"alias_kind":"pith_short_16","alias_value":"6EYB2M74ZMOTCYXO","created_at":"2026-07-05T10:02:44.174838+00:00"},{"alias_kind":"pith_short_8","alias_value":"6EYB2M74","created_at":"2026-07-05T10:02:44.174838+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.12327","citing_title":"Robust Planning for Autonomous Driving via Mixed Adversarial Diffusion Predictions","ref_index":76,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY","json":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY.json","graph_json":"https://pith.science/api/pith-number/6EYB2M74ZMOTCYXOKED6S5VCXY/graph.json","events_json":"https://pith.science/api/pith-number/6EYB2M74ZMOTCYXOKED6S5VCXY/events.json","paper":"https://pith.science/paper/6EYB2M74"},"agent_actions":{"view_html":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY","download_json":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY.json","view_paper":"https://pith.science/paper/6EYB2M74","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06222&json=true","fetch_graph":"https://pith.science/api/pith-number/6EYB2M74ZMOTCYXOKED6S5VCXY/graph.json","fetch_events":"https://pith.science/api/pith-number/6EYB2M74ZMOTCYXOKED6S5VCXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY/action/storage_attestation","attest_author":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY/action/author_attestation","sign_citation":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY/action/citation_signature","submit_replication":"https://pith.science/pith/6EYB2M74ZMOTCYXOKED6S5VCXY/action/replication_record"}},"created_at":"2026-07-05T10:02:44.174838+00:00","updated_at":"2026-07-05T10:02:44.174838+00:00"}