{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:7PMRNH4YXQHBSSMONUZVEBEKCB","short_pith_number":"pith:7PMRNH4Y","schema_version":"1.0","canonical_sha256":"fbd9169f98bc0e19498e6d3352048a107bc8953a8d731a0e992340cd1fe2e533","source":{"kind":"arxiv","id":"2312.05724","version":1},"attestation_state":"computed","paper":{"title":"Minimum-Time Trajectory Optimization With Data-Based Models: A Linear Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Dimitar Filev, Ehsan Taheri, Ilya Kolmanovsky, Nan Li","submitted_at":"2023-12-10T01:55:21Z","abstract_excerpt":"In this paper, we develop a computationally-efficient approach to minimum-time trajectory optimization using input-output data-based models, to produce an end-to-end data-to-control solution to time-optimal planning/control of dynamic systems and hence facilitate their autonomous operation. The approach integrates a non-parametric data-based model for trajectory prediction and a continuous optimization formulation based on an exponential weighting scheme for minimum-time trajectory planning. The optimization problem in its final form is a linear program and is easy to solve. We validate the ap"},"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":"2312.05724","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2023-12-10T01:55:21Z","cross_cats_sorted":["cs.SY","math.OC"],"title_canon_sha256":"3fc066c607216795d1305bdb027ab903ad3d9ea7fa13d9bb6583b8b53bd32ffb","abstract_canon_sha256":"400b8f07da04436ea95762d7cbcf51d9b7b902768e7669d51d7ddfd323f6251a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:22:31.618493Z","signature_b64":"QAryvjNJEhCnR2qtvB1HQ5UKddROfbYtSyaVVdwhc6Ib0mzcuvZ1fo9mo9oKR/2x87agqcM5GtphQF2/voCLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fbd9169f98bc0e19498e6d3352048a107bc8953a8d731a0e992340cd1fe2e533","last_reissued_at":"2026-07-05T07:22:31.618037Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:22:31.618037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum-Time Trajectory Optimization With Data-Based Models: A Linear Programming Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.OC"],"primary_cat":"eess.SY","authors_text":"Dimitar Filev, Ehsan Taheri, Ilya Kolmanovsky, Nan Li","submitted_at":"2023-12-10T01:55:21Z","abstract_excerpt":"In this paper, we develop a computationally-efficient approach to minimum-time trajectory optimization using input-output data-based models, to produce an end-to-end data-to-control solution to time-optimal planning/control of dynamic systems and hence facilitate their autonomous operation. The approach integrates a non-parametric data-based model for trajectory prediction and a continuous optimization formulation based on an exponential weighting scheme for minimum-time trajectory planning. The optimization problem in its final form is a linear program and is easy to solve. We validate the ap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.05724","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/2312.05724/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":"2312.05724","created_at":"2026-07-05T07:22:31.618094+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.05724v1","created_at":"2026-07-05T07:22:31.618094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.05724","created_at":"2026-07-05T07:22:31.618094+00:00"},{"alias_kind":"pith_short_12","alias_value":"7PMRNH4YXQHB","created_at":"2026-07-05T07:22:31.618094+00:00"},{"alias_kind":"pith_short_16","alias_value":"7PMRNH4YXQHBSSMO","created_at":"2026-07-05T07:22:31.618094+00:00"},{"alias_kind":"pith_short_8","alias_value":"7PMRNH4Y","created_at":"2026-07-05T07:22:31.618094+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/7PMRNH4YXQHBSSMONUZVEBEKCB","json":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB.json","graph_json":"https://pith.science/api/pith-number/7PMRNH4YXQHBSSMONUZVEBEKCB/graph.json","events_json":"https://pith.science/api/pith-number/7PMRNH4YXQHBSSMONUZVEBEKCB/events.json","paper":"https://pith.science/paper/7PMRNH4Y"},"agent_actions":{"view_html":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB","download_json":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB.json","view_paper":"https://pith.science/paper/7PMRNH4Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.05724&json=true","fetch_graph":"https://pith.science/api/pith-number/7PMRNH4YXQHBSSMONUZVEBEKCB/graph.json","fetch_events":"https://pith.science/api/pith-number/7PMRNH4YXQHBSSMONUZVEBEKCB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB/action/storage_attestation","attest_author":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB/action/author_attestation","sign_citation":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB/action/citation_signature","submit_replication":"https://pith.science/pith/7PMRNH4YXQHBSSMONUZVEBEKCB/action/replication_record"}},"created_at":"2026-07-05T07:22:31.618094+00:00","updated_at":"2026-07-05T07:22:31.618094+00:00"}