{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RT5QPC43VLRZG52MXOZISY22ZC","short_pith_number":"pith:RT5QPC43","schema_version":"1.0","canonical_sha256":"8cfb078b9baae393774cbbb289635ac88cd4fb3c03a8520a7b8638c4753254bf","source":{"kind":"arxiv","id":"1605.04151","version":2},"attestation_state":"computed","paper":{"title":"Perception-aware Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Forster, Davide Scaramuzza, Gabriele Costante, Jeffrey Delmerico, Paolo Valigi","submitted_at":"2016-05-13T12:23:12Z","abstract_excerpt":"In this paper, we give a double twist to the problem of planning under uncertainty. State-of-the-art planners seek to minimize the localization uncertainty by only considering the geometric structure of the scene. In this paper, we argue that motion planning for vision-controlled robots should be perception aware in that the robot should also favor texture-rich areas to minimize the localization uncertainty during a goal-reaching task. Thus, we describe how to optimally incorporate the photometric information (i.e., texture) of the scene, in addition to the the geometric one, to compute the un"},"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":"1605.04151","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2016-05-13T12:23:12Z","cross_cats_sorted":[],"title_canon_sha256":"e805c60a9826f0bd22667fe9818c50d8f0d1537e98aa1f480c6f282fff92f9a2","abstract_canon_sha256":"6b4cfd3592fad291e417ba34f2f69041b22adf6774944a3577e8a034d6f8d315"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:01.322928Z","signature_b64":"7JNidcfTksVy5Oz79LB9aqyaOvAKbRHIz/9lXNj+LNphmQA/vvaYu3+fKblHZT56UmwkC0GsM7p0JSLDIfVaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8cfb078b9baae393774cbbb289635ac88cd4fb3c03a8520a7b8638c4753254bf","last_reissued_at":"2026-05-18T00:51:01.322291Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:01.322291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perception-aware Path Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christian Forster, Davide Scaramuzza, Gabriele Costante, Jeffrey Delmerico, Paolo Valigi","submitted_at":"2016-05-13T12:23:12Z","abstract_excerpt":"In this paper, we give a double twist to the problem of planning under uncertainty. State-of-the-art planners seek to minimize the localization uncertainty by only considering the geometric structure of the scene. In this paper, we argue that motion planning for vision-controlled robots should be perception aware in that the robot should also favor texture-rich areas to minimize the localization uncertainty during a goal-reaching task. Thus, we describe how to optimally incorporate the photometric information (i.e., texture) of the scene, in addition to the the geometric one, to compute the un"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04151","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":"1605.04151","created_at":"2026-05-18T00:51:01.322381+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04151v2","created_at":"2026-05-18T00:51:01.322381+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04151","created_at":"2026-05-18T00:51:01.322381+00:00"},{"alias_kind":"pith_short_12","alias_value":"RT5QPC43VLRZ","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RT5QPC43VLRZG52M","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RT5QPC43","created_at":"2026-05-18T12:30:41.710351+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.13052","citing_title":"BOW: Bayesian Optimization over Windows for Motion Planning in Complex Environments","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2604.03450","citing_title":"High-Order Matrix Control Barrier Functions: Well-Posedness and Feasibility via Matrix Relative Degree","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC","json":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC.json","graph_json":"https://pith.science/api/pith-number/RT5QPC43VLRZG52MXOZISY22ZC/graph.json","events_json":"https://pith.science/api/pith-number/RT5QPC43VLRZG52MXOZISY22ZC/events.json","paper":"https://pith.science/paper/RT5QPC43"},"agent_actions":{"view_html":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC","download_json":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC.json","view_paper":"https://pith.science/paper/RT5QPC43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04151&json=true","fetch_graph":"https://pith.science/api/pith-number/RT5QPC43VLRZG52MXOZISY22ZC/graph.json","fetch_events":"https://pith.science/api/pith-number/RT5QPC43VLRZG52MXOZISY22ZC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC/action/storage_attestation","attest_author":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC/action/author_attestation","sign_citation":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC/action/citation_signature","submit_replication":"https://pith.science/pith/RT5QPC43VLRZG52MXOZISY22ZC/action/replication_record"}},"created_at":"2026-05-18T00:51:01.322381+00:00","updated_at":"2026-05-18T00:51:01.322381+00:00"}