{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:V2DUL3HQOQ7LGPJIL3MTFYPQCY","short_pith_number":"pith:V2DUL3HQ","schema_version":"1.0","canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","source":{"kind":"arxiv","id":"1504.08053","version":2},"attestation_state":"computed","paper":{"title":"Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Edward Schmerling, Lucas Janson, Marco Pavone","submitted_at":"2015-04-30T01:02:49Z","abstract_excerpt":"This article presents a novel approach, named MCMP (Monte Carlo Motion Planning), to the problem of motion planning under uncertainty, i.e., to the problem of computing a low-cost path that fulfills probabilistic collision avoidance constraints. MCMP estimates the collision probability (CP) of a given path by sampling via Monte Carlo the execution of a reference tracking controller (in this paper we consider LQG). The key algorithmic contribution of this paper is the design of statistical variance-reduction techniques, namely control variates and importance sampling, to make such a sampling pr"},"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":"1504.08053","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-30T01:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"a60e8c4f9791167e43ef49250a505886f0a2e30154fe353e4d90015cfa85e03a","abstract_canon_sha256":"140ad05bc046c7c80f11fa4e3d35f186fad7d19678d498272c2758cac4c19ba1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:01.951332Z","signature_b64":"u9Y79WxFs/mtOaN/nc6fi6jnwddxsrn73HA0/JbVT1fulZFx1mExYzVKOSG5tv9KjHTT3DaiP+Z72FwmsBjYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae8745ecf0743eb33d285ed932e1f01625b5bad8a2b93a21f1ca6c56ec662e9f","last_reissued_at":"2026-05-18T02:00:01.950889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:01.950889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monte Carlo Motion Planning for Robot Trajectory Optimization Under Uncertainty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Edward Schmerling, Lucas Janson, Marco Pavone","submitted_at":"2015-04-30T01:02:49Z","abstract_excerpt":"This article presents a novel approach, named MCMP (Monte Carlo Motion Planning), to the problem of motion planning under uncertainty, i.e., to the problem of computing a low-cost path that fulfills probabilistic collision avoidance constraints. MCMP estimates the collision probability (CP) of a given path by sampling via Monte Carlo the execution of a reference tracking controller (in this paper we consider LQG). The key algorithmic contribution of this paper is the design of statistical variance-reduction techniques, namely control variates and importance sampling, to make such a sampling pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.08053","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":""},"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":"1504.08053","created_at":"2026-05-18T02:00:01.950955+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.08053v2","created_at":"2026-05-18T02:00:01.950955+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.08053","created_at":"2026-05-18T02:00:01.950955+00:00"},{"alias_kind":"pith_short_12","alias_value":"V2DUL3HQOQ7L","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"V2DUL3HQOQ7LGPJI","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"V2DUL3HQ","created_at":"2026-05-18T12:29:44.643036+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/V2DUL3HQOQ7LGPJIL3MTFYPQCY","json":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY.json","graph_json":"https://pith.science/api/pith-number/V2DUL3HQOQ7LGPJIL3MTFYPQCY/graph.json","events_json":"https://pith.science/api/pith-number/V2DUL3HQOQ7LGPJIL3MTFYPQCY/events.json","paper":"https://pith.science/paper/V2DUL3HQ"},"agent_actions":{"view_html":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY","download_json":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY.json","view_paper":"https://pith.science/paper/V2DUL3HQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.08053&json=true","fetch_graph":"https://pith.science/api/pith-number/V2DUL3HQOQ7LGPJIL3MTFYPQCY/graph.json","fetch_events":"https://pith.science/api/pith-number/V2DUL3HQOQ7LGPJIL3MTFYPQCY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/action/storage_attestation","attest_author":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/action/author_attestation","sign_citation":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/action/citation_signature","submit_replication":"https://pith.science/pith/V2DUL3HQOQ7LGPJIL3MTFYPQCY/action/replication_record"}},"created_at":"2026-05-18T02:00:01.950955+00:00","updated_at":"2026-05-18T02:00:01.950955+00:00"}