{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LCPF3WM7BAQMQDUG46S6ZEY3QK","short_pith_number":"pith:LCPF3WM7","schema_version":"1.0","canonical_sha256":"589e5dd99f0820c80e86e7a5ec931b8292f8828864f694d59116abd6adf76304","source":{"kind":"arxiv","id":"2309.07872","version":2},"attestation_state":"computed","paper":{"title":"A Unified Perspective on Multiple Shooting In Differential Dynamic Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"He Li, Patrick M. Wensing, Tingnan Zhang, Wenhao Yu","submitted_at":"2023-09-14T17:19:37Z","abstract_excerpt":"Differential Dynamic Programming (DDP) is an efficient computational tool for solving nonlinear optimal control problems. It was originally designed as a single shooting method and thus is sensitive to the initial guess supplied. This work considers the extension of DDP to multiple shooting (MS), improving its robustness to initial guesses. A novel derivation is proposed that accounts for the defect between shooting segments during the DDP backward pass, while still maintaining quadratic convergence locally. The derivation enables unifying multiple previous MS algorithms, and opens the door 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":"2309.07872","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.RO","submitted_at":"2023-09-14T17:19:37Z","cross_cats_sorted":[],"title_canon_sha256":"b6c1e7696827e8415fd1f8600a901ba59137744a1adfe6abb58ede85730ffc3e","abstract_canon_sha256":"965d296daad26e52da33da4469c4d143a1ec1fc41d821ea591f461f7892cf3f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:55:06.202737Z","signature_b64":"WNL/DM5AcS9WhkAT978O8er8ISaRXM7zLvtd9VDSL+FYqh/t4WH8FaEDri+Bvyy4UhEprFmRD2ODmyXld5oyDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"589e5dd99f0820c80e86e7a5ec931b8292f8828864f694d59116abd6adf76304","last_reissued_at":"2026-07-05T06:55:06.202261Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:55:06.202261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Unified Perspective on Multiple Shooting In Differential Dynamic Programming","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"He Li, Patrick M. Wensing, Tingnan Zhang, Wenhao Yu","submitted_at":"2023-09-14T17:19:37Z","abstract_excerpt":"Differential Dynamic Programming (DDP) is an efficient computational tool for solving nonlinear optimal control problems. It was originally designed as a single shooting method and thus is sensitive to the initial guess supplied. This work considers the extension of DDP to multiple shooting (MS), improving its robustness to initial guesses. A novel derivation is proposed that accounts for the defect between shooting segments during the DDP backward pass, while still maintaining quadratic convergence locally. The derivation enables unifying multiple previous MS algorithms, and opens the door to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.07872","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.07872/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.07872","created_at":"2026-07-05T06:55:06.202321+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.07872v2","created_at":"2026-07-05T06:55:06.202321+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.07872","created_at":"2026-07-05T06:55:06.202321+00:00"},{"alias_kind":"pith_short_12","alias_value":"LCPF3WM7BAQM","created_at":"2026-07-05T06:55:06.202321+00:00"},{"alias_kind":"pith_short_16","alias_value":"LCPF3WM7BAQMQDUG","created_at":"2026-07-05T06:55:06.202321+00:00"},{"alias_kind":"pith_short_8","alias_value":"LCPF3WM7","created_at":"2026-07-05T06:55:06.202321+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03978","citing_title":"Stochastic Multiple Shooting Trajectory Optimization via Sequential Local Policy Evaluation","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK","json":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK.json","graph_json":"https://pith.science/api/pith-number/LCPF3WM7BAQMQDUG46S6ZEY3QK/graph.json","events_json":"https://pith.science/api/pith-number/LCPF3WM7BAQMQDUG46S6ZEY3QK/events.json","paper":"https://pith.science/paper/LCPF3WM7"},"agent_actions":{"view_html":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK","download_json":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK.json","view_paper":"https://pith.science/paper/LCPF3WM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.07872&json=true","fetch_graph":"https://pith.science/api/pith-number/LCPF3WM7BAQMQDUG46S6ZEY3QK/graph.json","fetch_events":"https://pith.science/api/pith-number/LCPF3WM7BAQMQDUG46S6ZEY3QK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK/action/storage_attestation","attest_author":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK/action/author_attestation","sign_citation":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK/action/citation_signature","submit_replication":"https://pith.science/pith/LCPF3WM7BAQMQDUG46S6ZEY3QK/action/replication_record"}},"created_at":"2026-07-05T06:55:06.202321+00:00","updated_at":"2026-07-05T06:55:06.202321+00:00"}