{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HATEQ37UQ2U6CXZ25TATMSPEHT","short_pith_number":"pith:HATEQ37U","schema_version":"1.0","canonical_sha256":"3826486ff486a9e15f3aecc13649e43ceb3bd12270587b6d992c0b10d8cb5aa1","source":{"kind":"arxiv","id":"1709.05443","version":1},"attestation_state":"computed","paper":{"title":"A Kinodynamic Aggressive Trajectory Planner For Narrow Passages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Ding Zhao, Dmitry Berenson, Yaohui Guo, Zhaolun Su","submitted_at":"2017-09-16T01:22:36Z","abstract_excerpt":"Planning a path for a nonholonomic robot is a challenging topic in motion planning and it becomes more difficult when the desired path contains narrow passages. This kind of scenario can arise, for instance, when quadcopters search a collapsed building after a natural disaster. Choosing the quadcopter as the target platform, this paper proposes the Kinodynamic Aggressive Trajectory (KAT) motion planning algorithm, which aims to compute aggressive trajectories for narrow passages under nonholonomic constraints. This type of maneuvers is necessary because the dynamics of quadcopters entail that "},"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":"1709.05443","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SY","submitted_at":"2017-09-16T01:22:36Z","cross_cats_sorted":[],"title_canon_sha256":"21ae1a41bcf71324a8b49b5b395d6efd6a1206fec546af8ffde0fd57f509efbd","abstract_canon_sha256":"17d6cef37f22f5b5a0609fbacfe403723a65f7dd7884b3676d35fafc18f16aee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:00.750358Z","signature_b64":"+Q5eL+IWm1GEYy7vZljY1YtQ4/FeYk5kv5ZoyPnD3R7z1xSosKkSunZACBtozxz4VAADa867rMXcFw3I9HdWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3826486ff486a9e15f3aecc13649e43ceb3bd12270587b6d992c0b10d8cb5aa1","last_reissued_at":"2026-05-18T00:35:00.749568Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:00.749568Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Kinodynamic Aggressive Trajectory Planner For Narrow Passages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SY","authors_text":"Ding Zhao, Dmitry Berenson, Yaohui Guo, Zhaolun Su","submitted_at":"2017-09-16T01:22:36Z","abstract_excerpt":"Planning a path for a nonholonomic robot is a challenging topic in motion planning and it becomes more difficult when the desired path contains narrow passages. This kind of scenario can arise, for instance, when quadcopters search a collapsed building after a natural disaster. Choosing the quadcopter as the target platform, this paper proposes the Kinodynamic Aggressive Trajectory (KAT) motion planning algorithm, which aims to compute aggressive trajectories for narrow passages under nonholonomic constraints. This type of maneuvers is necessary because the dynamics of quadcopters entail that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05443","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":"1709.05443","created_at":"2026-05-18T00:35:00.749692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.05443v1","created_at":"2026-05-18T00:35:00.749692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05443","created_at":"2026-05-18T00:35:00.749692+00:00"},{"alias_kind":"pith_short_12","alias_value":"HATEQ37UQ2U6","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"HATEQ37UQ2U6CXZ2","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"HATEQ37U","created_at":"2026-05-18T12:31:18.294218+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/HATEQ37UQ2U6CXZ25TATMSPEHT","json":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT.json","graph_json":"https://pith.science/api/pith-number/HATEQ37UQ2U6CXZ25TATMSPEHT/graph.json","events_json":"https://pith.science/api/pith-number/HATEQ37UQ2U6CXZ25TATMSPEHT/events.json","paper":"https://pith.science/paper/HATEQ37U"},"agent_actions":{"view_html":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT","download_json":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT.json","view_paper":"https://pith.science/paper/HATEQ37U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.05443&json=true","fetch_graph":"https://pith.science/api/pith-number/HATEQ37UQ2U6CXZ25TATMSPEHT/graph.json","fetch_events":"https://pith.science/api/pith-number/HATEQ37UQ2U6CXZ25TATMSPEHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT/action/storage_attestation","attest_author":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT/action/author_attestation","sign_citation":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT/action/citation_signature","submit_replication":"https://pith.science/pith/HATEQ37UQ2U6CXZ25TATMSPEHT/action/replication_record"}},"created_at":"2026-05-18T00:35:00.749692+00:00","updated_at":"2026-05-18T00:35:00.749692+00:00"}