Online Search with Maximum Clearance - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2020

Online Search with Maximum Clearance

Spyros Angelopoulos

Résumé

We study the setting in which a mobile agent must locate a hidden target in a bounded or unbounded environment, with no information about the hider's position. In particular, we consider online search, in which the performance of the search strategy is evaluated by its worst case competitive ratio. We introduce a multi-criteria search problem in which the searcher has a budget on its allotted search time, and the objective is to design strategies that are competitively efficient, respect the budget, and maximize the total searched ground. We give analytically optimal strategies for the line and the star environments, and efficient heuristics for general networks.

Dates et versions

hal-03448480 , version 1 (25-11-2021)

Identifiants

Citer

Spyros Angelopoulos, Malachi Voss. Online Search with Maximum Clearance. 2020. ⟨hal-03448480⟩
10 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More