{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:USVVHC2E6DKO5P77OL7RCSU3Z5","short_pith_number":"pith:USVVHC2E","schema_version":"1.0","canonical_sha256":"a4ab538b44f0d4eebfff72ff114a9bcf5d8f3e3d954c9e7e54b1e8c245d37d24","source":{"kind":"arxiv","id":"1702.04396","version":2},"attestation_state":"computed","paper":{"title":"Hybrid control trajectory optimization under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gerhard Neumann, Jan Peters, Joni Pajarinen, Michael Koval, Siddhartha Srinivasa, Ville Kyrki","submitted_at":"2017-02-14T21:27:46Z","abstract_excerpt":"Trajectory optimization is a fundamental problem in robotics. While optimization of continuous control trajectories is well developed, many applications require both discrete and continuous, i.e., hybrid, controls. Finding an optimal sequence of hybrid controls is challenging due to the exponential explosion of discrete control combinations. Our method, based on Differential Dynamic Programming (DDP), circumvents this problem by incorporating discrete actions inside DDP: we first optimize continuous mixtures of discrete actions, and, subsequently force the mixtures into fully discrete actions."},"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":"1702.04396","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-02-14T21:27:46Z","cross_cats_sorted":[],"title_canon_sha256":"39ad7f23bd7b4e5c039465fd5982696f60d8a03ed99caf6174ed28e3d8f0d7bd","abstract_canon_sha256":"78c8e8c8918795b8a935f53fdb23f790b7dca10b950d90157b9ac564b44c8729"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:41.713105Z","signature_b64":"AZxe0r2d2Ta2T3b/HrPsLKE2Zr9x3MrQlbfCFqjMpn168aHYwR0Y/5fvzCaO4nFFYvfh911eP2S57WSxlCeZBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4ab538b44f0d4eebfff72ff114a9bcf5d8f3e3d954c9e7e54b1e8c245d37d24","last_reissued_at":"2026-05-18T00:49:41.712681Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:41.712681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid control trajectory optimization under uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gerhard Neumann, Jan Peters, Joni Pajarinen, Michael Koval, Siddhartha Srinivasa, Ville Kyrki","submitted_at":"2017-02-14T21:27:46Z","abstract_excerpt":"Trajectory optimization is a fundamental problem in robotics. While optimization of continuous control trajectories is well developed, many applications require both discrete and continuous, i.e., hybrid, controls. Finding an optimal sequence of hybrid controls is challenging due to the exponential explosion of discrete control combinations. Our method, based on Differential Dynamic Programming (DDP), circumvents this problem by incorporating discrete actions inside DDP: we first optimize continuous mixtures of discrete actions, and, subsequently force the mixtures into fully discrete actions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04396","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":""},"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":"1702.04396","created_at":"2026-05-18T00:49:41.712742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.04396v2","created_at":"2026-05-18T00:49:41.712742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04396","created_at":"2026-05-18T00:49:41.712742+00:00"},{"alias_kind":"pith_short_12","alias_value":"USVVHC2E6DKO","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"USVVHC2E6DKO5P77","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"USVVHC2E","created_at":"2026-05-18T12:31:49.984773+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/USVVHC2E6DKO5P77OL7RCSU3Z5","json":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5.json","graph_json":"https://pith.science/api/pith-number/USVVHC2E6DKO5P77OL7RCSU3Z5/graph.json","events_json":"https://pith.science/api/pith-number/USVVHC2E6DKO5P77OL7RCSU3Z5/events.json","paper":"https://pith.science/paper/USVVHC2E"},"agent_actions":{"view_html":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5","download_json":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5.json","view_paper":"https://pith.science/paper/USVVHC2E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.04396&json=true","fetch_graph":"https://pith.science/api/pith-number/USVVHC2E6DKO5P77OL7RCSU3Z5/graph.json","fetch_events":"https://pith.science/api/pith-number/USVVHC2E6DKO5P77OL7RCSU3Z5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5/action/storage_attestation","attest_author":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5/action/author_attestation","sign_citation":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5/action/citation_signature","submit_replication":"https://pith.science/pith/USVVHC2E6DKO5P77OL7RCSU3Z5/action/replication_record"}},"created_at":"2026-05-18T00:49:41.712742+00:00","updated_at":"2026-05-18T00:49:41.712742+00:00"}