{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:CWC7U53R3NQLEKBZHZ3QYHYXJL","short_pith_number":"pith:CWC7U53R","schema_version":"1.0","canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","source":{"kind":"arxiv","id":"1811.10753","version":2},"attestation_state":"computed","paper":{"title":"Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gao Tang, Kris Hauser, Weidong Sun","submitted_at":"2018-11-27T00:18:18Z","abstract_excerpt":"We present an efficient optimization framework that solves trajectory optimization problems by decoupling state variables from timing variables, thereby decomposing a challenging nonlinear programming (NLP) problem into two easier subproblems. With timing fixed, the state variables can be optimized efficiently using convex optimization, and the timing variables can be optimized in a separate NLP, which forms a bilevel optimization problem. The challenge of obtaining the gradient of the timing variables is solved by sensitivity analysis of parametric NLPs. The exact analytic gradient is compute"},"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":"1811.10753","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2018-11-27T00:18:18Z","cross_cats_sorted":[],"title_canon_sha256":"db6e522eea8cc9b007b0f36d251403828f0d05db86f9876ca95ee083ba00604b","abstract_canon_sha256":"a8feef5b6d743dc8c82f479f91d64abfa653aaa1ffe351e3db5d9d89a29b10a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:34:59.913965Z","signature_b64":"d5oGLaX3qOtEC0ecLEZUGvYoflRZfyiqWZV4lcxOYoAY8xMsAQuBrUIlhFYyTyDirDgqOzRyBTb5/Swp4ONBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1585fa7771db60b228393e770c1f174ad12bc759267d08325069ad4d77c39137","last_reissued_at":"2026-07-05T02:34:59.913607Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:34:59.913607Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast UAV Trajectory Optimization using Bilevel Optimization with Analytical Gradients","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Gao Tang, Kris Hauser, Weidong Sun","submitted_at":"2018-11-27T00:18:18Z","abstract_excerpt":"We present an efficient optimization framework that solves trajectory optimization problems by decoupling state variables from timing variables, thereby decomposing a challenging nonlinear programming (NLP) problem into two easier subproblems. With timing fixed, the state variables can be optimized efficiently using convex optimization, and the timing variables can be optimized in a separate NLP, which forms a bilevel optimization problem. The challenge of obtaining the gradient of the timing variables is solved by sensitivity analysis of parametric NLPs. The exact analytic gradient is compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10753","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/1811.10753/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":"1811.10753","created_at":"2026-07-05T02:34:59.913665+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10753v2","created_at":"2026-07-05T02:34:59.913665+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10753","created_at":"2026-07-05T02:34:59.913665+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWC7U53R3NQL","created_at":"2026-07-05T02:34:59.913665+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWC7U53R3NQLEKBZ","created_at":"2026-07-05T02:34:59.913665+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWC7U53R","created_at":"2026-07-05T02:34:59.913665+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2601.02738","citing_title":"Optimizing Control-Friendly Trajectories with Self-Supervised Residual Learning","ref_index":32,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL","json":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL.json","graph_json":"https://pith.science/api/pith-number/CWC7U53R3NQLEKBZHZ3QYHYXJL/graph.json","events_json":"https://pith.science/api/pith-number/CWC7U53R3NQLEKBZHZ3QYHYXJL/events.json","paper":"https://pith.science/paper/CWC7U53R"},"agent_actions":{"view_html":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL","download_json":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL.json","view_paper":"https://pith.science/paper/CWC7U53R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10753&json=true","fetch_graph":"https://pith.science/api/pith-number/CWC7U53R3NQLEKBZHZ3QYHYXJL/graph.json","fetch_events":"https://pith.science/api/pith-number/CWC7U53R3NQLEKBZHZ3QYHYXJL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/action/storage_attestation","attest_author":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/action/author_attestation","sign_citation":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/action/citation_signature","submit_replication":"https://pith.science/pith/CWC7U53R3NQLEKBZHZ3QYHYXJL/action/replication_record"}},"created_at":"2026-07-05T02:34:59.913665+00:00","updated_at":"2026-07-05T02:34:59.913665+00:00"}