{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GN5T5W7C3OQHGCDD6373U6WWI2","short_pith_number":"pith:GN5T5W7C","schema_version":"1.0","canonical_sha256":"337b3edbe2dba0730863f6ffba7ad646ab1be20e51d2653f991282a9fca25d45","source":{"kind":"arxiv","id":"1909.09548","version":2},"attestation_state":"computed","paper":{"title":"An Efficient Sampling-based Method for Online Informative Path Planning in Unknown Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Juan Nieto, Lionel Ott, Lukas Schmid, Michael Pantic, Raghav Khanna, Roland Siegwart","submitted_at":"2019-09-20T15:07:14Z","abstract_excerpt":"The ability to plan informative paths online is essential to robot autonomy. In particular, sampling-based approaches are often used as they are capable of using arbitrary information gain formulations. However, they are prone to local minima, resulting in sub-optimal trajectories, and sometimes do not reach global coverage. In this paper, we present a new RRT*-inspired online informative path planning algorithm. Our method continuously expands a single tree of candidate trajectories and rewires segments to maintain the tree and refine intermediate trajectories. This allows the algorithm to ac"},"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":"1909.09548","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-09-20T15:07:14Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"ce0611e17126e4b9d760a663ca593f8ecb4654dde3ee24655abbcd5a22294f72","abstract_canon_sha256":"a7d97252037ab4bade5627cd01d0afc13a3c0eb2598992c5d5cd7436e8efa439"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:38:46.304353Z","signature_b64":"VM3JZgkA3jOkAlFpBx+womG+lq/rcjZWDYMu4L9GW+mmrAoULNFYDAMTYtH+BtpqmncKVvMwFjJbw025vVHhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"337b3edbe2dba0730863f6ffba7ad646ab1be20e51d2653f991282a9fca25d45","last_reissued_at":"2026-07-05T00:38:46.303961Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:38:46.303961Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Sampling-based Method for Online Informative Path Planning in Unknown Environments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Juan Nieto, Lionel Ott, Lukas Schmid, Michael Pantic, Raghav Khanna, Roland Siegwart","submitted_at":"2019-09-20T15:07:14Z","abstract_excerpt":"The ability to plan informative paths online is essential to robot autonomy. In particular, sampling-based approaches are often used as they are capable of using arbitrary information gain formulations. However, they are prone to local minima, resulting in sub-optimal trajectories, and sometimes do not reach global coverage. In this paper, we present a new RRT*-inspired online informative path planning algorithm. Our method continuously expands a single tree of candidate trajectories and rewires segments to maintain the tree and refine intermediate trajectories. This allows the algorithm to ac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.09548","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/1909.09548/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":"1909.09548","created_at":"2026-07-05T00:38:46.304030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.09548v2","created_at":"2026-07-05T00:38:46.304030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.09548","created_at":"2026-07-05T00:38:46.304030+00:00"},{"alias_kind":"pith_short_12","alias_value":"GN5T5W7C3OQH","created_at":"2026-07-05T00:38:46.304030+00:00"},{"alias_kind":"pith_short_16","alias_value":"GN5T5W7C3OQHGCDD","created_at":"2026-07-05T00:38:46.304030+00:00"},{"alias_kind":"pith_short_8","alias_value":"GN5T5W7C","created_at":"2026-07-05T00:38:46.304030+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/GN5T5W7C3OQHGCDD6373U6WWI2","json":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2.json","graph_json":"https://pith.science/api/pith-number/GN5T5W7C3OQHGCDD6373U6WWI2/graph.json","events_json":"https://pith.science/api/pith-number/GN5T5W7C3OQHGCDD6373U6WWI2/events.json","paper":"https://pith.science/paper/GN5T5W7C"},"agent_actions":{"view_html":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2","download_json":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2.json","view_paper":"https://pith.science/paper/GN5T5W7C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.09548&json=true","fetch_graph":"https://pith.science/api/pith-number/GN5T5W7C3OQHGCDD6373U6WWI2/graph.json","fetch_events":"https://pith.science/api/pith-number/GN5T5W7C3OQHGCDD6373U6WWI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2/action/storage_attestation","attest_author":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2/action/author_attestation","sign_citation":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2/action/citation_signature","submit_replication":"https://pith.science/pith/GN5T5W7C3OQHGCDD6373U6WWI2/action/replication_record"}},"created_at":"2026-07-05T00:38:46.304030+00:00","updated_at":"2026-07-05T00:38:46.304030+00:00"}