{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MJJ46LEGHWBFGGEI3DMTXWCYSC","short_pith_number":"pith:MJJ46LEG","schema_version":"1.0","canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","source":{"kind":"arxiv","id":"1703.00194","version":1},"attestation_state":"computed","paper":{"title":"Stochastic Functional Gradient for Motion Planning in Continuous Occupancy Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fabio Ramos, Gilad Francis, Lionel Ott","submitted_at":"2017-03-01T09:36:49Z","abstract_excerpt":"Safe path planning is a crucial component in autonomous robotics. The many approaches to find a collision free path can be categorically divided into trajectory optimisers and sampling-based methods. When planning using occupancy maps, the sampling-based approach is the prevalent method. The main drawback of such techniques is that the reasoning about the expected cost of a plan is limited to the search heuristic used by each method. We introduce a novel planning method based on trajectory optimisation to plan safe and efficient paths in continuous occupancy maps. We extend the expressiveness "},"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":"1703.00194","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-03-01T09:36:49Z","cross_cats_sorted":[],"title_canon_sha256":"17537d2a56a34517194401e563410ab92605bf2e2925650469711d84ffa6491d","abstract_canon_sha256":"986a04fa73e3f092d1ff9e2d3d8ac73dbf36365cd525acff57e07550f05695a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:45.659981Z","signature_b64":"ZRUelR9OXk4EwKE1ETiQQSODVcRWavb3QzCRTSzLoSspkug9Iy7yQ7sz97drYM49wvAkiTkYzZqFiH+GfZ1bBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6253cf2c863d82531888d8d93bd85890a467ba7a320ac3965a4d672514f142aa","last_reissued_at":"2026-05-18T00:49:45.659347Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:45.659347Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stochastic Functional Gradient for Motion Planning in Continuous Occupancy Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Fabio Ramos, Gilad Francis, Lionel Ott","submitted_at":"2017-03-01T09:36:49Z","abstract_excerpt":"Safe path planning is a crucial component in autonomous robotics. The many approaches to find a collision free path can be categorically divided into trajectory optimisers and sampling-based methods. When planning using occupancy maps, the sampling-based approach is the prevalent method. The main drawback of such techniques is that the reasoning about the expected cost of a plan is limited to the search heuristic used by each method. We introduce a novel planning method based on trajectory optimisation to plan safe and efficient paths in continuous occupancy maps. We extend the expressiveness "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.00194","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":"1703.00194","created_at":"2026-05-18T00:49:45.659436+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.00194v1","created_at":"2026-05-18T00:49:45.659436+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.00194","created_at":"2026-05-18T00:49:45.659436+00:00"},{"alias_kind":"pith_short_12","alias_value":"MJJ46LEGHWBF","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MJJ46LEGHWBFGGEI","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MJJ46LEG","created_at":"2026-05-18T12:31:31.346846+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/MJJ46LEGHWBFGGEI3DMTXWCYSC","json":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC.json","graph_json":"https://pith.science/api/pith-number/MJJ46LEGHWBFGGEI3DMTXWCYSC/graph.json","events_json":"https://pith.science/api/pith-number/MJJ46LEGHWBFGGEI3DMTXWCYSC/events.json","paper":"https://pith.science/paper/MJJ46LEG"},"agent_actions":{"view_html":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC","download_json":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC.json","view_paper":"https://pith.science/paper/MJJ46LEG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.00194&json=true","fetch_graph":"https://pith.science/api/pith-number/MJJ46LEGHWBFGGEI3DMTXWCYSC/graph.json","fetch_events":"https://pith.science/api/pith-number/MJJ46LEGHWBFGGEI3DMTXWCYSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/action/storage_attestation","attest_author":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/action/author_attestation","sign_citation":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/action/citation_signature","submit_replication":"https://pith.science/pith/MJJ46LEGHWBFGGEI3DMTXWCYSC/action/replication_record"}},"created_at":"2026-05-18T00:49:45.659436+00:00","updated_at":"2026-05-18T00:49:45.659436+00:00"}