{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:OJQJJUXRKRVOFAS5Y4HNBGTDOM","short_pith_number":"pith:OJQJJUXR","schema_version":"1.0","canonical_sha256":"726094d2f1546ae2825dc70ed09a6373289fbf521b680a106fd0573dc0767209","source":{"kind":"arxiv","id":"2005.07237","version":2},"attestation_state":"computed","paper":{"title":"Autonomous Planning for Multiple Aerial Cinematographers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"\\'Angel Montes-Romero, An\\'ibal Ollero, Arturo Torres-Gonz\\'alez, Jes\\'us Capit\\'an, Jos\\'e-Miguel D\\'iaz-B\\'a\\~nez, Luis-Evaristo Caraballo","submitted_at":"2020-05-14T19:53:31Z","abstract_excerpt":"This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjecture that the problem is NP-hard, we consider a discretization version, and propose a graph-based algorithm that can find an optimal solution of the discrete problem for a single UAV in polynomial time. Then, a greedy strategy is applied to solve the problem sequentially for multiple UAVs. We demons"},"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":"2005.07237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2020-05-14T19:53:31Z","cross_cats_sorted":[],"title_canon_sha256":"45673a25c26b8912642b2ce2b534040a4510990ce51762484777db1a2d06cbd6","abstract_canon_sha256":"57383742e4b0a0e8a522c9eb99ea27927fe23a2eda0161b5d7fc9bd84051774e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:12.322733Z","signature_b64":"y3Clysp/X/sF3g+NM6eDoD7e65xtmdtjNGUIc9pWPFRg0IJCeLRoJNzgHyfU5hGZYIghHJeiiKdJJptpeDvXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"726094d2f1546ae2825dc70ed09a6373289fbf521b680a106fd0573dc0767209","last_reissued_at":"2026-07-05T02:30:12.322231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:12.322231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Autonomous Planning for Multiple Aerial Cinematographers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"\\'Angel Montes-Romero, An\\'ibal Ollero, Arturo Torres-Gonz\\'alez, Jes\\'us Capit\\'an, Jos\\'e-Miguel D\\'iaz-B\\'a\\~nez, Luis-Evaristo Caraballo","submitted_at":"2020-05-14T19:53:31Z","abstract_excerpt":"This paper proposes a planning algorithm for autonomous media production with multiple Unmanned Aerial Vehicles (UAVs) in outdoor events. Given filming tasks specified by a media Director, we formulate an optimization problem to maximize the filming time considering battery constraints. As we conjecture that the problem is NP-hard, we consider a discretization version, and propose a graph-based algorithm that can find an optimal solution of the discrete problem for a single UAV in polynomial time. Then, a greedy strategy is applied to solve the problem sequentially for multiple UAVs. We demons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.07237","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/2005.07237/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":"2005.07237","created_at":"2026-07-05T02:30:12.322289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.07237v2","created_at":"2026-07-05T02:30:12.322289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.07237","created_at":"2026-07-05T02:30:12.322289+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJQJJUXRKRVO","created_at":"2026-07-05T02:30:12.322289+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJQJJUXRKRVOFAS5","created_at":"2026-07-05T02:30:12.322289+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJQJJUXR","created_at":"2026-07-05T02:30:12.322289+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/OJQJJUXRKRVOFAS5Y4HNBGTDOM","json":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM.json","graph_json":"https://pith.science/api/pith-number/OJQJJUXRKRVOFAS5Y4HNBGTDOM/graph.json","events_json":"https://pith.science/api/pith-number/OJQJJUXRKRVOFAS5Y4HNBGTDOM/events.json","paper":"https://pith.science/paper/OJQJJUXR"},"agent_actions":{"view_html":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM","download_json":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM.json","view_paper":"https://pith.science/paper/OJQJJUXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.07237&json=true","fetch_graph":"https://pith.science/api/pith-number/OJQJJUXRKRVOFAS5Y4HNBGTDOM/graph.json","fetch_events":"https://pith.science/api/pith-number/OJQJJUXRKRVOFAS5Y4HNBGTDOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM/action/storage_attestation","attest_author":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM/action/author_attestation","sign_citation":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM/action/citation_signature","submit_replication":"https://pith.science/pith/OJQJJUXRKRVOFAS5Y4HNBGTDOM/action/replication_record"}},"created_at":"2026-07-05T02:30:12.322289+00:00","updated_at":"2026-07-05T02:30:12.322289+00:00"}