Learning Submodular Objectives for Team Environmental Monitoring
Nils Wilde, Armin Sadeghi, Stephen L. Smith

TL;DR
This paper introduces a framework for learning subjective reward functions in team routing problems, enabling robots to adapt to user preferences in environmental monitoring tasks through preference-based learning.
Contribution
It proposes a novel approach to learn unknown reward preferences via user rankings, addressing both deterministic and noisy user models in team orienteering problems.
Findings
Effective learning of user preferences improves routing decisions.
The framework reduces regret in both deterministic and noisy settings.
Experimental results demonstrate practical benefits in environmental monitoring.
Abstract
In this paper, we study the well-known team orienteering problem where a fleet of robots collects rewards by visiting locations. Usually, the rewards are assumed to be known to the robots; however, in applications such as environmental monitoring or scene reconstruction, the rewards are often subjective and specifying them is challenging. We propose a framework to learn the unknown preferences of the user by presenting alternative solutions to them, and the user provides a ranking on the proposed alternative solutions. We consider the two cases for the user: 1) a deterministic user which provides the optimal ranking for the alternative solutions, and 2) a noisy user which provides the optimal ranking according to an unknown probability distribution. For the deterministic user we propose a framework to minimize a bound on the maximum deviation from the optimal solution, namely regret. We…
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.
