{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UG6Z2F643KTCVNGKSJOEBSFWFH","short_pith_number":"pith:UG6Z2F64","schema_version":"1.0","canonical_sha256":"a1bd9d17dcdaa62ab4ca925c40c8b629e75b9ae6c63d6b111447ac9471f49216","source":{"kind":"arxiv","id":"1809.07863","version":1},"attestation_state":"computed","paper":{"title":"Decentralized dynamic task allocation for UAVs with limited communication range","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Jesus Cerquides, Juan A. Rodriguez-Aguilar, Marc Pujol-Gonzalez, Milind Tambe, Pedro Meseguer","submitted_at":"2018-08-31T13:09:22Z","abstract_excerpt":"We present the Limited-range Online Routing Problem (LORP), which involves a team of Unmanned Aerial Vehicles (UAVs) with limited communication range that must autonomously coordinate to service task requests. We first show a general approach to cast this dynamic problem as a sequence of decentralized task allocation problems. Then we present two solutions both based on modeling the allocation task as a Markov Random Field to subsequently assess decisions by means of the decentralized Max-Sum algorithm. Our first solution assumes independence between requests, whereas our second solution also "},"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":"1809.07863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2018-08-31T13:09:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1866789d57f18a9836d703772866ddfc793989f9ac779db0dacdf2c2833007d3","abstract_canon_sha256":"4541d98373a244b6f9a7154f29cadefa394ecc16d28f572f56b31ee59b196112"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:11.077848Z","signature_b64":"MBb2fJckGHZQFRdcfy5zxn96/ITu0uQbTJBH2g2ysguX4UBIRhftfpnbEZ1dWGl1OFYhL9pkMWM4S3RAU9naDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1bd9d17dcdaa62ab4ca925c40c8b629e75b9ae6c63d6b111447ac9471f49216","last_reissued_at":"2026-05-18T00:05:11.077092Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:11.077092Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decentralized dynamic task allocation for UAVs with limited communication range","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NI","authors_text":"Jesus Cerquides, Juan A. Rodriguez-Aguilar, Marc Pujol-Gonzalez, Milind Tambe, Pedro Meseguer","submitted_at":"2018-08-31T13:09:22Z","abstract_excerpt":"We present the Limited-range Online Routing Problem (LORP), which involves a team of Unmanned Aerial Vehicles (UAVs) with limited communication range that must autonomously coordinate to service task requests. We first show a general approach to cast this dynamic problem as a sequence of decentralized task allocation problems. Then we present two solutions both based on modeling the allocation task as a Markov Random Field to subsequently assess decisions by means of the decentralized Max-Sum algorithm. Our first solution assumes independence between requests, whereas our second solution also "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.07863","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":"1809.07863","created_at":"2026-05-18T00:05:11.077208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.07863v1","created_at":"2026-05-18T00:05:11.077208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.07863","created_at":"2026-05-18T00:05:11.077208+00:00"},{"alias_kind":"pith_short_12","alias_value":"UG6Z2F643KTC","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UG6Z2F643KTCVNGK","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UG6Z2F64","created_at":"2026-05-18T12:32:56.356000+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/UG6Z2F643KTCVNGKSJOEBSFWFH","json":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH.json","graph_json":"https://pith.science/api/pith-number/UG6Z2F643KTCVNGKSJOEBSFWFH/graph.json","events_json":"https://pith.science/api/pith-number/UG6Z2F643KTCVNGKSJOEBSFWFH/events.json","paper":"https://pith.science/paper/UG6Z2F64"},"agent_actions":{"view_html":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH","download_json":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH.json","view_paper":"https://pith.science/paper/UG6Z2F64","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.07863&json=true","fetch_graph":"https://pith.science/api/pith-number/UG6Z2F643KTCVNGKSJOEBSFWFH/graph.json","fetch_events":"https://pith.science/api/pith-number/UG6Z2F643KTCVNGKSJOEBSFWFH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH/action/storage_attestation","attest_author":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH/action/author_attestation","sign_citation":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH/action/citation_signature","submit_replication":"https://pith.science/pith/UG6Z2F643KTCVNGKSJOEBSFWFH/action/replication_record"}},"created_at":"2026-05-18T00:05:11.077208+00:00","updated_at":"2026-05-18T00:05:11.077208+00:00"}