{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:BAKGCV3VCKLHKV4PJ6OFS6S7VK","short_pith_number":"pith:BAKGCV3V","schema_version":"1.0","canonical_sha256":"0814615775129675578f4f9c597a5faa98f7d48b8fdaf87dde75a9d2e300c397","source":{"kind":"arxiv","id":"2102.11736","version":1},"attestation_state":"computed","paper":{"title":"Recurrent Model Predictive Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY"],"primary_cat":"eess.SY","authors_text":"Bo Cheng, Jingliang Duan, Qi Sun, Shengbo Eben Li, Wenxuan Wang, Yuming Yin, Zhengyu Liu, Ziyu Lin","submitted_at":"2021-02-23T15:01:36Z","abstract_excerpt":"This paper proposes an off-line algorithm, called Recurrent Model Predictive Control (RMPC), to solve general nonlinear finite-horizon optimal control problems. Unlike traditional Model Predictive Control (MPC) algorithms, it can make full use of the current computing resources and adaptively select the longest model prediction horizon. Our algorithm employs a recurrent function to approximate the optimal policy, which maps the system states and reference values directly to the control inputs. The number of prediction steps is equal to the number of recurrent cycles of the learned policy funct"},"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":"2102.11736","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SY","submitted_at":"2021-02-23T15:01:36Z","cross_cats_sorted":["cs.AI","cs.SY"],"title_canon_sha256":"b1060f346207263cd0ab352864721c2b79b779fb53932a37a85f7eb27bcccf59","abstract_canon_sha256":"810aa8acc5e13a4719f731aa1beafd347536dd7d3417880d3fc0c3dbb796ca0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:17:53.773012Z","signature_b64":"E7/Z+cwNyptEkpGAbEC5Whq9kBm1pftTqET1uyKlDg62ds9JK9aYZg5n+3RyCCbND08JOYRIA0p/L2V+rv8iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0814615775129675578f4f9c597a5faa98f7d48b8fdaf87dde75a9d2e300c397","last_reissued_at":"2026-07-05T02:17:53.772545Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:17:53.772545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrent Model Predictive Control","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.SY"],"primary_cat":"eess.SY","authors_text":"Bo Cheng, Jingliang Duan, Qi Sun, Shengbo Eben Li, Wenxuan Wang, Yuming Yin, Zhengyu Liu, Ziyu Lin","submitted_at":"2021-02-23T15:01:36Z","abstract_excerpt":"This paper proposes an off-line algorithm, called Recurrent Model Predictive Control (RMPC), to solve general nonlinear finite-horizon optimal control problems. Unlike traditional Model Predictive Control (MPC) algorithms, it can make full use of the current computing resources and adaptively select the longest model prediction horizon. Our algorithm employs a recurrent function to approximate the optimal policy, which maps the system states and reference values directly to the control inputs. The number of prediction steps is equal to the number of recurrent cycles of the learned policy funct"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.11736","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/2102.11736/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":"2102.11736","created_at":"2026-07-05T02:17:53.772613+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.11736v1","created_at":"2026-07-05T02:17:53.772613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.11736","created_at":"2026-07-05T02:17:53.772613+00:00"},{"alias_kind":"pith_short_12","alias_value":"BAKGCV3VCKLH","created_at":"2026-07-05T02:17:53.772613+00:00"},{"alias_kind":"pith_short_16","alias_value":"BAKGCV3VCKLHKV4P","created_at":"2026-07-05T02:17:53.772613+00:00"},{"alias_kind":"pith_short_8","alias_value":"BAKGCV3V","created_at":"2026-07-05T02:17:53.772613+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/BAKGCV3VCKLHKV4PJ6OFS6S7VK","json":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK.json","graph_json":"https://pith.science/api/pith-number/BAKGCV3VCKLHKV4PJ6OFS6S7VK/graph.json","events_json":"https://pith.science/api/pith-number/BAKGCV3VCKLHKV4PJ6OFS6S7VK/events.json","paper":"https://pith.science/paper/BAKGCV3V"},"agent_actions":{"view_html":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK","download_json":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK.json","view_paper":"https://pith.science/paper/BAKGCV3V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.11736&json=true","fetch_graph":"https://pith.science/api/pith-number/BAKGCV3VCKLHKV4PJ6OFS6S7VK/graph.json","fetch_events":"https://pith.science/api/pith-number/BAKGCV3VCKLHKV4PJ6OFS6S7VK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK/action/storage_attestation","attest_author":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK/action/author_attestation","sign_citation":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK/action/citation_signature","submit_replication":"https://pith.science/pith/BAKGCV3VCKLHKV4PJ6OFS6S7VK/action/replication_record"}},"created_at":"2026-07-05T02:17:53.772613+00:00","updated_at":"2026-07-05T02:17:53.772613+00:00"}