{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:7X5TS3FGLMG7NI5ZIWIQ6PIMCS","short_pith_number":"pith:7X5TS3FG","schema_version":"1.0","canonical_sha256":"fdfb396ca65b0df6a3b945910f3d0c14a5417fbb488e9ec63f176cac53e23757","source":{"kind":"arxiv","id":"2211.06801","version":1},"attestation_state":"computed","paper":{"title":"BTO-RRT: A rapid, optimal, smooth and point cloud-based path planning algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Falko Kuester, Jiaqi Ma, Thomas R. Bewley, Zhaoliang Zheng","submitted_at":"2022-11-13T03:46:00Z","abstract_excerpt":"This paper explores a rapid, optimal smooth path-planning algorithm for robots (e.g., autonomous vehicles) in point cloud environments. Derivative maps such as dense point clouds, mesh maps, Octomaps, etc. are frequently used for path planning purposes. A bi-directional target-oriented point planning algorithm, directly using point clouds to compute the optimized and dynamically feasible trajectories, is presented in this paper. This approach searches for obstacle-free, low computational cost, smooth, and dynamically feasible paths by analyzing a point cloud of the target environment, using a "},"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":"2211.06801","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-11-13T03:46:00Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"f8b533c6c253f4ddab141944f7247ed4336631f9f3fa7882c563336380a2cad7","abstract_canon_sha256":"1931f4f23c4258625f347527d1a9c3fa3c6be35b07ff09b951eb5bd0e699cb45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:15:45.763918Z","signature_b64":"iKdqWacT/tYC1TSkkxbysbFJPzYjo+vfP5IOemT17YA6Xl1YMQGPKRd7iFDy0qZyxBiNZ50DI7OHijEXQR02DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdfb396ca65b0df6a3b945910f3d0c14a5417fbb488e9ec63f176cac53e23757","last_reissued_at":"2026-07-05T05:15:45.763431Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:15:45.763431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BTO-RRT: A rapid, optimal, smooth and point cloud-based path planning algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Falko Kuester, Jiaqi Ma, Thomas R. Bewley, Zhaoliang Zheng","submitted_at":"2022-11-13T03:46:00Z","abstract_excerpt":"This paper explores a rapid, optimal smooth path-planning algorithm for robots (e.g., autonomous vehicles) in point cloud environments. Derivative maps such as dense point clouds, mesh maps, Octomaps, etc. are frequently used for path planning purposes. A bi-directional target-oriented point planning algorithm, directly using point clouds to compute the optimized and dynamically feasible trajectories, is presented in this paper. This approach searches for obstacle-free, low computational cost, smooth, and dynamically feasible paths by analyzing a point cloud of the target environment, using a "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.06801","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/2211.06801/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":"2211.06801","created_at":"2026-07-05T05:15:45.763484+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.06801v1","created_at":"2026-07-05T05:15:45.763484+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.06801","created_at":"2026-07-05T05:15:45.763484+00:00"},{"alias_kind":"pith_short_12","alias_value":"7X5TS3FGLMG7","created_at":"2026-07-05T05:15:45.763484+00:00"},{"alias_kind":"pith_short_16","alias_value":"7X5TS3FGLMG7NI5Z","created_at":"2026-07-05T05:15:45.763484+00:00"},{"alias_kind":"pith_short_8","alias_value":"7X5TS3FG","created_at":"2026-07-05T05:15:45.763484+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/7X5TS3FGLMG7NI5ZIWIQ6PIMCS","json":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS.json","graph_json":"https://pith.science/api/pith-number/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/graph.json","events_json":"https://pith.science/api/pith-number/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/events.json","paper":"https://pith.science/paper/7X5TS3FG"},"agent_actions":{"view_html":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS","download_json":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS.json","view_paper":"https://pith.science/paper/7X5TS3FG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.06801&json=true","fetch_graph":"https://pith.science/api/pith-number/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/graph.json","fetch_events":"https://pith.science/api/pith-number/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/action/storage_attestation","attest_author":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/action/author_attestation","sign_citation":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/action/citation_signature","submit_replication":"https://pith.science/pith/7X5TS3FGLMG7NI5ZIWIQ6PIMCS/action/replication_record"}},"created_at":"2026-07-05T05:15:45.763484+00:00","updated_at":"2026-07-05T05:15:45.763484+00:00"}