Online Search with Maximum Clearance - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2021

Online Search with Maximum Clearance

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.
Fichier principal
Vignette du fichier
16480-Article Text-19974-1-2-20210518-1.pdf (618.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03439678 , version 1 (22-11-2021)

Identifiants

  • HAL Id : hal-03439678 , version 1

Citer

Spyros Angelopoulos, Malachi Voss. Online Search with Maximum Clearance. 35th AAAI Conference on Artificial Intelligence (AAAI), Feb 2021, Online Conference, United States. pp.3642-3650. ⟨hal-03439678⟩
71 Consultations
14 Téléchargements

Partager

Gmail Facebook X LinkedIn More