{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:X7TXB42ZVF5SQGSQUHG6TXTQNB","short_pith_number":"pith:X7TXB42Z","schema_version":"1.0","canonical_sha256":"bfe770f359a97b281a50a1cde9de70687bd432cbbc84d2623eb9d83747d9b19c","source":{"kind":"arxiv","id":"2209.05979","version":1},"attestation_state":"computed","paper":{"title":"Solving Mission-Wide Chance-Constrained Optimal Control Using Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kai Wang, Sebastien Gros","submitted_at":"2022-09-13T13:23:45Z","abstract_excerpt":"This paper aims to provide a Dynamic Programming (DP) approach to solve the Mission-Wide Chance-Constrained Optimal Control Problems (MWCC-OCP). The mission-wide chance constraint guarantees that the probability that the entire state trajectory lies within a constraint/safe region is higher than a prescribed level, and is different from the stage-wise chance constraints imposed at individual time steps. The control objective is to find an optimal policy sequence that achieves both (i) satisfaction of a mission-wide chance constraint, and (ii) minimization of a cost function. By transforming th"},"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":"2209.05979","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-09-13T13:23:45Z","cross_cats_sorted":[],"title_canon_sha256":"95ba7807c9dd3ae652caca818ce1a0db23db54681512634ed16ef7db40a136dc","abstract_canon_sha256":"4987e9179e36127a5cfbebc9b9cce20c5d763f46d0b50f6c90c65f32f9cddf68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:56:52.137083Z","signature_b64":"zEVOjtJrG+lK+t/LFN+K2lSI0+myJqm9aiph7rX7RJh9xyJaSGoLHDfM7K9kMPYVpUIVPrjXx0Sl57ITdlrdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfe770f359a97b281a50a1cde9de70687bd432cbbc84d2623eb9d83747d9b19c","last_reissued_at":"2026-07-05T04:56:52.136739Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:56:52.136739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solving Mission-Wide Chance-Constrained Optimal Control Using Dynamic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Kai Wang, Sebastien Gros","submitted_at":"2022-09-13T13:23:45Z","abstract_excerpt":"This paper aims to provide a Dynamic Programming (DP) approach to solve the Mission-Wide Chance-Constrained Optimal Control Problems (MWCC-OCP). The mission-wide chance constraint guarantees that the probability that the entire state trajectory lies within a constraint/safe region is higher than a prescribed level, and is different from the stage-wise chance constraints imposed at individual time steps. The control objective is to find an optimal policy sequence that achieves both (i) satisfaction of a mission-wide chance constraint, and (ii) minimization of a cost function. By transforming th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.05979","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2209.05979/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":"2209.05979","created_at":"2026-07-05T04:56:52.136796+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.05979v1","created_at":"2026-07-05T04:56:52.136796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.05979","created_at":"2026-07-05T04:56:52.136796+00:00"},{"alias_kind":"pith_short_12","alias_value":"X7TXB42ZVF5S","created_at":"2026-07-05T04:56:52.136796+00:00"},{"alias_kind":"pith_short_16","alias_value":"X7TXB42ZVF5SQGSQ","created_at":"2026-07-05T04:56:52.136796+00:00"},{"alias_kind":"pith_short_8","alias_value":"X7TXB42Z","created_at":"2026-07-05T04:56:52.136796+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/X7TXB42ZVF5SQGSQUHG6TXTQNB","json":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB.json","graph_json":"https://pith.science/api/pith-number/X7TXB42ZVF5SQGSQUHG6TXTQNB/graph.json","events_json":"https://pith.science/api/pith-number/X7TXB42ZVF5SQGSQUHG6TXTQNB/events.json","paper":"https://pith.science/paper/X7TXB42Z"},"agent_actions":{"view_html":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB","download_json":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB.json","view_paper":"https://pith.science/paper/X7TXB42Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.05979&json=true","fetch_graph":"https://pith.science/api/pith-number/X7TXB42ZVF5SQGSQUHG6TXTQNB/graph.json","fetch_events":"https://pith.science/api/pith-number/X7TXB42ZVF5SQGSQUHG6TXTQNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB/action/storage_attestation","attest_author":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB/action/author_attestation","sign_citation":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB/action/citation_signature","submit_replication":"https://pith.science/pith/X7TXB42ZVF5SQGSQUHG6TXTQNB/action/replication_record"}},"created_at":"2026-07-05T04:56:52.136796+00:00","updated_at":"2026-07-05T04:56:52.136796+00:00"}