{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XC2W2SJM3SXLDDLCBLF3AR5JOI","short_pith_number":"pith:XC2W2SJM","schema_version":"1.0","canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","source":{"kind":"arxiv","id":"1303.3533","version":1},"attestation_state":"computed","paper":{"title":"Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Calin Belta, Ivana \\v{C}ern\\'a, M\\'aria Svore\\v{n}ov\\'a","submitted_at":"2013-03-14T17:57:13Z","abstract_excerpt":"In this paper, we develop a provably correct optimal control strategy for a finite deterministic transition system. By assuming that penalties with known probabilities of occurrence and dynamics can be sensed locally at the states of the system, we derive a receding horizon strategy that minimizes the expected average cumulative penalty incurred between two consecutive satisfactions of a desired property. At the same time, we guarantee the satisfaction of correctness specifications expressed as Linear Temporal Logic formulas. We illustrate the approach with a persistent surveillance robotics a"},"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":"1303.3533","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-03-14T17:57:13Z","cross_cats_sorted":[],"title_canon_sha256":"cd332b77667432ec42721d9e79f6d70f0b27f860385cdb6538a66bce83f0b103","abstract_canon_sha256":"97c83f72d3a5857eb31553e3f57a3bc25b574da2287100ed9c6e0a003c3ae620"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:54.326607Z","signature_b64":"qIfTVBdWM7WgA7BC9VfHuEO/dRLYmXFuNIori66sJm6nrSsEFKLGdT6hNQ7b4Jy+zWK6l8hafeE4OoDO9BaTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8b56d492cdcaeb18d620acbb047a9720956d48e8cc22daedb816f5a074cbddf","last_reissued_at":"2026-05-18T03:30:54.325776Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:54.325776Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Receding Horizon Control for Finite Deterministic Systems with Temporal Logic Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Calin Belta, Ivana \\v{C}ern\\'a, M\\'aria Svore\\v{n}ov\\'a","submitted_at":"2013-03-14T17:57:13Z","abstract_excerpt":"In this paper, we develop a provably correct optimal control strategy for a finite deterministic transition system. By assuming that penalties with known probabilities of occurrence and dynamics can be sensed locally at the states of the system, we derive a receding horizon strategy that minimizes the expected average cumulative penalty incurred between two consecutive satisfactions of a desired property. At the same time, we guarantee the satisfaction of correctness specifications expressed as Linear Temporal Logic formulas. We illustrate the approach with a persistent surveillance robotics a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3533","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":"1303.3533","created_at":"2026-05-18T03:30:54.325901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.3533v1","created_at":"2026-05-18T03:30:54.325901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3533","created_at":"2026-05-18T03:30:54.325901+00:00"},{"alias_kind":"pith_short_12","alias_value":"XC2W2SJM3SXL","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XC2W2SJM3SXLDDLC","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XC2W2SJM","created_at":"2026-05-18T12:28:06.772260+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/XC2W2SJM3SXLDDLCBLF3AR5JOI","json":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI.json","graph_json":"https://pith.science/api/pith-number/XC2W2SJM3SXLDDLCBLF3AR5JOI/graph.json","events_json":"https://pith.science/api/pith-number/XC2W2SJM3SXLDDLCBLF3AR5JOI/events.json","paper":"https://pith.science/paper/XC2W2SJM"},"agent_actions":{"view_html":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI","download_json":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI.json","view_paper":"https://pith.science/paper/XC2W2SJM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.3533&json=true","fetch_graph":"https://pith.science/api/pith-number/XC2W2SJM3SXLDDLCBLF3AR5JOI/graph.json","fetch_events":"https://pith.science/api/pith-number/XC2W2SJM3SXLDDLCBLF3AR5JOI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/action/storage_attestation","attest_author":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/action/author_attestation","sign_citation":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/action/citation_signature","submit_replication":"https://pith.science/pith/XC2W2SJM3SXLDDLCBLF3AR5JOI/action/replication_record"}},"created_at":"2026-05-18T03:30:54.325901+00:00","updated_at":"2026-05-18T03:30:54.325901+00:00"}