{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:4XFC7AOCAHYIQ5YBKNYDXC6XCD","short_pith_number":"pith:4XFC7AOC","schema_version":"1.0","canonical_sha256":"e5ca2f81c201f088770153703b8bd710c5fa7d085702c8ccb6d8346dedbde5b5","source":{"kind":"arxiv","id":"2504.15320","version":1},"attestation_state":"computed","paper":{"title":"Efficient and Safe Planner for Automated Driving on Ramps Considering Unsatisfication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Jinming Yang, Qinghao Li, Xiaodan Wang, Zhen Tian, Zhihao Lin","submitted_at":"2025-04-20T21:39:51Z","abstract_excerpt":"Automated driving on ramps presents significant challenges due to the need to balance both safety and efficiency during lane changes. This paper proposes an integrated planner for automated vehicles (AVs) on ramps, utilizing an unsatisfactory level metric for efficiency and arrow-cluster-based sampling for safety. The planner identifies optimal times for the AV to change lanes, taking into account the vehicle's velocity as a key factor in efficiency. Additionally, the integrated planner employs arrow-cluster-based sampling to evaluate collision risks and select an optimal lane-changing curve. "},"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":"2504.15320","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2025-04-20T21:39:51Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"8869971067a05fbb3a3fd0184c3d7393aa04e8e44e44f76305ce101fe2caa68f","abstract_canon_sha256":"d79cfa5e57718ed42e8a7857186be214c807228190073978ade8e34e8a21c197"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:00.636186Z","signature_b64":"Xzn/SYVTyHzvYPsreZjUrgd87cztD25zl9SG6AhzQNTfMG6D1w313hVYyQgrm+VfwdQIcopj97gv/YGFWMb/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5ca2f81c201f088770153703b8bd710c5fa7d085702c8ccb6d8346dedbde5b5","last_reissued_at":"2026-07-05T10:52:00.635698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:00.635698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient and Safe Planner for Automated Driving on Ramps Considering Unsatisfication","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Jinming Yang, Qinghao Li, Xiaodan Wang, Zhen Tian, Zhihao Lin","submitted_at":"2025-04-20T21:39:51Z","abstract_excerpt":"Automated driving on ramps presents significant challenges due to the need to balance both safety and efficiency during lane changes. This paper proposes an integrated planner for automated vehicles (AVs) on ramps, utilizing an unsatisfactory level metric for efficiency and arrow-cluster-based sampling for safety. The planner identifies optimal times for the AV to change lanes, taking into account the vehicle's velocity as a key factor in efficiency. Additionally, the integrated planner employs arrow-cluster-based sampling to evaluate collision risks and select an optimal lane-changing curve. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.15320","kind":"arxiv","version":1},"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/2504.15320/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":"2504.15320","created_at":"2026-07-05T10:52:00.635756+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.15320v1","created_at":"2026-07-05T10:52:00.635756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.15320","created_at":"2026-07-05T10:52:00.635756+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XFC7AOCAHYI","created_at":"2026-07-05T10:52:00.635756+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XFC7AOCAHYIQ5YB","created_at":"2026-07-05T10:52:00.635756+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XFC7AOC","created_at":"2026-07-05T10:52:00.635756+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.08147","citing_title":"Mean Field Game-Based Interactive Trajectory Planning Using Physics-Inspired Unified Potential Fields","ref_index":9,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD","json":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD.json","graph_json":"https://pith.science/api/pith-number/4XFC7AOCAHYIQ5YBKNYDXC6XCD/graph.json","events_json":"https://pith.science/api/pith-number/4XFC7AOCAHYIQ5YBKNYDXC6XCD/events.json","paper":"https://pith.science/paper/4XFC7AOC"},"agent_actions":{"view_html":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD","download_json":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD.json","view_paper":"https://pith.science/paper/4XFC7AOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.15320&json=true","fetch_graph":"https://pith.science/api/pith-number/4XFC7AOCAHYIQ5YBKNYDXC6XCD/graph.json","fetch_events":"https://pith.science/api/pith-number/4XFC7AOCAHYIQ5YBKNYDXC6XCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD/action/storage_attestation","attest_author":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD/action/author_attestation","sign_citation":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD/action/citation_signature","submit_replication":"https://pith.science/pith/4XFC7AOCAHYIQ5YBKNYDXC6XCD/action/replication_record"}},"created_at":"2026-07-05T10:52:00.635756+00:00","updated_at":"2026-07-05T10:52:00.635756+00:00"}