{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HQ6ZCBJ53H5D3BR663RIPQ75WU","short_pith_number":"pith:HQ6ZCBJ5","schema_version":"1.0","canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","source":{"kind":"arxiv","id":"1903.07900","version":2},"attestation_state":"computed","paper":{"title":"Improved Path Planning by Tightly Combining Lattice-based Path Planning and Numerical Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Kristoffer Bergman, Oskar Ljungqvist","submitted_at":"2019-03-19T09:35:20Z","abstract_excerpt":"This paper presents a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems. The approach is motivated by first showing that a lattice-based path planner can be cast and analyzed as a bilevel optimization problem. This information is then used to tightly integrate a lattice-based path planner and numerical optimal control in a novel way. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with "},"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":"1903.07900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-19T09:35:20Z","cross_cats_sorted":[],"title_canon_sha256":"1152ad6e078b95078eb7806abd0a046364b3c66795b1a2d896eb213343e3cd9b","abstract_canon_sha256":"bef67c3549fdc8a2cceb48faf03aada252206dc99eb6ba6a90e952aca0601f6c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:33.100276Z","signature_b64":"68Fnw85skcfRnFT7wMvijUiJL1axcR7n6zqCjguXG/ljKZBWtGb4q7AX9VeE3MdHAGPAgXAb8fGre/FK3OktBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3d91053dd9fa3d863ef6e287c3fdb5293e350bab29fcb06efac772ab3e7ce2","last_reissued_at":"2026-05-17T23:50:33.099721Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:33.099721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Path Planning by Tightly Combining Lattice-based Path Planning and Numerical Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Daniel Axehill, Kristoffer Bergman, Oskar Ljungqvist","submitted_at":"2019-03-19T09:35:20Z","abstract_excerpt":"This paper presents a unified optimization-based path planning approach to efficiently compute locally optimal solutions to advanced path planning problems. The approach is motivated by first showing that a lattice-based path planner can be cast and analyzed as a bilevel optimization problem. This information is then used to tightly integrate a lattice-based path planner and numerical optimal control in a novel way. The lattice-based path planner is applied to the problem in a first step using a discretized search space, where system dynamics and objective function are chosen to coincide with "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.07900","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":"1903.07900","created_at":"2026-05-17T23:50:33.099809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.07900v2","created_at":"2026-05-17T23:50:33.099809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.07900","created_at":"2026-05-17T23:50:33.099809+00:00"},{"alias_kind":"pith_short_12","alias_value":"HQ6ZCBJ53H5D","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HQ6ZCBJ53H5D3BR6","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HQ6ZCBJ5","created_at":"2026-05-18T12:33:18.533446+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/HQ6ZCBJ53H5D3BR663RIPQ75WU","json":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU.json","graph_json":"https://pith.science/api/pith-number/HQ6ZCBJ53H5D3BR663RIPQ75WU/graph.json","events_json":"https://pith.science/api/pith-number/HQ6ZCBJ53H5D3BR663RIPQ75WU/events.json","paper":"https://pith.science/paper/HQ6ZCBJ5"},"agent_actions":{"view_html":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU","download_json":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU.json","view_paper":"https://pith.science/paper/HQ6ZCBJ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.07900&json=true","fetch_graph":"https://pith.science/api/pith-number/HQ6ZCBJ53H5D3BR663RIPQ75WU/graph.json","fetch_events":"https://pith.science/api/pith-number/HQ6ZCBJ53H5D3BR663RIPQ75WU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/action/storage_attestation","attest_author":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/action/author_attestation","sign_citation":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/action/citation_signature","submit_replication":"https://pith.science/pith/HQ6ZCBJ53H5D3BR663RIPQ75WU/action/replication_record"}},"created_at":"2026-05-17T23:50:33.099809+00:00","updated_at":"2026-05-17T23:50:33.099809+00:00"}