{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:5S4EZA6IGWVQOWUDRABWCW75SV","short_pith_number":"pith:5S4EZA6I","schema_version":"1.0","canonical_sha256":"ecb84c83c835ab075a838803615bfd957b6b9d913927881b038d6fdc061b4a77","source":{"kind":"arxiv","id":"2411.05624","version":1},"attestation_state":"computed","paper":{"title":"Data-Driven Min-Max MPC for LPV Systems with Unknown Scheduling Signal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Felix Br\\\"andle, Frank Allg\\\"ower, Julian Berberich, Yifan Xie","submitted_at":"2024-11-08T15:14:31Z","abstract_excerpt":"This paper presents a data-driven min-max model predictive control (MPC) scheme for linear parameter-varying (LPV) systems. Contrary to existing data-driven LPV control approaches, we assume that the scheduling signal is unknown during offline data collection and online system operation. Assuming a quadratic matrix inequality (QMI) description for the scheduling signal, we develop a novel data-driven characterization of the consistent system matrices using only input-state data. The proposed data-driven min-max MPC minimizes a tractable upper bound on the worst-case cost over the consistent sy"},"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":"2411.05624","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-11-08T15:14:31Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"8361f9cf97fcf551a7a84cfacbb3135372b59cab903f17c1b2af35f3297b0527","abstract_canon_sha256":"84bfd57524376bc3f4cec79ad3e6b5a212c55072b618ca41db8c74afaf7625ad"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:04.109985Z","signature_b64":"VrVbUlXieTF26F9+ng4MyyPW3JAq57GXVgltATWAmpQ7PeZVxn5vjFHBpFUpqQDFwukGNhUEjOimElLu9H46CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecb84c83c835ab075a838803615bfd957b6b9d913927881b038d6fdc061b4a77","last_reissued_at":"2026-07-05T09:33:04.109471Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:04.109471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Data-Driven Min-Max MPC for LPV Systems with Unknown Scheduling Signal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Felix Br\\\"andle, Frank Allg\\\"ower, Julian Berberich, Yifan Xie","submitted_at":"2024-11-08T15:14:31Z","abstract_excerpt":"This paper presents a data-driven min-max model predictive control (MPC) scheme for linear parameter-varying (LPV) systems. Contrary to existing data-driven LPV control approaches, we assume that the scheduling signal is unknown during offline data collection and online system operation. Assuming a quadratic matrix inequality (QMI) description for the scheduling signal, we develop a novel data-driven characterization of the consistent system matrices using only input-state data. The proposed data-driven min-max MPC minimizes a tractable upper bound on the worst-case cost over the consistent sy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.05624","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/2411.05624/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":"2411.05624","created_at":"2026-07-05T09:33:04.109542+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.05624v1","created_at":"2026-07-05T09:33:04.109542+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.05624","created_at":"2026-07-05T09:33:04.109542+00:00"},{"alias_kind":"pith_short_12","alias_value":"5S4EZA6IGWVQ","created_at":"2026-07-05T09:33:04.109542+00:00"},{"alias_kind":"pith_short_16","alias_value":"5S4EZA6IGWVQOWUD","created_at":"2026-07-05T09:33:04.109542+00:00"},{"alias_kind":"pith_short_8","alias_value":"5S4EZA6I","created_at":"2026-07-05T09:33:04.109542+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.24316","citing_title":"Data-Driven Robust MPC for Unknown Nonlinear Systems via Set-Membership Learning","ref_index":61,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV","json":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV.json","graph_json":"https://pith.science/api/pith-number/5S4EZA6IGWVQOWUDRABWCW75SV/graph.json","events_json":"https://pith.science/api/pith-number/5S4EZA6IGWVQOWUDRABWCW75SV/events.json","paper":"https://pith.science/paper/5S4EZA6I"},"agent_actions":{"view_html":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV","download_json":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV.json","view_paper":"https://pith.science/paper/5S4EZA6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.05624&json=true","fetch_graph":"https://pith.science/api/pith-number/5S4EZA6IGWVQOWUDRABWCW75SV/graph.json","fetch_events":"https://pith.science/api/pith-number/5S4EZA6IGWVQOWUDRABWCW75SV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV/action/storage_attestation","attest_author":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV/action/author_attestation","sign_citation":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV/action/citation_signature","submit_replication":"https://pith.science/pith/5S4EZA6IGWVQOWUDRABWCW75SV/action/replication_record"}},"created_at":"2026-07-05T09:33:04.109542+00:00","updated_at":"2026-07-05T09:33:04.109542+00:00"}