{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JB2JRSH5Q43QBIICA2S573JRIG","short_pith_number":"pith:JB2JRSH5","schema_version":"1.0","canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","source":{"kind":"arxiv","id":"1105.1186","version":1},"attestation_state":"computed","paper":{"title":"Sampling-based Algorithms for Optimal Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Emilio Frazzoli, Sertac Karaman","submitted_at":"2011-05-05T22:25:22Z","abstract_excerpt":"During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as "},"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":"1105.1186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2011-05-05T22:25:22Z","cross_cats_sorted":[],"title_canon_sha256":"20c8b63b54573dd67f46511f6fdefbbd705862b33f8c24bbc9cc70f7a8ebe7f2","abstract_canon_sha256":"a5a4cf657004ac998ff0c99fda6f41053fa7769cb3b9eeabd4c8412e02e05156"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:40.920189Z","signature_b64":"+hgnnGZ/gNbMaPeYG9E9dtbmfxZwJpXlZSwxyx68AAaKGP9Sj+w0ij2zH9OJG2dBEbEsKIzAwLxwnVwhaDJiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"487498c8fd873700a10206a5dfed31419e5189db4edc7924dc512405fa1a99b2","last_reissued_at":"2026-05-18T04:22:40.919764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:40.919764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sampling-based Algorithms for Optimal Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Emilio Frazzoli, Sertac Karaman","submitted_at":"2011-05-05T22:25:22Z","abstract_excerpt":"During the last decade, sampling-based path planning algorithms, such as Probabilistic RoadMaps (PRM) and Rapidly-exploring Random Trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to the formal analysis of the quality of the solution returned by such algorithms, e.g., as a function of the number of samples. The purpose of this paper is to fill this gap, by rigorously analyzing the asymptotic behavior of the cost of the solution returned by stochastic sampling-based algorithms as "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.1186","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":"1105.1186","created_at":"2026-05-18T04:22:40.919834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.1186v1","created_at":"2026-05-18T04:22:40.919834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.1186","created_at":"2026-05-18T04:22:40.919834+00:00"},{"alias_kind":"pith_short_12","alias_value":"JB2JRSH5Q43Q","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JB2JRSH5Q43QBIIC","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JB2JRSH5","created_at":"2026-05-18T12:26:32.869790+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2607.01378","citing_title":"Neuro-Symbolic Safety Guidance for Vision-Language-Action Models via Constrained Flow Matching","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"2511.12022","citing_title":"SBAMP: Sampling Based Adaptive Motion Planning","ref_index":1,"is_internal_anchor":true},{"citing_arxiv_id":"2605.05236","citing_title":"Topology-Driven Anti-Entanglement Control for Soft Robots","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21249","citing_title":"Reasoning About Traversability: Language-Guided Off-Road 3D Trajectory Planning","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG","json":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG.json","graph_json":"https://pith.science/api/pith-number/JB2JRSH5Q43QBIICA2S573JRIG/graph.json","events_json":"https://pith.science/api/pith-number/JB2JRSH5Q43QBIICA2S573JRIG/events.json","paper":"https://pith.science/paper/JB2JRSH5"},"agent_actions":{"view_html":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG","download_json":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG.json","view_paper":"https://pith.science/paper/JB2JRSH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.1186&json=true","fetch_graph":"https://pith.science/api/pith-number/JB2JRSH5Q43QBIICA2S573JRIG/graph.json","fetch_events":"https://pith.science/api/pith-number/JB2JRSH5Q43QBIICA2S573JRIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/action/storage_attestation","attest_author":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/action/author_attestation","sign_citation":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/action/citation_signature","submit_replication":"https://pith.science/pith/JB2JRSH5Q43QBIICA2S573JRIG/action/replication_record"}},"created_at":"2026-05-18T04:22:40.919834+00:00","updated_at":"2026-05-18T04:22:40.919834+00:00"}