{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:ODUIB3JFP4IKWCROBNQAHHRGND","short_pith_number":"pith:ODUIB3JF","schema_version":"1.0","canonical_sha256":"70e880ed257f10ab0a2e0b60039e2668c486cf7bf4dcea8bbb25c30763033bb9","source":{"kind":"arxiv","id":"2502.16882","version":1},"attestation_state":"computed","paper":{"title":"Primitive-Planner: An Ultra Lightweight Quadrotor Planner with Time-optimal Primitives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fei Gao, Jialiang Hou, Jialin Ji, Neng Pan, Yuxiang Guan, Zhepei Wang, Zhongxue Gan","submitted_at":"2025-02-24T06:29:30Z","abstract_excerpt":"It is a significant requirement for a quadrotor trajectory planner to simultaneously guarantee trajectory quality and system lightweight. Many researchers focus on this problem, but there's still a gap between their performance and our common wish. In this paper, we propose an ultra lightweight quadrotor planner with time-optimal primitives. Firstly, a novel motion primitive library is proposed to generate time-optimal and dynamical feasible trajectories offline. Secondly, we propose a fast collision checking method with a deterministic time consumption, independent of the sampling resolution "},"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":"2502.16882","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-02-24T06:29:30Z","cross_cats_sorted":[],"title_canon_sha256":"92583017d4a2c9bc9cd60a7f691014995fd7047b7aa940f87e27d40c073dd178","abstract_canon_sha256":"cdd874db29434663f2f5d41b08d4bad9790686c65cb00665f6723f2d34f68753"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:01.677986Z","signature_b64":"dqtlGluKbJC7tXubVzQZ+YkWw5WvtpHRdPLyoQJiTT0uH0lJCka6l+5znMrHoepjTOyxm2BpI0y3vvZMvgVGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e880ed257f10ab0a2e0b60039e2668c486cf7bf4dcea8bbb25c30763033bb9","last_reissued_at":"2026-07-05T10:19:01.677457Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:01.677457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Primitive-Planner: An Ultra Lightweight Quadrotor Planner with Time-optimal Primitives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fei Gao, Jialiang Hou, Jialin Ji, Neng Pan, Yuxiang Guan, Zhepei Wang, Zhongxue Gan","submitted_at":"2025-02-24T06:29:30Z","abstract_excerpt":"It is a significant requirement for a quadrotor trajectory planner to simultaneously guarantee trajectory quality and system lightweight. Many researchers focus on this problem, but there's still a gap between their performance and our common wish. In this paper, we propose an ultra lightweight quadrotor planner with time-optimal primitives. Firstly, a novel motion primitive library is proposed to generate time-optimal and dynamical feasible trajectories offline. Secondly, we propose a fast collision checking method with a deterministic time consumption, independent of the sampling resolution "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.16882","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/2502.16882/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":"2502.16882","created_at":"2026-07-05T10:19:01.677527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.16882v1","created_at":"2026-07-05T10:19:01.677527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.16882","created_at":"2026-07-05T10:19:01.677527+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODUIB3JFP4IK","created_at":"2026-07-05T10:19:01.677527+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODUIB3JFP4IKWCRO","created_at":"2026-07-05T10:19:01.677527+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODUIB3JF","created_at":"2026-07-05T10:19:01.677527+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/ODUIB3JFP4IKWCROBNQAHHRGND","json":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND.json","graph_json":"https://pith.science/api/pith-number/ODUIB3JFP4IKWCROBNQAHHRGND/graph.json","events_json":"https://pith.science/api/pith-number/ODUIB3JFP4IKWCROBNQAHHRGND/events.json","paper":"https://pith.science/paper/ODUIB3JF"},"agent_actions":{"view_html":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND","download_json":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND.json","view_paper":"https://pith.science/paper/ODUIB3JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.16882&json=true","fetch_graph":"https://pith.science/api/pith-number/ODUIB3JFP4IKWCROBNQAHHRGND/graph.json","fetch_events":"https://pith.science/api/pith-number/ODUIB3JFP4IKWCROBNQAHHRGND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND/action/storage_attestation","attest_author":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND/action/author_attestation","sign_citation":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND/action/citation_signature","submit_replication":"https://pith.science/pith/ODUIB3JFP4IKWCROBNQAHHRGND/action/replication_record"}},"created_at":"2026-07-05T10:19:01.677527+00:00","updated_at":"2026-07-05T10:19:01.677527+00:00"}