Papers › UAV Routing for Enhancing the Performance of a Classifier-in-the-loop

UAV Routing for Enhancing the Performance of a Classifier-in-the-loop

13 Oct 2023arXiv:2310.08828links table onlyarchive 2025-07-28

Deepak Prakash Kumar, Pranav Rajbhandari, Loy McGuire, Swaroop Darbha, Donald Sofge

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

Some human-machine systems are designed so that machines (robots) gather and deliver data to remotely located operators (humans) through an interface in order to aid them in classification. The performance of a human as a (binary) classifier-in-the-loop is characterized by probabilities of correctly classifying objects of type T and F. These two probabilities depend on the dwell time, d, spent collecting information at a point of interest (POI or interchangeably, target). The information gain associated with collecting information at a target is then a function of dwell time d and discounted by the revisit time, R, i.e., the duration between consecutive revisits to the same target. The objective of the problem of routing for classification is to optimally route the vehicles and determine the optimal dwell time at each target so as to maximize the total discounted information gain while visiting every target at least once. In this paper, we make a simplifying assumption that the information gain is discounted exponentially by the revisit time; this assumption enables one to decouple the problem of routing with the problem of determining optimal dwell time at each target for a single vehicle problem. For the multi-vehicle problem, we provide a fast heuristic to obtain the allocation of targets to each vehicle and the corresponding dwell time.

PaperPDFCode

Code

pranavraj575/UAV_routing_classification officialmentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections