{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:HVD4UWLTJT57KHX3MAM6T4WR7X","short_pith_number":"pith:HVD4UWLT","schema_version":"1.0","canonical_sha256":"3d47ca59734cfbf51efb6019e9f2d1fdfc089a7e935ed2d9713926b6691e8486","source":{"kind":"arxiv","id":"2309.15970","version":2},"attestation_state":"computed","paper":{"title":"Accelerating Motion Planning via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"An T. Le, Armin Biess, Georgia Chalvatzaki, Jan Peters","submitted_at":"2023-09-27T19:42:01Z","abstract_excerpt":"Motion planning is still an open problem for many disciplines, e.g., robotics, autonomous driving, due to their need for high computational resources that hinder real-time, efficient decision-making. A class of methods striving to provide smooth solutions is gradient-based trajectory optimization. However, those methods usually suffer from bad local minima, while for many settings, they may be inapplicable due to the absence of easy-to-access gradients of the optimization objectives. In response to these issues, we introduce Motion Planning via Optimal Transport (MPOT) -- a \\textit{gradient-fr"},"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":"2309.15970","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-27T19:42:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"be6260bd8d30bef42695c4148c071138d98eda4fcd9d826b6cdc8462d9ebbecc","abstract_canon_sha256":"187f4e15f786c738e3cdcd9d648d8e02f51f9aec57dab1663f2bb3c47825f22a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:06:34.663718Z","signature_b64":"oqxprIw9xl5MAWIA+Fdf9MkHich/Egw4Fr2ukCN1R4biuFxUVD0YVLaFj6Po183k6GdHBG3qoi5mnfHMcO9SAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d47ca59734cfbf51efb6019e9f2d1fdfc089a7e935ed2d9713926b6691e8486","last_reissued_at":"2026-07-05T07:06:34.663235Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:06:34.663235Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerating Motion Planning via Optimal Transport","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.RO","authors_text":"An T. Le, Armin Biess, Georgia Chalvatzaki, Jan Peters","submitted_at":"2023-09-27T19:42:01Z","abstract_excerpt":"Motion planning is still an open problem for many disciplines, e.g., robotics, autonomous driving, due to their need for high computational resources that hinder real-time, efficient decision-making. A class of methods striving to provide smooth solutions is gradient-based trajectory optimization. However, those methods usually suffer from bad local minima, while for many settings, they may be inapplicable due to the absence of easy-to-access gradients of the optimization objectives. In response to these issues, we introduce Motion Planning via Optimal Transport (MPOT) -- a \\textit{gradient-fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15970","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/2309.15970/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":"2309.15970","created_at":"2026-07-05T07:06:34.663307+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15970v2","created_at":"2026-07-05T07:06:34.663307+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15970","created_at":"2026-07-05T07:06:34.663307+00:00"},{"alias_kind":"pith_short_12","alias_value":"HVD4UWLTJT57","created_at":"2026-07-05T07:06:34.663307+00:00"},{"alias_kind":"pith_short_16","alias_value":"HVD4UWLTJT57KHX3","created_at":"2026-07-05T07:06:34.663307+00:00"},{"alias_kind":"pith_short_8","alias_value":"HVD4UWLT","created_at":"2026-07-05T07:06:34.663307+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18604","citing_title":"Simulation-Free Differential Dynamics through Neural Conservation Laws","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X","json":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X.json","graph_json":"https://pith.science/api/pith-number/HVD4UWLTJT57KHX3MAM6T4WR7X/graph.json","events_json":"https://pith.science/api/pith-number/HVD4UWLTJT57KHX3MAM6T4WR7X/events.json","paper":"https://pith.science/paper/HVD4UWLT"},"agent_actions":{"view_html":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X","download_json":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X.json","view_paper":"https://pith.science/paper/HVD4UWLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15970&json=true","fetch_graph":"https://pith.science/api/pith-number/HVD4UWLTJT57KHX3MAM6T4WR7X/graph.json","fetch_events":"https://pith.science/api/pith-number/HVD4UWLTJT57KHX3MAM6T4WR7X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X/action/storage_attestation","attest_author":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X/action/author_attestation","sign_citation":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X/action/citation_signature","submit_replication":"https://pith.science/pith/HVD4UWLTJT57KHX3MAM6T4WR7X/action/replication_record"}},"created_at":"2026-07-05T07:06:34.663307+00:00","updated_at":"2026-07-05T07:06:34.663307+00:00"}