{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4BYCYZALHJFS6RTQ4LLFJ7M7BC","short_pith_number":"pith:4BYCYZAL","schema_version":"1.0","canonical_sha256":"e0702c640b3a4b2f4670e2d654fd9f08ac642060aaa834d2cca27bf20f2e6841","source":{"kind":"arxiv","id":"1709.00342","version":1},"attestation_state":"computed","paper":{"title":"Real-time Dynamic-Mode Scheduling Using Single-Integration Hybrid Optimization for Linear Time-Varying Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Anastasia Mavrommati, Jarvis A. Schultz, Todd D. Murphey","submitted_at":"2017-08-31T15:12:06Z","abstract_excerpt":"This paper considers the problem of real-time mode scheduling in linear time-varying switched systems subject to a quadratic cost functional. The execution time of hybrid control algorithms is often prohibitive for real-time applications and typically may only be reduced at the expense of approximation accuracy. We address this trade-off by taking advantage of system linearity to formulate a projection-based approach so that no simulation is required during open-loop optimization. A numerical example shows how the proposed open-loop algorithm outperforms methods employing common numerical inte"},"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":"1709.00342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-31T15:12:06Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"5ce954811ab24251488bc5947372bb8c6cd34d0b41dbd5f765f704f41a721fbf","abstract_canon_sha256":"da941362fba6423743dc42878bdabca028251f19e65235d34ea0ca9aef86f15f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:10.614843Z","signature_b64":"uTP9jBTswecC6+Fl6B47JZVHEINHvpE2S73okpo5qOVDZ4+9R4rGQRjhqV3EgJzvfb5kRvV0Zmc6ZzW0jg5tBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0702c640b3a4b2f4670e2d654fd9f08ac642060aaa834d2cca27bf20f2e6841","last_reissued_at":"2026-05-18T00:36:10.614335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:10.614335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Real-time Dynamic-Mode Scheduling Using Single-Integration Hybrid Optimization for Linear Time-Varying Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"math.OC","authors_text":"Anastasia Mavrommati, Jarvis A. Schultz, Todd D. Murphey","submitted_at":"2017-08-31T15:12:06Z","abstract_excerpt":"This paper considers the problem of real-time mode scheduling in linear time-varying switched systems subject to a quadratic cost functional. The execution time of hybrid control algorithms is often prohibitive for real-time applications and typically may only be reduced at the expense of approximation accuracy. We address this trade-off by taking advantage of system linearity to formulate a projection-based approach so that no simulation is required during open-loop optimization. A numerical example shows how the proposed open-loop algorithm outperforms methods employing common numerical inte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.00342","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":"1709.00342","created_at":"2026-05-18T00:36:10.614414+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.00342v1","created_at":"2026-05-18T00:36:10.614414+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.00342","created_at":"2026-05-18T00:36:10.614414+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BYCYZALHJFS","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BYCYZALHJFS6RTQ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BYCYZAL","created_at":"2026-05-18T12:30:58.224056+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/4BYCYZALHJFS6RTQ4LLFJ7M7BC","json":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC.json","graph_json":"https://pith.science/api/pith-number/4BYCYZALHJFS6RTQ4LLFJ7M7BC/graph.json","events_json":"https://pith.science/api/pith-number/4BYCYZALHJFS6RTQ4LLFJ7M7BC/events.json","paper":"https://pith.science/paper/4BYCYZAL"},"agent_actions":{"view_html":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC","download_json":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC.json","view_paper":"https://pith.science/paper/4BYCYZAL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.00342&json=true","fetch_graph":"https://pith.science/api/pith-number/4BYCYZALHJFS6RTQ4LLFJ7M7BC/graph.json","fetch_events":"https://pith.science/api/pith-number/4BYCYZALHJFS6RTQ4LLFJ7M7BC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC/action/storage_attestation","attest_author":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC/action/author_attestation","sign_citation":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC/action/citation_signature","submit_replication":"https://pith.science/pith/4BYCYZALHJFS6RTQ4LLFJ7M7BC/action/replication_record"}},"created_at":"2026-05-18T00:36:10.614414+00:00","updated_at":"2026-05-18T00:36:10.614414+00:00"}