{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NDJ5TTZIPYEB6ED5NYGZA4WPP5","short_pith_number":"pith:NDJ5TTZI","schema_version":"1.0","canonical_sha256":"68d3d9cf287e081f107d6e0d9072cf7f7f2ff92118d7b5cae4baf93b54778e47","source":{"kind":"arxiv","id":"1804.05804","version":1},"attestation_state":"computed","paper":{"title":"Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Lucas Janson, Marco Pavone, Tommy Hu","submitted_at":"2018-04-16T17:24:26Z","abstract_excerpt":"This paper addresses the problem of planning a safe (i.e., collision-free) trajectory from an initial state to a goal region when the obstacle space is a-priori unknown and is incrementally revealed online, e.g., through line-of-sight perception. Despite its ubiquitous nature, this formulation of motion planning has received relatively little theoretical investigation, as opposed to the setup where the environment is assumed known. A fundamental challenge is that, unlike motion planning with known obstacles, it is not even clear what an optimal policy to strive for is. Our contribution is thre"},"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":"1804.05804","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-04-16T17:24:26Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"138ee41a7f3792ee15db377632074f975858027764151bf49608cad78f6997d8","abstract_canon_sha256":"a108f47b60da2c94a2c6cb7c0f60a8a68a7256ef3b93070f06ed9f4bc00742b5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:27.378777Z","signature_b64":"UPZ8KZuZtfp/h+E+DD3uxaw5wWkyRZ+hv5fH4H7aTEBA4mNwRNQ9SEolamucTce5yJpZwAY63zGypAza7al8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68d3d9cf287e081f107d6e0d9072cf7f7f2ff92118d7b5cae4baf93b54778e47","last_reissued_at":"2026-05-18T00:18:27.378152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:27.378152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Safe Motion Planning in Unknown Environments: Optimality Benchmarks and Tractable Policies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.RO","authors_text":"Lucas Janson, Marco Pavone, Tommy Hu","submitted_at":"2018-04-16T17:24:26Z","abstract_excerpt":"This paper addresses the problem of planning a safe (i.e., collision-free) trajectory from an initial state to a goal region when the obstacle space is a-priori unknown and is incrementally revealed online, e.g., through line-of-sight perception. Despite its ubiquitous nature, this formulation of motion planning has received relatively little theoretical investigation, as opposed to the setup where the environment is assumed known. A fundamental challenge is that, unlike motion planning with known obstacles, it is not even clear what an optimal policy to strive for is. Our contribution is thre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.05804","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":"1804.05804","created_at":"2026-05-18T00:18:27.378247+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.05804v1","created_at":"2026-05-18T00:18:27.378247+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.05804","created_at":"2026-05-18T00:18:27.378247+00:00"},{"alias_kind":"pith_short_12","alias_value":"NDJ5TTZIPYEB","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NDJ5TTZIPYEB6ED5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NDJ5TTZI","created_at":"2026-05-18T12:32:40.477152+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/NDJ5TTZIPYEB6ED5NYGZA4WPP5","json":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5.json","graph_json":"https://pith.science/api/pith-number/NDJ5TTZIPYEB6ED5NYGZA4WPP5/graph.json","events_json":"https://pith.science/api/pith-number/NDJ5TTZIPYEB6ED5NYGZA4WPP5/events.json","paper":"https://pith.science/paper/NDJ5TTZI"},"agent_actions":{"view_html":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5","download_json":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5.json","view_paper":"https://pith.science/paper/NDJ5TTZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.05804&json=true","fetch_graph":"https://pith.science/api/pith-number/NDJ5TTZIPYEB6ED5NYGZA4WPP5/graph.json","fetch_events":"https://pith.science/api/pith-number/NDJ5TTZIPYEB6ED5NYGZA4WPP5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5/action/storage_attestation","attest_author":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5/action/author_attestation","sign_citation":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5/action/citation_signature","submit_replication":"https://pith.science/pith/NDJ5TTZIPYEB6ED5NYGZA4WPP5/action/replication_record"}},"created_at":"2026-05-18T00:18:27.378247+00:00","updated_at":"2026-05-18T00:18:27.378247+00:00"}