Near-optimal irrevocable sample selection for periodic data streams with applications to marine robotics
Genevieve Flaspohler, Nicholas Roy, Yogesh Girdhar

TL;DR
This paper introduces a near-optimal sample selection algorithm for real-time monitoring of periodic data streams, addressing limitations of existing methods in structured, real-world environments like robotics and environmental sensing.
Contribution
The paper presents a novel periodic secretary algorithm that effectively selects representative samples from periodic phenomena with performance guarantees, unlike prior algorithms requiring random data order.
Findings
Algorithm performs near-optimally on real environmental data
Selects phytoplankton sampling locations effectively
Applicable to various real-time sensing scenarios
Abstract
We consider the task of monitoring spatiotemporal phenomena in real-time by deploying limited sampling resources at locations of interest irrevocably and without knowledge of future observations. This task can be modeled as an instance of the classical secretary problem. Although this problem has been studied extensively in theoretical domains, existing algorithms require that data arrive in random order to provide performance guarantees. These algorithms will perform arbitrarily poorly on data streams such as those encountered in robotics and environmental monitoring domains, which tend to have spatiotemporal structure. We focus on the problem of selecting representative samples from phenomena with periodic structure and introduce a novel sample selection algorithm that recovers a near-optimal sample set according to any monotone submodular utility function. We evaluate our algorithm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
