{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LTL47I2NCH24AATKBJGHIWBNT6","short_pith_number":"pith:LTL47I2N","schema_version":"1.0","canonical_sha256":"5cd7cfa34d11f5c0026a0a4c74582d9f96478ef8403a387b207fbd9b5ea5bb26","source":{"kind":"arxiv","id":"2309.15191","version":2},"attestation_state":"computed","paper":{"title":"Deep Learning for Optimization of Trajectories for Quadrotors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Igor Spasojevic, Vijay Kumar, Xiatao Sun, Yuwei Wu","submitted_at":"2023-09-26T18:51:46Z","abstract_excerpt":"This paper presents a novel learning-based trajectory planning framework for quadrotors that combines model-based optimization techniques with deep learning. Specifically, we formulate the trajectory optimization problem as a quadratic programming (QP) problem with dynamic and collision-free constraints using piecewise trajectory segments through safe flight corridors [1]. We train neural networks to directly learn the time allocation for each segment to generate optimal smooth and fast trajectories. Furthermore, the constrained optimization problem is applied as a separate implicit layer for "},"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":"2309.15191","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2023-09-26T18:51:46Z","cross_cats_sorted":[],"title_canon_sha256":"1785153f618b78019b87a0831f703e349d75d2144fdcc60cdfd0065098720a29","abstract_canon_sha256":"60f7ac44b476935f889456b76d192379236bcb219d8aa94672c998a85bfc2432"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:19:48.918292Z","signature_b64":"FBB5z7Tk+CxcF04OxU/rLWH/V+C6wO8UcYWJ8GhBzTTK+FZvGRoQr3g8gT2wWtcF9pFWolqep56QtrBWPeI4Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cd7cfa34d11f5c0026a0a4c74582d9f96478ef8403a387b207fbd9b5ea5bb26","last_reissued_at":"2026-07-05T07:19:48.917868Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:19:48.917868Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deep Learning for Optimization of Trajectories for Quadrotors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Igor Spasojevic, Vijay Kumar, Xiatao Sun, Yuwei Wu","submitted_at":"2023-09-26T18:51:46Z","abstract_excerpt":"This paper presents a novel learning-based trajectory planning framework for quadrotors that combines model-based optimization techniques with deep learning. Specifically, we formulate the trajectory optimization problem as a quadratic programming (QP) problem with dynamic and collision-free constraints using piecewise trajectory segments through safe flight corridors [1]. We train neural networks to directly learn the time allocation for each segment to generate optimal smooth and fast trajectories. Furthermore, the constrained optimization problem is applied as a separate implicit layer for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.15191","kind":"arxiv","version":2},"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/2309.15191/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":"2309.15191","created_at":"2026-07-05T07:19:48.917924+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.15191v2","created_at":"2026-07-05T07:19:48.917924+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.15191","created_at":"2026-07-05T07:19:48.917924+00:00"},{"alias_kind":"pith_short_12","alias_value":"LTL47I2NCH24","created_at":"2026-07-05T07:19:48.917924+00:00"},{"alias_kind":"pith_short_16","alias_value":"LTL47I2NCH24AATK","created_at":"2026-07-05T07:19:48.917924+00:00"},{"alias_kind":"pith_short_8","alias_value":"LTL47I2N","created_at":"2026-07-05T07:19:48.917924+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/LTL47I2NCH24AATKBJGHIWBNT6","json":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6.json","graph_json":"https://pith.science/api/pith-number/LTL47I2NCH24AATKBJGHIWBNT6/graph.json","events_json":"https://pith.science/api/pith-number/LTL47I2NCH24AATKBJGHIWBNT6/events.json","paper":"https://pith.science/paper/LTL47I2N"},"agent_actions":{"view_html":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6","download_json":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6.json","view_paper":"https://pith.science/paper/LTL47I2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.15191&json=true","fetch_graph":"https://pith.science/api/pith-number/LTL47I2NCH24AATKBJGHIWBNT6/graph.json","fetch_events":"https://pith.science/api/pith-number/LTL47I2NCH24AATKBJGHIWBNT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6/action/storage_attestation","attest_author":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6/action/author_attestation","sign_citation":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6/action/citation_signature","submit_replication":"https://pith.science/pith/LTL47I2NCH24AATKBJGHIWBNT6/action/replication_record"}},"created_at":"2026-07-05T07:19:48.917924+00:00","updated_at":"2026-07-05T07:19:48.917924+00:00"}