{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7A7UF5VDWMIAPKFIVW3BMXONWN","short_pith_number":"pith:7A7UF5VD","schema_version":"1.0","canonical_sha256":"f83f42f6a3b31007a8a8adb6165dcdb3422a5a1084cbee78e02e0c1973ad4547","source":{"kind":"arxiv","id":"1302.0723","version":2},"attestation_state":"computed","paper":{"title":"Multi-Robot Informative Path Planning for Active Sensing of Environmental Phenomena: A Tale of Two Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","cs.RO"],"primary_cat":"cs.LG","authors_text":"John M. Dolan, Kian Hsiang Low, Nannan Cao","submitted_at":"2013-02-04T15:34:12Z","abstract_excerpt":"A key problem of robotic environmental sensing and monitoring is that of active sensing: How can a team of robots plan the most informative observation paths to minimize the uncertainty in modeling and predicting an environmental phenomenon? This paper presents two principled approaches to efficient information-theoretic path planning based on entropy and mutual information criteria for in situ active sensing of an important broad class of widely-occurring environmental phenomena called anisotropic fields. Our proposed algorithms are novel in addressing a trade-off between active sensing perfo"},"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":"1302.0723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-04T15:34:12Z","cross_cats_sorted":["cs.AI","cs.MA","cs.RO"],"title_canon_sha256":"4d8da188e15c3fd89805fbe503dcd6ea66ec48c7c275294b81cb78cde6169c00","abstract_canon_sha256":"2eca7bed3eecc57f10729a74117570a9cbade3c6bb1b4f82fa3493ef6c458267"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:26.984175Z","signature_b64":"dqtfk8tTJ1FeYFF/rLeK8xBagLoIV9YK4dGkP95e/zrPu2KZpRGJz+CtPK3SYaurmgZ2PzkQOHrZ0mQX/FGlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f83f42f6a3b31007a8a8adb6165dcdb3422a5a1084cbee78e02e0c1973ad4547","last_reissued_at":"2026-05-18T03:34:26.983613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:26.983613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Robot Informative Path Planning for Active Sensing of Environmental Phenomena: A Tale of Two Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MA","cs.RO"],"primary_cat":"cs.LG","authors_text":"John M. Dolan, Kian Hsiang Low, Nannan Cao","submitted_at":"2013-02-04T15:34:12Z","abstract_excerpt":"A key problem of robotic environmental sensing and monitoring is that of active sensing: How can a team of robots plan the most informative observation paths to minimize the uncertainty in modeling and predicting an environmental phenomenon? This paper presents two principled approaches to efficient information-theoretic path planning based on entropy and mutual information criteria for in situ active sensing of an important broad class of widely-occurring environmental phenomena called anisotropic fields. Our proposed algorithms are novel in addressing a trade-off between active sensing perfo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0723","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":"1302.0723","created_at":"2026-05-18T03:34:26.983688+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0723v2","created_at":"2026-05-18T03:34:26.983688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0723","created_at":"2026-05-18T03:34:26.983688+00:00"},{"alias_kind":"pith_short_12","alias_value":"7A7UF5VDWMIA","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7A7UF5VDWMIAPKFI","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7A7UF5VD","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.23327","citing_title":"An Efficient Beam Search Algorithm for Active Perception in Mobile Robotics","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN","json":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN.json","graph_json":"https://pith.science/api/pith-number/7A7UF5VDWMIAPKFIVW3BMXONWN/graph.json","events_json":"https://pith.science/api/pith-number/7A7UF5VDWMIAPKFIVW3BMXONWN/events.json","paper":"https://pith.science/paper/7A7UF5VD"},"agent_actions":{"view_html":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN","download_json":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN.json","view_paper":"https://pith.science/paper/7A7UF5VD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0723&json=true","fetch_graph":"https://pith.science/api/pith-number/7A7UF5VDWMIAPKFIVW3BMXONWN/graph.json","fetch_events":"https://pith.science/api/pith-number/7A7UF5VDWMIAPKFIVW3BMXONWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN/action/storage_attestation","attest_author":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN/action/author_attestation","sign_citation":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN/action/citation_signature","submit_replication":"https://pith.science/pith/7A7UF5VDWMIAPKFIVW3BMXONWN/action/replication_record"}},"created_at":"2026-05-18T03:34:26.983688+00:00","updated_at":"2026-05-18T03:34:26.983688+00:00"}