Adaptive policies for perimeter surveillance problems

•Sequential search problem is formulated as a combinatorial multi-armed bandit.•We consider a novel setting with action-dependent filtering of Poisson rewards.•A new upper confidence bound approach based on martingale inequalities is proposed.•We derive order-optimal upper bounds on the regret of the approach.•We verify its strong performance and robustness in extensive numerical experiments.