{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:YRKLXVAKWIZRVTOJPACRITVIGR","short_pith_number":"pith:YRKLXVAK","schema_version":"1.0","canonical_sha256":"c454bbd40ab2331acdc97805144ea8347b32126b74781fecef2b00ba94170a93","source":{"kind":"arxiv","id":"2401.15674","version":1},"attestation_state":"computed","paper":{"title":"Cooperative Receding Horizon 3D Coverage Control with a Team of Networked Aerial Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christos G. Panayiotou, Marios M. Polycarpou, Panayiotis Kolios, Savvas Papaioannou, Theocharis Theocharides","submitted_at":"2024-01-28T14:43:03Z","abstract_excerpt":"This work proposes a receding horizon coverage control approach which allows multiple autonomous aerial agents to work cooperatively in order cover the total surface area of a 3D object of interest. The cooperative coverage problem which is posed in this work as an optimal control problem, jointly optimizes the agents' kinematic and camera control inputs, while considering coupling constraints amongst the team of agents which aim at minimizing the duplication of work. To generate look-ahead coverage trajectories over a finite planning horizon, the proposed approach integrates visibility constr"},"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":"2401.15674","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-28T14:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"ea630e701b5556079bab5cf086562ad307417b1017b38b103db0bba0b278c806","abstract_canon_sha256":"600c80d812adbb226367c0b88e6a40cd9b02bee7c424f43006f296f0d86ff829"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:38:38.362796Z","signature_b64":"1F6FkyumtYKyFeTAGTDWquGmentyTpsyKJ94XnAk0B1q8+mo3+fHYdRFw//GNFoLoSAP25vQsX0uJQWm+RRcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c454bbd40ab2331acdc97805144ea8347b32126b74781fecef2b00ba94170a93","last_reissued_at":"2026-07-05T07:38:38.362378Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:38:38.362378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cooperative Receding Horizon 3D Coverage Control with a Team of Networked Aerial Agents","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Christos G. Panayiotou, Marios M. Polycarpou, Panayiotis Kolios, Savvas Papaioannou, Theocharis Theocharides","submitted_at":"2024-01-28T14:43:03Z","abstract_excerpt":"This work proposes a receding horizon coverage control approach which allows multiple autonomous aerial agents to work cooperatively in order cover the total surface area of a 3D object of interest. The cooperative coverage problem which is posed in this work as an optimal control problem, jointly optimizes the agents' kinematic and camera control inputs, while considering coupling constraints amongst the team of agents which aim at minimizing the duplication of work. To generate look-ahead coverage trajectories over a finite planning horizon, the proposed approach integrates visibility constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.15674","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2401.15674/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":"2401.15674","created_at":"2026-07-05T07:38:38.362445+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.15674v1","created_at":"2026-07-05T07:38:38.362445+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.15674","created_at":"2026-07-05T07:38:38.362445+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRKLXVAKWIZR","created_at":"2026-07-05T07:38:38.362445+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRKLXVAKWIZRVTOJ","created_at":"2026-07-05T07:38:38.362445+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRKLXVAK","created_at":"2026-07-05T07:38:38.362445+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/YRKLXVAKWIZRVTOJPACRITVIGR","json":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR.json","graph_json":"https://pith.science/api/pith-number/YRKLXVAKWIZRVTOJPACRITVIGR/graph.json","events_json":"https://pith.science/api/pith-number/YRKLXVAKWIZRVTOJPACRITVIGR/events.json","paper":"https://pith.science/paper/YRKLXVAK"},"agent_actions":{"view_html":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR","download_json":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR.json","view_paper":"https://pith.science/paper/YRKLXVAK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.15674&json=true","fetch_graph":"https://pith.science/api/pith-number/YRKLXVAKWIZRVTOJPACRITVIGR/graph.json","fetch_events":"https://pith.science/api/pith-number/YRKLXVAKWIZRVTOJPACRITVIGR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR/action/storage_attestation","attest_author":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR/action/author_attestation","sign_citation":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR/action/citation_signature","submit_replication":"https://pith.science/pith/YRKLXVAKWIZRVTOJPACRITVIGR/action/replication_record"}},"created_at":"2026-07-05T07:38:38.362445+00:00","updated_at":"2026-07-05T07:38:38.362445+00:00"}