{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:WUQZU6DFM5G3DO6IBMTKO6AH3A","short_pith_number":"pith:WUQZU6DF","schema_version":"1.0","canonical_sha256":"b5219a7865674db1bbc80b26a77807d83481efe18a112c6a6e966120d4041625","source":{"kind":"arxiv","id":"2211.15902","version":3},"attestation_state":"computed","paper":{"title":"Simultaneous Spatial and Temporal Assignment for Fast UAV Trajectory Optimization using Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Naira Hovakimyan, Qianzhong Chen, Sheng Cheng","submitted_at":"2022-11-29T03:41:34Z","abstract_excerpt":"In this paper, we propose a framework for fast trajectory planning for unmanned aerial vehicles (UAVs). Our framework is reformulated from an existing bilevel optimization, in which the lower-level problem solves for the optimal trajectory with a fixed time allocation, whereas the upper-level problem updates the time allocation using analytical gradients. The lower-level problem incorporates the safety-set constraints (in the form of inequality constraints) and is cast as a convex quadratic program (QP). Our formulation modifies the lower-level QP by excluding the inequality constraints for th"},"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":"2211.15902","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-11-29T03:41:34Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"d829aebc19af6a6510777951cce206e563d886e2a32809e2a79696ccca0964f0","abstract_canon_sha256":"345dbd521e0593cfaf3a31e0def1c59d6e880e9fc6c8ae257d380e4ead307579"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:00:35.148270Z","signature_b64":"wKvQR9wjVCl2CLkwQ4Ka/J/j21a+CHXYx39WKX0p0EtIk3nDl/iUoFnFnG9GUmNuwN5A4K71NSrf9vZ2MtTBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5219a7865674db1bbc80b26a77807d83481efe18a112c6a6e966120d4041625","last_reissued_at":"2026-07-05T06:00:35.147810Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:00:35.147810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simultaneous Spatial and Temporal Assignment for Fast UAV Trajectory Optimization using Bilevel Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Naira Hovakimyan, Qianzhong Chen, Sheng Cheng","submitted_at":"2022-11-29T03:41:34Z","abstract_excerpt":"In this paper, we propose a framework for fast trajectory planning for unmanned aerial vehicles (UAVs). Our framework is reformulated from an existing bilevel optimization, in which the lower-level problem solves for the optimal trajectory with a fixed time allocation, whereas the upper-level problem updates the time allocation using analytical gradients. The lower-level problem incorporates the safety-set constraints (in the form of inequality constraints) and is cast as a convex quadratic program (QP). Our formulation modifies the lower-level QP by excluding the inequality constraints for th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.15902","kind":"arxiv","version":3},"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/2211.15902/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":"2211.15902","created_at":"2026-07-05T06:00:35.147866+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.15902v3","created_at":"2026-07-05T06:00:35.147866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.15902","created_at":"2026-07-05T06:00:35.147866+00:00"},{"alias_kind":"pith_short_12","alias_value":"WUQZU6DFM5G3","created_at":"2026-07-05T06:00:35.147866+00:00"},{"alias_kind":"pith_short_16","alias_value":"WUQZU6DFM5G3DO6I","created_at":"2026-07-05T06:00:35.147866+00:00"},{"alias_kind":"pith_short_8","alias_value":"WUQZU6DF","created_at":"2026-07-05T06:00:35.147866+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/WUQZU6DFM5G3DO6IBMTKO6AH3A","json":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A.json","graph_json":"https://pith.science/api/pith-number/WUQZU6DFM5G3DO6IBMTKO6AH3A/graph.json","events_json":"https://pith.science/api/pith-number/WUQZU6DFM5G3DO6IBMTKO6AH3A/events.json","paper":"https://pith.science/paper/WUQZU6DF"},"agent_actions":{"view_html":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A","download_json":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A.json","view_paper":"https://pith.science/paper/WUQZU6DF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.15902&json=true","fetch_graph":"https://pith.science/api/pith-number/WUQZU6DFM5G3DO6IBMTKO6AH3A/graph.json","fetch_events":"https://pith.science/api/pith-number/WUQZU6DFM5G3DO6IBMTKO6AH3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A/action/storage_attestation","attest_author":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A/action/author_attestation","sign_citation":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A/action/citation_signature","submit_replication":"https://pith.science/pith/WUQZU6DFM5G3DO6IBMTKO6AH3A/action/replication_record"}},"created_at":"2026-07-05T06:00:35.147866+00:00","updated_at":"2026-07-05T06:00:35.147866+00:00"}