Probabilistically Faulty Searching on a Half-Line

02/18/2020
by   Anthony Bonato, et al.
0

We study p-Faulty Search, a variant of the classic cow-path optimization problem, where a unit speed robot searches the half-line (or 1-ray) for a hidden item. The searcher is probabilistically faulty, and detection of the item with each visitation is an independent Bernoulli trial whose probability of success p is known. The objective is to minimize the worst case expected detection time, relative to the distance of the hidden item to the origin. A variation of the same problem was first proposed by Gal in 1980. Then in 2003, Alpern and Gal [The Theory of Search Games and Rendezvous] proposed a so-called monotone solution for searching the line (2-rays); that is, a trajectory in which the newly searched space increases monotonically in each ray and in each iteration. Moreover, they conjectured that an optimal trajectory for the 2-rays problem must be monotone. We disprove this conjecture when the search domain is the half-line (1-ray). We provide a lower bound for all monotone algorithms, which we also match with an upper bound. Our main contribution is the design and analysis of a sequence of refined search strategies, outside the family of monotone algorithms, which we call t-sub-monotone algorithms. Such algorithms induce performance that is strictly decreasing with t, and for all p ∈ (0,1). The value of t quantifies, in a certain sense, how much our algorithms deviate from being monotone, demonstrating that monotone algorithms are sub-optimal when searching the half-line.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2022

On the Complexity of Half-Guarding Monotone Polygons

We consider a variant of the art gallery problem where all guards are li...
research
10/26/2021

Efficient solvers for Armijo's backtracking problem

Backtracking is an inexact line search procedure that selects the first ...
research
07/10/2022

Opposing Half Guards

We study the art gallery problem for opposing half guards: guards that c...
research
03/05/2019

Strongly Exponential Separation Between Monotone VP and Monotone VNP

We show that there is a sequence of explicit multilinear polynomials P_n...
research
03/27/2023

Overcoming Probabilistic Faults in Disoriented Linear Search

We consider search by mobile agents for a hidden, idle target, placed on...
research
10/05/1998

Anytime Coalition Structure Generation with Worst Case Guarantees

Coalition formation is a key topic in multiagent systems. One would pref...
research
04/27/2015

Further Connections Between Contract-Scheduling and Ray-Searching Problems

This paper addresses two classes of different, yet interrelated optimiza...

Please sign up or login with your details

Forgot password? Click here to reset