{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:L2GXR7ZYKLNDV4K3DN3X67YYQB","short_pith_number":"pith:L2GXR7ZY","schema_version":"1.0","canonical_sha256":"5e8d78ff3852da3af15b1b777f7f18806ae4b573d0d43ec31e59d9d25e1fcce8","source":{"kind":"arxiv","id":"2607.04259","version":1},"attestation_state":"computed","paper":{"title":"Integrated Graph Search and Model Predictive Control for Smooth and Efficient Path Planning in Autonomous Vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Arno Eichberger, Dong Bi, Duc-Tien Bui, Hung Duy Nguyen, Ngoc Thinh Nguyen, Tomislav Mihalj","submitted_at":"2026-07-05T12:14:33Z","abstract_excerpt":"Path planning is a fundamental component of autonomous vehicles, where achieving safe, comfortable, and dynamically feasible paths while ensuring computational efficiency remains a significant challenge. This paper presents a sequential path planning framework in which a rough path obtained from graph search is explicitly exploited to guide a Model Predictive Control (MPC)-based path refinement. A rough path is first obtained via Dijkstra search on a discretized grid and is then used to construct a spatially varying convex lateral safety corridor that explicitly captures obstacle avoidance con"},"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":"2607.04259","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-07-05T12:14:33Z","cross_cats_sorted":[],"title_canon_sha256":"dcc4a5f0fa6ebe73c12a49fc8c86951cc9c4c7cb9d22fd3aa931db33685e83cd","abstract_canon_sha256":"9466ff4ade0d122421a25dfbba8f183eff77aeaffa5af8a95c3a9a28d6fb6964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-07T02:19:05.783481Z","signature_b64":"orJ3/J7aY1Odsymnw2w1D3RA/YYqTotNfy4JALcrsTDFlK68dvdWORMRvogu6cbOgiiDO9+RgqW9H6DnAIzMBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5e8d78ff3852da3af15b1b777f7f18806ae4b573d0d43ec31e59d9d25e1fcce8","last_reissued_at":"2026-07-07T02:19:05.782296Z","signature_status":"signed_v1","first_computed_at":"2026-07-07T02:19:05.782296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integrated Graph Search and Model Predictive Control for Smooth and Efficient Path Planning in Autonomous Vehicles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Arno Eichberger, Dong Bi, Duc-Tien Bui, Hung Duy Nguyen, Ngoc Thinh Nguyen, Tomislav Mihalj","submitted_at":"2026-07-05T12:14:33Z","abstract_excerpt":"Path planning is a fundamental component of autonomous vehicles, where achieving safe, comfortable, and dynamically feasible paths while ensuring computational efficiency remains a significant challenge. This paper presents a sequential path planning framework in which a rough path obtained from graph search is explicitly exploited to guide a Model Predictive Control (MPC)-based path refinement. A rough path is first obtained via Dijkstra search on a discretized grid and is then used to construct a spatially varying convex lateral safety corridor that explicitly captures obstacle avoidance con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.04259","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/2607.04259/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":"2607.04259","created_at":"2026-07-07T02:19:05.782450+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.04259v1","created_at":"2026-07-07T02:19:05.782450+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.04259","created_at":"2026-07-07T02:19:05.782450+00:00"},{"alias_kind":"pith_short_12","alias_value":"L2GXR7ZYKLND","created_at":"2026-07-07T02:19:05.782450+00:00"},{"alias_kind":"pith_short_16","alias_value":"L2GXR7ZYKLNDV4K3","created_at":"2026-07-07T02:19:05.782450+00:00"},{"alias_kind":"pith_short_8","alias_value":"L2GXR7ZY","created_at":"2026-07-07T02:19:05.782450+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/L2GXR7ZYKLNDV4K3DN3X67YYQB","json":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB.json","graph_json":"https://pith.science/api/pith-number/L2GXR7ZYKLNDV4K3DN3X67YYQB/graph.json","events_json":"https://pith.science/api/pith-number/L2GXR7ZYKLNDV4K3DN3X67YYQB/events.json","paper":"https://pith.science/paper/L2GXR7ZY"},"agent_actions":{"view_html":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB","download_json":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB.json","view_paper":"https://pith.science/paper/L2GXR7ZY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.04259&json=true","fetch_graph":"https://pith.science/api/pith-number/L2GXR7ZYKLNDV4K3DN3X67YYQB/graph.json","fetch_events":"https://pith.science/api/pith-number/L2GXR7ZYKLNDV4K3DN3X67YYQB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB/action/storage_attestation","attest_author":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB/action/author_attestation","sign_citation":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB/action/citation_signature","submit_replication":"https://pith.science/pith/L2GXR7ZYKLNDV4K3DN3X67YYQB/action/replication_record"}},"created_at":"2026-07-07T02:19:05.782450+00:00","updated_at":"2026-07-07T02:19:05.782450+00:00"}