{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6VZ3U6BQLTO6UPOVPPIIBCITQZ","short_pith_number":"pith:6VZ3U6BQ","schema_version":"1.0","canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","source":{"kind":"arxiv","id":"1902.10182","version":1},"attestation_state":"computed","paper":{"title":"Obstacle-aware Adaptive Informative Path Planning for UAV-based Target Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ajith Anil Meera, Alexander Millane, Marija Popovic, Roland Siegwart","submitted_at":"2019-02-26T19:46:42Z","abstract_excerpt":"Target search with unmanned aerial vehicles (UAVs) is relevant problem to many scenarios, e.g., search and rescue (SaR). However, a key challenge is planning paths for maximal search efficiency given flight time constraints. To address this, we propose the Obstacle-aware Adaptive Informative Path Planning (OA-IPP) algorithm for target search in cluttered environments using UAVs. Our approach leverages a layered planning strategy using a Gaussian Process (GP)-based model of target occupancy to generate informative paths in continuous 3D space. Within this framework, we introduce an adaptive rep"},"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":"1902.10182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-02-26T19:46:42Z","cross_cats_sorted":[],"title_canon_sha256":"012c3ee0eb4c8203278e12681b2a3c5d75d32701601e0ea74c103e9c7f5e3c0e","abstract_canon_sha256":"0a0da162c37fb221a8c1e09c1d034b29e657a4fda8c3dc2691e9238ca272d94c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:31.548047Z","signature_b64":"VRoAnYv8CRAsG4NKIXj3pde3L2bxcm//bymynKahyCJIojzJeViQMfRB+Cz3A5IWUas4y4/ozRVRwlbIna1aBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f573ba78305cddea3dd57bd0808913866f8031c135e0523964248c324cf6ac2c","last_reissued_at":"2026-05-17T23:52:31.547511Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:31.547511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Obstacle-aware Adaptive Informative Path Planning for UAV-based Target Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ajith Anil Meera, Alexander Millane, Marija Popovic, Roland Siegwart","submitted_at":"2019-02-26T19:46:42Z","abstract_excerpt":"Target search with unmanned aerial vehicles (UAVs) is relevant problem to many scenarios, e.g., search and rescue (SaR). However, a key challenge is planning paths for maximal search efficiency given flight time constraints. To address this, we propose the Obstacle-aware Adaptive Informative Path Planning (OA-IPP) algorithm for target search in cluttered environments using UAVs. Our approach leverages a layered planning strategy using a Gaussian Process (GP)-based model of target occupancy to generate informative paths in continuous 3D space. Within this framework, we introduce an adaptive rep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.10182","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":"1902.10182","created_at":"2026-05-17T23:52:31.547596+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.10182v1","created_at":"2026-05-17T23:52:31.547596+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.10182","created_at":"2026-05-17T23:52:31.547596+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VZ3U6BQLTO6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VZ3U6BQLTO6UPOV","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VZ3U6BQ","created_at":"2026-05-18T12:33:10.108867+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/6VZ3U6BQLTO6UPOVPPIIBCITQZ","json":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ.json","graph_json":"https://pith.science/api/pith-number/6VZ3U6BQLTO6UPOVPPIIBCITQZ/graph.json","events_json":"https://pith.science/api/pith-number/6VZ3U6BQLTO6UPOVPPIIBCITQZ/events.json","paper":"https://pith.science/paper/6VZ3U6BQ"},"agent_actions":{"view_html":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ","download_json":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ.json","view_paper":"https://pith.science/paper/6VZ3U6BQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.10182&json=true","fetch_graph":"https://pith.science/api/pith-number/6VZ3U6BQLTO6UPOVPPIIBCITQZ/graph.json","fetch_events":"https://pith.science/api/pith-number/6VZ3U6BQLTO6UPOVPPIIBCITQZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/action/storage_attestation","attest_author":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/action/author_attestation","sign_citation":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/action/citation_signature","submit_replication":"https://pith.science/pith/6VZ3U6BQLTO6UPOVPPIIBCITQZ/action/replication_record"}},"created_at":"2026-05-17T23:52:31.547596+00:00","updated_at":"2026-05-17T23:52:31.547596+00:00"}