{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D7EKL7SV2RVZFCXEZMBOP3GVVH","short_pith_number":"pith:D7EKL7SV","schema_version":"1.0","canonical_sha256":"1fc8a5fe55d46b928ae4cb02e7ecd5a9daaf59106c52da6d3ad06d7dc8b42df4","source":{"kind":"arxiv","id":"1803.04868","version":2},"attestation_state":"computed","paper":{"title":"Search-based optimal motion planning for automated driving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bakir Lacevic, Barys Shyrokau, Martin Horn, Michael Stolz, Zlatan Ajanovic","submitted_at":"2018-03-13T15:07:06Z","abstract_excerpt":"This paper presents a framework for fast and robust motion planning designed to facilitate automated driving. The framework allows for real-time computation even for horizons of several hundred meters and thus enabling automated driving in urban conditions. This is achieved through several features. Firstly, a convenient geometrical representation of both the search space and driving constraints enables the use of classical path planning approach. Thus, a wide variety of constraints can be tackled simultaneously (other vehicles, traffic lights, etc.). Secondly, an exact cost-to-go map, obtaine"},"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":"1803.04868","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-03-13T15:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"72489406ffeef4327861fadb27e995b47c418053b9fb91aa68fae65a4598f4d7","abstract_canon_sha256":"6a7b65c3d102b9cf39f6a19669a820f17c401b41fe87d4bea375c627add98133"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:53.306436Z","signature_b64":"EmvjrO/02jJc8J2K7eBeitW7stcelo2wCeAkmCpnlttdX2SSI9j3BKS10D7Dunz62JidRIvJRQ9MLbtqIktUDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1fc8a5fe55d46b928ae4cb02e7ecd5a9daaf59106c52da6d3ad06d7dc8b42df4","last_reissued_at":"2026-05-17T23:52:53.305789Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:53.305789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Search-based optimal motion planning for automated driving","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Bakir Lacevic, Barys Shyrokau, Martin Horn, Michael Stolz, Zlatan Ajanovic","submitted_at":"2018-03-13T15:07:06Z","abstract_excerpt":"This paper presents a framework for fast and robust motion planning designed to facilitate automated driving. The framework allows for real-time computation even for horizons of several hundred meters and thus enabling automated driving in urban conditions. This is achieved through several features. Firstly, a convenient geometrical representation of both the search space and driving constraints enables the use of classical path planning approach. Thus, a wide variety of constraints can be tackled simultaneously (other vehicles, traffic lights, etc.). Secondly, an exact cost-to-go map, obtaine"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04868","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":""},"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":"1803.04868","created_at":"2026-05-17T23:52:53.305909+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04868v2","created_at":"2026-05-17T23:52:53.305909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04868","created_at":"2026-05-17T23:52:53.305909+00:00"},{"alias_kind":"pith_short_12","alias_value":"D7EKL7SV2RVZ","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D7EKL7SV2RVZFCXE","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D7EKL7SV","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH","json":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH.json","graph_json":"https://pith.science/api/pith-number/D7EKL7SV2RVZFCXEZMBOP3GVVH/graph.json","events_json":"https://pith.science/api/pith-number/D7EKL7SV2RVZFCXEZMBOP3GVVH/events.json","paper":"https://pith.science/paper/D7EKL7SV"},"agent_actions":{"view_html":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH","download_json":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH.json","view_paper":"https://pith.science/paper/D7EKL7SV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04868&json=true","fetch_graph":"https://pith.science/api/pith-number/D7EKL7SV2RVZFCXEZMBOP3GVVH/graph.json","fetch_events":"https://pith.science/api/pith-number/D7EKL7SV2RVZFCXEZMBOP3GVVH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH/action/storage_attestation","attest_author":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH/action/author_attestation","sign_citation":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH/action/citation_signature","submit_replication":"https://pith.science/pith/D7EKL7SV2RVZFCXEZMBOP3GVVH/action/replication_record"}},"created_at":"2026-05-17T23:52:53.305909+00:00","updated_at":"2026-05-17T23:52:53.305909+00:00"}