Treasure hunt is finding an inert target by a mobile agent. We consider treasure hunt in polygonal terrains with polygonal obstacles. The agent finds the treasure when there is a segment of length at most 1 between them, inside the terrain. The cost of treasure hunt is the length of the agent's trajectory. We investigate the amount of information (advice complexity) needed for treasure hunt at cost linear in the length of a shortest path in the terrain from the initial position of the agent to the treasure. A polygon is c-fat if the ratio of the radius of the smallest disc containing it to the radius of the largest disc contained in it is at most c. For regular terrains, defined as convex polygons with convex c-fat obstacles, for some constant $c>1$, we establish the exact advice complexity of treasure hunt. We then show that advice complexity of treasure hunt for arbitrary terrains is exponentially larger than for regular terrains.

寻宝是通过移动代理寻找惰性目标。我们考虑在具有多边形障碍物的多边形地形中寻宝。在地形内部，当它们之间的长度最多为 1 时，agent 找到了宝藏。寻宝的成本是代理的轨迹长度。我们调查寻宝所需的信息量（建议复杂性），成本与从代理的初始位置到宝藏的地形中最短路径的长度成线性关系。多边形是Ç -fat如果它含有包含在它最大盘的半径最小的盘的半径之比为至多Ç。对于规则地形，定义为带有凸c -fat 障碍物的凸多边形，对于一些常数$C>1$，我们建立了寻宝的确切建议复杂性。然后我们表明，对于任意地形的寻宝建议的复杂性比常规地形的建议复杂度呈指数级大。