Abstract
A mobile agent navigating along edges of a simple connected unweighted graph, either finite or countably infinite, has to find an inert target (treasure) hidden in one of the nodes. This task is known as treasure hunt. The agent has no a priori knowledge of the graph, of the location of the treasure, or of the initial distance to it. The cost of a treasure hunt algorithm is the worst-case number of edge traversals performed by the agent until finding the treasure. Awerbuch et al. [3] considered graph exploration and treasure hunt for finite graphs in a restricted model where the agent has a fuel tank that can be replenished only at the starting node s. The size of the tank is B = 2 (1+α) r, for some positive real constant α, where r, called the radius of the graph, is the maximum distance from s to any other node. The tank of size B allows the agent to make at most ⌊ B ⌋ edge traversals between two consecutive visits at node s.
Let e(d) be the number of edges whose at least one endpoint is at distance less than d from s. Awerbuch et al. [3] conjectured that it is impossible to find a treasure hidden in a node at distance at most d at cost nearly linear in e(d). We first design a deterministic treasure hunt algorithm working in the model without any restrictions on the moves of the agent at cost 𝒪(e(d) log d) and then show how to modify this algorithm to work in the model from Awerbuch et al. [3] with the same complexity. Thus, we refute the preceding 20-year-old conjecture. We observe that no treasure hunt algorithm can beat cost Θ (e(d)) for all graphs, and thus our algorithms are also almost optimal.
- [1] . 2003. The Theory of Search Games and Rendezvous.
International Series in Operations Research and Management Science , Vol. 55. Kluwer.DOI: Google ScholarCross Ref - [2] . 2017. Infinite linear programming and online searching with turn cost. Theor. Comput. Sci. 670 (2017), 11–22.
DOI: Google ScholarDigital Library - [3] . 1999. Piecemeal graph exploration by a mobile robot. Inf. Comput. 152, 2 (1999), 155–172.
DOI: Google ScholarDigital Library - [4] . 1993. Searching in the plane. Inf. Comput. 106, 2 (1993), 234–252.
DOI: Google ScholarDigital Library - [5] . 1964. On the linear search problem. Isr. J. Math. 2 (1964), 221–228.
DOI: Google ScholarCross Ref - [6] . 1970. Yet more on the linear search problem. Isr. J. Math. 8 (1970), 419–429. Google ScholarCross Ref
- [7] . 1963. An optimal search. SIAM Rev. 5, 3 (1963), 274–274.
DOI: Google ScholarDigital Library - [8] . 2021. Almost-optimal deterministic treasure hunt in arbitrary graphs. In Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP’21). Leibniz International Proceedings in Informatics, Vol. 198. Schloss Dagstuhl–Leibniz-Zentrum für Informatik, Dagstuhl, Germany, Article 36, 20 pages.
DOI: Google ScholarCross Ref - [9] . 2020. Deterministic treasure hunt in the plane with angular hints. Algorithmica 82, 11 (2020), 3250–3281.
DOI: Google ScholarDigital Library - [10] . 1994. Agent searching in a tree and the optimality of iterative deepening. Artif. Intell. 71, 1 (1994), 195–208.
DOI: Google ScholarDigital Library - [11] . 1995. A correction to “Agent Searching in a Tree and the Optimality of Iterative Deepening.” Artif. Intell. 77, 1 (1995), 173–176.
DOI: Google ScholarDigital Library - [12] . 2006. Online searching with turn cost. Theor. Comput. Sci. 361, 2-3 (2006), 342–355.
DOI: Google ScholarDigital Library - [13] . 2006. Optimal constrained graph exploration. ACM Trans. Algorithms 2, 3 (2006), 380–402.
DOI: Google ScholarDigital Library - [14] . 2008. Competitive online approximation of the optimal search ratio. SIAM J. Comput. 38, 3 (2008), 881–898.
DOI: Google ScholarDigital Library - [15] . 2016. A distributed deterministic spiral search algorithm for swarms. In Proceedings of the 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS’16). IEEE, Los Alamitos, CA, 4430–4436.
DOI: Google ScholarDigital Library - [16] . 2013. Search Games: A Review. Springer, New York, NY, 3–15.
DOI: Google ScholarCross Ref - [17] . 2010. Online algorithms for searching and exploration in the plane. Comput. Sci. Rev. 4, 4 (2010), 189–201.
DOI: Google ScholarDigital Library - [18] . 2009. On the two-dimensional cow search problem. Inf. Process. Lett. 109, 11 (2009), 543–547.
DOI: Google ScholarDigital Library - [19] . 1996. Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem. Inf. Comput. 131, 1 (1996), 63–79.
DOI: Google ScholarDigital Library - [20] . 2011. Competitive search in symmetric trees. In Algorithms and Data Structures. Lecture Notes in Computer Science, Vol. 6844. Springer, 560–570.
DOI: Google ScholarCross Ref - [21] . 2015. Treasure hunt with advice. In Structural Information and Communication Complexity. Lecture Notes in Computer Science, Vol. 9439. Springer, 328–341. Google ScholarDigital Library
- [22] . 2010. On the optimality of spiral search. In Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’10). SIAM, 1–12.
DOI: Google ScholarCross Ref - [23] . 2012. Searching for an axis-parallel shoreline. Theor. Comput. Sci. 447 (2012), 85–99.
DOI: Google ScholarDigital Library - [24] . 2001. The ultimate strategy to search on m rays? Theor. Comput. Sci. 261, 2 (2001), 267–295.
DOI: Google ScholarDigital Library - [25] . 2015. Tradeoffs between cost and information for rendezvous and treasure hunt. J. Parallel Distrib. Comput. 83 (2015), 159–167.
DOI: Google ScholarDigital Library - [26] . 2018. Reaching a target in the plane with no information. Inf. Process. Lett. 140 (2018), 13–17. Google ScholarCross Ref
- [27] . 2001. Lower bounds in on-line geometric searching. Comput. Geom. 18, 1 (2001), 37–53.
DOI: Google ScholarDigital Library - [28] . 2014. Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences. ACM Trans. Algorithms 10, 3 (2014), Article 12, 15 pages.
DOI: Google ScholarDigital Library
Index Terms
- Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
Recommendations
Pebble guided optimal treasure hunt in anonymous graphs
Highlights- We study the problem of pebble-guided treasure hunt by a mobile agent in anonymous graphs.
AbstractWe study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree d e g ( v ) are labeled arbitrarily as 0 , 1 , … , d e g ( v ) − 1. A mobile agent, starting ...
Pebble Guided Near Optimal Treasure Hunt in Anonymous Graphs
Structural Information and Communication ComplexityAbstractWe study the problem of treasure hunt in a graph by a mobile agent. The nodes in the graph are anonymous and the edges at any node v of degree deg(v) are labeled arbitrarily as . A mobile agent, starting from a node, must find a ...
Treasure Hunt in Graph Using Pebbles
Stabilization, Safety, and Security of Distributed SystemsAbstractIn this paper, we study the treasure hunt problem in a graph by a mobile agent. The nodes in the graph are anonymous and the edges incident to a vertex whose degree is deg(v) and they are labeled arbitrarily as . At a ...
Comments