{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CNXBOWFQFLHBLTBCOVIIOMS73Z","short_pith_number":"pith:CNXBOWFQ","schema_version":"1.0","canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","source":{"kind":"arxiv","id":"2403.10115","version":2},"attestation_state":"computed","paper":{"title":"Fast Generation of Feasible Trajectories in Direct Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Kiessling, Jan Swevers, Jonathan Frey, Katrin Baumg\\\"artner, Moritz Diehl, Wilm Decr\\'e","submitted_at":"2024-03-15T09:03:13Z","abstract_excerpt":"This paper examines the question of finding feasible points to discrete-time optimal control problems. The optimization problem of finding a feasible trajectory is transcribed to an unconstrained optimal control problem. An efficient algorithm, called FP-DDP, is proposed that solves the resulting problem using Differential Dynamic Programming preserving feasibility with respect to the system dynamics in every iteration. Notably, FP-DDP admits global and rapid local convergence properties induced by a combination of a Levenberg-Marquardt method and an Armijo-type line search. The efficiency of "},"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":"2403.10115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-03-15T09:03:13Z","cross_cats_sorted":[],"title_canon_sha256":"39d5e37fc653a873b9de4951efe5107677bac555784d967105dd2c2c98728e33","abstract_canon_sha256":"0debfed973bbe2b0ed08acae674e8d959fe0a4fc5c62b6159eb5a22068c9001a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:40:15.053191Z","signature_b64":"uwR/8hzyQxCyIj/J9+QJ0b+GdhmCnfrIT2EBD4pesPhJy0HmZUSMKz5ZQLpgyHNFCIk9jsmFDSGCZ7MCDN3vCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"136e1758b02ace15cc22755087325fde62279ccdc8c38d33884f41509416f34e","last_reissued_at":"2026-07-05T08:40:15.052697Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:40:15.052697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Generation of Feasible Trajectories in Direct Optimal Control","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"David Kiessling, Jan Swevers, Jonathan Frey, Katrin Baumg\\\"artner, Moritz Diehl, Wilm Decr\\'e","submitted_at":"2024-03-15T09:03:13Z","abstract_excerpt":"This paper examines the question of finding feasible points to discrete-time optimal control problems. The optimization problem of finding a feasible trajectory is transcribed to an unconstrained optimal control problem. An efficient algorithm, called FP-DDP, is proposed that solves the resulting problem using Differential Dynamic Programming preserving feasibility with respect to the system dynamics in every iteration. Notably, FP-DDP admits global and rapid local convergence properties induced by a combination of a Levenberg-Marquardt method and an Armijo-type line search. The efficiency of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.10115","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/2403.10115/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":"2403.10115","created_at":"2026-07-05T08:40:15.052757+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.10115v2","created_at":"2026-07-05T08:40:15.052757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.10115","created_at":"2026-07-05T08:40:15.052757+00:00"},{"alias_kind":"pith_short_12","alias_value":"CNXBOWFQFLHB","created_at":"2026-07-05T08:40:15.052757+00:00"},{"alias_kind":"pith_short_16","alias_value":"CNXBOWFQFLHBLTBC","created_at":"2026-07-05T08:40:15.052757+00:00"},{"alias_kind":"pith_short_8","alias_value":"CNXBOWFQ","created_at":"2026-07-05T08:40:15.052757+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/CNXBOWFQFLHBLTBCOVIIOMS73Z","json":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z.json","graph_json":"https://pith.science/api/pith-number/CNXBOWFQFLHBLTBCOVIIOMS73Z/graph.json","events_json":"https://pith.science/api/pith-number/CNXBOWFQFLHBLTBCOVIIOMS73Z/events.json","paper":"https://pith.science/paper/CNXBOWFQ"},"agent_actions":{"view_html":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z","download_json":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z.json","view_paper":"https://pith.science/paper/CNXBOWFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.10115&json=true","fetch_graph":"https://pith.science/api/pith-number/CNXBOWFQFLHBLTBCOVIIOMS73Z/graph.json","fetch_events":"https://pith.science/api/pith-number/CNXBOWFQFLHBLTBCOVIIOMS73Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/action/storage_attestation","attest_author":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/action/author_attestation","sign_citation":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/action/citation_signature","submit_replication":"https://pith.science/pith/CNXBOWFQFLHBLTBCOVIIOMS73Z/action/replication_record"}},"created_at":"2026-07-05T08:40:15.052757+00:00","updated_at":"2026-07-05T08:40:15.052757+00:00"}