{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IIKD4A6WKBWTGRX4BIB32LPVE2","short_pith_number":"pith:IIKD4A6W","schema_version":"1.0","canonical_sha256":"42143e03d6506d3346fc0a03bd2df5268e019912756b92a67c3e08e0dd9553a0","source":{"kind":"arxiv","id":"1701.01882","version":1},"attestation_state":"computed","paper":{"title":"Differential Dynamic Programming for time-delayed systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"David D. Fan, Evangelos A. Theodorou","submitted_at":"2017-01-07T20:48:23Z","abstract_excerpt":"Trajectory optimization considers the problem of deciding how to control a dynamical system to move along a trajectory which minimizes some cost function. Differential Dynamic Programming (DDP) is an optimal control method which utilizes a second-order approximation of the problem to find the control. It is fast enough to allow real-time control and has been shown to work well for trajectory optimization in robotic systems. Here we extend classic DDP to systems with multiple time-delays in the state. Being able to find optimal trajectories for time-delayed systems with DDP opens up the possibi"},"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":"1701.01882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-01-07T20:48:23Z","cross_cats_sorted":[],"title_canon_sha256":"1934edc385f51f349822e5ffee27f302da2ac980413a899302bc5c510fa51682","abstract_canon_sha256":"f1d8eec00f48268720172699623d37547d7dd3a50367e08b9ee8c794c7f6edcf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:13.217797Z","signature_b64":"Nn1ArcvGa+0hQsvE2PgZfWV7qSR39ME0w6bs+RGoM2DRjss/oZVV/MHKtVy33wlcxBf6QvdVTNF7QKwPu6tSCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42143e03d6506d3346fc0a03bd2df5268e019912756b92a67c3e08e0dd9553a0","last_reissued_at":"2026-05-18T00:53:13.217226Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:13.217226Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Differential Dynamic Programming for time-delayed systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"David D. Fan, Evangelos A. Theodorou","submitted_at":"2017-01-07T20:48:23Z","abstract_excerpt":"Trajectory optimization considers the problem of deciding how to control a dynamical system to move along a trajectory which minimizes some cost function. Differential Dynamic Programming (DDP) is an optimal control method which utilizes a second-order approximation of the problem to find the control. It is fast enough to allow real-time control and has been shown to work well for trajectory optimization in robotic systems. Here we extend classic DDP to systems with multiple time-delays in the state. Being able to find optimal trajectories for time-delayed systems with DDP opens up the possibi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01882","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":""},"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":"1701.01882","created_at":"2026-05-18T00:53:13.217311+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.01882v1","created_at":"2026-05-18T00:53:13.217311+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01882","created_at":"2026-05-18T00:53:13.217311+00:00"},{"alias_kind":"pith_short_12","alias_value":"IIKD4A6WKBWT","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IIKD4A6WKBWTGRX4","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IIKD4A6W","created_at":"2026-05-18T12:31:21.493067+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/IIKD4A6WKBWTGRX4BIB32LPVE2","json":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2.json","graph_json":"https://pith.science/api/pith-number/IIKD4A6WKBWTGRX4BIB32LPVE2/graph.json","events_json":"https://pith.science/api/pith-number/IIKD4A6WKBWTGRX4BIB32LPVE2/events.json","paper":"https://pith.science/paper/IIKD4A6W"},"agent_actions":{"view_html":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2","download_json":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2.json","view_paper":"https://pith.science/paper/IIKD4A6W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.01882&json=true","fetch_graph":"https://pith.science/api/pith-number/IIKD4A6WKBWTGRX4BIB32LPVE2/graph.json","fetch_events":"https://pith.science/api/pith-number/IIKD4A6WKBWTGRX4BIB32LPVE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2/action/storage_attestation","attest_author":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2/action/author_attestation","sign_citation":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2/action/citation_signature","submit_replication":"https://pith.science/pith/IIKD4A6WKBWTGRX4BIB32LPVE2/action/replication_record"}},"created_at":"2026-05-18T00:53:13.217311+00:00","updated_at":"2026-05-18T00:53:13.217311+00:00"}