{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YYGRCAR6AWKLJEPWGPYDH3UFFF","short_pith_number":"pith:YYGRCAR6","schema_version":"1.0","canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","source":{"kind":"arxiv","id":"1308.0189","version":4},"attestation_state":"computed","paper":{"title":"Asymptotically near-optimal RRT for fast, high-quality, motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Oren Salzman","submitted_at":"2013-08-01T13:25:21Z","abstract_excerpt":"We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a solution that is within an approximation factor of 1+epsilon of the optimal solution. Our algorithm allows for a continuous interpolation between the fast RRT algorithm and the asymptotically optimal RRT* and RRG algorithms. When the approximation factor is 1 (i.e., no approximation is allowed), LBT-RRT behaves like RRG. When the approximation factor is unbounded, LBT-RRT behaves like RRT. In between, LBT-RRT is shown"},"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":"1308.0189","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2013-08-01T13:25:21Z","cross_cats_sorted":[],"title_canon_sha256":"fd628973dcea85aaefe79de80d0f716e9e4fcc482511be506462012c3e40e7fb","abstract_canon_sha256":"5b61237bc709428fd0528d13f27c772e010381173e50ce8bef224af4e2ae5d28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:40.551622Z","signature_b64":"yOmAX3wu/RinXER2yPXddfX+Cbl27dXpWPo6dAJf3sEhapV8vilXfQ3Q5Yb8z3j45hR29S/hEFPGEV08pJXICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c60d11023e0594b491f633f033ee852975da4fe7b8af1a119429a0d3c96abd4e","last_reissued_at":"2026-05-18T02:25:40.550563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:40.550563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically near-optimal RRT for fast, high-quality, motion planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dan Halperin, Oren Salzman","submitted_at":"2013-08-01T13:25:21Z","abstract_excerpt":"We present Lower Bound Tree-RRT (LBT-RRT), a single-query sampling-based algorithm that is asymptotically near-optimal. Namely, the solution extracted from LBT-RRT converges to a solution that is within an approximation factor of 1+epsilon of the optimal solution. Our algorithm allows for a continuous interpolation between the fast RRT algorithm and the asymptotically optimal RRT* and RRG algorithms. When the approximation factor is 1 (i.e., no approximation is allowed), LBT-RRT behaves like RRG. When the approximation factor is unbounded, LBT-RRT behaves like RRT. In between, LBT-RRT is shown"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.0189","kind":"arxiv","version":4},"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":"1308.0189","created_at":"2026-05-18T02:25:40.551167+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.0189v4","created_at":"2026-05-18T02:25:40.551167+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.0189","created_at":"2026-05-18T02:25:40.551167+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYGRCAR6AWKL","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYGRCAR6AWKLJEPW","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYGRCAR6","created_at":"2026-05-18T12:28:09.283467+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/YYGRCAR6AWKLJEPWGPYDH3UFFF","json":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF.json","graph_json":"https://pith.science/api/pith-number/YYGRCAR6AWKLJEPWGPYDH3UFFF/graph.json","events_json":"https://pith.science/api/pith-number/YYGRCAR6AWKLJEPWGPYDH3UFFF/events.json","paper":"https://pith.science/paper/YYGRCAR6"},"agent_actions":{"view_html":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF","download_json":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF.json","view_paper":"https://pith.science/paper/YYGRCAR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.0189&json=true","fetch_graph":"https://pith.science/api/pith-number/YYGRCAR6AWKLJEPWGPYDH3UFFF/graph.json","fetch_events":"https://pith.science/api/pith-number/YYGRCAR6AWKLJEPWGPYDH3UFFF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/action/storage_attestation","attest_author":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/action/author_attestation","sign_citation":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/action/citation_signature","submit_replication":"https://pith.science/pith/YYGRCAR6AWKLJEPWGPYDH3UFFF/action/replication_record"}},"created_at":"2026-05-18T02:25:40.551167+00:00","updated_at":"2026-05-18T02:25:40.551167+00:00"}