{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:COVKJWKT6SX52OXTRWWZMPRPLI","short_pith_number":"pith:COVKJWKT","schema_version":"1.0","canonical_sha256":"13aaa4d953f4afdd3af38dad963e2f5a184e3fa2b309ac62d8da2db74cd053c3","source":{"kind":"arxiv","id":"1906.11669","version":1},"attestation_state":"computed","paper":{"title":"Airways: Optimization-Based Planning of Quadrotor Trajectories according to High-Level User Goals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.HC","authors_text":"Benjamin Hepp, Christoph Gebhardt, Otmar Hilliges, Stefan Stevsic, Tobias Naegeli","submitted_at":"2019-06-27T14:14:51Z","abstract_excerpt":"In this paper we propose a computational design tool that al-lows end-users to create advanced quadrotor trajectories witha variety of application scenarios in mind. Our algorithm al-lows novice users to create quadrotor based use-cases withoutrequiring deep knowledge in either quadrotor control or theunderlying constraints of the target domain. To achieve thisgoal we propose an optimization-based method that gener-ates feasible trajectories which can be flown in the real world.Furthermore, the method incorporates high-level human ob-jectives into the planning of flight trajectories. An easy t"},"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":"1906.11669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.HC","submitted_at":"2019-06-27T14:14:51Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"bdb48488fde4d93875b5936363d3bbdaf321468111a98d1a729451708c420a37","abstract_canon_sha256":"ec77bd7537cdf14080d1f59eacaf306945967426bb79df56987fb0698ad823f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:04.138689Z","signature_b64":"VTa3a01sk48T+A6I68nyQzxAnuQhrTa8e25PT6vyajFQS/7xMMzh+8IojLHcWY8RG6HdMrYAYTY4xmkHk9IoDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13aaa4d953f4afdd3af38dad963e2f5a184e3fa2b309ac62d8da2db74cd053c3","last_reissued_at":"2026-05-17T23:42:04.137922Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:04.137922Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Airways: Optimization-Based Planning of Quadrotor Trajectories according to High-Level User Goals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.HC","authors_text":"Benjamin Hepp, Christoph Gebhardt, Otmar Hilliges, Stefan Stevsic, Tobias Naegeli","submitted_at":"2019-06-27T14:14:51Z","abstract_excerpt":"In this paper we propose a computational design tool that al-lows end-users to create advanced quadrotor trajectories witha variety of application scenarios in mind. Our algorithm al-lows novice users to create quadrotor based use-cases withoutrequiring deep knowledge in either quadrotor control or theunderlying constraints of the target domain. To achieve thisgoal we propose an optimization-based method that gener-ates feasible trajectories which can be flown in the real world.Furthermore, the method incorporates high-level human ob-jectives into the planning of flight trajectories. An easy t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.11669","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":"1906.11669","created_at":"2026-05-17T23:42:04.138050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.11669v1","created_at":"2026-05-17T23:42:04.138050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.11669","created_at":"2026-05-17T23:42:04.138050+00:00"},{"alias_kind":"pith_short_12","alias_value":"COVKJWKT6SX5","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"COVKJWKT6SX52OXT","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"COVKJWKT","created_at":"2026-05-18T12:33:15.570797+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/COVKJWKT6SX52OXTRWWZMPRPLI","json":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI.json","graph_json":"https://pith.science/api/pith-number/COVKJWKT6SX52OXTRWWZMPRPLI/graph.json","events_json":"https://pith.science/api/pith-number/COVKJWKT6SX52OXTRWWZMPRPLI/events.json","paper":"https://pith.science/paper/COVKJWKT"},"agent_actions":{"view_html":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI","download_json":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI.json","view_paper":"https://pith.science/paper/COVKJWKT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.11669&json=true","fetch_graph":"https://pith.science/api/pith-number/COVKJWKT6SX52OXTRWWZMPRPLI/graph.json","fetch_events":"https://pith.science/api/pith-number/COVKJWKT6SX52OXTRWWZMPRPLI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI/action/storage_attestation","attest_author":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI/action/author_attestation","sign_citation":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI/action/citation_signature","submit_replication":"https://pith.science/pith/COVKJWKT6SX52OXTRWWZMPRPLI/action/replication_record"}},"created_at":"2026-05-17T23:42:04.138050+00:00","updated_at":"2026-05-17T23:42:04.138050+00:00"}