{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:MLYBA43MJNKKEZMME4PKUTTNDF","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f757fc778f7b6d76f836bc467f2efb2065dbdb68cdfbc2424ed09a24fbbee0e0","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T23:29:54Z","title_canon_sha256":"5dd197dfe676534638c06eb18cc7bd8b4fc679dce4f4897b10b444a6457d97e3"},"schema_version":"1.0","source":{"id":"2605.14199","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14199","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14199v1","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14199","created_at":"2026-05-17T23:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"MLYBA43MJNKK","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"MLYBA43MJNKKEZMM","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"MLYBA43M","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0484f703158cb607cda8ea6fd3cdbfee8b936da2099eef723eaa456b54c3cb4a","target":"graph","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"The results indicate that the GCS-based method generates collision-free and dynamically consistent trajectories that closely match those obtained from the nonlinear program, while exhibiting improved computational efficiency and reduced sensitivity to initialization."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"Under small-slip and linear tire assumptions, a simplified dynamic bicycle model enables approximate enforcement of dynamic feasibility through convex constraints on trajectory derivatives."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Graphs of convex sets with Bezier paths and a simplified bicycle model produce trajectories that closely match nonlinear optimal control results but with better speed and initialization robustness in CommonRoad driving scenarios."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Optimization over graphs of convex sets approximates nonlinear optimal control for autonomous vehicle motion planning with greater efficiency."}],"snapshot_sha256":"f7982c612576eb1a4f5ddeec1d07930b0af71331eddf4ede7365f235e5d3c8b8"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"6378fa9d3f2c42a2fa2e87b063ea952d488cf966e45c1fdd92b4431dc105af0e"},"paper":{"abstract_excerpt":"Motion planning for autonomous vehicles requires generating collision-free and dynamically feasible trajectories in complex environments under real-time constraints. While nonlinear optimal control formulations provide high-fidelity solutions, they are computationally demanding and sensitive to initialization, whereas geometric planning methods scale well but often decouple path selection from trajectory optimization. This paper studies the extent to which optimization over Graphs of Convex Sets (GCS) can approximate solutions of nonlinear optimal control problems in the context of autonomous ","authors_text":"Ant\\^onio Augusto Fr\\\"ohlich, Matheus Wagner","cross_cats":["cs.SY","eess.SY"],"headline":"Optimization over graphs of convex sets approximates nonlinear optimal control for autonomous vehicle motion planning with greater efficiency.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T23:29:54Z","title":"Motion Planning for Autonomous Vehicles using Optimization over Graphs of Convex Sets"},"references":{"count":26,"internal_anchors":0,"resolved_work":26,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Model pre- dictive control for autonomous ground vehicles: a review,","work_id":"11178950-4bfc-4c9c-a249-056cadcb9878","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Self- driving cars: A survey,","work_id":"95d2787a-79dc-4973-a1c8-9a1ef4e78086","year":2021},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A review of learning-based motion planning: Toward a data-driven optimal control approach,","work_id":"148bfbd6-2e6f-457d-85c8-ad7bab1b84ee","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"A survey of motion planning and control techniques for self-driving urban vehicles,","work_id":"f1757f4c-2d28-4c7c-bb52-fb3e6603ea39","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Spatio-temporal lattice planning using opti- mal motion primitives,","work_id":"245921b3-1155-4bd0-a0a1-b9f2804bc514","year":2023}],"snapshot_sha256":"5cf61f4768b270e523eb56636a9ac3b4cf6f940d81ae44d1ce03a305a0bf2a57"},"source":{"id":"2605.14199","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T04:42:06.539061Z","id":"c32c6b0a-2766-478d-82b9-b8eb21b689fe","model_set":{"reader":"grok-4.3"},"one_line_summary":"Graphs of convex sets with Bezier paths and a simplified bicycle model produce trajectories that closely match nonlinear optimal control results but with better speed and initialization robustness in CommonRoad driving scenarios.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Optimization over graphs of convex sets approximates nonlinear optimal control for autonomous vehicle motion planning with greater efficiency.","strongest_claim":"The results indicate that the GCS-based method generates collision-free and dynamically consistent trajectories that closely match those obtained from the nonlinear program, while exhibiting improved computational efficiency and reduced sensitivity to initialization.","weakest_assumption":"Under small-slip and linear tire assumptions, a simplified dynamic bicycle model enables approximate enforcement of dynamic feasibility through convex constraints on trajectory derivatives."}},"verdict_id":"c32c6b0a-2766-478d-82b9-b8eb21b689fe"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:efa3d36b37185540289c3004b7deb6c07fdd5fb1db919c4d11fcbef80940e693","target":"record","created_at":"2026-05-17T23:39:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f757fc778f7b6d76f836bc467f2efb2065dbdb68cdfbc2424ed09a24fbbee0e0","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2026-05-13T23:29:54Z","title_canon_sha256":"5dd197dfe676534638c06eb18cc7bd8b4fc679dce4f4897b10b444a6457d97e3"},"schema_version":"1.0","source":{"id":"2605.14199","kind":"arxiv","version":1}},"canonical_sha256":"62f010736c4b54a2658c271eaa4e6d196626adcd2c9368009dff9c63a56a588c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62f010736c4b54a2658c271eaa4e6d196626adcd2c9368009dff9c63a56a588c","first_computed_at":"2026-05-17T23:39:11.065010Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:11.065010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W7S+CSfxnIHvIVzB7/A4H5I1W3s0s84NjStv9naNojjh9ZnvIw0kgvSC+LK1ZfFkP7Gy/oY4glxy2wRvUyW7Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:11.065482Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14199","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:efa3d36b37185540289c3004b7deb6c07fdd5fb1db919c4d11fcbef80940e693","sha256:0484f703158cb607cda8ea6fd3cdbfee8b936da2099eef723eaa456b54c3cb4a"],"state_sha256":"0ca1eefe0ac1999fce878eae8f445367a336aa85592c00333fb4d1af59daca6e"}