{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:DXALASOC55QGEM43EE7QB24WS3","short_pith_number":"pith:DXALASOC","schema_version":"1.0","canonical_sha256":"1dc0b049c2ef6062339b213f00eb9696c751488460006a7aa8286355d3d3fcad","source":{"kind":"arxiv","id":"2411.18913","version":2},"attestation_state":"computed","paper":{"title":"Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Russ Tedrake, Shruti Garg, Thomas Cohn","submitted_at":"2024-11-28T05:08:00Z","abstract_excerpt":"Optimization based motion planning provides a useful modeling framework through various costs and constraints. Using Graph of Convex Sets (GCS) for trajectory optimization gives guarantees of feasibility and optimality by representing configuration space as the finite union of convex sets. Nonlinear parametrizations can be used to extend this technique to handle cases such as kinematic loops, but this distorts distances, such that solving with convex objectives will yield paths that are suboptimal in the original space. We present a method to extend GCS to nonconvex objectives, allowing us to "},"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":"2411.18913","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-11-28T05:08:00Z","cross_cats_sorted":[],"title_canon_sha256":"c301642ce4f1c40de59dc6c1bbdaeb80276052ccfb949e2d5ce29154af7f11dd","abstract_canon_sha256":"35eabece68dff306e8f160d87b60a15964711f2a00a5e743326fbc8d9ef0d742"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:48:21.879746Z","signature_b64":"11s9yKmZixUmyMJHiH/YZGiRaoseI1wECKcmR9RQCq5FP104nBDZBbWkb0cD3gt2niHKDEecADTBZmpnkAHOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1dc0b049c2ef6062339b213f00eb9696c751488460006a7aa8286355d3d3fcad","last_reissued_at":"2026-07-05T10:48:21.879244Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:48:21.879244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Planning Shorter Paths in Graphs of Convex Sets by Undistorting Parametrized Configuration Spaces","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Russ Tedrake, Shruti Garg, Thomas Cohn","submitted_at":"2024-11-28T05:08:00Z","abstract_excerpt":"Optimization based motion planning provides a useful modeling framework through various costs and constraints. Using Graph of Convex Sets (GCS) for trajectory optimization gives guarantees of feasibility and optimality by representing configuration space as the finite union of convex sets. Nonlinear parametrizations can be used to extend this technique to handle cases such as kinematic loops, but this distorts distances, such that solving with convex objectives will yield paths that are suboptimal in the original space. We present a method to extend GCS to nonconvex objectives, allowing us to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.18913","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.18913/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":"2411.18913","created_at":"2026-07-05T10:48:21.879297+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.18913v2","created_at":"2026-07-05T10:48:21.879297+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.18913","created_at":"2026-07-05T10:48:21.879297+00:00"},{"alias_kind":"pith_short_12","alias_value":"DXALASOC55QG","created_at":"2026-07-05T10:48:21.879297+00:00"},{"alias_kind":"pith_short_16","alias_value":"DXALASOC55QGEM43","created_at":"2026-07-05T10:48:21.879297+00:00"},{"alias_kind":"pith_short_8","alias_value":"DXALASOC","created_at":"2026-07-05T10:48:21.879297+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.18516","citing_title":"Task Allocation and Motion Planning in Dynamic, Cluttered Environments via CBBA and Graphs of Convex Sets","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3","json":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3.json","graph_json":"https://pith.science/api/pith-number/DXALASOC55QGEM43EE7QB24WS3/graph.json","events_json":"https://pith.science/api/pith-number/DXALASOC55QGEM43EE7QB24WS3/events.json","paper":"https://pith.science/paper/DXALASOC"},"agent_actions":{"view_html":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3","download_json":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3.json","view_paper":"https://pith.science/paper/DXALASOC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.18913&json=true","fetch_graph":"https://pith.science/api/pith-number/DXALASOC55QGEM43EE7QB24WS3/graph.json","fetch_events":"https://pith.science/api/pith-number/DXALASOC55QGEM43EE7QB24WS3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3/action/storage_attestation","attest_author":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3/action/author_attestation","sign_citation":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3/action/citation_signature","submit_replication":"https://pith.science/pith/DXALASOC55QGEM43EE7QB24WS3/action/replication_record"}},"created_at":"2026-07-05T10:48:21.879297+00:00","updated_at":"2026-07-05T10:48:21.879297+00:00"}