{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FITP2CTK2KOJJ5Y4GKDPP3SWRU","short_pith_number":"pith:FITP2CTK","schema_version":"1.0","canonical_sha256":"2a26fd0a6ad29c94f71c3286f7ee568d1de06a51633d09ce465ed133719865ac","source":{"kind":"arxiv","id":"2003.02609","version":2},"attestation_state":"computed","paper":{"title":"UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"David Gesbert, Harald Bayerlein, Marco Caccamo, Mirco Theile, Richard Nai","submitted_at":"2020-03-05T13:43:47Z","abstract_excerpt":"Coverage path planning (CPP) is the task of designing a trajectory that enables a mobile agent to travel over every point of an area of interest. We propose a new method to control an unmanned aerial vehicle (UAV) carrying a camera on a CPP mission with random start positions and multiple options for landing positions in an environment containing no-fly zones. While numerous approaches have been proposed to solve similar CPP problems, we leverage end-to-end reinforcement learning (RL) to learn a control policy that generalizes over varying power constraints for the UAV. Despite recent improvem"},"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":"2003.02609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-03-05T13:43:47Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"a2c5329478d7e4a669b10cc62bd34e0e761d2df03d12fc86a2f1aae2d6dcd6f6","abstract_canon_sha256":"797bc55929d4f3e47118ecdcd6c179ce6c48f6d45663c4f5c658a025609884e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:14:41.212944Z","signature_b64":"JDZYqe42dkAKn01y5Up4N6aSqI5WBtUsbeaQ8YhawHbZM40unno+dHbldjvarb6fCnEE5n0m3B2IK7uMM5lQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a26fd0a6ad29c94f71c3286f7ee568d1de06a51633d09ce465ed133719865ac","last_reissued_at":"2026-07-05T02:14:41.212461Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:14:41.212461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"UAV Coverage Path Planning under Varying Power Constraints using Deep Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"David Gesbert, Harald Bayerlein, Marco Caccamo, Mirco Theile, Richard Nai","submitted_at":"2020-03-05T13:43:47Z","abstract_excerpt":"Coverage path planning (CPP) is the task of designing a trajectory that enables a mobile agent to travel over every point of an area of interest. We propose a new method to control an unmanned aerial vehicle (UAV) carrying a camera on a CPP mission with random start positions and multiple options for landing positions in an environment containing no-fly zones. While numerous approaches have been proposed to solve similar CPP problems, we leverage end-to-end reinforcement learning (RL) to learn a control policy that generalizes over varying power constraints for the UAV. Despite recent improvem"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.02609","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/2003.02609/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":"2003.02609","created_at":"2026-07-05T02:14:41.212526+00:00"},{"alias_kind":"arxiv_version","alias_value":"2003.02609v2","created_at":"2026-07-05T02:14:41.212526+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.02609","created_at":"2026-07-05T02:14:41.212526+00:00"},{"alias_kind":"pith_short_12","alias_value":"FITP2CTK2KOJ","created_at":"2026-07-05T02:14:41.212526+00:00"},{"alias_kind":"pith_short_16","alias_value":"FITP2CTK2KOJJ5Y4","created_at":"2026-07-05T02:14:41.212526+00:00"},{"alias_kind":"pith_short_8","alias_value":"FITP2CTK","created_at":"2026-07-05T02:14:41.212526+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/FITP2CTK2KOJJ5Y4GKDPP3SWRU","json":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU.json","graph_json":"https://pith.science/api/pith-number/FITP2CTK2KOJJ5Y4GKDPP3SWRU/graph.json","events_json":"https://pith.science/api/pith-number/FITP2CTK2KOJJ5Y4GKDPP3SWRU/events.json","paper":"https://pith.science/paper/FITP2CTK"},"agent_actions":{"view_html":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU","download_json":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU.json","view_paper":"https://pith.science/paper/FITP2CTK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2003.02609&json=true","fetch_graph":"https://pith.science/api/pith-number/FITP2CTK2KOJJ5Y4GKDPP3SWRU/graph.json","fetch_events":"https://pith.science/api/pith-number/FITP2CTK2KOJJ5Y4GKDPP3SWRU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU/action/storage_attestation","attest_author":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU/action/author_attestation","sign_citation":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU/action/citation_signature","submit_replication":"https://pith.science/pith/FITP2CTK2KOJJ5Y4GKDPP3SWRU/action/replication_record"}},"created_at":"2026-07-05T02:14:41.212526+00:00","updated_at":"2026-07-05T02:14:41.212526+00:00"}