{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:L4H2BM5VITB7DMLMLA6PNZR665","short_pith_number":"pith:L4H2BM5V","schema_version":"1.0","canonical_sha256":"5f0fa0b3b544c3f1b16c583cf6e63ef7460b99a4a3c461ca90ee653dabb5d04c","source":{"kind":"arxiv","id":"2202.03947","version":1},"attestation_state":"computed","paper":{"title":"Minimum-Time Quadrotor Waypoint Flight in Cluttered Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Davide Scaramuzza, Robert Penicka","submitted_at":"2022-02-08T15:54:19Z","abstract_excerpt":"We tackle the problem of planning a minimum-time trajectory for a quadrotor over a sequence of specified waypoints in the presence of obstacles while exploiting the full quadrotor dynamics. This problem is crucial for autonomous search and rescue and drone racing scenarios but was, so far, unaddressed by the robotics community \\emph{in its entirety} due to the challenges of minimizing time in the presence of the non-convex constraints posed by collision avoidance. Early works relied on simplified dynamics or polynomial trajectory representations that did not exploit the full actuator potential"},"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":"2202.03947","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2022-02-08T15:54:19Z","cross_cats_sorted":[],"title_canon_sha256":"4c5b6c07cf53d56fc1e1fd2a31589e856fa5142e7b94e6078819a906dd385d65","abstract_canon_sha256":"96f1c0a0f777c0ecdea8505309e44bb7c2cb41b35e493645a6265997a1bf9673"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:55:21.941947Z","signature_b64":"1kZXR5yHFpYpvnPUhOCQ27VkjIrFqymhFNDcWLftw55ryW1jjCokLitgJxRfFuqZNxkkz0PnXbd+MIn5APGYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f0fa0b3b544c3f1b16c583cf6e63ef7460b99a4a3c461ca90ee653dabb5d04c","last_reissued_at":"2026-07-05T03:55:21.941211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:55:21.941211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimum-Time Quadrotor Waypoint Flight in Cluttered Environments","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Davide Scaramuzza, Robert Penicka","submitted_at":"2022-02-08T15:54:19Z","abstract_excerpt":"We tackle the problem of planning a minimum-time trajectory for a quadrotor over a sequence of specified waypoints in the presence of obstacles while exploiting the full quadrotor dynamics. This problem is crucial for autonomous search and rescue and drone racing scenarios but was, so far, unaddressed by the robotics community \\emph{in its entirety} due to the challenges of minimizing time in the presence of the non-convex constraints posed by collision avoidance. Early works relied on simplified dynamics or polynomial trajectory representations that did not exploit the full actuator potential"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.03947","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2202.03947/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":"2202.03947","created_at":"2026-07-05T03:55:21.941368+00:00"},{"alias_kind":"arxiv_version","alias_value":"2202.03947v1","created_at":"2026-07-05T03:55:21.941368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.03947","created_at":"2026-07-05T03:55:21.941368+00:00"},{"alias_kind":"pith_short_12","alias_value":"L4H2BM5VITB7","created_at":"2026-07-05T03:55:21.941368+00:00"},{"alias_kind":"pith_short_16","alias_value":"L4H2BM5VITB7DMLM","created_at":"2026-07-05T03:55:21.941368+00:00"},{"alias_kind":"pith_short_8","alias_value":"L4H2BM5V","created_at":"2026-07-05T03:55:21.941368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.01200","citing_title":"FastBridge: Closing the Model-Based Realization Gap in Safety Filters on 3D Gaussian Splatting for Fast Quadrotor Flight","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665","json":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665.json","graph_json":"https://pith.science/api/pith-number/L4H2BM5VITB7DMLMLA6PNZR665/graph.json","events_json":"https://pith.science/api/pith-number/L4H2BM5VITB7DMLMLA6PNZR665/events.json","paper":"https://pith.science/paper/L4H2BM5V"},"agent_actions":{"view_html":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665","download_json":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665.json","view_paper":"https://pith.science/paper/L4H2BM5V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2202.03947&json=true","fetch_graph":"https://pith.science/api/pith-number/L4H2BM5VITB7DMLMLA6PNZR665/graph.json","fetch_events":"https://pith.science/api/pith-number/L4H2BM5VITB7DMLMLA6PNZR665/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665/action/storage_attestation","attest_author":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665/action/author_attestation","sign_citation":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665/action/citation_signature","submit_replication":"https://pith.science/pith/L4H2BM5VITB7DMLMLA6PNZR665/action/replication_record"}},"created_at":"2026-07-05T03:55:21.941368+00:00","updated_at":"2026-07-05T03:55:21.941368+00:00"}