{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZH4ULOEGHURPU2HNJSGBGEVSIG","short_pith_number":"pith:ZH4ULOEG","schema_version":"1.0","canonical_sha256":"c9f945b8863d22fa68ed4c8c1312b2418fce6f39321405d510e59eab716d4f0f","source":{"kind":"arxiv","id":"2009.10484","version":2},"attestation_state":"computed","paper":{"title":"Asymptotically Optimal Sampling-Based Motion Planning Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan D. Gammell, Marlin P. Strub","submitted_at":"2020-09-22T12:13:55Z","abstract_excerpt":"Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also optimize a cost function, such as path length.\n  Formal path-quality guarantees for continuously valued search spaces are an active area of research interest. Recent results have proven that some sampling-based planning methods probabilistically converge toward the optimal solution as computational effort approaches infinity. This survey summarizes the assu"},"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":"2009.10484","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-09-22T12:13:55Z","cross_cats_sorted":[],"title_canon_sha256":"59f659de2505b9dc1cbc8a3409e7a85c6179610ca106b18e62a619fc7bf5840c","abstract_canon_sha256":"84adc8825586a1f39e63e0abbd378f3bbcc58856d60fe1c04a56f1b100022dea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:06:44.525483Z","signature_b64":"sufmlPG8TAHauR5i8JlTgjD+vZC5qxZHjUyZTt89l/cOHf+s7O/wkMDEQkmEetr8yUZXqnwBoiDFl3XOkmW/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9f945b8863d22fa68ed4c8c1312b2418fce6f39321405d510e59eab716d4f0f","last_reissued_at":"2026-07-05T02:06:44.525019Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:06:44.525019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Asymptotically Optimal Sampling-Based Motion Planning Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Jonathan D. Gammell, Marlin P. Strub","submitted_at":"2020-09-22T12:13:55Z","abstract_excerpt":"Motion planning is a fundamental problem in autonomous robotics that requires finding a path to a specified goal that avoids obstacles and takes into account a robot's limitations and constraints. It is often desirable for this path to also optimize a cost function, such as path length.\n  Formal path-quality guarantees for continuously valued search spaces are an active area of research interest. Recent results have proven that some sampling-based planning methods probabilistically converge toward the optimal solution as computational effort approaches infinity. This survey summarizes the assu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.10484","kind":"arxiv","version":2},"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/2009.10484/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":"2009.10484","created_at":"2026-07-05T02:06:44.525078+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.10484v2","created_at":"2026-07-05T02:06:44.525078+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.10484","created_at":"2026-07-05T02:06:44.525078+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZH4ULOEGHURP","created_at":"2026-07-05T02:06:44.525078+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZH4ULOEGHURPU2HN","created_at":"2026-07-05T02:06:44.525078+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZH4ULOEG","created_at":"2026-07-05T02:06:44.525078+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/ZH4ULOEGHURPU2HNJSGBGEVSIG","json":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG.json","graph_json":"https://pith.science/api/pith-number/ZH4ULOEGHURPU2HNJSGBGEVSIG/graph.json","events_json":"https://pith.science/api/pith-number/ZH4ULOEGHURPU2HNJSGBGEVSIG/events.json","paper":"https://pith.science/paper/ZH4ULOEG"},"agent_actions":{"view_html":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG","download_json":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG.json","view_paper":"https://pith.science/paper/ZH4ULOEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.10484&json=true","fetch_graph":"https://pith.science/api/pith-number/ZH4ULOEGHURPU2HNJSGBGEVSIG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZH4ULOEGHURPU2HNJSGBGEVSIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG/action/storage_attestation","attest_author":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG/action/author_attestation","sign_citation":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG/action/citation_signature","submit_replication":"https://pith.science/pith/ZH4ULOEGHURPU2HNJSGBGEVSIG/action/replication_record"}},"created_at":"2026-07-05T02:06:44.525078+00:00","updated_at":"2026-07-05T02:06:44.525078+00:00"}