{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PB6UMIBTQZQH4RURAD4FIXYQVX","short_pith_number":"pith:PB6UMIBT","schema_version":"1.0","canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","source":{"kind":"arxiv","id":"1807.02931","version":1},"attestation_state":"computed","paper":{"title":"Optimal Trajectory-Planning of UAVs via B-Splines and Disjunctive Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Babaei, Amirhossein Karimi","submitted_at":"2018-07-09T03:40:17Z","abstract_excerpt":"This paper investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive programming and receding horizon concept, which has many advantages, such as a high computational speed. Disjunctive programming is applied in order to relax the non-convex constraints of the problem. Moreover, the B-spline curves are employed to represent the trajectories which should be generated in the optimization process."},"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":"1807.02931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-07-09T03:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"388916a2b40e9245cba3a1525cc4a201a756c94c8ff3f0c8930a8d4051b8b153","abstract_canon_sha256":"907cccca8305f73aa0ca6d70c9a5d78e2b45967f78dfbdb89b1b8cedd95ab1be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:13.324864Z","signature_b64":"NdA1kV1U1flEZKW+QqlPz9hoIYQe6U6gwf8VaEXvyDH5Skz+De1N+MV5wyfKwyJvcM9rIYWcb0q8mbXBZshBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"787d46203386607e469100f8545f10add85f92911fb9df8c00612eda0dd8491c","last_reissued_at":"2026-05-18T00:11:13.324203Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:13.324203Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Trajectory-Planning of UAVs via B-Splines and Disjunctive Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alireza Babaei, Amirhossein Karimi","submitted_at":"2018-07-09T03:40:17Z","abstract_excerpt":"This paper investigates an efficient algorithm for trajectory planning problem of autonomous unmanned aerial vehicles which fly over three-dimensional terrains. The proposed algorithm combines convex optimization with disjunctive programming and receding horizon concept, which has many advantages, such as a high computational speed. Disjunctive programming is applied in order to relax the non-convex constraints of the problem. Moreover, the B-spline curves are employed to represent the trajectories which should be generated in the optimization process."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02931","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":"1807.02931","created_at":"2026-05-18T00:11:13.324292+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02931v1","created_at":"2026-05-18T00:11:13.324292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02931","created_at":"2026-05-18T00:11:13.324292+00:00"},{"alias_kind":"pith_short_12","alias_value":"PB6UMIBTQZQH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"PB6UMIBTQZQH4RUR","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"PB6UMIBT","created_at":"2026-05-18T12:32:43.782077+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/PB6UMIBTQZQH4RURAD4FIXYQVX","json":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX.json","graph_json":"https://pith.science/api/pith-number/PB6UMIBTQZQH4RURAD4FIXYQVX/graph.json","events_json":"https://pith.science/api/pith-number/PB6UMIBTQZQH4RURAD4FIXYQVX/events.json","paper":"https://pith.science/paper/PB6UMIBT"},"agent_actions":{"view_html":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX","download_json":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX.json","view_paper":"https://pith.science/paper/PB6UMIBT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02931&json=true","fetch_graph":"https://pith.science/api/pith-number/PB6UMIBTQZQH4RURAD4FIXYQVX/graph.json","fetch_events":"https://pith.science/api/pith-number/PB6UMIBTQZQH4RURAD4FIXYQVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/action/storage_attestation","attest_author":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/action/author_attestation","sign_citation":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/action/citation_signature","submit_replication":"https://pith.science/pith/PB6UMIBTQZQH4RURAD4FIXYQVX/action/replication_record"}},"created_at":"2026-05-18T00:11:13.324292+00:00","updated_at":"2026-05-18T00:11:13.324292+00:00"}