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.

中文翻译：

---

具有最大许可的在线搜索

我们研究了移动代理必须在有界或无界环境中定位隐藏目标的设置，而没有有关隐藏程序位置的信息。特别是，我们考虑在线搜索，其中搜索策略的性能通过最坏情况下的竞争率来评估。我们介绍了一种多标准搜索问题，其中搜索者在分配的搜索时间上有预算，并且目标是设计具有竞争优势的策略，尊重预算并最大化总搜索范围。我们为线路和星型环境提供了分析上的最佳策略，并为常规网络提供了有效的启发式方法。