SearcharxivSearch

arXiv · 2609.05765

Utility-Driven Spatial Data Sampling for UAV-Assisted Scientific Smart Farming

Abstract

Large smart-farming deployments generate continuous scientific data from spatially distributed sensors, including soil, humidity, temperature, crop-health, and pest-related measurements. In vast agricultural fields, however, an energy-constrained unmanned aerial vehicle (UAV) often cannot collect data from every sensor during each mission. Existing UAV-assisted collection methods typically optimize coverage, route length, data volume, or freshness, but they do not always distinguish between data that is merely available and data that is scientifically valuable. This poster introduces a utility-driven spatial sampling framework for UAV-assisted smart farming. The field is partitioned into grid cells, each sized according to the UAV ground coverage range. After an initial exploration phase, each cell receives a scientific utility score based on freshness, redundancy, anomaly likelihood, and model uncertainty. The UAV then selects and visits a subset of high-utility cells under battery and return-to-base constraints. The proposed framework reframes UAV-based collection as adaptive scientific data management rather than exhaustive sensing.

Explore related subjects

Keep this discovery

BibTeXRIS

Keiwan Soltani, Sajal K. Das. 2026-09-04. Utility-Driven Spatial Data Sampling for UAV-Assisted Scientific Smart Farming. https://arxiv.org/abs/2609.05765

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Self-Geometry: GT-Free and Plug-and-Play Test-Time Adaptation for Geometrically Consistent 3D Vision Foundation Models

Recent Vision Foundation Models (VFMs) predict depth, camera pose, and pointmap in a single forward pass without per-scene optimization, achieving strong generalization. However, enforcing explicit multi-view geometric consistency, e.g., through bundle adjustment, is computationally costly and is thus not imposed during VFM pretraining, so such inconsistency can arise. To address this, implicit self-consistency derived from model outputs (e.g., pointmaps, features), though enforced at test-time in prior work, delivers inherently limited performance gain, especially on scenes where the pretrained VFM is highly inaccurate. In contrast to this implicit signal, we propose Self-Geometry, a plug-and-play test-time adaptation pipeline that directly imposes explicit multi-view geometric constraints using 2D pixel correspondences as pseudo ground-truth. Our proposed Self-Geometry consists of Geometric Disentanglement Optimization, which combines Multi-View Consistency and Epipolar Consistency losses with Gradient Disentanglement to prevent gradient conflict; Frame Angular-Neighbor, a view sampler based on SO(3) geodesic distances for lightly imposing these constraints; and Lightweight TTA, which adapts VFMs via LoRA. Our method achieves consistent improvements in both pose and geometry estimation across six VFMs (VGGT, $π^3$, DA3-Giant/Large/Base/Small) and four benchmarks (7Scenes, ETH3D, ScanNet++, HiRoom).

cs.CV

Peer Oversight in Collective Decision Making

This article introduces peer $k$-oversight, a property of sequential collective decision mechanisms requiring at least $k$ agents to be responsible for every harmful outcome. It is shown that whenever $k$-oversight can be achieved by redistributing control over the decisions in a mechanism, it can be achieved using just $k$ agents. A polynomial-time algorithm is also presented that determines whether such a redistribution exists and, when it does, constructs one. These results establish peer oversight as a tractable design principle for multiagent decision-making systems.

cs.GT